{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JDC7IOIEO36HYSQA6S43SY3EYM","short_pith_number":"pith:JDC7IOIE","schema_version":"1.0","canonical_sha256":"48c5f4390476fc7c4a00f4b9b96364c309783502d8d3a1e71407799b272c096d","source":{"kind":"arxiv","id":"1805.00923","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.00923","created_at":"2026-05-18T00:02:39.690213+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.00923v2","created_at":"2026-05-18T00:02:39.690213+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.00923","created_at":"2026-05-18T00:02:39.690213+00:00"},{"alias_kind":"pith_short_12","alias_value":"JDC7IOIEO36H","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"JDC7IOIEO36HYSQA","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"JDC7IOIE","created_at":"2026-05-18T12:32:31.084164+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/JDC7IOIEO36HYSQA6S43SY3EYM","json":"https://pith.science/pith/JDC7IOIEO36HYSQA6S43SY3EYM.json","graph_json":"https://pith.science/api/pith-number/JDC7IOIEO36HYSQA6S43SY3EYM/graph.json","events_json":"https://pith.science/api/pith-number/JDC7IOIEO36HYSQA6S43SY3EYM/events.json","paper":"https://pith.science/paper/JDC7IOIE"},"agent_actions":{"view_html":"https://pith.science/pith/JDC7IOIEO36HYSQA6S43SY3EYM","download_json":"https://pith.science/pith/JDC7IOIEO36HYSQA6S43SY3EYM.json","view_paper":"https://pith.science/paper/JDC7IOIE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.00923&json=true","fetch_graph":"https://pith.science/api/pith-number/JDC7IOIEO36HYSQA6S43SY3EYM/graph.json","fetch_events":"https://pith.science/api/pith-number/JDC7IOIEO36HYSQA6S43SY3EYM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JDC7IOIEO36HYSQA6S43SY3EYM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JDC7IOIEO36HYSQA6S43SY3EYM/action/storage_attestation","attest_author":"https://pith.science/pith/JDC7IOIEO36HYSQA6S43SY3EYM/action/author_attestation","sign_citation":"https://pith.science/pith/JDC7IOIEO36HYSQA6S43SY3EYM/action/citation_signature","submit_replication":"https://pith.science/pith/JDC7IOIEO36HYSQA6S43SY3EYM/action/replication_record"}},"created_at":"2026-05-18T00:02:39.690213+00:00","updated_at":"2026-05-18T00:02:39.690213+00:00"}