{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:IASN2DSGQ4SKTVEK3CNZVRTBPF","short_pith_number":"pith:IASN2DSG","schema_version":"1.0","canonical_sha256":"4024dd0e468724a9d48ad89b9ac6617944d4df2550f462b43120a9738a33d5c4","source":{"kind":"arxiv","id":"1305.0384","version":1},"attestation_state":"computed","paper":{"title":"Optimal Distributed Scheduling in Wireless Networks under the SINR interference model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Proutiere, Prasanna Chaporkar","submitted_at":"2013-05-02T10:08:30Z","abstract_excerpt":"Radio resource sharing mechanisms are key to ensuring good performance in wireless networks. In their seminal paper \\cite{tassiulas1}, Tassiulas and Ephremides introduced the Maximum Weighted Scheduling algorithm, and proved its throughput-optimality. Since then, there have been extensive research efforts to devise distributed implementations of this algorithm. Recently, distributed adaptive CSMA scheduling schemes \\cite{jiang08} have been proposed and shown to be optimal, without the need of message passing among transmitters. However their analysis relies on the assumption that interference "},"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":"1305.0384","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-02T10:08:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ac43df97a9b76de2f2100387a94a730fbc4b69248ee9e3ec2127f6e04d40f4ca","abstract_canon_sha256":"a5fb590a9e91bd332b7cd60481599acbdd429696347fc1b637f6c9a0e3cc49b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:40.409657Z","signature_b64":"qvxxkiwvgWGA6u0/i7+satislTNFpbPmWb/A7Lu2K67M/QbTrEy+tZT7Qqf8tptFM0UBczjmxtPjLSPyJwA/CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4024dd0e468724a9d48ad89b9ac6617944d4df2550f462b43120a9738a33d5c4","last_reissued_at":"2026-05-18T03:26:40.409163Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:40.409163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Distributed Scheduling in Wireless Networks under the SINR interference model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Proutiere, Prasanna Chaporkar","submitted_at":"2013-05-02T10:08:30Z","abstract_excerpt":"Radio resource sharing mechanisms are key to ensuring good performance in wireless networks. In their seminal paper \\cite{tassiulas1}, Tassiulas and Ephremides introduced the Maximum Weighted Scheduling algorithm, and proved its throughput-optimality. Since then, there have been extensive research efforts to devise distributed implementations of this algorithm. Recently, distributed adaptive CSMA scheduling schemes \\cite{jiang08} have been proposed and shown to be optimal, without the need of message passing among transmitters. However their analysis relies on the assumption that interference "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0384","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":"1305.0384","created_at":"2026-05-18T03:26:40.409243+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.0384v1","created_at":"2026-05-18T03:26:40.409243+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0384","created_at":"2026-05-18T03:26:40.409243+00:00"},{"alias_kind":"pith_short_12","alias_value":"IASN2DSGQ4SK","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"IASN2DSGQ4SKTVEK","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"IASN2DSG","created_at":"2026-05-18T12:27:46.883200+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/IASN2DSGQ4SKTVEK3CNZVRTBPF","json":"https://pith.science/pith/IASN2DSGQ4SKTVEK3CNZVRTBPF.json","graph_json":"https://pith.science/api/pith-number/IASN2DSGQ4SKTVEK3CNZVRTBPF/graph.json","events_json":"https://pith.science/api/pith-number/IASN2DSGQ4SKTVEK3CNZVRTBPF/events.json","paper":"https://pith.science/paper/IASN2DSG"},"agent_actions":{"view_html":"https://pith.science/pith/IASN2DSGQ4SKTVEK3CNZVRTBPF","download_json":"https://pith.science/pith/IASN2DSGQ4SKTVEK3CNZVRTBPF.json","view_paper":"https://pith.science/paper/IASN2DSG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.0384&json=true","fetch_graph":"https://pith.science/api/pith-number/IASN2DSGQ4SKTVEK3CNZVRTBPF/graph.json","fetch_events":"https://pith.science/api/pith-number/IASN2DSGQ4SKTVEK3CNZVRTBPF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IASN2DSGQ4SKTVEK3CNZVRTBPF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IASN2DSGQ4SKTVEK3CNZVRTBPF/action/storage_attestation","attest_author":"https://pith.science/pith/IASN2DSGQ4SKTVEK3CNZVRTBPF/action/author_attestation","sign_citation":"https://pith.science/pith/IASN2DSGQ4SKTVEK3CNZVRTBPF/action/citation_signature","submit_replication":"https://pith.science/pith/IASN2DSGQ4SKTVEK3CNZVRTBPF/action/replication_record"}},"created_at":"2026-05-18T03:26:40.409243+00:00","updated_at":"2026-05-18T03:26:40.409243+00:00"}