{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JDC7IOIEO36HYSQA6S43SY3EYM","short_pith_number":"pith:JDC7IOIE","canonical_record":{"source":{"id":"1805.00923","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-05-02T17:38:35Z","cross_cats_sorted":[],"title_canon_sha256":"7c2bdb21c341692172b1e86de6cbeb2f927da0ab17a12def16d880f460bd5ddb","abstract_canon_sha256":"a080d117cd1f4c997ff20b5796b061ff8e10c24a71c6666bc64fc94ccc32959c"},"schema_version":"1.0"},"canonical_sha256":"48c5f4390476fc7c4a00f4b9b96364c309783502d8d3a1e71407799b272c096d","source":{"kind":"arxiv","id":"1805.00923","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.00923","created_at":"2026-05-18T00:02:39Z"},{"alias_kind":"arxiv_version","alias_value":"1805.00923v2","created_at":"2026-05-18T00:02:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.00923","created_at":"2026-05-18T00:02:39Z"},{"alias_kind":"pith_short_12","alias_value":"JDC7IOIEO36H","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JDC7IOIEO36HYSQA","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JDC7IOIE","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JDC7IOIEO36HYSQA6S43SY3EYM","target":"record","payload":{"canonical_record":{"source":{"id":"1805.00923","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-05-02T17:38:35Z","cross_cats_sorted":[],"title_canon_sha256":"7c2bdb21c341692172b1e86de6cbeb2f927da0ab17a12def16d880f460bd5ddb","abstract_canon_sha256":"a080d117cd1f4c997ff20b5796b061ff8e10c24a71c6666bc64fc94ccc32959c"},"schema_version":"1.0"},"canonical_sha256":"48c5f4390476fc7c4a00f4b9b96364c309783502d8d3a1e71407799b272c096d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:39.690767Z","signature_b64":"2E6HRbyW4054RQqYlv7eeMQTMqkN8bJJY2l936dVWrtccOGKRKY4uaTeONgBqUbzzdsUTcfI1tJewAKBj+W0Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48c5f4390476fc7c4a00f4b9b96364c309783502d8d3a1e71407799b272c096d","last_reissued_at":"2026-05-18T00:02:39.690108Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:39.690108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.00923","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:02:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mj41aLwmYemyxwcNI35xD7edvztLYipb/oVZnyXjuvbFqjZY2Y2CXuTs7yhDYRxbIdPr3vx/NxQ546Aa3QDkDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:31:39.560671Z"},"content_sha256":"1c342e7bb078a04b6e6b968d36bc6fb1996ea226c9c55530fc1180bf761a2701","schema_version":"1.0","event_id":"sha256:1c342e7bb078a04b6e6b968d36bc6fb1996ea226c9c55530fc1180bf761a2701"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JDC7IOIEO36HYSQA6S43SY3EYM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GraphIt: A High-Performance DSL for Graph Analytics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Julian Shun, Mengjiao Yang, Riyadh Baghdadi, Saman Amarasinghe, Shoaib Kamil, Yunming Zhang","submitted_at":"2018-05-02T17:38:35Z","abstract_excerpt":"The performance bottlenecks of graph applications depend not only on the algorithm and the underlying hardware, but also on the size and structure of the input graph. Programmers must try different combinations of a large set of techniques to develop the best implementation for a specific algorithm and type of graph. Existing graph frameworks lack flexibility, supporting only a limited set of optimizations.\n  This paper introduces GraphIt, a new DSL for graph computations that generates fast implementations for algorithms with different performance characteristics running on graphs with differ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.00923","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:02:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I9Yq+6a6O5cMj5LeOKgGq+ScM4CUW0Xx+iWyh3IFZSLdBJBZuFsj+twkLyJEVOM4vmRvxG1VuFGgPpqkXIKsAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:31:39.561020Z"},"content_sha256":"86faa55c6ac8ac764c38a27d2a15195449dbab06b80bb5823aa288970a0ea755","schema_version":"1.0","event_id":"sha256:86faa55c6ac8ac764c38a27d2a15195449dbab06b80bb5823aa288970a0ea755"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JDC7IOIEO36HYSQA6S43SY3EYM/bundle.json","state_url":"https://pith.science/pith/JDC7IOIEO36HYSQA6S43SY3EYM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JDC7IOIEO36HYSQA6S43SY3EYM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T23:31:39Z","links":{"resolver":"https://pith.science/pith/JDC7IOIEO36HYSQA6S43SY3EYM","bundle":"https://pith.science/pith/JDC7IOIEO36HYSQA6S43SY3EYM/bundle.json","state":"https://pith.science/pith/JDC7IOIEO36HYSQA6S43SY3EYM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JDC7IOIEO36HYSQA6S43SY3EYM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JDC7IOIEO36HYSQA6S43SY3EYM","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":"a080d117cd1f4c997ff20b5796b061ff8e10c24a71c6666bc64fc94ccc32959c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-05-02T17:38:35Z","title_canon_sha256":"7c2bdb21c341692172b1e86de6cbeb2f927da0ab17a12def16d880f460bd5ddb"},"schema_version":"1.0","source":{"id":"1805.00923","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.00923","created_at":"2026-05-18T00:02:39Z"},{"alias_kind":"arxiv_version","alias_value":"1805.00923v2","created_at":"2026-05-18T00:02:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.00923","created_at":"2026-05-18T00:02:39Z"},{"alias_kind":"pith_short_12","alias_value":"JDC7IOIEO36H","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JDC7IOIEO36HYSQA","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JDC7IOIE","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:86faa55c6ac8ac764c38a27d2a15195449dbab06b80bb5823aa288970a0ea755","target":"graph","created_at":"2026-05-18T00:02:39Z","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"},"paper":{"abstract_excerpt":"The performance bottlenecks of graph applications depend not only on the algorithm and the underlying hardware, but also on the size and structure of the input graph. Programmers must try different combinations of a large set of techniques to develop the best implementation for a specific algorithm and type of graph. Existing graph frameworks lack flexibility, supporting only a limited set of optimizations.\n  This paper introduces GraphIt, a new DSL for graph computations that generates fast implementations for algorithms with different performance characteristics running on graphs with differ","authors_text":"Julian Shun, Mengjiao Yang, Riyadh Baghdadi, Saman Amarasinghe, Shoaib Kamil, Yunming Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-05-02T17:38:35Z","title":"GraphIt: A High-Performance DSL for Graph Analytics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.00923","kind":"arxiv","version":2},"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:1c342e7bb078a04b6e6b968d36bc6fb1996ea226c9c55530fc1180bf761a2701","target":"record","created_at":"2026-05-18T00:02:39Z","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":"a080d117cd1f4c997ff20b5796b061ff8e10c24a71c6666bc64fc94ccc32959c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-05-02T17:38:35Z","title_canon_sha256":"7c2bdb21c341692172b1e86de6cbeb2f927da0ab17a12def16d880f460bd5ddb"},"schema_version":"1.0","source":{"id":"1805.00923","kind":"arxiv","version":2}},"canonical_sha256":"48c5f4390476fc7c4a00f4b9b96364c309783502d8d3a1e71407799b272c096d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"48c5f4390476fc7c4a00f4b9b96364c309783502d8d3a1e71407799b272c096d","first_computed_at":"2026-05-18T00:02:39.690108Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:39.690108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2E6HRbyW4054RQqYlv7eeMQTMqkN8bJJY2l936dVWrtccOGKRKY4uaTeONgBqUbzzdsUTcfI1tJewAKBj+W0Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:39.690767Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.00923","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c342e7bb078a04b6e6b968d36bc6fb1996ea226c9c55530fc1180bf761a2701","sha256:86faa55c6ac8ac764c38a27d2a15195449dbab06b80bb5823aa288970a0ea755"],"state_sha256":"11c8ec461898118eadb78e00db204de709807731622b9029d3ef1e9927f8fc0a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O2Gf0uA1EMJr7LNxFHQEI9eTDF+TGY/KzYyp2Z4JbhuMFBzYCSatUgQp6NDffUz4mWa6iSndtYoXxYPOr6KBBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T23:31:39.562965Z","bundle_sha256":"8cdbee6f0e7dd858b883fe0aad907d26b88864a0e71cef9d83a4d005584d1baf"}}