{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JSNPTNPCIGTLV4ARZ5F4JO3KS4","short_pith_number":"pith:JSNPTNPC","schema_version":"1.0","canonical_sha256":"4c9af9b5e241a6baf011cf4bc4bb6a97274e6510540dda590fa543c5d1fd7677","source":{"kind":"arxiv","id":"1705.10104","version":1},"attestation_state":"computed","paper":{"title":"Universal Framework for Wireless Scheduling Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Magnus M. Halldorsson, Tigran Tonoyan","submitted_at":"2017-05-29T10:34:38Z","abstract_excerpt":"An overarching issue in resource management of wireless networks is assessing their capacity: How much communication can be achieved in a network, utilizing all the tools available: power control, scheduling, routing, channel assignment and rate adjustment? We propose the first framework for approximation algorithms in the physical model that addresses these questions in full, including rate control. The approximations obtained are doubly logarithmic in the link length and rate diversity. Where previous bounds are known, this gives an exponential improvement.\n  A key contribution is showing th"},"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":"1705.10104","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-05-29T10:34:38Z","cross_cats_sorted":[],"title_canon_sha256":"4bea648f9156de3a3bc8bce7a688b15b51b55491c7c733dc4109dcea591fe46b","abstract_canon_sha256":"eda532811bb6b804528f2b12e8070bbcb674d89f8497f391d04b73d9b2c40134"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:31.943361Z","signature_b64":"i9Hjpmct98RRQHMgu5niBqOEwRzYlfqMC1Mh3ofQWYoPSeaPT3GojmuVgnqg+aaKIFWvumCIXVy79u0nUKpuCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c9af9b5e241a6baf011cf4bc4bb6a97274e6510540dda590fa543c5d1fd7677","last_reissued_at":"2026-05-18T00:43:31.942755Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:31.942755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal Framework for Wireless Scheduling Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Magnus M. Halldorsson, Tigran Tonoyan","submitted_at":"2017-05-29T10:34:38Z","abstract_excerpt":"An overarching issue in resource management of wireless networks is assessing their capacity: How much communication can be achieved in a network, utilizing all the tools available: power control, scheduling, routing, channel assignment and rate adjustment? We propose the first framework for approximation algorithms in the physical model that addresses these questions in full, including rate control. The approximations obtained are doubly logarithmic in the link length and rate diversity. Where previous bounds are known, this gives an exponential improvement.\n  A key contribution is showing th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10104","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":"1705.10104","created_at":"2026-05-18T00:43:31.942826+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.10104v1","created_at":"2026-05-18T00:43:31.942826+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10104","created_at":"2026-05-18T00:43:31.942826+00:00"},{"alias_kind":"pith_short_12","alias_value":"JSNPTNPCIGTL","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"JSNPTNPCIGTLV4AR","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"JSNPTNPC","created_at":"2026-05-18T12:31:24.725408+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/JSNPTNPCIGTLV4ARZ5F4JO3KS4","json":"https://pith.science/pith/JSNPTNPCIGTLV4ARZ5F4JO3KS4.json","graph_json":"https://pith.science/api/pith-number/JSNPTNPCIGTLV4ARZ5F4JO3KS4/graph.json","events_json":"https://pith.science/api/pith-number/JSNPTNPCIGTLV4ARZ5F4JO3KS4/events.json","paper":"https://pith.science/paper/JSNPTNPC"},"agent_actions":{"view_html":"https://pith.science/pith/JSNPTNPCIGTLV4ARZ5F4JO3KS4","download_json":"https://pith.science/pith/JSNPTNPCIGTLV4ARZ5F4JO3KS4.json","view_paper":"https://pith.science/paper/JSNPTNPC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.10104&json=true","fetch_graph":"https://pith.science/api/pith-number/JSNPTNPCIGTLV4ARZ5F4JO3KS4/graph.json","fetch_events":"https://pith.science/api/pith-number/JSNPTNPCIGTLV4ARZ5F4JO3KS4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JSNPTNPCIGTLV4ARZ5F4JO3KS4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JSNPTNPCIGTLV4ARZ5F4JO3KS4/action/storage_attestation","attest_author":"https://pith.science/pith/JSNPTNPCIGTLV4ARZ5F4JO3KS4/action/author_attestation","sign_citation":"https://pith.science/pith/JSNPTNPCIGTLV4ARZ5F4JO3KS4/action/citation_signature","submit_replication":"https://pith.science/pith/JSNPTNPCIGTLV4ARZ5F4JO3KS4/action/replication_record"}},"created_at":"2026-05-18T00:43:31.942826+00:00","updated_at":"2026-05-18T00:43:31.942826+00:00"}