{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:Q5B5OPO5Q7D4DIHGCDDNR2MAMB","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":"600ed592ebdd10429d43ca9a825c06985a6f50aa2015b8c92a0f22fc8c6c405a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-02-23T17:45:17Z","title_canon_sha256":"5afceb8bb8321d9c8ca9b25b2b7c6598462845a8fa41172f98187dc1b627146b"},"schema_version":"1.0","source":{"id":"1902.08819","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08819","created_at":"2026-07-04T23:56:47Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08819v2","created_at":"2026-07-04T23:56:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08819","created_at":"2026-07-04T23:56:47Z"},{"alias_kind":"pith_short_12","alias_value":"Q5B5OPO5Q7D4","created_at":"2026-07-04T23:56:47Z"},{"alias_kind":"pith_short_16","alias_value":"Q5B5OPO5Q7D4DIHG","created_at":"2026-07-04T23:56:47Z"},{"alias_kind":"pith_short_8","alias_value":"Q5B5OPO5","created_at":"2026-07-04T23:56:47Z"}],"graph_snapshots":[{"event_id":"sha256:34799adf43e7ada471920360861e50bbb7705facd27cc5b39d1123d53113552f","target":"graph","created_at":"2026-07-04T23:56:47Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1902.08819/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Gal Oren, Leonid Barenboim","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-02-23T17:45:17Z","title":"Fast Distributed Backup Placement in Sparse and Dense Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08819","kind":"arxiv","version":2},"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:f2f11fee042f4f90035d708dea193bc2dfad15aa78d15bebfb10777c8d96a63a","target":"record","created_at":"2026-07-04T23:56:47Z","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":"600ed592ebdd10429d43ca9a825c06985a6f50aa2015b8c92a0f22fc8c6c405a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-02-23T17:45:17Z","title_canon_sha256":"5afceb8bb8321d9c8ca9b25b2b7c6598462845a8fa41172f98187dc1b627146b"},"schema_version":"1.0","source":{"id":"1902.08819","kind":"arxiv","version":2}},"canonical_sha256":"8743d73ddd87c7c1a0e610c6d8e980606c8bbbea56c13f8cdf38f1a2f9b9b24b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8743d73ddd87c7c1a0e610c6d8e980606c8bbbea56c13f8cdf38f1a2f9b9b24b","first_computed_at":"2026-07-04T23:56:47.895403Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:56:47.895403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"toL/MO89s3RVDNgqaNyi+Gtp3CZlOLd536mRzCII1fP6PKJu2Pjrw+sqbICrC0G5miFmdVFCVV6nKkxYzBmbBg==","signature_status":"signed_v1","signed_at":"2026-07-04T23:56:47.896015Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.08819","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f2f11fee042f4f90035d708dea193bc2dfad15aa78d15bebfb10777c8d96a63a","sha256:34799adf43e7ada471920360861e50bbb7705facd27cc5b39d1123d53113552f"],"state_sha256":"b0ae9bc15ce14c1c55fd2669517305174bcfac7c677fa0b51c6680be892508e2"}