{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:OAIBIKJBY2RGXTOCMELNWO2WJG","short_pith_number":"pith:OAIBIKJB","schema_version":"1.0","canonical_sha256":"7010142921c6a26bcdc26116db3b5649a0f57104a73f0ca64d587e4be2c8d09b","source":{"kind":"arxiv","id":"1210.0693","version":1},"attestation_state":"computed","paper":{"title":"Joint Estimation and Contention-Resolution Protocol for Wireless Random Access","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kasper F. Trilingsgaard, Nuno K. Pratas, Petar Popovski, \\v{C}edomir Stefanovi\\'c","submitted_at":"2012-10-02T07:55:18Z","abstract_excerpt":"We propose a contention-based random-access protocol, designed for wireless networks where the number of users is not a priori known. The protocol operates in rounds divided into equal-duration slots, performing at the same time estimation of the number of users and resolution of their transmissions. The users independently access the wireless link on a slot basis with a predefined probability, resulting in a distribution of user transmissions over slots, based on which the estimation and contention resolution are performed. Specifically, the contention resolution is performed using successive"},"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":"1210.0693","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-02T07:55:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"855da6eadf91afd67bfd248e05faee6d6319ce44ea1037326737f48da6fb77c3","abstract_canon_sha256":"3959e64d7a2edb3179b0a14621300d548ea4f8d34e1ef570eec33d12e2b66581"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:14.475506Z","signature_b64":"5JEh0WATpMXgX1zIR19OQMPHAPuexSQNV4FmFrsgXwX0Q7rkBKYMF7j1n9bVw6RYZGIyZ3SgemoH8FzLG5F6Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7010142921c6a26bcdc26116db3b5649a0f57104a73f0ca64d587e4be2c8d09b","last_reissued_at":"2026-05-18T03:44:14.474789Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:14.474789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Joint Estimation and Contention-Resolution Protocol for Wireless Random Access","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kasper F. Trilingsgaard, Nuno K. Pratas, Petar Popovski, \\v{C}edomir Stefanovi\\'c","submitted_at":"2012-10-02T07:55:18Z","abstract_excerpt":"We propose a contention-based random-access protocol, designed for wireless networks where the number of users is not a priori known. The protocol operates in rounds divided into equal-duration slots, performing at the same time estimation of the number of users and resolution of their transmissions. The users independently access the wireless link on a slot basis with a predefined probability, resulting in a distribution of user transmissions over slots, based on which the estimation and contention resolution are performed. Specifically, the contention resolution is performed using successive"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0693","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":"1210.0693","created_at":"2026-05-18T03:44:14.474910+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.0693v1","created_at":"2026-05-18T03:44:14.474910+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0693","created_at":"2026-05-18T03:44:14.474910+00:00"},{"alias_kind":"pith_short_12","alias_value":"OAIBIKJBY2RG","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"OAIBIKJBY2RGXTOC","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"OAIBIKJB","created_at":"2026-05-18T12:27:16.716162+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/OAIBIKJBY2RGXTOCMELNWO2WJG","json":"https://pith.science/pith/OAIBIKJBY2RGXTOCMELNWO2WJG.json","graph_json":"https://pith.science/api/pith-number/OAIBIKJBY2RGXTOCMELNWO2WJG/graph.json","events_json":"https://pith.science/api/pith-number/OAIBIKJBY2RGXTOCMELNWO2WJG/events.json","paper":"https://pith.science/paper/OAIBIKJB"},"agent_actions":{"view_html":"https://pith.science/pith/OAIBIKJBY2RGXTOCMELNWO2WJG","download_json":"https://pith.science/pith/OAIBIKJBY2RGXTOCMELNWO2WJG.json","view_paper":"https://pith.science/paper/OAIBIKJB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.0693&json=true","fetch_graph":"https://pith.science/api/pith-number/OAIBIKJBY2RGXTOCMELNWO2WJG/graph.json","fetch_events":"https://pith.science/api/pith-number/OAIBIKJBY2RGXTOCMELNWO2WJG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OAIBIKJBY2RGXTOCMELNWO2WJG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OAIBIKJBY2RGXTOCMELNWO2WJG/action/storage_attestation","attest_author":"https://pith.science/pith/OAIBIKJBY2RGXTOCMELNWO2WJG/action/author_attestation","sign_citation":"https://pith.science/pith/OAIBIKJBY2RGXTOCMELNWO2WJG/action/citation_signature","submit_replication":"https://pith.science/pith/OAIBIKJBY2RGXTOCMELNWO2WJG/action/replication_record"}},"created_at":"2026-05-18T03:44:14.474910+00:00","updated_at":"2026-05-18T03:44:14.474910+00:00"}