{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:5LDIOC7RIUAEEKFZULSEOWKAHW","short_pith_number":"pith:5LDIOC7R","schema_version":"1.0","canonical_sha256":"eac6870bf145004228b9a2e44759403d919b2cb861ddad8420e04af7d4280321","source":{"kind":"arxiv","id":"1009.5944","version":1},"attestation_state":"computed","paper":{"title":"Throughput-Optimal Random Access with Order-Optimal Delay","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mahdi Lotfinezhad, Peter Marbach","submitted_at":"2010-09-29T17:09:21Z","abstract_excerpt":"In this paper, we consider CSMA policies for scheduling of multihop wireless networks with one-hop traffic. The main contribution of this paper is to propose Unlocking CSMA (U-CSMA) policy that enables to obtain high throughput with low (average) packet delay for large wireless networks. In particular, the delay under U-CSMA policy becomes order-optimal. For one-hop traffic, delay is defined to be order-optimal if it is O(1), i.e., it stays bounded, as the network-size increases to infinity. Using mean field theory techniques, we analytically show that for torus (grid-like) interference topolo"},"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":"1009.5944","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-29T17:09:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2f0cc9bfab2453a1f39dd354dc234e8ab7d4380a69a982e3fd59a20d0dba80f1","abstract_canon_sha256":"a51ed14e49a915876830a2c696219c3c39ab77dfe777bde30d4b7d1014e28ff5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:08.591670Z","signature_b64":"KzvnSOAKdHTHQV77SHBRfLIC4rIvLHsAtbD6dYQ2q+R8sB567Bd50diOwWluHnGf/9dnv9zKyr8EJQKkfA44CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eac6870bf145004228b9a2e44759403d919b2cb861ddad8420e04af7d4280321","last_reissued_at":"2026-05-18T04:40:08.591211Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:08.591211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Throughput-Optimal Random Access with Order-Optimal Delay","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mahdi Lotfinezhad, Peter Marbach","submitted_at":"2010-09-29T17:09:21Z","abstract_excerpt":"In this paper, we consider CSMA policies for scheduling of multihop wireless networks with one-hop traffic. The main contribution of this paper is to propose Unlocking CSMA (U-CSMA) policy that enables to obtain high throughput with low (average) packet delay for large wireless networks. In particular, the delay under U-CSMA policy becomes order-optimal. For one-hop traffic, delay is defined to be order-optimal if it is O(1), i.e., it stays bounded, as the network-size increases to infinity. Using mean field theory techniques, we analytically show that for torus (grid-like) interference topolo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.5944","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":"1009.5944","created_at":"2026-05-18T04:40:08.591287+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.5944v1","created_at":"2026-05-18T04:40:08.591287+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.5944","created_at":"2026-05-18T04:40:08.591287+00:00"},{"alias_kind":"pith_short_12","alias_value":"5LDIOC7RIUAE","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"5LDIOC7RIUAEEKFZ","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"5LDIOC7R","created_at":"2026-05-18T12:26:04.259169+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/5LDIOC7RIUAEEKFZULSEOWKAHW","json":"https://pith.science/pith/5LDIOC7RIUAEEKFZULSEOWKAHW.json","graph_json":"https://pith.science/api/pith-number/5LDIOC7RIUAEEKFZULSEOWKAHW/graph.json","events_json":"https://pith.science/api/pith-number/5LDIOC7RIUAEEKFZULSEOWKAHW/events.json","paper":"https://pith.science/paper/5LDIOC7R"},"agent_actions":{"view_html":"https://pith.science/pith/5LDIOC7RIUAEEKFZULSEOWKAHW","download_json":"https://pith.science/pith/5LDIOC7RIUAEEKFZULSEOWKAHW.json","view_paper":"https://pith.science/paper/5LDIOC7R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.5944&json=true","fetch_graph":"https://pith.science/api/pith-number/5LDIOC7RIUAEEKFZULSEOWKAHW/graph.json","fetch_events":"https://pith.science/api/pith-number/5LDIOC7RIUAEEKFZULSEOWKAHW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5LDIOC7RIUAEEKFZULSEOWKAHW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5LDIOC7RIUAEEKFZULSEOWKAHW/action/storage_attestation","attest_author":"https://pith.science/pith/5LDIOC7RIUAEEKFZULSEOWKAHW/action/author_attestation","sign_citation":"https://pith.science/pith/5LDIOC7RIUAEEKFZULSEOWKAHW/action/citation_signature","submit_replication":"https://pith.science/pith/5LDIOC7RIUAEEKFZULSEOWKAHW/action/replication_record"}},"created_at":"2026-05-18T04:40:08.591287+00:00","updated_at":"2026-05-18T04:40:08.591287+00:00"}