{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:BTG5LN5RTUGMYX7JIIPWZRHUUX","short_pith_number":"pith:BTG5LN5R","canonical_record":{"source":{"id":"1206.1113","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-06-06T03:08:41Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"13c5d6866f3abd6382167fc272ea15ad8faf1a138580f39ddb7b79104669b2e3","abstract_canon_sha256":"d14458222460d76ec385abeca41396ede2104d23621b0ac0e23c9b5010dee8bf"},"schema_version":"1.0"},"canonical_sha256":"0ccdd5b7b19d0ccc5fe9421f6cc4f4a5e90cffbd764e5fde85ace69b098bf509","source":{"kind":"arxiv","id":"1206.1113","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.1113","created_at":"2026-05-18T03:54:06Z"},{"alias_kind":"arxiv_version","alias_value":"1206.1113v1","created_at":"2026-05-18T03:54:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.1113","created_at":"2026-05-18T03:54:06Z"},{"alias_kind":"pith_short_12","alias_value":"BTG5LN5RTUGM","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BTG5LN5RTUGMYX7J","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BTG5LN5R","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:BTG5LN5RTUGMYX7JIIPWZRHUUX","target":"record","payload":{"canonical_record":{"source":{"id":"1206.1113","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-06-06T03:08:41Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"13c5d6866f3abd6382167fc272ea15ad8faf1a138580f39ddb7b79104669b2e3","abstract_canon_sha256":"d14458222460d76ec385abeca41396ede2104d23621b0ac0e23c9b5010dee8bf"},"schema_version":"1.0"},"canonical_sha256":"0ccdd5b7b19d0ccc5fe9421f6cc4f4a5e90cffbd764e5fde85ace69b098bf509","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:06.956728Z","signature_b64":"jtUM1yV6mEQPw0Jg7Gd8O9SRChCpYT49MYTFHTJlrEuC0SD0ClzMU7df+8BaMMDMQeR/ZTAz+u+/Wm57/RoyAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ccdd5b7b19d0ccc5fe9421f6cc4f4a5e90cffbd764e5fde85ace69b098bf509","last_reissued_at":"2026-05-18T03:54:06.956157Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:06.956157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.1113","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-18T03:54:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xaCaUumD1yqWrAFPREWlovYtwW2hjQouezSLOkwED3CYKVybWNPdnANe1WpBgnMlEbPJEN0SHNf3s3KD7OS1DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:18:53.935599Z"},"content_sha256":"f450e1561abecd6264c41eb3396b2a9739453c10a84d820e1bd2d699997dfe57","schema_version":"1.0","event_id":"sha256:f450e1561abecd6264c41eb3396b2a9739453c10a84d820e1bd2d699997dfe57"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:BTG5LN5RTUGMYX7JIIPWZRHUUX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Gopal Pandurangan, Guanhong Pei, Maleq Khan, V.S. Anil Kumar","submitted_at":"2012-06-06T03:08:41Z","abstract_excerpt":"A fundamental problem in wireless networks is the \\emph{minimum spanning tree} (MST) problem: given a set $V$ of wireless nodes, compute a spanning tree $T$, so that the total cost of $T$ is minimized. In recent years, there has been a lot of interest in the physical interference model based on SINR constraints. Distributed algorithms are especially challenging in the SINR model, because of the non-locality of the model.\n  In this paper, we develop a fast distributed approximation algorithm for MST construction in an SINR based distributed computing model. For an $n$-node network, our algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.1113","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-18T03:54:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jaUqr5zcn5Xo3i0gIh1QgEKOraao4mojCazFT542CNU+WuoBDVvrgJhFCZz5wVJF21tsSEp1GviWEkqeGGVQAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:18:53.936275Z"},"content_sha256":"d61f171c41c32cb7a59537c1b51f7a4984c66f86345b0410e8ddde365ab003a0","schema_version":"1.0","event_id":"sha256:d61f171c41c32cb7a59537c1b51f7a4984c66f86345b0410e8ddde365ab003a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BTG5LN5RTUGMYX7JIIPWZRHUUX/bundle.json","state_url":"https://pith.science/pith/BTG5LN5RTUGMYX7JIIPWZRHUUX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BTG5LN5RTUGMYX7JIIPWZRHUUX/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-25T22:18:53Z","links":{"resolver":"https://pith.science/pith/BTG5LN5RTUGMYX7JIIPWZRHUUX","bundle":"https://pith.science/pith/BTG5LN5RTUGMYX7JIIPWZRHUUX/bundle.json","state":"https://pith.science/pith/BTG5LN5RTUGMYX7JIIPWZRHUUX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BTG5LN5RTUGMYX7JIIPWZRHUUX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:BTG5LN5RTUGMYX7JIIPWZRHUUX","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":"d14458222460d76ec385abeca41396ede2104d23621b0ac0e23c9b5010dee8bf","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-06-06T03:08:41Z","title_canon_sha256":"13c5d6866f3abd6382167fc272ea15ad8faf1a138580f39ddb7b79104669b2e3"},"schema_version":"1.0","source":{"id":"1206.1113","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.1113","created_at":"2026-05-18T03:54:06Z"},{"alias_kind":"arxiv_version","alias_value":"1206.1113v1","created_at":"2026-05-18T03:54:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.1113","created_at":"2026-05-18T03:54:06Z"},{"alias_kind":"pith_short_12","alias_value":"BTG5LN5RTUGM","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BTG5LN5RTUGMYX7J","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BTG5LN5R","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:d61f171c41c32cb7a59537c1b51f7a4984c66f86345b0410e8ddde365ab003a0","target":"graph","created_at":"2026-05-18T03:54:06Z","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":"A fundamental problem in wireless networks is the \\emph{minimum spanning tree} (MST) problem: given a set $V$ of wireless nodes, compute a spanning tree $T$, so that the total cost of $T$ is minimized. In recent years, there has been a lot of interest in the physical interference model based on SINR constraints. Distributed algorithms are especially challenging in the SINR model, because of the non-locality of the model.\n  In this paper, we develop a fast distributed approximation algorithm for MST construction in an SINR based distributed computing model. For an $n$-node network, our algorith","authors_text":"Gopal Pandurangan, Guanhong Pei, Maleq Khan, V.S. Anil Kumar","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-06-06T03:08:41Z","title":"A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.1113","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:f450e1561abecd6264c41eb3396b2a9739453c10a84d820e1bd2d699997dfe57","target":"record","created_at":"2026-05-18T03:54:06Z","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":"d14458222460d76ec385abeca41396ede2104d23621b0ac0e23c9b5010dee8bf","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-06-06T03:08:41Z","title_canon_sha256":"13c5d6866f3abd6382167fc272ea15ad8faf1a138580f39ddb7b79104669b2e3"},"schema_version":"1.0","source":{"id":"1206.1113","kind":"arxiv","version":1}},"canonical_sha256":"0ccdd5b7b19d0ccc5fe9421f6cc4f4a5e90cffbd764e5fde85ace69b098bf509","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ccdd5b7b19d0ccc5fe9421f6cc4f4a5e90cffbd764e5fde85ace69b098bf509","first_computed_at":"2026-05-18T03:54:06.956157Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:54:06.956157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jtUM1yV6mEQPw0Jg7Gd8O9SRChCpYT49MYTFHTJlrEuC0SD0ClzMU7df+8BaMMDMQeR/ZTAz+u+/Wm57/RoyAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:54:06.956728Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.1113","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f450e1561abecd6264c41eb3396b2a9739453c10a84d820e1bd2d699997dfe57","sha256:d61f171c41c32cb7a59537c1b51f7a4984c66f86345b0410e8ddde365ab003a0"],"state_sha256":"143c14f3360cda8c25238d833d7a19d8e5f1b40be048ef5fe3b0ff712925a288"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6qj7Z3GsVIiQSSOj2cHnbIjjLgE2bKCIH/nKZcGo4WX91uAogsdUudQImH7zxj2Cx8SgH9aChCzmkBEIRVmHDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:18:53.939689Z","bundle_sha256":"ede7e372ca7d95cc825a7bfaafb57a74cf8d55622530e9ac74d16af32c96aedd"}}