{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:KW7I7CO7JFLNDPLWVCW32LXLE6","short_pith_number":"pith:KW7I7CO7","schema_version":"1.0","canonical_sha256":"55be8f89df4956d1bd76a8adbd2eeb2782578bfd5d436d40539377b745d7b6ac","source":{"kind":"arxiv","id":"2003.10536","version":1},"attestation_state":"computed","paper":{"title":"ProGraML: Graph-based Deep Learning for Program Optimization and Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF","cs.PL","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chris Cummins, Hugh Leather, Tal Ben-Nun, Torsten Hoefler, Zacharias V. Fisches","submitted_at":"2020-03-23T20:27:00Z","abstract_excerpt":"The increasing complexity of computing systems places a tremendous burden on optimizing compilers, requiring ever more accurate and aggressive optimizations. Machine learning offers significant benefits for constructing optimization heuristics but there remains a gap between what state-of-the-art methods achieve and the performance of an optimal heuristic. Closing this gap requires improvements in two key areas: a representation that accurately captures the semantics of programs, and a model architecture with sufficient expressiveness to reason about this representation.\n  We introduce ProGraM"},"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":"2003.10536","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-23T20:27:00Z","cross_cats_sorted":["cs.PF","cs.PL","stat.ML"],"title_canon_sha256":"42b31acabbc7cd1b9357b8952537da75fb757f7d78ca9f355ab32f03b2902ce2","abstract_canon_sha256":"068f7820c2d90590b13272d1b8fc5fe2b2d9d324f777fa756de6fac8ca047d3c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:50:18.182509Z","signature_b64":"iyork37nsmSYeNDErsWrFF3N2/LCUZyaKf3rWxCZrbIH2rwHk3uzHQNkD6Zy2N3UD0HVJyUSFyiAUD6iA2rCBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55be8f89df4956d1bd76a8adbd2eeb2782578bfd5d436d40539377b745d7b6ac","last_reissued_at":"2026-07-05T00:50:18.182028Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:50:18.182028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ProGraML: Graph-based Deep Learning for Program Optimization and Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF","cs.PL","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chris Cummins, Hugh Leather, Tal Ben-Nun, Torsten Hoefler, Zacharias V. Fisches","submitted_at":"2020-03-23T20:27:00Z","abstract_excerpt":"The increasing complexity of computing systems places a tremendous burden on optimizing compilers, requiring ever more accurate and aggressive optimizations. Machine learning offers significant benefits for constructing optimization heuristics but there remains a gap between what state-of-the-art methods achieve and the performance of an optimal heuristic. Closing this gap requires improvements in two key areas: a representation that accurately captures the semantics of programs, and a model architecture with sufficient expressiveness to reason about this representation.\n  We introduce ProGraM"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.10536","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2003.10536/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2003.10536","created_at":"2026-07-05T00:50:18.182100+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.10536v1","created_at":"2026-07-05T00:50:18.182100+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.10536","created_at":"2026-07-05T00:50:18.182100+00:00"},{"alias_kind":"pith_short_12","alias_value":"KW7I7CO7JFLN","created_at":"2026-07-05T00:50:18.182100+00:00"},{"alias_kind":"pith_short_16","alias_value":"KW7I7CO7JFLNDPLW","created_at":"2026-07-05T00:50:18.182100+00:00"},{"alias_kind":"pith_short_8","alias_value":"KW7I7CO7","created_at":"2026-07-05T00:50:18.182100+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.14326","citing_title":"Assessing Large Language Models in Comprehending and Verifying Concurrent Programs across Memory Models","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KW7I7CO7JFLNDPLWVCW32LXLE6","json":"https://pith.science/pith/KW7I7CO7JFLNDPLWVCW32LXLE6.json","graph_json":"https://pith.science/api/pith-number/KW7I7CO7JFLNDPLWVCW32LXLE6/graph.json","events_json":"https://pith.science/api/pith-number/KW7I7CO7JFLNDPLWVCW32LXLE6/events.json","paper":"https://pith.science/paper/KW7I7CO7"},"agent_actions":{"view_html":"https://pith.science/pith/KW7I7CO7JFLNDPLWVCW32LXLE6","download_json":"https://pith.science/pith/KW7I7CO7JFLNDPLWVCW32LXLE6.json","view_paper":"https://pith.science/paper/KW7I7CO7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.10536&json=true","fetch_graph":"https://pith.science/api/pith-number/KW7I7CO7JFLNDPLWVCW32LXLE6/graph.json","fetch_events":"https://pith.science/api/pith-number/KW7I7CO7JFLNDPLWVCW32LXLE6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KW7I7CO7JFLNDPLWVCW32LXLE6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KW7I7CO7JFLNDPLWVCW32LXLE6/action/storage_attestation","attest_author":"https://pith.science/pith/KW7I7CO7JFLNDPLWVCW32LXLE6/action/author_attestation","sign_citation":"https://pith.science/pith/KW7I7CO7JFLNDPLWVCW32LXLE6/action/citation_signature","submit_replication":"https://pith.science/pith/KW7I7CO7JFLNDPLWVCW32LXLE6/action/replication_record"}},"created_at":"2026-07-05T00:50:18.182100+00:00","updated_at":"2026-07-05T00:50:18.182100+00:00"}