{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PY3OSL2P7NRCDPPZVXVCFCA7I3","short_pith_number":"pith:PY3OSL2P","schema_version":"1.0","canonical_sha256":"7e36e92f4ffb6221bdf9adea22881f46c5f301c7c67467c59c19f173c6fa0063","source":{"kind":"arxiv","id":"1707.01548","version":2},"attestation_state":"computed","paper":{"title":"Stability conditions for a discrete-time decentralised medium access algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.NI","authors_text":"Alexander Stolyar, Seva Shneer","submitted_at":"2017-07-05T19:22:28Z","abstract_excerpt":"We consider a stochastic queueing system modelling the behaviour of a wireless network with nodes employing a discrete-time version of the standard decentralised medium access algorithm. The system is {\\em unsaturated} -- each node receives an exogenous flow of packets at the rate $\\lambda$ packets per time slot. Each packet takes one slot to transmit, but neighboring nodes cannot transmit simultaneously. The algorithm we study is {\\em standard} in that: a node with empty queue does {\\em not} compete for medium access; the access procedure by a node does {\\em not} depend on its queue length, a"},"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":"1707.01548","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-07-05T19:22:28Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"9e0f334061a2ccb84106b7963311daf6303dd4dfc38ccdca38a151484fd53399","abstract_canon_sha256":"d32fed8ec07cf2dd0fef4e84a4b54c1b35e1b038a52db79f2bb1fd83a82f2e67"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:39.489835Z","signature_b64":"gTxZIaNzabRsK1FvC3d+swjkWnnh+BoEk9xm+KWH2EIW8Va7YC8vr0jAjB/PJ39D8DvYnbpw87gOnOQ6+OzZBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e36e92f4ffb6221bdf9adea22881f46c5f301c7c67467c59c19f173c6fa0063","last_reissued_at":"2026-05-18T00:20:39.488999Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:39.488999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stability conditions for a discrete-time decentralised medium access algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.NI","authors_text":"Alexander Stolyar, Seva Shneer","submitted_at":"2017-07-05T19:22:28Z","abstract_excerpt":"We consider a stochastic queueing system modelling the behaviour of a wireless network with nodes employing a discrete-time version of the standard decentralised medium access algorithm. The system is {\\em unsaturated} -- each node receives an exogenous flow of packets at the rate $\\lambda$ packets per time slot. Each packet takes one slot to transmit, but neighboring nodes cannot transmit simultaneously. The algorithm we study is {\\em standard} in that: a node with empty queue does {\\em not} compete for medium access; the access procedure by a node does {\\em not} depend on its queue length, a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01548","kind":"arxiv","version":2},"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":"1707.01548","created_at":"2026-05-18T00:20:39.489140+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.01548v2","created_at":"2026-05-18T00:20:39.489140+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01548","created_at":"2026-05-18T00:20:39.489140+00:00"},{"alias_kind":"pith_short_12","alias_value":"PY3OSL2P7NRC","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PY3OSL2P7NRCDPPZ","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PY3OSL2P","created_at":"2026-05-18T12:31:37.085036+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/PY3OSL2P7NRCDPPZVXVCFCA7I3","json":"https://pith.science/pith/PY3OSL2P7NRCDPPZVXVCFCA7I3.json","graph_json":"https://pith.science/api/pith-number/PY3OSL2P7NRCDPPZVXVCFCA7I3/graph.json","events_json":"https://pith.science/api/pith-number/PY3OSL2P7NRCDPPZVXVCFCA7I3/events.json","paper":"https://pith.science/paper/PY3OSL2P"},"agent_actions":{"view_html":"https://pith.science/pith/PY3OSL2P7NRCDPPZVXVCFCA7I3","download_json":"https://pith.science/pith/PY3OSL2P7NRCDPPZVXVCFCA7I3.json","view_paper":"https://pith.science/paper/PY3OSL2P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.01548&json=true","fetch_graph":"https://pith.science/api/pith-number/PY3OSL2P7NRCDPPZVXVCFCA7I3/graph.json","fetch_events":"https://pith.science/api/pith-number/PY3OSL2P7NRCDPPZVXVCFCA7I3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PY3OSL2P7NRCDPPZVXVCFCA7I3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PY3OSL2P7NRCDPPZVXVCFCA7I3/action/storage_attestation","attest_author":"https://pith.science/pith/PY3OSL2P7NRCDPPZVXVCFCA7I3/action/author_attestation","sign_citation":"https://pith.science/pith/PY3OSL2P7NRCDPPZVXVCFCA7I3/action/citation_signature","submit_replication":"https://pith.science/pith/PY3OSL2P7NRCDPPZVXVCFCA7I3/action/replication_record"}},"created_at":"2026-05-18T00:20:39.489140+00:00","updated_at":"2026-05-18T00:20:39.489140+00:00"}