{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:VSMCO7VSAFRPWLVBBERMP6CVOV","short_pith_number":"pith:VSMCO7VS","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"},"canonical_sha256":"ac98277eb20162fb2ea10922c7f855755f6b5d3294c7d7fd956974e7972815ab","source":{"kind":"arxiv","id":"1107.4222","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.4222","created_at":"2026-05-18T04:17:12Z"},{"alias_kind":"arxiv_version","alias_value":"1107.4222v1","created_at":"2026-05-18T04:17:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4222","created_at":"2026-05-18T04:17:12Z"},{"alias_kind":"pith_short_12","alias_value":"VSMCO7VSAFRP","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"VSMCO7VSAFRPWLVB","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"VSMCO7VS","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:VSMCO7VSAFRPWLVBBERMP6CVOV","target":"record","payload":{"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"},"canonical_sha256":"ac98277eb20162fb2ea10922c7f855755f6b5d3294c7d7fd956974e7972815ab","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"},"source_kind":"arxiv","source_id":"1107.4222","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:17:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/q+HClkio7kkugptlXLjXbFKpisbANznZLqCN41HjPEKz+jU5RDabKJ5lzplOBxvtIZArELcctQu8bPJ+7+1CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T10:54:57.465222Z"},"content_sha256":"4d0aeae990d6b266bd8cf3b269f317bc4dc9b83ccf32d3e5b9f801b717069502","schema_version":"1.0","event_id":"sha256:4d0aeae990d6b266bd8cf3b269f317bc4dc9b83ccf32d3e5b9f801b717069502"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:VSMCO7VSAFRPWLVBBERMP6CVOV","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:17:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Hgmj3j19dECAHqMycx44v5pOVApArJL41WTcEMWVkExo3hEeehOrUgGezpnRVUlX29KGopf4qSHN/WmXHwPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T10:54:57.465591Z"},"content_sha256":"7b9120d8680ac42680cc11020fc48ee04684a5aad27b92f90f5795e970a7507a","schema_version":"1.0","event_id":"sha256:7b9120d8680ac42680cc11020fc48ee04684a5aad27b92f90f5795e970a7507a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VSMCO7VSAFRPWLVBBERMP6CVOV/bundle.json","state_url":"https://pith.science/pith/VSMCO7VSAFRPWLVBBERMP6CVOV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VSMCO7VSAFRPWLVBBERMP6CVOV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-30T10:54:57Z","links":{"resolver":"https://pith.science/pith/VSMCO7VSAFRPWLVBBERMP6CVOV","bundle":"https://pith.science/pith/VSMCO7VSAFRPWLVBBERMP6CVOV/bundle.json","state":"https://pith.science/pith/VSMCO7VSAFRPWLVBBERMP6CVOV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VSMCO7VSAFRPWLVBBERMP6CVOV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:VSMCO7VSAFRPWLVBBERMP6CVOV","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":"79ea8ffc59aea0adbdfa48ef2b966f85add76ed37e5ee32b18647cc63e6435e6","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-21T10:07:27Z","title_canon_sha256":"df5980270be8b064b6b7bbad796380563b98aa7e067ddf3abf1c6977661e9b77"},"schema_version":"1.0","source":{"id":"1107.4222","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.4222","created_at":"2026-05-18T04:17:12Z"},{"alias_kind":"arxiv_version","alias_value":"1107.4222v1","created_at":"2026-05-18T04:17:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4222","created_at":"2026-05-18T04:17:12Z"},{"alias_kind":"pith_short_12","alias_value":"VSMCO7VSAFRP","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"VSMCO7VSAFRPWLVB","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"VSMCO7VS","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:7b9120d8680ac42680cc11020fc48ee04684a5aad27b92f90f5795e970a7507a","target":"graph","created_at":"2026-05-18T04:17:12Z","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":"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","authors_text":"Hakob Aslanyan","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-21T10:07:27Z","title":"Interference minimization in physical model of wireless networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.4222","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:4d0aeae990d6b266bd8cf3b269f317bc4dc9b83ccf32d3e5b9f801b717069502","target":"record","created_at":"2026-05-18T04:17:12Z","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":"79ea8ffc59aea0adbdfa48ef2b966f85add76ed37e5ee32b18647cc63e6435e6","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-21T10:07:27Z","title_canon_sha256":"df5980270be8b064b6b7bbad796380563b98aa7e067ddf3abf1c6977661e9b77"},"schema_version":"1.0","source":{"id":"1107.4222","kind":"arxiv","version":1}},"canonical_sha256":"ac98277eb20162fb2ea10922c7f855755f6b5d3294c7d7fd956974e7972815ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac98277eb20162fb2ea10922c7f855755f6b5d3294c7d7fd956974e7972815ab","first_computed_at":"2026-05-18T04:17:12.957507Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:17:12.957507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W+zr+T40/6MrgwSGEcjHBYAdeCUWzlqkIvZpSURW3EAV+CrheP/ZNC+4HSC8xlXEmLzWBo7pDOrMfh33Or60Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:17:12.958196Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.4222","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d0aeae990d6b266bd8cf3b269f317bc4dc9b83ccf32d3e5b9f801b717069502","sha256:7b9120d8680ac42680cc11020fc48ee04684a5aad27b92f90f5795e970a7507a"],"state_sha256":"b15cf10c44765b6ff5740ef6248adfcc5271bc1b9ea312696c1d74d117401ca2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l4Ob3VHOUPYgEtse6w6po2vUvBQLxiZ+OsfUthwgH4ePwoYc3OmnmZ+oFBxbn5YYc2D2Qlite79TF1T6phCIDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T10:54:57.467552Z","bundle_sha256":"efcaaf0a660f8656c015034de9c88a1624c4d9a00d22d84af0986f35f9774c8b"}}