{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:26V4ZEYEGCWQXPURCLEV746W2H","short_pith_number":"pith:26V4ZEYE","canonical_record":{"source":{"id":"1308.2473","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-08-12T06:30:09Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"de0da69022d492a44266c03ead80955108da9781675ef86937fbd30b466c1da4","abstract_canon_sha256":"e26cef98bd18bc742a7cd764c22a3b242d53b2c147186074210f4a0e82798c32"},"schema_version":"1.0"},"canonical_sha256":"d7abcc930430ad0bbe9112c95ff3d6d1d0153bf7d7d0c7b77061b5dccb7fd5d8","source":{"kind":"arxiv","id":"1308.2473","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.2473","created_at":"2026-05-18T03:16:07Z"},{"alias_kind":"arxiv_version","alias_value":"1308.2473v1","created_at":"2026-05-18T03:16:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.2473","created_at":"2026-05-18T03:16:07Z"},{"alias_kind":"pith_short_12","alias_value":"26V4ZEYEGCWQ","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"26V4ZEYEGCWQXPUR","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"26V4ZEYE","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:26V4ZEYEGCWQXPURCLEV746W2H","target":"record","payload":{"canonical_record":{"source":{"id":"1308.2473","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-08-12T06:30:09Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"de0da69022d492a44266c03ead80955108da9781675ef86937fbd30b466c1da4","abstract_canon_sha256":"e26cef98bd18bc742a7cd764c22a3b242d53b2c147186074210f4a0e82798c32"},"schema_version":"1.0"},"canonical_sha256":"d7abcc930430ad0bbe9112c95ff3d6d1d0153bf7d7d0c7b77061b5dccb7fd5d8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:07.286024Z","signature_b64":"JahGYhiak9P4mugopb/9xiukL9FpTJMH1+ZmulV/+5vQLFit2lLpZmW136GVl36oNiqnmze6pPz5sbuXVjTuCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7abcc930430ad0bbe9112c95ff3d6d1d0153bf7d7d0c7b77061b5dccb7fd5d8","last_reissued_at":"2026-05-18T03:16:07.285498Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:07.285498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.2473","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:16:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kgJtKznp3ED7+53iAwSOVyNIy9a/Ot8ZYOr1Ncrd53Nzp2XY5b245iPUhOIampDLTvX0uVthzBjOMqeBDUAHDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T22:07:44.046207Z"},"content_sha256":"c2ba2235517a2dee6d5b7947acde44f241ec8393f297c6958cb8a3445dd9e3d5","schema_version":"1.0","event_id":"sha256:c2ba2235517a2dee6d5b7947acde44f241ec8393f297c6958cb8a3445dd9e3d5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:26V4ZEYEGCWQXPURCLEV746W2H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Super-Fast Distributed Algorithms for Metric Facility Location","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Andrew Berns, James Hegeman, Sriram V. Pemmaraju","submitted_at":"2013-08-12T06:30:09Z","abstract_excerpt":"This paper presents a distributed O(1)-approximation algorithm, with expected-$O(\\log \\log n)$ running time, in the $\\mathcal{CONGEST}$ model for the metric facility location problem on a size-$n$ clique network. Though metric facility location has been considered by a number of researchers in low-diameter settings, this is the first sub-logarithmic-round algorithm for the problem that yields an O(1)-approximation in the setting of non-uniform facility opening costs. In order to obtain this result, our paper makes three main technical contributions. First, we show a new lower bound for metric "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.2473","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:16:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9CklY3K3bxq/EFNbpqK+ZNAf3k1AHwgrDh8tI5QW31BYZW+0/AU55abAwzoGWyyvGcdVWDrc2RvgKcXauujeCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T22:07:44.046654Z"},"content_sha256":"ae779cd4e8682bf9b91ca58cf58af5d3ae2bf1d469072a1944fd2bbde4580173","schema_version":"1.0","event_id":"sha256:ae779cd4e8682bf9b91ca58cf58af5d3ae2bf1d469072a1944fd2bbde4580173"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/26V4ZEYEGCWQXPURCLEV746W2H/bundle.json","state_url":"https://pith.science/pith/26V4ZEYEGCWQXPURCLEV746W2H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/26V4ZEYEGCWQXPURCLEV746W2H/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-22T22:07:44Z","links":{"resolver":"https://pith.science/pith/26V4ZEYEGCWQXPURCLEV746W2H","bundle":"https://pith.science/pith/26V4ZEYEGCWQXPURCLEV746W2H/bundle.json","state":"https://pith.science/pith/26V4ZEYEGCWQXPURCLEV746W2H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/26V4ZEYEGCWQXPURCLEV746W2H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:26V4ZEYEGCWQXPURCLEV746W2H","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":"e26cef98bd18bc742a7cd764c22a3b242d53b2c147186074210f4a0e82798c32","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-08-12T06:30:09Z","title_canon_sha256":"de0da69022d492a44266c03ead80955108da9781675ef86937fbd30b466c1da4"},"schema_version":"1.0","source":{"id":"1308.2473","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.2473","created_at":"2026-05-18T03:16:07Z"},{"alias_kind":"arxiv_version","alias_value":"1308.2473v1","created_at":"2026-05-18T03:16:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.2473","created_at":"2026-05-18T03:16:07Z"},{"alias_kind":"pith_short_12","alias_value":"26V4ZEYEGCWQ","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"26V4ZEYEGCWQXPUR","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"26V4ZEYE","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:ae779cd4e8682bf9b91ca58cf58af5d3ae2bf1d469072a1944fd2bbde4580173","target":"graph","created_at":"2026-05-18T03:16:07Z","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":"This paper presents a distributed O(1)-approximation algorithm, with expected-$O(\\log \\log n)$ running time, in the $\\mathcal{CONGEST}$ model for the metric facility location problem on a size-$n$ clique network. Though metric facility location has been considered by a number of researchers in low-diameter settings, this is the first sub-logarithmic-round algorithm for the problem that yields an O(1)-approximation in the setting of non-uniform facility opening costs. In order to obtain this result, our paper makes three main technical contributions. First, we show a new lower bound for metric ","authors_text":"Andrew Berns, James Hegeman, Sriram V. Pemmaraju","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-08-12T06:30:09Z","title":"Super-Fast Distributed Algorithms for Metric Facility Location"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.2473","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:c2ba2235517a2dee6d5b7947acde44f241ec8393f297c6958cb8a3445dd9e3d5","target":"record","created_at":"2026-05-18T03:16:07Z","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":"e26cef98bd18bc742a7cd764c22a3b242d53b2c147186074210f4a0e82798c32","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-08-12T06:30:09Z","title_canon_sha256":"de0da69022d492a44266c03ead80955108da9781675ef86937fbd30b466c1da4"},"schema_version":"1.0","source":{"id":"1308.2473","kind":"arxiv","version":1}},"canonical_sha256":"d7abcc930430ad0bbe9112c95ff3d6d1d0153bf7d7d0c7b77061b5dccb7fd5d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7abcc930430ad0bbe9112c95ff3d6d1d0153bf7d7d0c7b77061b5dccb7fd5d8","first_computed_at":"2026-05-18T03:16:07.285498Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:16:07.285498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JahGYhiak9P4mugopb/9xiukL9FpTJMH1+ZmulV/+5vQLFit2lLpZmW136GVl36oNiqnmze6pPz5sbuXVjTuCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:16:07.286024Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.2473","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c2ba2235517a2dee6d5b7947acde44f241ec8393f297c6958cb8a3445dd9e3d5","sha256:ae779cd4e8682bf9b91ca58cf58af5d3ae2bf1d469072a1944fd2bbde4580173"],"state_sha256":"7926f67fb7aad36239c8fee1259889bda7ef220186fae19b84b6c017b755457d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V2B0kNG/aEORgPsbvf7/5CqZ1l9hGW4l/tq+hE2JLCT5RtDwQHU1Y7s0gYZx/ED/Tvl2t4TtJyo98tfZXvdJAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T22:07:44.048862Z","bundle_sha256":"3c3771021b0a24d9d6b54376d3913e1c64e50cced99256328dd47a538ab115a0"}}