{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JA4FPAG2CGEREXAYF73BVZHILO","short_pith_number":"pith:JA4FPAG2","canonical_record":{"source":{"id":"1310.5407","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-10-21T03:02:51Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"65a047d6384f927a7f21481203488e6ef9e732c13976b57ce4b145d76068fb91","abstract_canon_sha256":"60f0308de2d8ee5d02ccc62f5bf211d56c1e81dc9051e8a55c613db2e99d34c8"},"schema_version":"1.0"},"canonical_sha256":"48385780da1189125c182ff61ae4e85ba403f6fde76eb069f6a35010b9572220","source":{"kind":"arxiv","id":"1310.5407","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.5407","created_at":"2026-05-18T03:09:35Z"},{"alias_kind":"arxiv_version","alias_value":"1310.5407v1","created_at":"2026-05-18T03:09:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5407","created_at":"2026-05-18T03:09:35Z"},{"alias_kind":"pith_short_12","alias_value":"JA4FPAG2CGER","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JA4FPAG2CGEREXAY","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JA4FPAG2","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JA4FPAG2CGEREXAYF73BVZHILO","target":"record","payload":{"canonical_record":{"source":{"id":"1310.5407","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-10-21T03:02:51Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"65a047d6384f927a7f21481203488e6ef9e732c13976b57ce4b145d76068fb91","abstract_canon_sha256":"60f0308de2d8ee5d02ccc62f5bf211d56c1e81dc9051e8a55c613db2e99d34c8"},"schema_version":"1.0"},"canonical_sha256":"48385780da1189125c182ff61ae4e85ba403f6fde76eb069f6a35010b9572220","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:35.848064Z","signature_b64":"SUUJU7rCqhgVrwh/zQctigGF1gQV6/6dCAJ2gw/1UgpfC9gpgFsPAIbo/1TMlmEgXlpzHBJKrfVWImE++kUpDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48385780da1189125c182ff61ae4e85ba403f6fde76eb069f6a35010b9572220","last_reissued_at":"2026-05-18T03:09:35.847285Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:35.847285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.5407","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:09:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X7WZ8AERCzyzx1f1HXug4Ar+PAb8E2b3PhrFAwUERJIsDJPBdl6xw1Kvy3jdGI+ezh9N/VQ54YG/urtb2cFsAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T18:31:06.322630Z"},"content_sha256":"de59e28c3d245cdf0a96c25581a1412ef8c2e32abd0b800b276466272ca4ea45","schema_version":"1.0","event_id":"sha256:de59e28c3d245cdf0a96c25581a1412ef8c2e32abd0b800b276466272ca4ea45"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JA4FPAG2CGEREXAYF73BVZHILO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Computation of Sparse Cuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Anisur Rahaman Molla, Atish Das Sarma, Gopal Pandurangan","submitted_at":"2013-10-21T03:02:51Z","abstract_excerpt":"Finding sparse cuts is an important tool in analyzing large-scale distributed networks such as the Internet and Peer-to-Peer networks, as well as large-scale graphs such as the web graph, online social communities, and VLSI circuits. In distributed communication networks, they are useful for topology maintenance and for designing better search and routing algorithms.\n  In this paper, we focus on developing fast distributed algorithms for computing sparse cuts in networks. Given an undirected $n$-node network $G$ with conductance $\\phi$, the goal is to find a cut set whose conductance is close "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5407","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:09:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K5vIlTlWzfBsWk1FGobAYeblqzsg1PMq/aNBG7nzz5W3XKTh/4HPCWH79WiBEC9hD5WDUiOi4JiQyGwqYBNmBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T18:31:06.322981Z"},"content_sha256":"70d797d72299741f7013c85645fee214e21369a2dfbc65b498c8da5f61034903","schema_version":"1.0","event_id":"sha256:70d797d72299741f7013c85645fee214e21369a2dfbc65b498c8da5f61034903"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JA4FPAG2CGEREXAYF73BVZHILO/bundle.json","state_url":"https://pith.science/pith/JA4FPAG2CGEREXAYF73BVZHILO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JA4FPAG2CGEREXAYF73BVZHILO/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-30T18:31:06Z","links":{"resolver":"https://pith.science/pith/JA4FPAG2CGEREXAYF73BVZHILO","bundle":"https://pith.science/pith/JA4FPAG2CGEREXAYF73BVZHILO/bundle.json","state":"https://pith.science/pith/JA4FPAG2CGEREXAYF73BVZHILO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JA4FPAG2CGEREXAYF73BVZHILO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JA4FPAG2CGEREXAYF73BVZHILO","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":"60f0308de2d8ee5d02ccc62f5bf211d56c1e81dc9051e8a55c613db2e99d34c8","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-10-21T03:02:51Z","title_canon_sha256":"65a047d6384f927a7f21481203488e6ef9e732c13976b57ce4b145d76068fb91"},"schema_version":"1.0","source":{"id":"1310.5407","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.5407","created_at":"2026-05-18T03:09:35Z"},{"alias_kind":"arxiv_version","alias_value":"1310.5407v1","created_at":"2026-05-18T03:09:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5407","created_at":"2026-05-18T03:09:35Z"},{"alias_kind":"pith_short_12","alias_value":"JA4FPAG2CGER","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JA4FPAG2CGEREXAY","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JA4FPAG2","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:70d797d72299741f7013c85645fee214e21369a2dfbc65b498c8da5f61034903","target":"graph","created_at":"2026-05-18T03:09:35Z","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":"Finding sparse cuts is an important tool in analyzing large-scale distributed networks such as the Internet and Peer-to-Peer networks, as well as large-scale graphs such as the web graph, online social communities, and VLSI circuits. In distributed communication networks, they are useful for topology maintenance and for designing better search and routing algorithms.\n  In this paper, we focus on developing fast distributed algorithms for computing sparse cuts in networks. Given an undirected $n$-node network $G$ with conductance $\\phi$, the goal is to find a cut set whose conductance is close ","authors_text":"Anisur Rahaman Molla, Atish Das Sarma, Gopal Pandurangan","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-10-21T03:02:51Z","title":"Distributed Computation of Sparse Cuts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5407","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:de59e28c3d245cdf0a96c25581a1412ef8c2e32abd0b800b276466272ca4ea45","target":"record","created_at":"2026-05-18T03:09:35Z","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":"60f0308de2d8ee5d02ccc62f5bf211d56c1e81dc9051e8a55c613db2e99d34c8","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-10-21T03:02:51Z","title_canon_sha256":"65a047d6384f927a7f21481203488e6ef9e732c13976b57ce4b145d76068fb91"},"schema_version":"1.0","source":{"id":"1310.5407","kind":"arxiv","version":1}},"canonical_sha256":"48385780da1189125c182ff61ae4e85ba403f6fde76eb069f6a35010b9572220","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"48385780da1189125c182ff61ae4e85ba403f6fde76eb069f6a35010b9572220","first_computed_at":"2026-05-18T03:09:35.847285Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:35.847285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SUUJU7rCqhgVrwh/zQctigGF1gQV6/6dCAJ2gw/1UgpfC9gpgFsPAIbo/1TMlmEgXlpzHBJKrfVWImE++kUpDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:35.848064Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.5407","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de59e28c3d245cdf0a96c25581a1412ef8c2e32abd0b800b276466272ca4ea45","sha256:70d797d72299741f7013c85645fee214e21369a2dfbc65b498c8da5f61034903"],"state_sha256":"c412ca9b70c8f4d8bfa3b7c35d6f1f5c96eedf2f7746b062611455cf41d476e3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SK30pZF8HmMvChuXNxsGlo4Z1e/T5XaamKH1eLsw4G5Qi2U5bayuX0OxoH+b5sSS9kR0qItrtHUuH/aYTILsAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T18:31:06.327292Z","bundle_sha256":"2b075a494062d288143c65df734e6506fbb3ab847e6355453473a2ee6eb643a0"}}