{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:VSMCO7VSAFRPWLVBBERMP6CVOV","short_pith_number":"pith:VSMCO7VS","schema_version":"1.0","canonical_sha256":"ac98277eb20162fb2ea10922c7f855755f6b5d3294c7d7fd956974e7972815ab","source":{"kind":"arxiv","id":"1107.4222","version":1},"attestation_state":"computed","paper":{"title":"Interference minimization in physical model of wireless networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Hakob Aslanyan","submitted_at":"2011-07-21T10:07:27Z","abstract_excerpt":"Interference minimization problem in wireless sensor and ad-hoc networks is considered. That is to assign a transmission power to each node of a network such that the network is connected and at the same time the maximum of accumulated signal straight on network nodes is minimum. Previous works on interference minimization in wireless networks mainly consider the disk graph model of network. For disk graph model two approximation algorithms with $O(\\sqrt{n})$ and $O((opt\\ln{n})^{2})$ upper bounds of maximum interference are known, where $n$ is the number of nodes and $opt$ is the minimal inter"},"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":"1107.4222","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-21T10:07:27Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"df5980270be8b064b6b7bbad796380563b98aa7e067ddf3abf1c6977661e9b77","abstract_canon_sha256":"79ea8ffc59aea0adbdfa48ef2b966f85add76ed37e5ee32b18647cc63e6435e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:17:12.958196Z","signature_b64":"W+zr+T40/6MrgwSGEcjHBYAdeCUWzlqkIvZpSURW3EAV+CrheP/ZNC+4HSC8xlXEmLzWBo7pDOrMfh33Or60Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac98277eb20162fb2ea10922c7f855755f6b5d3294c7d7fd956974e7972815ab","last_reissued_at":"2026-05-18T04:17:12.957507Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:17:12.957507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Interference minimization in physical model of wireless networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Hakob Aslanyan","submitted_at":"2011-07-21T10:07:27Z","abstract_excerpt":"Interference minimization problem in wireless sensor and ad-hoc networks is considered. That is to assign a transmission power to each node of a network such that the network is connected and at the same time the maximum of accumulated signal straight on network nodes is minimum. Previous works on interference minimization in wireless networks mainly consider the disk graph model of network. For disk graph model two approximation algorithms with $O(\\sqrt{n})$ and $O((opt\\ln{n})^{2})$ upper bounds of maximum interference are known, where $n$ is the number of nodes and $opt$ is the minimal inter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.4222","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":"1107.4222","created_at":"2026-05-18T04:17:12.957622+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.4222v1","created_at":"2026-05-18T04:17:12.957622+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4222","created_at":"2026-05-18T04:17:12.957622+00:00"},{"alias_kind":"pith_short_12","alias_value":"VSMCO7VSAFRP","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"VSMCO7VSAFRPWLVB","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"VSMCO7VS","created_at":"2026-05-18T12:26:44.992195+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/VSMCO7VSAFRPWLVBBERMP6CVOV","json":"https://pith.science/pith/VSMCO7VSAFRPWLVBBERMP6CVOV.json","graph_json":"https://pith.science/api/pith-number/VSMCO7VSAFRPWLVBBERMP6CVOV/graph.json","events_json":"https://pith.science/api/pith-number/VSMCO7VSAFRPWLVBBERMP6CVOV/events.json","paper":"https://pith.science/paper/VSMCO7VS"},"agent_actions":{"view_html":"https://pith.science/pith/VSMCO7VSAFRPWLVBBERMP6CVOV","download_json":"https://pith.science/pith/VSMCO7VSAFRPWLVBBERMP6CVOV.json","view_paper":"https://pith.science/paper/VSMCO7VS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.4222&json=true","fetch_graph":"https://pith.science/api/pith-number/VSMCO7VSAFRPWLVBBERMP6CVOV/graph.json","fetch_events":"https://pith.science/api/pith-number/VSMCO7VSAFRPWLVBBERMP6CVOV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VSMCO7VSAFRPWLVBBERMP6CVOV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VSMCO7VSAFRPWLVBBERMP6CVOV/action/storage_attestation","attest_author":"https://pith.science/pith/VSMCO7VSAFRPWLVBBERMP6CVOV/action/author_attestation","sign_citation":"https://pith.science/pith/VSMCO7VSAFRPWLVBBERMP6CVOV/action/citation_signature","submit_replication":"https://pith.science/pith/VSMCO7VSAFRPWLVBBERMP6CVOV/action/replication_record"}},"created_at":"2026-05-18T04:17:12.957622+00:00","updated_at":"2026-05-18T04:17:12.957622+00:00"}