{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LIGAWIY5NKQ5KSTQ7M4BV3DQPY","short_pith_number":"pith:LIGAWIY5","canonical_record":{"source":{"id":"1708.07883","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-25T21:10:06Z","cross_cats_sorted":["cs.DS","cs.PF","cs.SI"],"title_canon_sha256":"9ea96620dce65cc5ea8f4a982d28892b925fc9eff2c7ead8290cb44f15a25252","abstract_canon_sha256":"8722d286747a7782c90caeb5160c86aa21eb16dd248050b4af5229fd990e9297"},"schema_version":"1.0"},"canonical_sha256":"5a0c0b231d6aa1d54a70fb381aec707e181306cce5e0774c091152e98a897200","source":{"kind":"arxiv","id":"1708.07883","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07883","created_at":"2026-05-18T00:30:57Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07883v1","created_at":"2026-05-18T00:30:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07883","created_at":"2026-05-18T00:30:57Z"},{"alias_kind":"pith_short_12","alias_value":"LIGAWIY5NKQ5","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LIGAWIY5NKQ5KSTQ","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LIGAWIY5","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LIGAWIY5NKQ5KSTQ7M4BV3DQPY","target":"record","payload":{"canonical_record":{"source":{"id":"1708.07883","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-25T21:10:06Z","cross_cats_sorted":["cs.DS","cs.PF","cs.SI"],"title_canon_sha256":"9ea96620dce65cc5ea8f4a982d28892b925fc9eff2c7ead8290cb44f15a25252","abstract_canon_sha256":"8722d286747a7782c90caeb5160c86aa21eb16dd248050b4af5229fd990e9297"},"schema_version":"1.0"},"canonical_sha256":"5a0c0b231d6aa1d54a70fb381aec707e181306cce5e0774c091152e98a897200","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:57.425359Z","signature_b64":"ETv+58I9ygDyf6iRB6fs9Ph692aDUbrYLgL6tD/JXd+j61KgWZcsWN87Q2SRQyjfM5pR0/GtKY/bXp4Vb4ORDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a0c0b231d6aa1d54a70fb381aec707e181306cce5e0774c091152e98a897200","last_reissued_at":"2026-05-18T00:30:57.424755Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:57.424755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.07883","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-18T00:30:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jQAsHn7a1ITk50rv3th52CePHmG4zHcoTgeBQQTDDcFVbsaVGUZxO4LRe9If0dPU9K8iQOUqyMooLGnyBQd2Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:40:21.901608Z"},"content_sha256":"3e31c652326c909a84d053d83d841add574f3b97df889efa042f01b9ecb00471","schema_version":"1.0","event_id":"sha256:3e31c652326c909a84d053d83d841add574f3b97df889efa042f01b9ecb00471"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LIGAWIY5NKQ5KSTQ7M4BV3DQPY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Streaming Graph Challenge: Stochastic Block Partition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.PF","cs.SI"],"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":"2017-08-25T21:10:06Z","abstract_excerpt":"An important objective for analyzing real-world graphs is to achieve scalable performance on large, streaming graphs. A challenging and relevant example is the graph partition problem. As a combinatorial problem, graph partition is NP-hard, but existing relaxation methods provide reasonable approximate solutions that can be scaled for large graphs. Competitive benchmarks and challenges have proven to be an effective means to advance state-of-the-art performance and foster community collaboration. This paper describes a graph partition challenge with a baseline partition algorithm of sub-quadra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07883","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-18T00:30:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vM7bmtD7jSTginIDIYyctAYDsYL2je+jE20YPg635TiAISnrJR4IDuN9M3dpUT51/5qDe2urirRi84827ESEAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:40:21.901957Z"},"content_sha256":"ffd85564453a82a97929ecce9b4bba87641ca5e45cf5d57fbc5cb642de1631b7","schema_version":"1.0","event_id":"sha256:ffd85564453a82a97929ecce9b4bba87641ca5e45cf5d57fbc5cb642de1631b7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LIGAWIY5NKQ5KSTQ7M4BV3DQPY/bundle.json","state_url":"https://pith.science/pith/LIGAWIY5NKQ5KSTQ7M4BV3DQPY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LIGAWIY5NKQ5KSTQ7M4BV3DQPY/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-04T15:40:21Z","links":{"resolver":"https://pith.science/pith/LIGAWIY5NKQ5KSTQ7M4BV3DQPY","bundle":"https://pith.science/pith/LIGAWIY5NKQ5KSTQ7M4BV3DQPY/bundle.json","state":"https://pith.science/pith/LIGAWIY5NKQ5KSTQ7M4BV3DQPY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LIGAWIY5NKQ5KSTQ7M4BV3DQPY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LIGAWIY5NKQ5KSTQ7M4BV3DQPY","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":"8722d286747a7782c90caeb5160c86aa21eb16dd248050b4af5229fd990e9297","cross_cats_sorted":["cs.DS","cs.PF","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-25T21:10:06Z","title_canon_sha256":"9ea96620dce65cc5ea8f4a982d28892b925fc9eff2c7ead8290cb44f15a25252"},"schema_version":"1.0","source":{"id":"1708.07883","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07883","created_at":"2026-05-18T00:30:57Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07883v1","created_at":"2026-05-18T00:30:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07883","created_at":"2026-05-18T00:30:57Z"},{"alias_kind":"pith_short_12","alias_value":"LIGAWIY5NKQ5","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LIGAWIY5NKQ5KSTQ","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LIGAWIY5","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:ffd85564453a82a97929ecce9b4bba87641ca5e45cf5d57fbc5cb642de1631b7","target":"graph","created_at":"2026-05-18T00:30:57Z","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":"An important objective for analyzing real-world graphs is to achieve scalable performance on large, streaming graphs. A challenging and relevant example is the graph partition problem. As a combinatorial problem, graph partition is NP-hard, but existing relaxation methods provide reasonable approximate solutions that can be scaled for large graphs. Competitive benchmarks and challenges have proven to be an effective means to advance state-of-the-art performance and foster community collaboration. This paper describes a graph partition challenge with a baseline partition algorithm of sub-quadra","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","cs.PF","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-25T21:10:06Z","title":"Streaming Graph Challenge: Stochastic Block Partition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07883","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:3e31c652326c909a84d053d83d841add574f3b97df889efa042f01b9ecb00471","target":"record","created_at":"2026-05-18T00:30:57Z","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":"8722d286747a7782c90caeb5160c86aa21eb16dd248050b4af5229fd990e9297","cross_cats_sorted":["cs.DS","cs.PF","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-25T21:10:06Z","title_canon_sha256":"9ea96620dce65cc5ea8f4a982d28892b925fc9eff2c7ead8290cb44f15a25252"},"schema_version":"1.0","source":{"id":"1708.07883","kind":"arxiv","version":1}},"canonical_sha256":"5a0c0b231d6aa1d54a70fb381aec707e181306cce5e0774c091152e98a897200","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a0c0b231d6aa1d54a70fb381aec707e181306cce5e0774c091152e98a897200","first_computed_at":"2026-05-18T00:30:57.424755Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:57.424755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ETv+58I9ygDyf6iRB6fs9Ph692aDUbrYLgL6tD/JXd+j61KgWZcsWN87Q2SRQyjfM5pR0/GtKY/bXp4Vb4ORDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:57.425359Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.07883","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e31c652326c909a84d053d83d841add574f3b97df889efa042f01b9ecb00471","sha256:ffd85564453a82a97929ecce9b4bba87641ca5e45cf5d57fbc5cb642de1631b7"],"state_sha256":"2813d4295d62f33c1fb82d715a1bf76ddfd6eecd4e3aff25088e17cd43375b9d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V9RJTHrHLoGeVizPlrJg0gN38ZdPcf61sMYu03bqTdk29HVyuV15BABAYpdWhZ5lAulugm/kAfgFLhGhoN1JDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T15:40:21.903932Z","bundle_sha256":"0d00af73748006e1bf9cc8fbded4b35f6dff246fd29952774a2920811d17d8a3"}}