{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:4ZPLIR3YT65CS2UL2SEVCGAFFO","short_pith_number":"pith:4ZPLIR3Y","schema_version":"1.0","canonical_sha256":"e65eb447789fba296a8bd4895118052b9f2a96e996e81355c8f5c19240bf10dc","source":{"kind":"arxiv","id":"1003.5068","version":1},"attestation_state":"computed","paper":{"title":"On the stability of flow-aware CSMA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.PR"],"primary_cat":"cs.PF","authors_text":"France), M. Feuillet (INRIA, Paris, Rocquencourt, T. Bonald (Telecom ParisTech","submitted_at":"2010-03-26T08:06:37Z","abstract_excerpt":"We consider a wireless network where each flow (instead of each link)  runs its own CSMA (Carrier Sense Multiple Access) algorithm. Specifically, each  flow attempts to access the radio  channel after some random time and transmits a packet if the channel is sensed idle. We prove that, unlike the standard CSMA algorithm, this simple distributed access scheme is optimal in the sense that the network is stable   for all traffic intensities  in the capacity region of the network."},"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":"1003.5068","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2010-03-26T08:06:37Z","cross_cats_sorted":["cs.NI","math.PR"],"title_canon_sha256":"2f6f6d4b7406d22be13c0ac3f927b78401926ac14afcd484c0ecc2cfa43cc654","abstract_canon_sha256":"4e6e39d99950cc4ff3d3a285a841b4404495b0e016b34085776fdbf78cfd3cde"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:09.879742Z","signature_b64":"ps3+dSXNOgaVM2hb7ITWyww8PDVsJ/5YCwOMIXiiEWBwEVa260djQfF5N0ipPf6fdcw/rDuQTE8VwFOa22HpBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e65eb447789fba296a8bd4895118052b9f2a96e996e81355c8f5c19240bf10dc","last_reissued_at":"2026-05-18T04:28:09.879090Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:09.879090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the stability of flow-aware CSMA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.PR"],"primary_cat":"cs.PF","authors_text":"France), M. Feuillet (INRIA, Paris, Rocquencourt, T. Bonald (Telecom ParisTech","submitted_at":"2010-03-26T08:06:37Z","abstract_excerpt":"We consider a wireless network where each flow (instead of each link)  runs its own CSMA (Carrier Sense Multiple Access) algorithm. Specifically, each  flow attempts to access the radio  channel after some random time and transmits a packet if the channel is sensed idle. We prove that, unlike the standard CSMA algorithm, this simple distributed access scheme is optimal in the sense that the network is stable   for all traffic intensities  in the capacity region of the network."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.5068","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":"1003.5068","created_at":"2026-05-18T04:28:09.879199+00:00"},{"alias_kind":"arxiv_version","alias_value":"1003.5068v1","created_at":"2026-05-18T04:28:09.879199+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.5068","created_at":"2026-05-18T04:28:09.879199+00:00"},{"alias_kind":"pith_short_12","alias_value":"4ZPLIR3YT65C","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"4ZPLIR3YT65CS2UL","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"4ZPLIR3Y","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/4ZPLIR3YT65CS2UL2SEVCGAFFO","json":"https://pith.science/pith/4ZPLIR3YT65CS2UL2SEVCGAFFO.json","graph_json":"https://pith.science/api/pith-number/4ZPLIR3YT65CS2UL2SEVCGAFFO/graph.json","events_json":"https://pith.science/api/pith-number/4ZPLIR3YT65CS2UL2SEVCGAFFO/events.json","paper":"https://pith.science/paper/4ZPLIR3Y"},"agent_actions":{"view_html":"https://pith.science/pith/4ZPLIR3YT65CS2UL2SEVCGAFFO","download_json":"https://pith.science/pith/4ZPLIR3YT65CS2UL2SEVCGAFFO.json","view_paper":"https://pith.science/paper/4ZPLIR3Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1003.5068&json=true","fetch_graph":"https://pith.science/api/pith-number/4ZPLIR3YT65CS2UL2SEVCGAFFO/graph.json","fetch_events":"https://pith.science/api/pith-number/4ZPLIR3YT65CS2UL2SEVCGAFFO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4ZPLIR3YT65CS2UL2SEVCGAFFO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4ZPLIR3YT65CS2UL2SEVCGAFFO/action/storage_attestation","attest_author":"https://pith.science/pith/4ZPLIR3YT65CS2UL2SEVCGAFFO/action/author_attestation","sign_citation":"https://pith.science/pith/4ZPLIR3YT65CS2UL2SEVCGAFFO/action/citation_signature","submit_replication":"https://pith.science/pith/4ZPLIR3YT65CS2UL2SEVCGAFFO/action/replication_record"}},"created_at":"2026-05-18T04:28:09.879199+00:00","updated_at":"2026-05-18T04:28:09.879199+00:00"}