{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:S3OSY57BX25FW2AYWXQVZOELEK","short_pith_number":"pith:S3OSY57B","canonical_record":{"source":{"id":"1610.07220","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-10-23T19:07:47Z","cross_cats_sorted":[],"title_canon_sha256":"8d642d749f7abefb4c06f017ecb85d80e04a2e4725b97d742273884efecb7013","abstract_canon_sha256":"6454917cd5056e6657aaed1d5440f92bd4e8969ba2146fc93a72f2d34dbb0e15"},"schema_version":"1.0"},"canonical_sha256":"96dd2c77e1beba5b6818b5e15cb88b22aefe188ccbd48f4dc6f7034c51166ffa","source":{"kind":"arxiv","id":"1610.07220","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.07220","created_at":"2026-05-18T01:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"1610.07220v1","created_at":"2026-05-18T01:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07220","created_at":"2026-05-18T01:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"S3OSY57BX25F","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"S3OSY57BX25FW2AY","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"S3OSY57B","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:S3OSY57BX25FW2AYWXQVZOELEK","target":"record","payload":{"canonical_record":{"source":{"id":"1610.07220","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-10-23T19:07:47Z","cross_cats_sorted":[],"title_canon_sha256":"8d642d749f7abefb4c06f017ecb85d80e04a2e4725b97d742273884efecb7013","abstract_canon_sha256":"6454917cd5056e6657aaed1d5440f92bd4e8969ba2146fc93a72f2d34dbb0e15"},"schema_version":"1.0"},"canonical_sha256":"96dd2c77e1beba5b6818b5e15cb88b22aefe188ccbd48f4dc6f7034c51166ffa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:34.983426Z","signature_b64":"9eiwfofetWlD5YbcOLdiq6SbQdsmRa9vBwNQFko+ruIoJ0laP7dNVDobJVEAD+Ca5AmnCTv8hSYvBn6SZ3rcCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96dd2c77e1beba5b6818b5e15cb88b22aefe188ccbd48f4dc6f7034c51166ffa","last_reissued_at":"2026-05-18T01:01:34.982630Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:34.982630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.07220","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-18T01:01:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"siSPWPaQ8pEjVdQ++oHB8ERzw7g/AABRkYtpqf3yyl3x67JCdZe0jKX7+vLBFSKbV+CshY16lPshsLjqWEG1CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:38:37.876733Z"},"content_sha256":"419622bd82dc95e3196f2be9917a22592e001a8681c89ced45827f7a555eeff6","schema_version":"1.0","event_id":"sha256:419622bd82dc95e3196f2be9917a22592e001a8681c89ced45827f7a555eeff6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:S3OSY57BX25FW2AYWXQVZOELEK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Partitioning Trillion-edge Graphs in Minutes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"George M Slota, Kamesh Madduri, Karen Devine, Sivasankaran Rajamanickam","submitted_at":"2016-10-23T19:07:47Z","abstract_excerpt":"We introduce XtraPuLP, a new distributed-memory graph partitioner designed to process trillion-edge graphs. XtraPuLP is based on the scalable label propagation community detection technique, which has been demonstrated as a viable means to produce high quality partitions with minimal computation time. On a collection of large sparse graphs, we show that XtraPuLP partitioning quality is comparable to state-of-the-art partitioning methods. We also demonstrate that XtraPuLP can produce partitions of real-world graphs with billion+ vertices in minutes. Further, we show that using XtraPuLP partitio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07220","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-18T01:01:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"exty4gHSCLl9vvyz8Odlvyj8M01CoSEuR1u5pUbaFAklFuqA/25ck8E7vh9v23EKQ5SZBUfpwn2H77Ipx3hTAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:38:37.877080Z"},"content_sha256":"8d0e258024e8a6368ff84b6fb01ed5daee246f256591fe841a44b9d8773520b9","schema_version":"1.0","event_id":"sha256:8d0e258024e8a6368ff84b6fb01ed5daee246f256591fe841a44b9d8773520b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S3OSY57BX25FW2AYWXQVZOELEK/bundle.json","state_url":"https://pith.science/pith/S3OSY57BX25FW2AYWXQVZOELEK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S3OSY57BX25FW2AYWXQVZOELEK/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-02T18:38:37Z","links":{"resolver":"https://pith.science/pith/S3OSY57BX25FW2AYWXQVZOELEK","bundle":"https://pith.science/pith/S3OSY57BX25FW2AYWXQVZOELEK/bundle.json","state":"https://pith.science/pith/S3OSY57BX25FW2AYWXQVZOELEK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S3OSY57BX25FW2AYWXQVZOELEK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:S3OSY57BX25FW2AYWXQVZOELEK","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":"6454917cd5056e6657aaed1d5440f92bd4e8969ba2146fc93a72f2d34dbb0e15","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-10-23T19:07:47Z","title_canon_sha256":"8d642d749f7abefb4c06f017ecb85d80e04a2e4725b97d742273884efecb7013"},"schema_version":"1.0","source":{"id":"1610.07220","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.07220","created_at":"2026-05-18T01:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"1610.07220v1","created_at":"2026-05-18T01:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07220","created_at":"2026-05-18T01:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"S3OSY57BX25F","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"S3OSY57BX25FW2AY","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"S3OSY57B","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:8d0e258024e8a6368ff84b6fb01ed5daee246f256591fe841a44b9d8773520b9","target":"graph","created_at":"2026-05-18T01:01:34Z","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":"We introduce XtraPuLP, a new distributed-memory graph partitioner designed to process trillion-edge graphs. XtraPuLP is based on the scalable label propagation community detection technique, which has been demonstrated as a viable means to produce high quality partitions with minimal computation time. On a collection of large sparse graphs, we show that XtraPuLP partitioning quality is comparable to state-of-the-art partitioning methods. We also demonstrate that XtraPuLP can produce partitions of real-world graphs with billion+ vertices in minutes. Further, we show that using XtraPuLP partitio","authors_text":"George M Slota, Kamesh Madduri, Karen Devine, Sivasankaran Rajamanickam","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-10-23T19:07:47Z","title":"Partitioning Trillion-edge Graphs in Minutes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07220","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:419622bd82dc95e3196f2be9917a22592e001a8681c89ced45827f7a555eeff6","target":"record","created_at":"2026-05-18T01:01:34Z","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":"6454917cd5056e6657aaed1d5440f92bd4e8969ba2146fc93a72f2d34dbb0e15","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-10-23T19:07:47Z","title_canon_sha256":"8d642d749f7abefb4c06f017ecb85d80e04a2e4725b97d742273884efecb7013"},"schema_version":"1.0","source":{"id":"1610.07220","kind":"arxiv","version":1}},"canonical_sha256":"96dd2c77e1beba5b6818b5e15cb88b22aefe188ccbd48f4dc6f7034c51166ffa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96dd2c77e1beba5b6818b5e15cb88b22aefe188ccbd48f4dc6f7034c51166ffa","first_computed_at":"2026-05-18T01:01:34.982630Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:34.982630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9eiwfofetWlD5YbcOLdiq6SbQdsmRa9vBwNQFko+ruIoJ0laP7dNVDobJVEAD+Ca5AmnCTv8hSYvBn6SZ3rcCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:34.983426Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.07220","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:419622bd82dc95e3196f2be9917a22592e001a8681c89ced45827f7a555eeff6","sha256:8d0e258024e8a6368ff84b6fb01ed5daee246f256591fe841a44b9d8773520b9"],"state_sha256":"2f94098344d18c06523a30fdc73ab08bfa8f2b3d292d37b73800c26e63fc25bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WIxSlVTLgT+ZbPAnfiDRwOrk/GLayLz4eRVElRhk2/f6bRes2cvCy44mkY3UgTa1rVAcdy3ZPsfiUauKkbWRAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T18:38:37.878968Z","bundle_sha256":"873e3cb121f27d16e9e858cb67370f5ff8f4117dcd00b4232b14e33ec53f4eef"}}