Buildability / Receipt
This public receipt window renders only fields present in the canonical receipt object, deterministic fixture receipt, or canonical evidence receipt. Missing compute, demo, hash, signature, approval, telemetry, and adoption fields stay explicit.
Public buildability page receipt window
/buildability/graph-construction-and-matching-for-imperative-programs-using-neural-and-structural-methods
Subject: Graph Construction and Matching for Imperative Programs using Neural and Structural Methods
Verdict
Ignore
Verdict is Ignore because current viability and proof state do not clear the buildability gate.
Time to first demo
Insufficient data
No first-demo timestamp, owner estimate, or elapsed demo receipt is attached to this surface.
Data
{"file name": "input.pdf", "number of pages": 20, "author": "Arshad Beg; Diarmuid O'Donoghue; Rosemary Monahan"
Truth Boundary
Buildability surfaces only report computed viability and proof receipts. They do not claim live production usage, pilot outcomes, founder sign-off, public Brier calibration, judge divergence, or external adoption unless explicitly sourced.
Compute
{"file name": "input.pdf", "number of pages": 20, "author": "Arshad Beg; Diarmuid O'Donoghue; Rosemary Monahan", "title": "Graph Construction and Matching for Imperative Programs using Neural and Structural Methods", "creation date": null, "modification date": null, "kids": []}
Inference
{"file name": "input.pdf", "number of pages": 20, "author": "Arshad Beg; Diarmuid O'Donoghue; Rosemary Monahan", "title": "Graph Construction and Matching for Imperative Programs using Neural and Structural Methods", "creation date": null, "modification date": null, "kids": []}
Hardware
{"file name": "input.pdf", "number of pages": 20, "author": "Arshad Beg; Diarmuid O'Donoghue; Rosemary Monahan", "title": "Graph Construction and Matching for Imperative Programs using Neural and Structural Methods", "creation date": null, "modification date": null, "kids": []}
Receipt path
/buildability/graph-construction-and-matching-for-imperative-programs-using-neural-and-structural-methods
Paper ref
graph-construction-and-matching-for-imperative-programs-using-neural-and-structural-methods
arXiv id
2604.26578
Generated at
2026-04-30T15:12:58.879Z
Evidence freshness
stale
Last verification
2026-04-30T15:12:58.879Z
Sources
3
References
0
Coverage
50%
Lineage hash
b8d2c2182afb2ee2a70947b492bec13b3bf868a383957b4da9b2e9ff85d71044
Canonical opportunity-kernel lineage hash.
External signature
unsigned_external
No founder, registry, pilot, or production-adoption signature is attached to this receipt.
Verification
not_verified
Verification is blocked until an external signature is provided.
Some score or evidence fields are outside the preferred freshness window.
repo_url
references