{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:XNRT5VCYPWGZJE7XHAXKNV5BBS","short_pith_number":"pith:XNRT5VCY","schema_version":"1.0","canonical_sha256":"bb633ed4587d8d9493f7382ea6d7a10caeac8d382e7bb15fac05440695a59edf","source":{"kind":"arxiv","id":"1507.03137","version":2},"attestation_state":"computed","paper":{"title":"Pushdown Control-Flow Analysis for Free","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"David Van Horn, Matthew Might, Michael D. Adams, Steven Lyde, Thomas Gilray","submitted_at":"2015-07-11T18:37:48Z","abstract_excerpt":"Traditional control-flow analysis (CFA) for higher-order languages, whether implemented by constraint-solving or abstract interpretation, introduces spurious connections between callers and callees. Two distinct invocations of a function will necessarily pollute one another's return-flow. Recently, three distinct approaches have been published which provide perfect call-stack precision in a computable manner: CFA2, PDCFA, and AAC. Unfortunately, CFA2 and PDCFA are difficult to implement and require significant engineering effort. Furthermore, all three are computationally expensive; for a mono"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1507.03137","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-07-11T18:37:48Z","cross_cats_sorted":[],"title_canon_sha256":"a599ce90f921b7d691d52882bd54468a12570a2a01961882acccb9ff68a54704","abstract_canon_sha256":"5e81096e8e67bdaa9a73318611e4888b0b128c3d1f6b64f8e97e334e14edd69d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:44.253675Z","signature_b64":"QFQne2WmRJ6YVEH6TswrVhr/Z3ALTE9f0sUOlsGhLsTA7K16qvylw9/m+SfWqUp1cl2/D2h7jNHA1HIiTy5RBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb633ed4587d8d9493f7382ea6d7a10caeac8d382e7bb15fac05440695a59edf","last_reissued_at":"2026-05-18T01:18:44.253062Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:44.253062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pushdown Control-Flow Analysis for Free","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"David Van Horn, Matthew Might, Michael D. Adams, Steven Lyde, Thomas Gilray","submitted_at":"2015-07-11T18:37:48Z","abstract_excerpt":"Traditional control-flow analysis (CFA) for higher-order languages, whether implemented by constraint-solving or abstract interpretation, introduces spurious connections between callers and callees. Two distinct invocations of a function will necessarily pollute one another's return-flow. Recently, three distinct approaches have been published which provide perfect call-stack precision in a computable manner: CFA2, PDCFA, and AAC. Unfortunately, CFA2 and PDCFA are difficult to implement and require significant engineering effort. Furthermore, all three are computationally expensive; for a mono"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03137","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1507.03137","created_at":"2026-05-18T01:18:44.253148+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.03137v2","created_at":"2026-05-18T01:18:44.253148+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03137","created_at":"2026-05-18T01:18:44.253148+00:00"},{"alias_kind":"pith_short_12","alias_value":"XNRT5VCYPWGZ","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"XNRT5VCYPWGZJE7X","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"XNRT5VCY","created_at":"2026-05-18T12:29:50.041715+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XNRT5VCYPWGZJE7XHAXKNV5BBS","json":"https://pith.science/pith/XNRT5VCYPWGZJE7XHAXKNV5BBS.json","graph_json":"https://pith.science/api/pith-number/XNRT5VCYPWGZJE7XHAXKNV5BBS/graph.json","events_json":"https://pith.science/api/pith-number/XNRT5VCYPWGZJE7XHAXKNV5BBS/events.json","paper":"https://pith.science/paper/XNRT5VCY"},"agent_actions":{"view_html":"https://pith.science/pith/XNRT5VCYPWGZJE7XHAXKNV5BBS","download_json":"https://pith.science/pith/XNRT5VCYPWGZJE7XHAXKNV5BBS.json","view_paper":"https://pith.science/paper/XNRT5VCY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.03137&json=true","fetch_graph":"https://pith.science/api/pith-number/XNRT5VCYPWGZJE7XHAXKNV5BBS/graph.json","fetch_events":"https://pith.science/api/pith-number/XNRT5VCYPWGZJE7XHAXKNV5BBS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XNRT5VCYPWGZJE7XHAXKNV5BBS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XNRT5VCYPWGZJE7XHAXKNV5BBS/action/storage_attestation","attest_author":"https://pith.science/pith/XNRT5VCYPWGZJE7XHAXKNV5BBS/action/author_attestation","sign_citation":"https://pith.science/pith/XNRT5VCYPWGZJE7XHAXKNV5BBS/action/citation_signature","submit_replication":"https://pith.science/pith/XNRT5VCYPWGZJE7XHAXKNV5BBS/action/replication_record"}},"created_at":"2026-05-18T01:18:44.253148+00:00","updated_at":"2026-05-18T01:18:44.253148+00:00"}