{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:EQKFAWZMUFXZ2PMALJ2WN3GMVN","short_pith_number":"pith:EQKFAWZM","schema_version":"1.0","canonical_sha256":"2414505b2ca16f9d3d805a7566ecccab5d1a75f6e9e6948ca519e26d7b42d6ee","source":{"kind":"arxiv","id":"1304.7626","version":3},"attestation_state":"computed","paper":{"title":"Stability of a Random Multiple Access Channel with \"Success-Failure\" Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Andrey Turlikov, Bruce Hajek, Sergey Foss","submitted_at":"2013-04-29T11:51:53Z","abstract_excerpt":"We consider a model of a decentralized multiple access system with a non-standard binary feedback where the empty and collision situations cannot be distinguished. We show that, like in the case of a ternary feedback, for any input rate \\lambda < 1/e, there exists a \"doubly randomized\" adaptive transmission protocol which stabilizes the behavior of the system. We discuss also a number of related problems and formulate some hypotheses."},"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":"1304.7626","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-04-29T11:51:53Z","cross_cats_sorted":[],"title_canon_sha256":"38d8a2b76655e00604b9bbb7bf83de8d96867665752ad9756005d779707b7dec","abstract_canon_sha256":"3d8689ff92cf93fcc6f224dba8b9d68327ec07ca2f6e509b95fe73383306e841"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:18.730994Z","signature_b64":"jFDwtO/nDeUuMP8mHJFH2+GnzZrHEY+rcnoe6HYwHTCM12x3Vh8EWQkAe1+fCN7kFu5+V2KHBGQ8DQ5CWXIGBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2414505b2ca16f9d3d805a7566ecccab5d1a75f6e9e6948ca519e26d7b42d6ee","last_reissued_at":"2026-05-18T01:11:18.730533Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:18.730533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stability of a Random Multiple Access Channel with \"Success-Failure\" Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Andrey Turlikov, Bruce Hajek, Sergey Foss","submitted_at":"2013-04-29T11:51:53Z","abstract_excerpt":"We consider a model of a decentralized multiple access system with a non-standard binary feedback where the empty and collision situations cannot be distinguished. We show that, like in the case of a ternary feedback, for any input rate \\lambda < 1/e, there exists a \"doubly randomized\" adaptive transmission protocol which stabilizes the behavior of the system. We discuss also a number of related problems and formulate some hypotheses."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7626","kind":"arxiv","version":3},"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":"1304.7626","created_at":"2026-05-18T01:11:18.730604+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.7626v3","created_at":"2026-05-18T01:11:18.730604+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7626","created_at":"2026-05-18T01:11:18.730604+00:00"},{"alias_kind":"pith_short_12","alias_value":"EQKFAWZMUFXZ","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"EQKFAWZMUFXZ2PMA","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"EQKFAWZM","created_at":"2026-05-18T12:27:43.054852+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/EQKFAWZMUFXZ2PMALJ2WN3GMVN","json":"https://pith.science/pith/EQKFAWZMUFXZ2PMALJ2WN3GMVN.json","graph_json":"https://pith.science/api/pith-number/EQKFAWZMUFXZ2PMALJ2WN3GMVN/graph.json","events_json":"https://pith.science/api/pith-number/EQKFAWZMUFXZ2PMALJ2WN3GMVN/events.json","paper":"https://pith.science/paper/EQKFAWZM"},"agent_actions":{"view_html":"https://pith.science/pith/EQKFAWZMUFXZ2PMALJ2WN3GMVN","download_json":"https://pith.science/pith/EQKFAWZMUFXZ2PMALJ2WN3GMVN.json","view_paper":"https://pith.science/paper/EQKFAWZM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.7626&json=true","fetch_graph":"https://pith.science/api/pith-number/EQKFAWZMUFXZ2PMALJ2WN3GMVN/graph.json","fetch_events":"https://pith.science/api/pith-number/EQKFAWZMUFXZ2PMALJ2WN3GMVN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EQKFAWZMUFXZ2PMALJ2WN3GMVN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EQKFAWZMUFXZ2PMALJ2WN3GMVN/action/storage_attestation","attest_author":"https://pith.science/pith/EQKFAWZMUFXZ2PMALJ2WN3GMVN/action/author_attestation","sign_citation":"https://pith.science/pith/EQKFAWZMUFXZ2PMALJ2WN3GMVN/action/citation_signature","submit_replication":"https://pith.science/pith/EQKFAWZMUFXZ2PMALJ2WN3GMVN/action/replication_record"}},"created_at":"2026-05-18T01:11:18.730604+00:00","updated_at":"2026-05-18T01:11:18.730604+00:00"}