{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FO33JIL4O3UW4NVSXD6DQHPMXM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"fbe03228d7477d3190848b9170905545618f907c22f20eff49c41fc7773132fb","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-04-01T09:45:11Z","title_canon_sha256":"82470f16b8e3eda0094a671452e73aa2156ddc4d63d9cac7ee876e6ea1a95b2c"},"schema_version":"1.0","source":{"id":"1604.00178","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.00178","created_at":"2026-05-18T01:17:54Z"},{"alias_kind":"arxiv_version","alias_value":"1604.00178v1","created_at":"2026-05-18T01:17:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00178","created_at":"2026-05-18T01:17:54Z"},{"alias_kind":"pith_short_12","alias_value":"FO33JIL4O3UW","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FO33JIL4O3UW4NVS","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FO33JIL4","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:005a8bbe763433b573e790b758ccad9678556dead70831f6eac3f5f2aeedd532","target":"graph","created_at":"2026-05-18T01:17:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Bjorn Landfeldt, Mehmet Karaca","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-04-01T09:45:11Z","title":"Approaching Optimal Centralized Scheduling with CSMA-based Random Access over Fading Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00178","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:199cf45522cd9ce27ff0722377aa5840f95e9bd01d19e62978d8454cd5d529b4","target":"record","created_at":"2026-05-18T01:17:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"fbe03228d7477d3190848b9170905545618f907c22f20eff49c41fc7773132fb","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-04-01T09:45:11Z","title_canon_sha256":"82470f16b8e3eda0094a671452e73aa2156ddc4d63d9cac7ee876e6ea1a95b2c"},"schema_version":"1.0","source":{"id":"1604.00178","kind":"arxiv","version":1}},"canonical_sha256":"2bb7b4a17c76e96e36b2b8fc381decbb16fc2c171b97f1f576741ede28e5633b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2bb7b4a17c76e96e36b2b8fc381decbb16fc2c171b97f1f576741ede28e5633b","first_computed_at":"2026-05-18T01:17:54.378966Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:54.378966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1ZwtfaRv1EQadY4rbXuD2TEw7/eR/pazJZCWMguMiluS7y1NWjbQwIWJsA2Xa41L/hbfGPJSVY1m/Hs5eU2OCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:54.379584Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.00178","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:199cf45522cd9ce27ff0722377aa5840f95e9bd01d19e62978d8454cd5d529b4","sha256:005a8bbe763433b573e790b758ccad9678556dead70831f6eac3f5f2aeedd532"],"state_sha256":"09e10545d435f1a54637ceda624f577a5fa3e9ef4845f5296774511907bf8537"}