{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:EMVCDETD6CNO2IHCWHWKE5HYXV","short_pith_number":"pith:EMVCDETD","canonical_record":{"source":{"id":"1207.1836","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-07-08T02:51:21Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"450e6a3427d430e0a5e474c4b553dba2e0b05e04637539bfbf14699e62ade609","abstract_canon_sha256":"c61b8dacd066775cb54589b329875369e16cc69e2b7292c01546c0075d60a596"},"schema_version":"1.0"},"canonical_sha256":"232a219263f09aed20e2b1eca274f8bd41c5ca70ddf74861bdb9e15b9869a425","source":{"kind":"arxiv","id":"1207.1836","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1836","created_at":"2026-05-18T03:43:04Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1836v2","created_at":"2026-05-18T03:43:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1836","created_at":"2026-05-18T03:43:04Z"},{"alias_kind":"pith_short_12","alias_value":"EMVCDETD6CNO","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EMVCDETD6CNO2IHC","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EMVCDETD","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:EMVCDETD6CNO2IHCWHWKE5HYXV","target":"record","payload":{"canonical_record":{"source":{"id":"1207.1836","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-07-08T02:51:21Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"450e6a3427d430e0a5e474c4b553dba2e0b05e04637539bfbf14699e62ade609","abstract_canon_sha256":"c61b8dacd066775cb54589b329875369e16cc69e2b7292c01546c0075d60a596"},"schema_version":"1.0"},"canonical_sha256":"232a219263f09aed20e2b1eca274f8bd41c5ca70ddf74861bdb9e15b9869a425","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:04.941491Z","signature_b64":"B3emvSgBRFz+FeR2KKa3kheniDcDmjYnVrJfFnCtPDXcvxeWZnGIMKUva/G0Dnkncy0a4Y5O75nLjEv8qCSMAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"232a219263f09aed20e2b1eca274f8bd41c5ca70ddf74861bdb9e15b9869a425","last_reissued_at":"2026-05-18T03:43:04.940821Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:04.940821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.1836","source_version":2,"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:43:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UFFWygEQjSUhvt97YVM1UZX/Nw5Iw0+FxLEg5AiMFjUzuGYWIRJcFRF8QveMBqigQRWe/A7rdPbIwi+K+g32Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T23:25:10.791522Z"},"content_sha256":"20c637675ca5268b8000afafced503f79245ae32c9c3f4a9a0cb71b9863b3af9","schema_version":"1.0","event_id":"sha256:20c637675ca5268b8000afafced503f79245ae32c9c3f4a9a0cb71b9863b3af9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:EMVCDETD6CNO2IHCWHWKE5HYXV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Tight Bounds for Local Broadcasting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.NI","authors_text":"Magnus M. Halldorsson, Pradipta Mitra","submitted_at":"2012-07-08T02:51:21Z","abstract_excerpt":"We consider the local broadcasting problem in the SINR model, which is a basic primitive for gathering initial information among $n$ wireless nodes. Assuming that nodes can measure received power, we achieve an essentially optimal constant approximate algorithm (with a $\\log^2 n$ additive term). This improves upon the previous best $O(\\log n)$-approximate algorithm. Without power measurement, our algorithm achieves $O(\\log n)$-approximation, matching the previous best result, but with a simpler approach that works under harsher conditions, such as arbitrary node failures. We give complementary"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1836","kind":"arxiv","version":2},"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:43:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rJ9ZSayjEqICdEMz1gMDbVGsT+ycPfQV2FAfQfdBGWweuwEhMTuJ+thf0A7XB9+XGjr3sWerDHSQ6hp++FG6CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T23:25:10.791892Z"},"content_sha256":"f3838e531a55ad3b9aa5a51700454b76a777122148f7bb566062870aabaf0c9d","schema_version":"1.0","event_id":"sha256:f3838e531a55ad3b9aa5a51700454b76a777122148f7bb566062870aabaf0c9d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EMVCDETD6CNO2IHCWHWKE5HYXV/bundle.json","state_url":"https://pith.science/pith/EMVCDETD6CNO2IHCWHWKE5HYXV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EMVCDETD6CNO2IHCWHWKE5HYXV/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-05T23:25:10Z","links":{"resolver":"https://pith.science/pith/EMVCDETD6CNO2IHCWHWKE5HYXV","bundle":"https://pith.science/pith/EMVCDETD6CNO2IHCWHWKE5HYXV/bundle.json","state":"https://pith.science/pith/EMVCDETD6CNO2IHCWHWKE5HYXV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EMVCDETD6CNO2IHCWHWKE5HYXV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:EMVCDETD6CNO2IHCWHWKE5HYXV","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":"c61b8dacd066775cb54589b329875369e16cc69e2b7292c01546c0075d60a596","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-07-08T02:51:21Z","title_canon_sha256":"450e6a3427d430e0a5e474c4b553dba2e0b05e04637539bfbf14699e62ade609"},"schema_version":"1.0","source":{"id":"1207.1836","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1836","created_at":"2026-05-18T03:43:04Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1836v2","created_at":"2026-05-18T03:43:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1836","created_at":"2026-05-18T03:43:04Z"},{"alias_kind":"pith_short_12","alias_value":"EMVCDETD6CNO","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EMVCDETD6CNO2IHC","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EMVCDETD","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:f3838e531a55ad3b9aa5a51700454b76a777122148f7bb566062870aabaf0c9d","target":"graph","created_at":"2026-05-18T03:43:04Z","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 the local broadcasting problem in the SINR model, which is a basic primitive for gathering initial information among $n$ wireless nodes. Assuming that nodes can measure received power, we achieve an essentially optimal constant approximate algorithm (with a $\\log^2 n$ additive term). This improves upon the previous best $O(\\log n)$-approximate algorithm. Without power measurement, our algorithm achieves $O(\\log n)$-approximation, matching the previous best result, but with a simpler approach that works under harsher conditions, such as arbitrary node failures. We give complementary","authors_text":"Magnus M. Halldorsson, Pradipta Mitra","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-07-08T02:51:21Z","title":"Towards Tight Bounds for Local Broadcasting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1836","kind":"arxiv","version":2},"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:20c637675ca5268b8000afafced503f79245ae32c9c3f4a9a0cb71b9863b3af9","target":"record","created_at":"2026-05-18T03:43:04Z","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":"c61b8dacd066775cb54589b329875369e16cc69e2b7292c01546c0075d60a596","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-07-08T02:51:21Z","title_canon_sha256":"450e6a3427d430e0a5e474c4b553dba2e0b05e04637539bfbf14699e62ade609"},"schema_version":"1.0","source":{"id":"1207.1836","kind":"arxiv","version":2}},"canonical_sha256":"232a219263f09aed20e2b1eca274f8bd41c5ca70ddf74861bdb9e15b9869a425","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"232a219263f09aed20e2b1eca274f8bd41c5ca70ddf74861bdb9e15b9869a425","first_computed_at":"2026-05-18T03:43:04.940821Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:43:04.940821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B3emvSgBRFz+FeR2KKa3kheniDcDmjYnVrJfFnCtPDXcvxeWZnGIMKUva/G0Dnkncy0a4Y5O75nLjEv8qCSMAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:43:04.941491Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.1836","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:20c637675ca5268b8000afafced503f79245ae32c9c3f4a9a0cb71b9863b3af9","sha256:f3838e531a55ad3b9aa5a51700454b76a777122148f7bb566062870aabaf0c9d"],"state_sha256":"51dbdceb8ca21886a9894b77e87e7140dc0afda415505ac126924cfe8cf2daa6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EmtEkMgayeXZoHFkeCiO4AhYJDm0/d0FmaDfGC9QTGiJSpcZODeLYDLkAQcBObizwXN067c++5uVnMb9mzNlCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T23:25:10.795181Z","bundle_sha256":"ed1a3fa79fa89c920df92e03bd0c5a140d21052e36559a33e2847ccd0f470ee0"}}