{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:2QNFWEI27U745QENA4NFNR5LBZ","short_pith_number":"pith:2QNFWEI2","schema_version":"1.0","canonical_sha256":"d41a5b111afd3fcec08d071a56c7ab0e4a1bdbcc1f066c53be0c3641cc0c7b22","source":{"kind":"arxiv","id":"1307.3692","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1307.3692","created_at":"2026-05-18T03:18:28.173600+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.3692v1","created_at":"2026-05-18T03:18:28.173600+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.3692","created_at":"2026-05-18T03:18:28.173600+00:00"},{"alias_kind":"pith_short_12","alias_value":"2QNFWEI27U74","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"2QNFWEI27U745QEN","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"2QNFWEI2","created_at":"2026-05-18T12:27:32.513160+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/2QNFWEI27U745QENA4NFNR5LBZ","json":"https://pith.science/pith/2QNFWEI27U745QENA4NFNR5LBZ.json","graph_json":"https://pith.science/api/pith-number/2QNFWEI27U745QENA4NFNR5LBZ/graph.json","events_json":"https://pith.science/api/pith-number/2QNFWEI27U745QENA4NFNR5LBZ/events.json","paper":"https://pith.science/paper/2QNFWEI2"},"agent_actions":{"view_html":"https://pith.science/pith/2QNFWEI27U745QENA4NFNR5LBZ","download_json":"https://pith.science/pith/2QNFWEI27U745QENA4NFNR5LBZ.json","view_paper":"https://pith.science/paper/2QNFWEI2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.3692&json=true","fetch_graph":"https://pith.science/api/pith-number/2QNFWEI27U745QENA4NFNR5LBZ/graph.json","fetch_events":"https://pith.science/api/pith-number/2QNFWEI27U745QENA4NFNR5LBZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2QNFWEI27U745QENA4NFNR5LBZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2QNFWEI27U745QENA4NFNR5LBZ/action/storage_attestation","attest_author":"https://pith.science/pith/2QNFWEI27U745QENA4NFNR5LBZ/action/author_attestation","sign_citation":"https://pith.science/pith/2QNFWEI27U745QENA4NFNR5LBZ/action/citation_signature","submit_replication":"https://pith.science/pith/2QNFWEI27U745QENA4NFNR5LBZ/action/replication_record"}},"created_at":"2026-05-18T03:18:28.173600+00:00","updated_at":"2026-05-18T03:18:28.173600+00:00"}