{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:FO33JIL4O3UW4NVSXD6DQHPMXM","short_pith_number":"pith:FO33JIL4","schema_version":"1.0","canonical_sha256":"2bb7b4a17c76e96e36b2b8fc381decbb16fc2c171b97f1f576741ede28e5633b","source":{"kind":"arxiv","id":"1604.00178","version":1},"attestation_state":"computed","paper":{"title":"Approaching Optimal Centralized Scheduling with CSMA-based Random Access over Fading Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Bjorn Landfeldt, Mehmet Karaca","submitted_at":"2016-04-01T09:45:11Z","abstract_excerpt":"Carrier Sense Multiple Access (CSMA) based distributed algorithms can attain the largest capacity region as the centralized Max-Weight policy does. Despite their capability of achieving throughput-optimality, these algorithms can either incur large delay and have large complexity or only operate over non-fading channels. In this letter, by assuming arbitrary back-off time we first propose a fully distributed randomized algorithm whose performance can be pushed to the performance of the centralized Max-Weight policy not only in terms of throughput but also in terms of delay for completely-conne"},"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":"1604.00178","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-04-01T09:45:11Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"82470f16b8e3eda0094a671452e73aa2156ddc4d63d9cac7ee876e6ea1a95b2c","abstract_canon_sha256":"fbe03228d7477d3190848b9170905545618f907c22f20eff49c41fc7773132fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:54.379584Z","signature_b64":"1ZwtfaRv1EQadY4rbXuD2TEw7/eR/pazJZCWMguMiluS7y1NWjbQwIWJsA2Xa41L/hbfGPJSVY1m/Hs5eU2OCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2bb7b4a17c76e96e36b2b8fc381decbb16fc2c171b97f1f576741ede28e5633b","last_reissued_at":"2026-05-18T01:17:54.378966Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:54.378966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approaching Optimal Centralized Scheduling with CSMA-based Random Access over Fading Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Bjorn Landfeldt, Mehmet Karaca","submitted_at":"2016-04-01T09:45:11Z","abstract_excerpt":"Carrier Sense Multiple Access (CSMA) based distributed algorithms can attain the largest capacity region as the centralized Max-Weight policy does. Despite their capability of achieving throughput-optimality, these algorithms can either incur large delay and have large complexity or only operate over non-fading channels. In this letter, by assuming arbitrary back-off time we first propose a fully distributed randomized algorithm whose performance can be pushed to the performance of the centralized Max-Weight policy not only in terms of throughput but also in terms of delay for completely-conne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00178","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":"1604.00178","created_at":"2026-05-18T01:17:54.379084+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.00178v1","created_at":"2026-05-18T01:17:54.379084+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00178","created_at":"2026-05-18T01:17:54.379084+00:00"},{"alias_kind":"pith_short_12","alias_value":"FO33JIL4O3UW","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"FO33JIL4O3UW4NVS","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"FO33JIL4","created_at":"2026-05-18T12:30:15.759754+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/FO33JIL4O3UW4NVSXD6DQHPMXM","json":"https://pith.science/pith/FO33JIL4O3UW4NVSXD6DQHPMXM.json","graph_json":"https://pith.science/api/pith-number/FO33JIL4O3UW4NVSXD6DQHPMXM/graph.json","events_json":"https://pith.science/api/pith-number/FO33JIL4O3UW4NVSXD6DQHPMXM/events.json","paper":"https://pith.science/paper/FO33JIL4"},"agent_actions":{"view_html":"https://pith.science/pith/FO33JIL4O3UW4NVSXD6DQHPMXM","download_json":"https://pith.science/pith/FO33JIL4O3UW4NVSXD6DQHPMXM.json","view_paper":"https://pith.science/paper/FO33JIL4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.00178&json=true","fetch_graph":"https://pith.science/api/pith-number/FO33JIL4O3UW4NVSXD6DQHPMXM/graph.json","fetch_events":"https://pith.science/api/pith-number/FO33JIL4O3UW4NVSXD6DQHPMXM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FO33JIL4O3UW4NVSXD6DQHPMXM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FO33JIL4O3UW4NVSXD6DQHPMXM/action/storage_attestation","attest_author":"https://pith.science/pith/FO33JIL4O3UW4NVSXD6DQHPMXM/action/author_attestation","sign_citation":"https://pith.science/pith/FO33JIL4O3UW4NVSXD6DQHPMXM/action/citation_signature","submit_replication":"https://pith.science/pith/FO33JIL4O3UW4NVSXD6DQHPMXM/action/replication_record"}},"created_at":"2026-05-18T01:17:54.379084+00:00","updated_at":"2026-05-18T01:17:54.379084+00:00"}