{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:R6CTPCVVTKFVE2IVBN4FFEZ7MO","short_pith_number":"pith:R6CTPCVV","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"},"canonical_sha256":"8f85378ab59a8b5269150b7852933f638eef13436d1a56ee505e6e8b746134e0","source":{"kind":"arxiv","id":"1805.09675","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09675","created_at":"2026-05-17T23:58:19Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09675v1","created_at":"2026-05-17T23:58:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09675","created_at":"2026-05-17T23:58:19Z"},{"alias_kind":"pith_short_12","alias_value":"R6CTPCVVTKFV","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"R6CTPCVVTKFVE2IV","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"R6CTPCVV","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:R6CTPCVVTKFVE2IVBN4FFEZ7MO","target":"record","payload":{"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"},"canonical_sha256":"8f85378ab59a8b5269150b7852933f638eef13436d1a56ee505e6e8b746134e0","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"},"source_kind":"arxiv","source_id":"1805.09675","source_version":1,"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-17T23:58:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d8/I7UBiXu0ZfQkLWn3nfzxwGyp3BwExNf6s0nXCqpcuz14pXOWGzZnkdx/psFY7Al2+rCZZnGczR8uFVL3BAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:58:09.783018Z"},"content_sha256":"73faf58a2ce4e2022d5e17d9bcb7c44e9b60218babcf34f65826d8f5ae6ba6a4","schema_version":"1.0","event_id":"sha256:73faf58a2ce4e2022d5e17d9bcb7c44e9b60218babcf34f65826d8f5ae6ba6a4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:R6CTPCVVTKFVE2IVBN4FFEZ7MO","target":"graph","payload":{"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"},"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-17T23:58:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PdAxYCPn8ApO1WPAO2OENL21M5afDbqvt6sY5NW5IOgLssfFMUn3ytzdHD82S1XhflX2r2OrGda+uMD7eF2qCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:58:09.783388Z"},"content_sha256":"2b40993389195abb4476fabb48a69c4885853d62484dd859489c34c801dd2b60","schema_version":"1.0","event_id":"sha256:2b40993389195abb4476fabb48a69c4885853d62484dd859489c34c801dd2b60"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R6CTPCVVTKFVE2IVBN4FFEZ7MO/bundle.json","state_url":"https://pith.science/pith/R6CTPCVVTKFVE2IVBN4FFEZ7MO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R6CTPCVVTKFVE2IVBN4FFEZ7MO/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-04T17:58:09Z","links":{"resolver":"https://pith.science/pith/R6CTPCVVTKFVE2IVBN4FFEZ7MO","bundle":"https://pith.science/pith/R6CTPCVVTKFVE2IVBN4FFEZ7MO/bundle.json","state":"https://pith.science/pith/R6CTPCVVTKFVE2IVBN4FFEZ7MO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R6CTPCVVTKFVE2IVBN4FFEZ7MO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:R6CTPCVVTKFVE2IVBN4FFEZ7MO","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":"df5ebe2de730abd6df865bae2eeb319051d99b99c6e58e99b77b866941217f12","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-23T01:18:37Z","title_canon_sha256":"95950dadc82c86b0d16d7c590adfbb67b218bf1265823a91e040bb04257f2423"},"schema_version":"1.0","source":{"id":"1805.09675","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09675","created_at":"2026-05-17T23:58:19Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09675v1","created_at":"2026-05-17T23:58:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09675","created_at":"2026-05-17T23:58:19Z"},{"alias_kind":"pith_short_12","alias_value":"R6CTPCVVTKFV","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"R6CTPCVVTKFVE2IV","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"R6CTPCVV","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:2b40993389195abb4476fabb48a69c4885853d62484dd859489c34c801dd2b60","target":"graph","created_at":"2026-05-17T23:58:19Z","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 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","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","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-23T01:18:37Z","title":"GraphChallenge.org: Raising the Bar on Graph Analytic Performance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09675","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:73faf58a2ce4e2022d5e17d9bcb7c44e9b60218babcf34f65826d8f5ae6ba6a4","target":"record","created_at":"2026-05-17T23:58:19Z","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":"df5ebe2de730abd6df865bae2eeb319051d99b99c6e58e99b77b866941217f12","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-23T01:18:37Z","title_canon_sha256":"95950dadc82c86b0d16d7c590adfbb67b218bf1265823a91e040bb04257f2423"},"schema_version":"1.0","source":{"id":"1805.09675","kind":"arxiv","version":1}},"canonical_sha256":"8f85378ab59a8b5269150b7852933f638eef13436d1a56ee505e6e8b746134e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f85378ab59a8b5269150b7852933f638eef13436d1a56ee505e6e8b746134e0","first_computed_at":"2026-05-17T23:58:19.254893Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:19.254893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pJKc25NPoAqyp5V6Bj1w01KlIhbByUombBLuK1yGtsKNImKMwB+dRdtnu4oGebU0zBy8eQdwtDeuan12V6ShBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:19.255422Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.09675","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73faf58a2ce4e2022d5e17d9bcb7c44e9b60218babcf34f65826d8f5ae6ba6a4","sha256:2b40993389195abb4476fabb48a69c4885853d62484dd859489c34c801dd2b60"],"state_sha256":"b3e4ac838b8f28ba9d6aa9a68b16ffb16e169e02c064e205e846b0b929e7a95a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dufev/1sCSRkBWXuYmwppGDMIFjI5Ckaz77w4Y7GdNK8PfEPU9eJIn7nF1BwzlzBkEMG8/Hl4gDOixh2xvkgAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T17:58:09.785331Z","bundle_sha256":"2fd48a169a543702b830fd2b3e4be63a7a22ffce007c5bbc81f7656da12b64fd"}}