{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:RMTZZKD3V2Z4R5QJL77YAEHQIF","short_pith_number":"pith:RMTZZKD3","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"},"canonical_sha256":"8b279ca87baeb3c8f6095fff8010f04179f8646ba23270e5d27f0f99d5ce232d","source":{"kind":"arxiv","id":"1102.2785","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2785","created_at":"2026-05-18T03:52:15Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2785v5","created_at":"2026-05-18T03:52:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2785","created_at":"2026-05-18T03:52:15Z"},{"alias_kind":"pith_short_12","alias_value":"RMTZZKD3V2Z4","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"RMTZZKD3V2Z4R5QJ","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"RMTZZKD3","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:RMTZZKD3V2Z4R5QJL77YAEHQIF","target":"record","payload":{"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"},"canonical_sha256":"8b279ca87baeb3c8f6095fff8010f04179f8646ba23270e5d27f0f99d5ce232d","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"},"source_kind":"arxiv","source_id":"1102.2785","source_version":5,"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-18T03:52:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XbeHAQOLfqPu7wUUO1vUurh2LZHd94gQ411/2Q+oC6z0CmpGnOtoqHVLgSBSdTKozIAinxuZ8XOh7N9tr3LsDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:36:17.682291Z"},"content_sha256":"2ee3a37808a427412053aed6a82be8cb23b294146c2fbf7726886a8e1db195d6","schema_version":"1.0","event_id":"sha256:2ee3a37808a427412053aed6a82be8cb23b294146c2fbf7726886a8e1db195d6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:RMTZZKD3V2Z4R5QJL77YAEHQIF","target":"graph","payload":{"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"},"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-18T03:52:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4KoUtUUyKnG/aiTWJkTfobKPRQM5joiglRoJ2ilIC0XRWr6GDnJRJqX5FKxShjhpGd04sJ15Wi00/4YLVuCjCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:36:17.682694Z"},"content_sha256":"30acb6691ce97bdc4630b272bba641ec0c25acbe1044dd1fd4c3804dc02087f5","schema_version":"1.0","event_id":"sha256:30acb6691ce97bdc4630b272bba641ec0c25acbe1044dd1fd4c3804dc02087f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RMTZZKD3V2Z4R5QJL77YAEHQIF/bundle.json","state_url":"https://pith.science/pith/RMTZZKD3V2Z4R5QJL77YAEHQIF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RMTZZKD3V2Z4R5QJL77YAEHQIF/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-26T20:36:17Z","links":{"resolver":"https://pith.science/pith/RMTZZKD3V2Z4R5QJL77YAEHQIF","bundle":"https://pith.science/pith/RMTZZKD3V2Z4R5QJL77YAEHQIF/bundle.json","state":"https://pith.science/pith/RMTZZKD3V2Z4R5QJL77YAEHQIF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RMTZZKD3V2Z4R5QJL77YAEHQIF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:RMTZZKD3V2Z4R5QJL77YAEHQIF","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":"cdfb226d5594a606bf5360fd8b70399acb9287f1337a93e38eddabc492a176f0","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-02-14T14:46:09Z","title_canon_sha256":"c8984aea1de5bb8a7860b3a21491c185287979dc658be2a235c8119d603b7345"},"schema_version":"1.0","source":{"id":"1102.2785","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2785","created_at":"2026-05-18T03:52:15Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2785v5","created_at":"2026-05-18T03:52:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2785","created_at":"2026-05-18T03:52:15Z"},{"alias_kind":"pith_short_12","alias_value":"RMTZZKD3V2Z4","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"RMTZZKD3V2Z4R5QJ","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"RMTZZKD3","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:30acb6691ce97bdc4630b272bba641ec0c25acbe1044dd1fd4c3804dc02087f5","target":"graph","created_at":"2026-05-18T03:52:15Z","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":"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","authors_text":"Matias Korman","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-02-14T14:46:09Z","title":"Minimizing interference in ad-hoc networks with bounded communication radius"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2785","kind":"arxiv","version":5},"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:2ee3a37808a427412053aed6a82be8cb23b294146c2fbf7726886a8e1db195d6","target":"record","created_at":"2026-05-18T03:52:15Z","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":"cdfb226d5594a606bf5360fd8b70399acb9287f1337a93e38eddabc492a176f0","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-02-14T14:46:09Z","title_canon_sha256":"c8984aea1de5bb8a7860b3a21491c185287979dc658be2a235c8119d603b7345"},"schema_version":"1.0","source":{"id":"1102.2785","kind":"arxiv","version":5}},"canonical_sha256":"8b279ca87baeb3c8f6095fff8010f04179f8646ba23270e5d27f0f99d5ce232d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b279ca87baeb3c8f6095fff8010f04179f8646ba23270e5d27f0f99d5ce232d","first_computed_at":"2026-05-18T03:52:15.116199Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:15.116199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ElwNhpdhONUHmoEYY/UKBdf06on7gWTD/Kr5WCEHmGNZvjCFzMmqemBfT7R1okaufGpMvixXCZ4iJCl1BVUeCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:15.116925Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.2785","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ee3a37808a427412053aed6a82be8cb23b294146c2fbf7726886a8e1db195d6","sha256:30acb6691ce97bdc4630b272bba641ec0c25acbe1044dd1fd4c3804dc02087f5"],"state_sha256":"baf459c591559611941f2749dffafe1903eca031ae49b6983133eb965fe8315f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l30THdmQX073te9tTP4425q5yOJqn6kR/7ttdvQ2HkmBCqSFG4RPL/My5NqEJvFniM5tQkm6TrJ6Rz7in41ZBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T20:36:17.685921Z","bundle_sha256":"39ee8228fcc125666f7a3cbdf06909979878f6ebba3a5bb338d463694c8c508e"}}