{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:BTG5LN5RTUGMYX7JIIPWZRHUUX","short_pith_number":"pith:BTG5LN5R","schema_version":"1.0","canonical_sha256":"0ccdd5b7b19d0ccc5fe9421f6cc4f4a5e90cffbd764e5fde85ace69b098bf509","source":{"kind":"arxiv","id":"1206.1113","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1206.1113","created_at":"2026-05-18T03:54:06.956245+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.1113v1","created_at":"2026-05-18T03:54:06.956245+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.1113","created_at":"2026-05-18T03:54:06.956245+00:00"},{"alias_kind":"pith_short_12","alias_value":"BTG5LN5RTUGM","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"BTG5LN5RTUGMYX7J","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"BTG5LN5R","created_at":"2026-05-18T12:27:01.376967+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BTG5LN5RTUGMYX7JIIPWZRHUUX","json":"https://pith.science/pith/BTG5LN5RTUGMYX7JIIPWZRHUUX.json","graph_json":"https://pith.science/api/pith-number/BTG5LN5RTUGMYX7JIIPWZRHUUX/graph.json","events_json":"https://pith.science/api/pith-number/BTG5LN5RTUGMYX7JIIPWZRHUUX/events.json","paper":"https://pith.science/paper/BTG5LN5R"},"agent_actions":{"view_html":"https://pith.science/pith/BTG5LN5RTUGMYX7JIIPWZRHUUX","download_json":"https://pith.science/pith/BTG5LN5RTUGMYX7JIIPWZRHUUX.json","view_paper":"https://pith.science/paper/BTG5LN5R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.1113&json=true","fetch_graph":"https://pith.science/api/pith-number/BTG5LN5RTUGMYX7JIIPWZRHUUX/graph.json","fetch_events":"https://pith.science/api/pith-number/BTG5LN5RTUGMYX7JIIPWZRHUUX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BTG5LN5RTUGMYX7JIIPWZRHUUX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BTG5LN5RTUGMYX7JIIPWZRHUUX/action/storage_attestation","attest_author":"https://pith.science/pith/BTG5LN5RTUGMYX7JIIPWZRHUUX/action/author_attestation","sign_citation":"https://pith.science/pith/BTG5LN5RTUGMYX7JIIPWZRHUUX/action/citation_signature","submit_replication":"https://pith.science/pith/BTG5LN5RTUGMYX7JIIPWZRHUUX/action/replication_record"}},"created_at":"2026-05-18T03:54:06.956245+00:00","updated_at":"2026-05-18T03:54:06.956245+00:00"}