{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:2QNFWEI27U745QENA4NFNR5LBZ","short_pith_number":"pith:2QNFWEI2","canonical_record":{"source":{"id":"1307.3692","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-14T03:41:36Z","cross_cats_sorted":[],"title_canon_sha256":"7b55f3e9230e85ec4b490f20eeb03e0184dbd2c7f7abfe201b9e65f3f1672073","abstract_canon_sha256":"d8f1472782db24b35913b3e4ea0698c61ab05d6e8d6b68c6be322aafbb607837"},"schema_version":"1.0"},"canonical_sha256":"d41a5b111afd3fcec08d071a56c7ab0e4a1bdbcc1f066c53be0c3641cc0c7b22","source":{"kind":"arxiv","id":"1307.3692","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.3692","created_at":"2026-05-18T03:18:28Z"},{"alias_kind":"arxiv_version","alias_value":"1307.3692v1","created_at":"2026-05-18T03:18:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.3692","created_at":"2026-05-18T03:18:28Z"},{"alias_kind":"pith_short_12","alias_value":"2QNFWEI27U74","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"2QNFWEI27U745QEN","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"2QNFWEI2","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:2QNFWEI27U745QENA4NFNR5LBZ","target":"record","payload":{"canonical_record":{"source":{"id":"1307.3692","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-14T03:41:36Z","cross_cats_sorted":[],"title_canon_sha256":"7b55f3e9230e85ec4b490f20eeb03e0184dbd2c7f7abfe201b9e65f3f1672073","abstract_canon_sha256":"d8f1472782db24b35913b3e4ea0698c61ab05d6e8d6b68c6be322aafbb607837"},"schema_version":"1.0"},"canonical_sha256":"d41a5b111afd3fcec08d071a56c7ab0e4a1bdbcc1f066c53be0c3641cc0c7b22","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:28.174171Z","signature_b64":"Vzx66Ioq3mHo9fqCyZUH+3HTqi1Xa/DVEOGzlnbfyRt1VzjBB2FRkA5IgNvqWAVD1AQWl1FYmZRTgPw+mcMvAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d41a5b111afd3fcec08d071a56c7ab0e4a1bdbcc1f066c53be0c3641cc0c7b22","last_reissued_at":"2026-05-18T03:18:28.173485Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:28.173485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.3692","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-18T03:18:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4S/2AFiDrxs0RgtLyF2rnHwGmwpogF3I3qGnre2djad0dbAvknN378LDBOaeGLN/i9MErYLZw26GtTcpsp0lBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T08:26:44.284134Z"},"content_sha256":"d672bc85445651420bf7fb659295c9f5f4d6d26ccdad34cbae58bfad51cfcc48","schema_version":"1.0","event_id":"sha256:d672bc85445651420bf7fb659295c9f5f4d6d26ccdad34cbae58bfad51cfcc48"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:2QNFWEI27U745QENA4NFNR5LBZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel Graph Decompositions Using Random Shifts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gary L. Miller, Richard Peng, Shen Chen Xu","submitted_at":"2013-07-14T03:41:36Z","abstract_excerpt":"We show an improved parallel algorithm for decomposing an undirected unweighted graph into small diameter pieces with a small fraction of the edges in between. These decompositions form critical subroutines in a number of graph algorithms. Our algorithm builds upon the shifted shortest path approach introduced in [Blelloch, Gupta, Koutis, Miller, Peng, Tangwongsan, SPAA 2011]. By combining various stages of the previous algorithm, we obtain a significantly simpler algorithm with the same asymptotic guarantees as the best sequential algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.3692","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-18T03:18:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qyMNTH+QBCCHE4ML87/VrnXs3GbyqvJCYaDYINTCz/O+Hw+YPSJldjTIZaWcjthK/rFnYTZj4X6z4Kt95IMkCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T08:26:44.284484Z"},"content_sha256":"e0004c1a6b32623c886234ef5486b5024e051288a8fa34528791f30e51f9cb24","schema_version":"1.0","event_id":"sha256:e0004c1a6b32623c886234ef5486b5024e051288a8fa34528791f30e51f9cb24"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2QNFWEI27U745QENA4NFNR5LBZ/bundle.json","state_url":"https://pith.science/pith/2QNFWEI27U745QENA4NFNR5LBZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2QNFWEI27U745QENA4NFNR5LBZ/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-05T08:26:44Z","links":{"resolver":"https://pith.science/pith/2QNFWEI27U745QENA4NFNR5LBZ","bundle":"https://pith.science/pith/2QNFWEI27U745QENA4NFNR5LBZ/bundle.json","state":"https://pith.science/pith/2QNFWEI27U745QENA4NFNR5LBZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2QNFWEI27U745QENA4NFNR5LBZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:2QNFWEI27U745QENA4NFNR5LBZ","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":"d8f1472782db24b35913b3e4ea0698c61ab05d6e8d6b68c6be322aafbb607837","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-14T03:41:36Z","title_canon_sha256":"7b55f3e9230e85ec4b490f20eeb03e0184dbd2c7f7abfe201b9e65f3f1672073"},"schema_version":"1.0","source":{"id":"1307.3692","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.3692","created_at":"2026-05-18T03:18:28Z"},{"alias_kind":"arxiv_version","alias_value":"1307.3692v1","created_at":"2026-05-18T03:18:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.3692","created_at":"2026-05-18T03:18:28Z"},{"alias_kind":"pith_short_12","alias_value":"2QNFWEI27U74","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"2QNFWEI27U745QEN","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"2QNFWEI2","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:e0004c1a6b32623c886234ef5486b5024e051288a8fa34528791f30e51f9cb24","target":"graph","created_at":"2026-05-18T03:18:28Z","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 show an improved parallel algorithm for decomposing an undirected unweighted graph into small diameter pieces with a small fraction of the edges in between. These decompositions form critical subroutines in a number of graph algorithms. Our algorithm builds upon the shifted shortest path approach introduced in [Blelloch, Gupta, Koutis, Miller, Peng, Tangwongsan, SPAA 2011]. By combining various stages of the previous algorithm, we obtain a significantly simpler algorithm with the same asymptotic guarantees as the best sequential algorithm.","authors_text":"Gary L. Miller, Richard Peng, Shen Chen Xu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-14T03:41:36Z","title":"Parallel Graph Decompositions Using Random Shifts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.3692","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:d672bc85445651420bf7fb659295c9f5f4d6d26ccdad34cbae58bfad51cfcc48","target":"record","created_at":"2026-05-18T03:18:28Z","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":"d8f1472782db24b35913b3e4ea0698c61ab05d6e8d6b68c6be322aafbb607837","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-14T03:41:36Z","title_canon_sha256":"7b55f3e9230e85ec4b490f20eeb03e0184dbd2c7f7abfe201b9e65f3f1672073"},"schema_version":"1.0","source":{"id":"1307.3692","kind":"arxiv","version":1}},"canonical_sha256":"d41a5b111afd3fcec08d071a56c7ab0e4a1bdbcc1f066c53be0c3641cc0c7b22","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d41a5b111afd3fcec08d071a56c7ab0e4a1bdbcc1f066c53be0c3641cc0c7b22","first_computed_at":"2026-05-18T03:18:28.173485Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:18:28.173485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Vzx66Ioq3mHo9fqCyZUH+3HTqi1Xa/DVEOGzlnbfyRt1VzjBB2FRkA5IgNvqWAVD1AQWl1FYmZRTgPw+mcMvAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:18:28.174171Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.3692","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d672bc85445651420bf7fb659295c9f5f4d6d26ccdad34cbae58bfad51cfcc48","sha256:e0004c1a6b32623c886234ef5486b5024e051288a8fa34528791f30e51f9cb24"],"state_sha256":"0a7cb430df4ef370bb5ecc99cc03d8bb060f36839edd3c8da8b050d4614a0a01"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ZLhFAmOrn+VBjeBD1d8Dt4mTuvucrIR3Jjw6c3Wsg50dsQS7FdgW6lrKI9R6LyHkIp2BA1P2/iFAKYO1cUsAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T08:26:44.286286Z","bundle_sha256":"408c3e0d0d3de8662d8eb89dd29c6cf0d6bf912590a3d7eeb41212d8493538e1"}}