{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:MTJ4UMBIVLPPJ4EL3CHB7YPKDY","short_pith_number":"pith:MTJ4UMBI","schema_version":"1.0","canonical_sha256":"64d3ca3028aadef4f08bd88e1fe1ea1e25c9476b4bf8edde4c257e1f1561606d","source":{"kind":"arxiv","id":"1104.5200","version":2},"attestation_state":"computed","paper":{"title":"Nearly Optimal Bounds for Distributed Wireless Scheduling in the SINR Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DS","authors_text":"Magnus M. Halldorsson, Pradipta Mitra","submitted_at":"2011-04-27T17:48:07Z","abstract_excerpt":"We study the wireless scheduling problem in the SINR model. More specifically, given a set of $n$ links, each a sender-receiver pair, we wish to partition (or \\emph{schedule}) the links into the minimum number of slots, each satisfying interference constraints allowing simultaneous transmission. In the basic problem, all senders transmit with the same uniform power.\n  We give a distributed $O(\\log n)$-approximation algorithm for the scheduling problem, matching the best ratio known for centralized algorithms. It holds in arbitrary metric space and for every length-monotone and sublinear power "},"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":"1104.5200","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-27T17:48:07Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"7cfbe1b4065786c3b781547187549670ce6e32689ce3057adb3eba70ea333519","abstract_canon_sha256":"431dd9af8fafa011347ce265d8715677be204961d9c70fe43fef68810609082b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:49.769196Z","signature_b64":"rdKe8UKwvmZSiUQhunV/B/pOXzejQF1p2OC6nQ+II75iQs8NZg+RQ1xXKPeL+Z/nLRK+loOTOnu5hP6Jh5cCDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64d3ca3028aadef4f08bd88e1fe1ea1e25c9476b4bf8edde4c257e1f1561606d","last_reissued_at":"2026-05-18T02:52:49.768751Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:49.768751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nearly Optimal Bounds for Distributed Wireless Scheduling in the SINR Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DS","authors_text":"Magnus M. Halldorsson, Pradipta Mitra","submitted_at":"2011-04-27T17:48:07Z","abstract_excerpt":"We study the wireless scheduling problem in the SINR model. More specifically, given a set of $n$ links, each a sender-receiver pair, we wish to partition (or \\emph{schedule}) the links into the minimum number of slots, each satisfying interference constraints allowing simultaneous transmission. In the basic problem, all senders transmit with the same uniform power.\n  We give a distributed $O(\\log n)$-approximation algorithm for the scheduling problem, matching the best ratio known for centralized algorithms. It holds in arbitrary metric space and for every length-monotone and sublinear power "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.5200","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1104.5200","created_at":"2026-05-18T02:52:49.768818+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.5200v2","created_at":"2026-05-18T02:52:49.768818+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.5200","created_at":"2026-05-18T02:52:49.768818+00:00"},{"alias_kind":"pith_short_12","alias_value":"MTJ4UMBIVLPP","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"MTJ4UMBIVLPPJ4EL","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"MTJ4UMBI","created_at":"2026-05-18T12:26:34.985390+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/MTJ4UMBIVLPPJ4EL3CHB7YPKDY","json":"https://pith.science/pith/MTJ4UMBIVLPPJ4EL3CHB7YPKDY.json","graph_json":"https://pith.science/api/pith-number/MTJ4UMBIVLPPJ4EL3CHB7YPKDY/graph.json","events_json":"https://pith.science/api/pith-number/MTJ4UMBIVLPPJ4EL3CHB7YPKDY/events.json","paper":"https://pith.science/paper/MTJ4UMBI"},"agent_actions":{"view_html":"https://pith.science/pith/MTJ4UMBIVLPPJ4EL3CHB7YPKDY","download_json":"https://pith.science/pith/MTJ4UMBIVLPPJ4EL3CHB7YPKDY.json","view_paper":"https://pith.science/paper/MTJ4UMBI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.5200&json=true","fetch_graph":"https://pith.science/api/pith-number/MTJ4UMBIVLPPJ4EL3CHB7YPKDY/graph.json","fetch_events":"https://pith.science/api/pith-number/MTJ4UMBIVLPPJ4EL3CHB7YPKDY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MTJ4UMBIVLPPJ4EL3CHB7YPKDY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MTJ4UMBIVLPPJ4EL3CHB7YPKDY/action/storage_attestation","attest_author":"https://pith.science/pith/MTJ4UMBIVLPPJ4EL3CHB7YPKDY/action/author_attestation","sign_citation":"https://pith.science/pith/MTJ4UMBIVLPPJ4EL3CHB7YPKDY/action/citation_signature","submit_replication":"https://pith.science/pith/MTJ4UMBIVLPPJ4EL3CHB7YPKDY/action/replication_record"}},"created_at":"2026-05-18T02:52:49.768818+00:00","updated_at":"2026-05-18T02:52:49.768818+00:00"}