{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:SFDPBBLKPJZM4S4GAIHBCGCCU4","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":"045f2bce15b573133d30eea2ba0a8dcb991db0c4674d64db31c9538e679b86de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-08T20:58:12Z","title_canon_sha256":"d4e074d63a3820812aa5455080ceac1a4f8c74bd15fd8a40979f5590abd29347"},"schema_version":"1.0","source":{"id":"1511.02525","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02525","created_at":"2026-05-18T01:27:30Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02525v1","created_at":"2026-05-18T01:27:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02525","created_at":"2026-05-18T01:27:30Z"},{"alias_kind":"pith_short_12","alias_value":"SFDPBBLKPJZM","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"SFDPBBLKPJZM4S4G","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"SFDPBBLK","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:23b748742fba868413e1b7d80f1ca8944ebf5a89939578860c0f04b97e76c56f","target":"graph","created_at":"2026-05-18T01:27:30Z","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":"In the relay placement problem the input is a set of sensors and a number $r \\ge 1$, the communication range of a relay. In the one-tier version of the problem the objective is to place a minimum number of relays so that between every pair of sensors there is a path through sensors and/or relays such that the consecutive vertices of the path are within distance $r$ if both vertices are relays and within distance 1 otherwise. The two-tier version adds the restrictions that the path must go through relays, and not through sensors. We present a 3.11-approximation algorithm for the one-tier versio","authors_text":"Alon Efrat, Joseph S. B. Mitchell, Jukka Suomela, S\\'andor P. Fekete, Valentin Polishchuk","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-08T20:58:12Z","title":"Improved Approximation Algorithms for Relay Placement"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02525","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:4e761bfde9d2ad782da6663f175e535e78cbf7738549c904180d92d18490be1a","target":"record","created_at":"2026-05-18T01:27:30Z","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":"045f2bce15b573133d30eea2ba0a8dcb991db0c4674d64db31c9538e679b86de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-08T20:58:12Z","title_canon_sha256":"d4e074d63a3820812aa5455080ceac1a4f8c74bd15fd8a40979f5590abd29347"},"schema_version":"1.0","source":{"id":"1511.02525","kind":"arxiv","version":1}},"canonical_sha256":"9146f0856a7a72ce4b86020e111842a7091d06280aa7eb03742786edc0eb11f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9146f0856a7a72ce4b86020e111842a7091d06280aa7eb03742786edc0eb11f7","first_computed_at":"2026-05-18T01:27:30.022783Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:30.022783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6dBFMQFm9f6N5Rc2R8lx3KeKgRtvvPGEVCLSk9Rh386OcO4h3KAwlQ0YryisXmJDT8AxxSkU0aGWAIrpZbNfCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:30.023293Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.02525","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e761bfde9d2ad782da6663f175e535e78cbf7738549c904180d92d18490be1a","sha256:23b748742fba868413e1b7d80f1ca8944ebf5a89939578860c0f04b97e76c56f"],"state_sha256":"ab754ba85f4421cc4e907cf294ad7fa3da0ae3ff0eb4e72cd94e40298dab9870"}