{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:6NCONJQCTZZOGBRAHHF2YASRBE","short_pith_number":"pith:6NCONJQC","canonical_record":{"source":{"id":"1111.6689","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-11-29T04:38:52Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"23aac1e8bad2d0d9e7c317f06a3a40514c3d19a9ab2603669a20446652f44d87","abstract_canon_sha256":"2ed76b46ff4d5a735898b655b712dc6e39ac7c39b8f6c3e01b1f79fa924f4aea"},"schema_version":"1.0"},"canonical_sha256":"f344e6a6029e72e3062039cbac0251093c67b493997adf7cfdbdc54d5e2069ae","source":{"kind":"arxiv","id":"1111.6689","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.6689","created_at":"2026-05-18T04:07:28Z"},{"alias_kind":"arxiv_version","alias_value":"1111.6689v1","created_at":"2026-05-18T04:07:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.6689","created_at":"2026-05-18T04:07:28Z"},{"alias_kind":"pith_short_12","alias_value":"6NCONJQCTZZO","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6NCONJQCTZZOGBRA","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6NCONJQC","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:6NCONJQCTZZOGBRAHHF2YASRBE","target":"record","payload":{"canonical_record":{"source":{"id":"1111.6689","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-11-29T04:38:52Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"23aac1e8bad2d0d9e7c317f06a3a40514c3d19a9ab2603669a20446652f44d87","abstract_canon_sha256":"2ed76b46ff4d5a735898b655b712dc6e39ac7c39b8f6c3e01b1f79fa924f4aea"},"schema_version":"1.0"},"canonical_sha256":"f344e6a6029e72e3062039cbac0251093c67b493997adf7cfdbdc54d5e2069ae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:28.737691Z","signature_b64":"agi/FFqm3+oNC8WBhhuCCDA5qIz3qiIxxsWBbNmMmDrprJHOLILPTNNU8nmhvmE2j29ZsGD0e63xtchnRThVDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f344e6a6029e72e3062039cbac0251093c67b493997adf7cfdbdc54d5e2069ae","last_reissued_at":"2026-05-18T04:07:28.737230Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:28.737230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.6689","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:07:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QG524QAOdklDdyw0I6JRUJicO6COuqxSm5Jb/KyuRtIVJ3IR39ZQW4P5K2xqpo7DvpILegHeV2qmIDX2h70RDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:08:01.189786Z"},"content_sha256":"da9325df9382ceb3667a168683ba231f8759126a5790fdb68b8ea55cf87bbb4d","schema_version":"1.0","event_id":"sha256:da9325df9382ceb3667a168683ba231f8759126a5790fdb68b8ea55cf87bbb4d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:6NCONJQCTZZOGBRAHHF2YASRBE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounding Interference in Wireless Ad Hoc Networks with Nodes in Random Position","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.CG","authors_text":"Alireza Haghnegahdar, Majid Khabbazian, Stephane Durocher","submitted_at":"2011-11-29T04:38:52Z","abstract_excerpt":"The interference at a wireless node s can be modelled by the number of wireless nodes whose transmission ranges cover s. Given a set of positions for wireless nodes, the interference minimization problem is to assign a transmission radius (equivalently, a power level) to each node such that the resulting communication graph is connected, while minimizing the maximum interference. We consider the model introduced by von Rickenback et al. (2005), in which each transmission range is represented by a ball and edges in the communication graph are symmetric. The problem is NP-complete in two dimensi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.6689","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:07:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hNVuT7S9IpapEZAFk/+ASxCJsDw/cNBQSOBjFWXc90HXPGWy1vTQJoevrZK1ASDRdtEcxUnofjw/feCs/OvfAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:08:01.190337Z"},"content_sha256":"f6efd1f60e9457e97fe3cae3e5bc2e3e75cac759aed418d17c2dabced7eeb7c0","schema_version":"1.0","event_id":"sha256:f6efd1f60e9457e97fe3cae3e5bc2e3e75cac759aed418d17c2dabced7eeb7c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6NCONJQCTZZOGBRAHHF2YASRBE/bundle.json","state_url":"https://pith.science/pith/6NCONJQCTZZOGBRAHHF2YASRBE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6NCONJQCTZZOGBRAHHF2YASRBE/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-05-31T16:08:01Z","links":{"resolver":"https://pith.science/pith/6NCONJQCTZZOGBRAHHF2YASRBE","bundle":"https://pith.science/pith/6NCONJQCTZZOGBRAHHF2YASRBE/bundle.json","state":"https://pith.science/pith/6NCONJQCTZZOGBRAHHF2YASRBE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6NCONJQCTZZOGBRAHHF2YASRBE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:6NCONJQCTZZOGBRAHHF2YASRBE","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":"2ed76b46ff4d5a735898b655b712dc6e39ac7c39b8f6c3e01b1f79fa924f4aea","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-11-29T04:38:52Z","title_canon_sha256":"23aac1e8bad2d0d9e7c317f06a3a40514c3d19a9ab2603669a20446652f44d87"},"schema_version":"1.0","source":{"id":"1111.6689","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.6689","created_at":"2026-05-18T04:07:28Z"},{"alias_kind":"arxiv_version","alias_value":"1111.6689v1","created_at":"2026-05-18T04:07:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.6689","created_at":"2026-05-18T04:07:28Z"},{"alias_kind":"pith_short_12","alias_value":"6NCONJQCTZZO","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6NCONJQCTZZOGBRA","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6NCONJQC","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:f6efd1f60e9457e97fe3cae3e5bc2e3e75cac759aed418d17c2dabced7eeb7c0","target":"graph","created_at":"2026-05-18T04:07:28Z","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":"The interference at a wireless node s can be modelled by the number of wireless nodes whose transmission ranges cover s. Given a set of positions for wireless nodes, the interference minimization problem is to assign a transmission radius (equivalently, a power level) to each node such that the resulting communication graph is connected, while minimizing the maximum interference. We consider the model introduced by von Rickenback et al. (2005), in which each transmission range is represented by a ball and edges in the communication graph are symmetric. The problem is NP-complete in two dimensi","authors_text":"Alireza Haghnegahdar, Majid Khabbazian, Stephane Durocher","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-11-29T04:38:52Z","title":"Bounding Interference in Wireless Ad Hoc Networks with Nodes in Random Position"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.6689","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:da9325df9382ceb3667a168683ba231f8759126a5790fdb68b8ea55cf87bbb4d","target":"record","created_at":"2026-05-18T04:07:28Z","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":"2ed76b46ff4d5a735898b655b712dc6e39ac7c39b8f6c3e01b1f79fa924f4aea","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-11-29T04:38:52Z","title_canon_sha256":"23aac1e8bad2d0d9e7c317f06a3a40514c3d19a9ab2603669a20446652f44d87"},"schema_version":"1.0","source":{"id":"1111.6689","kind":"arxiv","version":1}},"canonical_sha256":"f344e6a6029e72e3062039cbac0251093c67b493997adf7cfdbdc54d5e2069ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f344e6a6029e72e3062039cbac0251093c67b493997adf7cfdbdc54d5e2069ae","first_computed_at":"2026-05-18T04:07:28.737230Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:07:28.737230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"agi/FFqm3+oNC8WBhhuCCDA5qIz3qiIxxsWBbNmMmDrprJHOLILPTNNU8nmhvmE2j29ZsGD0e63xtchnRThVDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:07:28.737691Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.6689","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da9325df9382ceb3667a168683ba231f8759126a5790fdb68b8ea55cf87bbb4d","sha256:f6efd1f60e9457e97fe3cae3e5bc2e3e75cac759aed418d17c2dabced7eeb7c0"],"state_sha256":"f135eab65f5db3595f8b6dc312abcbd7daf582142ebd71a12778efb60d589101"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4RDPUiyKt7evrNJQIYpeEcgss2U1buiIHZiH8f+nfIxHpc9jw5G6mDmvRz1b7wVeNQKB7C4TvBJ6wjRAiNYDCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T16:08:01.193347Z","bundle_sha256":"fd2a81bfc76b2c8e7700d0d42e181aca9572391224881809a5d6fa66a5137a47"}}