{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:RMTZZKD3V2Z4R5QJL77YAEHQIF","short_pith_number":"pith:RMTZZKD3","schema_version":"1.0","canonical_sha256":"8b279ca87baeb3c8f6095fff8010f04179f8646ba23270e5d27f0f99d5ce232d","source":{"kind":"arxiv","id":"1102.2785","version":5},"attestation_state":"computed","paper":{"title":"Minimizing interference in ad-hoc networks with bounded communication radius","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.CG","authors_text":"Matias Korman","submitted_at":"2011-02-14T14:46:09Z","abstract_excerpt":"We consider a topology control problem in which we are given a set of $n$ sensors in the plane and we would like to assign a communication radius to each of them. The radii assignment must generate a strongly connected network and have low receiver-based interference (i.e., we minimize the largest in-degree of the network). We give an algorithm that generates a network with $O(\\log \\Delta)$ interference, where $\\Delta$ is the interference of a uniform-radius ad-hoc network. We then adapt the construction to the case in which no sensor can have a communication radius larger than $R_{\\min}$, the"},"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":"1102.2785","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-02-14T14:46:09Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"c8984aea1de5bb8a7860b3a21491c185287979dc658be2a235c8119d603b7345","abstract_canon_sha256":"cdfb226d5594a606bf5360fd8b70399acb9287f1337a93e38eddabc492a176f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:15.116925Z","signature_b64":"ElwNhpdhONUHmoEYY/UKBdf06on7gWTD/Kr5WCEHmGNZvjCFzMmqemBfT7R1okaufGpMvixXCZ4iJCl1BVUeCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b279ca87baeb3c8f6095fff8010f04179f8646ba23270e5d27f0f99d5ce232d","last_reissued_at":"2026-05-18T03:52:15.116199Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:15.116199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimizing interference in ad-hoc networks with bounded communication radius","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.CG","authors_text":"Matias Korman","submitted_at":"2011-02-14T14:46:09Z","abstract_excerpt":"We consider a topology control problem in which we are given a set of $n$ sensors in the plane and we would like to assign a communication radius to each of them. The radii assignment must generate a strongly connected network and have low receiver-based interference (i.e., we minimize the largest in-degree of the network). We give an algorithm that generates a network with $O(\\log \\Delta)$ interference, where $\\Delta$ is the interference of a uniform-radius ad-hoc network. We then adapt the construction to the case in which no sensor can have a communication radius larger than $R_{\\min}$, the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2785","kind":"arxiv","version":5},"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":"1102.2785","created_at":"2026-05-18T03:52:15.116327+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.2785v5","created_at":"2026-05-18T03:52:15.116327+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2785","created_at":"2026-05-18T03:52:15.116327+00:00"},{"alias_kind":"pith_short_12","alias_value":"RMTZZKD3V2Z4","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"RMTZZKD3V2Z4R5QJ","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"RMTZZKD3","created_at":"2026-05-18T12:26:41.206345+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/RMTZZKD3V2Z4R5QJL77YAEHQIF","json":"https://pith.science/pith/RMTZZKD3V2Z4R5QJL77YAEHQIF.json","graph_json":"https://pith.science/api/pith-number/RMTZZKD3V2Z4R5QJL77YAEHQIF/graph.json","events_json":"https://pith.science/api/pith-number/RMTZZKD3V2Z4R5QJL77YAEHQIF/events.json","paper":"https://pith.science/paper/RMTZZKD3"},"agent_actions":{"view_html":"https://pith.science/pith/RMTZZKD3V2Z4R5QJL77YAEHQIF","download_json":"https://pith.science/pith/RMTZZKD3V2Z4R5QJL77YAEHQIF.json","view_paper":"https://pith.science/paper/RMTZZKD3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.2785&json=true","fetch_graph":"https://pith.science/api/pith-number/RMTZZKD3V2Z4R5QJL77YAEHQIF/graph.json","fetch_events":"https://pith.science/api/pith-number/RMTZZKD3V2Z4R5QJL77YAEHQIF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RMTZZKD3V2Z4R5QJL77YAEHQIF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RMTZZKD3V2Z4R5QJL77YAEHQIF/action/storage_attestation","attest_author":"https://pith.science/pith/RMTZZKD3V2Z4R5QJL77YAEHQIF/action/author_attestation","sign_citation":"https://pith.science/pith/RMTZZKD3V2Z4R5QJL77YAEHQIF/action/citation_signature","submit_replication":"https://pith.science/pith/RMTZZKD3V2Z4R5QJL77YAEHQIF/action/replication_record"}},"created_at":"2026-05-18T03:52:15.116327+00:00","updated_at":"2026-05-18T03:52:15.116327+00:00"}