{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ZT7OM7EOQ7JQYVZAFR72KW5AK6","short_pith_number":"pith:ZT7OM7EO","schema_version":"1.0","canonical_sha256":"ccfee67c8e87d30c57202c7fa55ba0579da6ad39bdf374be61d88a275d9976cd","source":{"kind":"arxiv","id":"1406.7753","version":1},"attestation_state":"computed","paper":{"title":"Interference Minimization in Asymmetric Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Dustin Eversmann, Kevin Buchin, Michael Hoffmann, Wolfgang Mulzer, Yves Brise","submitted_at":"2014-06-30T14:24:10Z","abstract_excerpt":"A fundamental problem in wireless sensor networks is to connect a given set of sensors while minimizing the \\emph{receiver interference}. This is modeled as follows: each sensor node corresponds to a point in $\\mathbb{R}^d$ and each \\emph{transmission range} corresponds to a ball. The receiver interference of a sensor node is defined as the number of transmission ranges it lies in. Our goal is to choose transmission radii that minimize the maximum interference while maintaining a strongly connected asymmetric communication graph.\n  For the two-dimensional case, we show that it is NP-complete t"},"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":"1406.7753","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-06-30T14:24:10Z","cross_cats_sorted":[],"title_canon_sha256":"51163338ca9f6f7a166c96871476415727e1669c4e17ddfc43438466ae0e6e00","abstract_canon_sha256":"7562881aff58747c7f75e3f04c104ab0f481e52cc9dce78d550ba786f1e64ba6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:44.271054Z","signature_b64":"KlxChSBoBmx01an2YzoKe222L8xyd5YP0kV1nZH59DZOjINyN+LeAg7fNjg8XafJ8GdSg0CFyzY7tOYv3hpxAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccfee67c8e87d30c57202c7fa55ba0579da6ad39bdf374be61d88a275d9976cd","last_reissued_at":"2026-05-18T02:48:44.270276Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:44.270276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Interference Minimization in Asymmetric Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Dustin Eversmann, Kevin Buchin, Michael Hoffmann, Wolfgang Mulzer, Yves Brise","submitted_at":"2014-06-30T14:24:10Z","abstract_excerpt":"A fundamental problem in wireless sensor networks is to connect a given set of sensors while minimizing the \\emph{receiver interference}. This is modeled as follows: each sensor node corresponds to a point in $\\mathbb{R}^d$ and each \\emph{transmission range} corresponds to a ball. The receiver interference of a sensor node is defined as the number of transmission ranges it lies in. Our goal is to choose transmission radii that minimize the maximum interference while maintaining a strongly connected asymmetric communication graph.\n  For the two-dimensional case, we show that it is NP-complete t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.7753","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":"1406.7753","created_at":"2026-05-18T02:48:44.270406+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.7753v1","created_at":"2026-05-18T02:48:44.270406+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7753","created_at":"2026-05-18T02:48:44.270406+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZT7OM7EOQ7JQ","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZT7OM7EOQ7JQYVZA","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZT7OM7EO","created_at":"2026-05-18T12:28:59.999130+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/ZT7OM7EOQ7JQYVZAFR72KW5AK6","json":"https://pith.science/pith/ZT7OM7EOQ7JQYVZAFR72KW5AK6.json","graph_json":"https://pith.science/api/pith-number/ZT7OM7EOQ7JQYVZAFR72KW5AK6/graph.json","events_json":"https://pith.science/api/pith-number/ZT7OM7EOQ7JQYVZAFR72KW5AK6/events.json","paper":"https://pith.science/paper/ZT7OM7EO"},"agent_actions":{"view_html":"https://pith.science/pith/ZT7OM7EOQ7JQYVZAFR72KW5AK6","download_json":"https://pith.science/pith/ZT7OM7EOQ7JQYVZAFR72KW5AK6.json","view_paper":"https://pith.science/paper/ZT7OM7EO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.7753&json=true","fetch_graph":"https://pith.science/api/pith-number/ZT7OM7EOQ7JQYVZAFR72KW5AK6/graph.json","fetch_events":"https://pith.science/api/pith-number/ZT7OM7EOQ7JQYVZAFR72KW5AK6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZT7OM7EOQ7JQYVZAFR72KW5AK6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZT7OM7EOQ7JQYVZAFR72KW5AK6/action/storage_attestation","attest_author":"https://pith.science/pith/ZT7OM7EOQ7JQYVZAFR72KW5AK6/action/author_attestation","sign_citation":"https://pith.science/pith/ZT7OM7EOQ7JQYVZAFR72KW5AK6/action/citation_signature","submit_replication":"https://pith.science/pith/ZT7OM7EOQ7JQYVZAFR72KW5AK6/action/replication_record"}},"created_at":"2026-05-18T02:48:44.270406+00:00","updated_at":"2026-05-18T02:48:44.270406+00:00"}