{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:KW7I7CO7JFLNDPLWVCW32LXLE6","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"068f7820c2d90590b13272d1b8fc5fe2b2d9d324f777fa756de6fac8ca047d3c","cross_cats_sorted":["cs.PF","cs.PL","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-23T20:27:00Z","title_canon_sha256":"42b31acabbc7cd1b9357b8952537da75fb757f7d78ca9f355ab32f03b2902ce2"},"schema_version":"1.0","source":{"id":"2003.10536","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.10536","created_at":"2026-07-05T00:50:18Z"},{"alias_kind":"arxiv_version","alias_value":"2003.10536v1","created_at":"2026-07-05T00:50:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.10536","created_at":"2026-07-05T00:50:18Z"},{"alias_kind":"pith_short_12","alias_value":"KW7I7CO7JFLN","created_at":"2026-07-05T00:50:18Z"},{"alias_kind":"pith_short_16","alias_value":"KW7I7CO7JFLNDPLW","created_at":"2026-07-05T00:50:18Z"},{"alias_kind":"pith_short_8","alias_value":"KW7I7CO7","created_at":"2026-07-05T00:50:18Z"}],"graph_snapshots":[{"event_id":"sha256:c536fe0fb51212b13d4891b2e9686ab83db58c47a01bcfc7a7ccc7067fac9e6a","target":"graph","created_at":"2026-07-05T00:50:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2003.10536/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Chris Cummins, Hugh Leather, Tal Ben-Nun, Torsten Hoefler, Zacharias V. Fisches","cross_cats":["cs.PF","cs.PL","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-23T20:27:00Z","title":"ProGraML: Graph-based Deep Learning for Program Optimization and Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.10536","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9db39c515b286b1919d7ec453eddda97cf8ba136a3847b1704b8057262f8dd6f","target":"record","created_at":"2026-07-05T00:50:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"068f7820c2d90590b13272d1b8fc5fe2b2d9d324f777fa756de6fac8ca047d3c","cross_cats_sorted":["cs.PF","cs.PL","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-23T20:27:00Z","title_canon_sha256":"42b31acabbc7cd1b9357b8952537da75fb757f7d78ca9f355ab32f03b2902ce2"},"schema_version":"1.0","source":{"id":"2003.10536","kind":"arxiv","version":1}},"canonical_sha256":"55be8f89df4956d1bd76a8adbd2eeb2782578bfd5d436d40539377b745d7b6ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"55be8f89df4956d1bd76a8adbd2eeb2782578bfd5d436d40539377b745d7b6ac","first_computed_at":"2026-07-05T00:50:18.182028Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:50:18.182028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iyork37nsmSYeNDErsWrFF3N2/LCUZyaKf3rWxCZrbIH2rwHk3uzHQNkD6Zy2N3UD0HVJyUSFyiAUD6iA2rCBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:50:18.182509Z","signed_message":"canonical_sha256_bytes"},"source_id":"2003.10536","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9db39c515b286b1919d7ec453eddda97cf8ba136a3847b1704b8057262f8dd6f","sha256:c536fe0fb51212b13d4891b2e9686ab83db58c47a01bcfc7a7ccc7067fac9e6a"],"state_sha256":"bb34c10800c7a79af49a67b8b8fa03ac5a368b093827c3fc6872cf96273b2bcb"}