{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:Q5B5OPO5Q7D4DIHGCDDNR2MAMB","short_pith_number":"pith:Q5B5OPO5","schema_version":"1.0","canonical_sha256":"8743d73ddd87c7c1a0e610c6d8e980606c8bbbea56c13f8cdf38f1a2f9b9b24b","source":{"kind":"arxiv","id":"1902.08819","version":2},"attestation_state":"computed","paper":{"title":"Fast Distributed Backup Placement in Sparse and Dense Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Gal Oren, Leonid Barenboim","submitted_at":"2019-02-23T17:45:17Z","abstract_excerpt":"We consider the Backup Placement problem in networks in the $\\mathcal{CONGEST}$ distributed setting. Given a network graph $G = (V,E)$, the goal of each vertex $v \\in V$ is selecting a neighbor, such that the maximum number of vertices in $V$ that select the same vertex is minimized. The backup placement problem was introduced by Halldorsson, Kohler, Patt-Shamir, and Rawitz, who obtained an $O(\\log n/ \\log \\log n)$ approximation with randomized polylogarithmic time. Their algorithm remained the state-of-the-art for general graphs, as well as specific graph topologies. In this paper we obtain s"},"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":"1902.08819","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-02-23T17:45:17Z","cross_cats_sorted":[],"title_canon_sha256":"5afceb8bb8321d9c8ca9b25b2b7c6598462845a8fa41172f98187dc1b627146b","abstract_canon_sha256":"600ed592ebdd10429d43ca9a825c06985a6f50aa2015b8c92a0f22fc8c6c405a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:56:47.896015Z","signature_b64":"toL/MO89s3RVDNgqaNyi+Gtp3CZlOLd536mRzCII1fP6PKJu2Pjrw+sqbICrC0G5miFmdVFCVV6nKkxYzBmbBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8743d73ddd87c7c1a0e610c6d8e980606c8bbbea56c13f8cdf38f1a2f9b9b24b","last_reissued_at":"2026-07-04T23:56:47.895403Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:56:47.895403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Distributed Backup Placement in Sparse and Dense Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Gal Oren, Leonid Barenboim","submitted_at":"2019-02-23T17:45:17Z","abstract_excerpt":"We consider the Backup Placement problem in networks in the $\\mathcal{CONGEST}$ distributed setting. Given a network graph $G = (V,E)$, the goal of each vertex $v \\in V$ is selecting a neighbor, such that the maximum number of vertices in $V$ that select the same vertex is minimized. The backup placement problem was introduced by Halldorsson, Kohler, Patt-Shamir, and Rawitz, who obtained an $O(\\log n/ \\log \\log n)$ approximation with randomized polylogarithmic time. Their algorithm remained the state-of-the-art for general graphs, as well as specific graph topologies. In this paper we obtain s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08819","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1902.08819/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1902.08819","created_at":"2026-07-04T23:56:47.895468+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.08819v2","created_at":"2026-07-04T23:56:47.895468+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08819","created_at":"2026-07-04T23:56:47.895468+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q5B5OPO5Q7D4","created_at":"2026-07-04T23:56:47.895468+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q5B5OPO5Q7D4DIHG","created_at":"2026-07-04T23:56:47.895468+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q5B5OPO5","created_at":"2026-07-04T23:56:47.895468+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.05700","citing_title":"Distributed Backup Placement in One Round and its Applications to Maximum Matching Approximation and Self-Stabilization","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q5B5OPO5Q7D4DIHGCDDNR2MAMB","json":"https://pith.science/pith/Q5B5OPO5Q7D4DIHGCDDNR2MAMB.json","graph_json":"https://pith.science/api/pith-number/Q5B5OPO5Q7D4DIHGCDDNR2MAMB/graph.json","events_json":"https://pith.science/api/pith-number/Q5B5OPO5Q7D4DIHGCDDNR2MAMB/events.json","paper":"https://pith.science/paper/Q5B5OPO5"},"agent_actions":{"view_html":"https://pith.science/pith/Q5B5OPO5Q7D4DIHGCDDNR2MAMB","download_json":"https://pith.science/pith/Q5B5OPO5Q7D4DIHGCDDNR2MAMB.json","view_paper":"https://pith.science/paper/Q5B5OPO5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.08819&json=true","fetch_graph":"https://pith.science/api/pith-number/Q5B5OPO5Q7D4DIHGCDDNR2MAMB/graph.json","fetch_events":"https://pith.science/api/pith-number/Q5B5OPO5Q7D4DIHGCDDNR2MAMB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q5B5OPO5Q7D4DIHGCDDNR2MAMB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q5B5OPO5Q7D4DIHGCDDNR2MAMB/action/storage_attestation","attest_author":"https://pith.science/pith/Q5B5OPO5Q7D4DIHGCDDNR2MAMB/action/author_attestation","sign_citation":"https://pith.science/pith/Q5B5OPO5Q7D4DIHGCDDNR2MAMB/action/citation_signature","submit_replication":"https://pith.science/pith/Q5B5OPO5Q7D4DIHGCDDNR2MAMB/action/replication_record"}},"created_at":"2026-07-04T23:56:47.895468+00:00","updated_at":"2026-07-04T23:56:47.895468+00:00"}