{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SFDPBBLKPJZM4S4GAIHBCGCCU4","short_pith_number":"pith:SFDPBBLK","schema_version":"1.0","canonical_sha256":"9146f0856a7a72ce4b86020e111842a7091d06280aa7eb03742786edc0eb11f7","source":{"kind":"arxiv","id":"1511.02525","version":1},"attestation_state":"computed","paper":{"title":"Improved Approximation Algorithms for Relay Placement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alon Efrat, Joseph S. B. Mitchell, Jukka Suomela, S\\'andor P. Fekete, Valentin Polishchuk","submitted_at":"2015-11-08T20:58:12Z","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"},"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":"1511.02525","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-08T20:58:12Z","cross_cats_sorted":[],"title_canon_sha256":"d4e074d63a3820812aa5455080ceac1a4f8c74bd15fd8a40979f5590abd29347","abstract_canon_sha256":"045f2bce15b573133d30eea2ba0a8dcb991db0c4674d64db31c9538e679b86de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:30.023293Z","signature_b64":"6dBFMQFm9f6N5Rc2R8lx3KeKgRtvvPGEVCLSk9Rh386OcO4h3KAwlQ0YryisXmJDT8AxxSkU0aGWAIrpZbNfCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9146f0856a7a72ce4b86020e111842a7091d06280aa7eb03742786edc0eb11f7","last_reissued_at":"2026-05-18T01:27:30.022783Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:30.022783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Approximation Algorithms for Relay Placement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alon Efrat, Joseph S. B. Mitchell, Jukka Suomela, S\\'andor P. Fekete, Valentin Polishchuk","submitted_at":"2015-11-08T20:58:12Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02525","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.02525","created_at":"2026-05-18T01:27:30.022865+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.02525v1","created_at":"2026-05-18T01:27:30.022865+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02525","created_at":"2026-05-18T01:27:30.022865+00:00"},{"alias_kind":"pith_short_12","alias_value":"SFDPBBLKPJZM","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"SFDPBBLKPJZM4S4G","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"SFDPBBLK","created_at":"2026-05-18T12:29:39.896362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SFDPBBLKPJZM4S4GAIHBCGCCU4","json":"https://pith.science/pith/SFDPBBLKPJZM4S4GAIHBCGCCU4.json","graph_json":"https://pith.science/api/pith-number/SFDPBBLKPJZM4S4GAIHBCGCCU4/graph.json","events_json":"https://pith.science/api/pith-number/SFDPBBLKPJZM4S4GAIHBCGCCU4/events.json","paper":"https://pith.science/paper/SFDPBBLK"},"agent_actions":{"view_html":"https://pith.science/pith/SFDPBBLKPJZM4S4GAIHBCGCCU4","download_json":"https://pith.science/pith/SFDPBBLKPJZM4S4GAIHBCGCCU4.json","view_paper":"https://pith.science/paper/SFDPBBLK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.02525&json=true","fetch_graph":"https://pith.science/api/pith-number/SFDPBBLKPJZM4S4GAIHBCGCCU4/graph.json","fetch_events":"https://pith.science/api/pith-number/SFDPBBLKPJZM4S4GAIHBCGCCU4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SFDPBBLKPJZM4S4GAIHBCGCCU4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SFDPBBLKPJZM4S4GAIHBCGCCU4/action/storage_attestation","attest_author":"https://pith.science/pith/SFDPBBLKPJZM4S4GAIHBCGCCU4/action/author_attestation","sign_citation":"https://pith.science/pith/SFDPBBLKPJZM4S4GAIHBCGCCU4/action/citation_signature","submit_replication":"https://pith.science/pith/SFDPBBLKPJZM4S4GAIHBCGCCU4/action/replication_record"}},"created_at":"2026-05-18T01:27:30.022865+00:00","updated_at":"2026-05-18T01:27:30.022865+00:00"}