{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:R6CTPCVVTKFVE2IVBN4FFEZ7MO","short_pith_number":"pith:R6CTPCVV","schema_version":"1.0","canonical_sha256":"8f85378ab59a8b5269150b7852933f638eef13436d1a56ee505e6e8b746134e0","source":{"kind":"arxiv","id":"1805.09675","version":1},"attestation_state":"computed","paper":{"title":"GraphChallenge.org: Raising the Bar on Graph Analytic Performance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DC","authors_text":"Albert Reuther, Diane Staheli, Edward Kao, Jeremy Kepner, Michael Hurley, Michael Jones, Paul Monticciolo, Sanjeev Mohindra, Siddharth Samsi, Steven Smith, Vijay Gadepally, William Song","submitted_at":"2018-05-23T01:18:37Z","abstract_excerpt":"The rise of graph analytic systems has created a need for new ways to measure and compare the capabilities of graph processing systems. The MIT/Amazon/IEEE Graph Challenge has been developed to provide a well-defined community venue for stimulating research and highlighting innovations in graph analysis software, hardware, algorithms, and systems. GraphChallenge.org provides a wide range of pre-parsed graph data sets, graph generators, mathematically defined graph algorithms, example serial implementations in a variety of languages, and specific metrics for measuring performance. Graph Challen"},"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.09675","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-23T01:18:37Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"95950dadc82c86b0d16d7c590adfbb67b218bf1265823a91e040bb04257f2423","abstract_canon_sha256":"df5ebe2de730abd6df865bae2eeb319051d99b99c6e58e99b77b866941217f12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:19.255422Z","signature_b64":"pJKc25NPoAqyp5V6Bj1w01KlIhbByUombBLuK1yGtsKNImKMwB+dRdtnu4oGebU0zBy8eQdwtDeuan12V6ShBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f85378ab59a8b5269150b7852933f638eef13436d1a56ee505e6e8b746134e0","last_reissued_at":"2026-05-17T23:58:19.254893Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:19.254893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GraphChallenge.org: Raising the Bar on Graph Analytic Performance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DC","authors_text":"Albert Reuther, Diane Staheli, Edward Kao, Jeremy Kepner, Michael Hurley, Michael Jones, Paul Monticciolo, Sanjeev Mohindra, Siddharth Samsi, Steven Smith, Vijay Gadepally, William Song","submitted_at":"2018-05-23T01:18:37Z","abstract_excerpt":"The rise of graph analytic systems has created a need for new ways to measure and compare the capabilities of graph processing systems. The MIT/Amazon/IEEE Graph Challenge has been developed to provide a well-defined community venue for stimulating research and highlighting innovations in graph analysis software, hardware, algorithms, and systems. GraphChallenge.org provides a wide range of pre-parsed graph data sets, graph generators, mathematically defined graph algorithms, example serial implementations in a variety of languages, and specific metrics for measuring performance. Graph Challen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09675","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":""},"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.09675","created_at":"2026-05-17T23:58:19.254969+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.09675v1","created_at":"2026-05-17T23:58:19.254969+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09675","created_at":"2026-05-17T23:58:19.254969+00:00"},{"alias_kind":"pith_short_12","alias_value":"R6CTPCVVTKFV","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"R6CTPCVVTKFVE2IV","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"R6CTPCVV","created_at":"2026-05-18T12:32:50.500415+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/R6CTPCVVTKFVE2IVBN4FFEZ7MO","json":"https://pith.science/pith/R6CTPCVVTKFVE2IVBN4FFEZ7MO.json","graph_json":"https://pith.science/api/pith-number/R6CTPCVVTKFVE2IVBN4FFEZ7MO/graph.json","events_json":"https://pith.science/api/pith-number/R6CTPCVVTKFVE2IVBN4FFEZ7MO/events.json","paper":"https://pith.science/paper/R6CTPCVV"},"agent_actions":{"view_html":"https://pith.science/pith/R6CTPCVVTKFVE2IVBN4FFEZ7MO","download_json":"https://pith.science/pith/R6CTPCVVTKFVE2IVBN4FFEZ7MO.json","view_paper":"https://pith.science/paper/R6CTPCVV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.09675&json=true","fetch_graph":"https://pith.science/api/pith-number/R6CTPCVVTKFVE2IVBN4FFEZ7MO/graph.json","fetch_events":"https://pith.science/api/pith-number/R6CTPCVVTKFVE2IVBN4FFEZ7MO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R6CTPCVVTKFVE2IVBN4FFEZ7MO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R6CTPCVVTKFVE2IVBN4FFEZ7MO/action/storage_attestation","attest_author":"https://pith.science/pith/R6CTPCVVTKFVE2IVBN4FFEZ7MO/action/author_attestation","sign_citation":"https://pith.science/pith/R6CTPCVVTKFVE2IVBN4FFEZ7MO/action/citation_signature","submit_replication":"https://pith.science/pith/R6CTPCVVTKFVE2IVBN4FFEZ7MO/action/replication_record"}},"created_at":"2026-05-17T23:58:19.254969+00:00","updated_at":"2026-05-17T23:58:19.254969+00:00"}