{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:OAIBIKJBY2RGXTOCMELNWO2WJG","short_pith_number":"pith:OAIBIKJB","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"},"canonical_sha256":"7010142921c6a26bcdc26116db3b5649a0f57104a73f0ca64d587e4be2c8d09b","source":{"kind":"arxiv","id":"1210.0693","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.0693","created_at":"2026-05-18T03:44:14Z"},{"alias_kind":"arxiv_version","alias_value":"1210.0693v1","created_at":"2026-05-18T03:44:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0693","created_at":"2026-05-18T03:44:14Z"},{"alias_kind":"pith_short_12","alias_value":"OAIBIKJBY2RG","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OAIBIKJBY2RGXTOC","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OAIBIKJB","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:OAIBIKJBY2RGXTOCMELNWO2WJG","target":"record","payload":{"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"},"canonical_sha256":"7010142921c6a26bcdc26116db3b5649a0f57104a73f0ca64d587e4be2c8d09b","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"},"source_kind":"arxiv","source_id":"1210.0693","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:44:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oiEFHhxWts/JTXJ7DRJavSFxz5l/36BHQa2u5oNJ/WN9FZ6gURDd/YUBD1h+M7n5mXY9/L9B7pOR+gtCx0VSBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:08:11.698686Z"},"content_sha256":"93a8e9f2e8afd80f85180f9ca3bef356785c7b773186b83518615490c1ab1103","schema_version":"1.0","event_id":"sha256:93a8e9f2e8afd80f85180f9ca3bef356785c7b773186b83518615490c1ab1103"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:OAIBIKJBY2RGXTOCMELNWO2WJG","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:44:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F9nwS+JMhWFJ73Ztn6uRzWS7podUoOC9YMKye9PpXbQLuFNe3kCYGXacikmB3MY2I3w0JLYpEJIyP+yEYsO4AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:08:11.699230Z"},"content_sha256":"8e5740fbd7ed9497e138d9633af6e30c0a18e71fd1bdfc53845bd3be1f579689","schema_version":"1.0","event_id":"sha256:8e5740fbd7ed9497e138d9633af6e30c0a18e71fd1bdfc53845bd3be1f579689"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OAIBIKJBY2RGXTOCMELNWO2WJG/bundle.json","state_url":"https://pith.science/pith/OAIBIKJBY2RGXTOCMELNWO2WJG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OAIBIKJBY2RGXTOCMELNWO2WJG/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T21:08:11Z","links":{"resolver":"https://pith.science/pith/OAIBIKJBY2RGXTOCMELNWO2WJG","bundle":"https://pith.science/pith/OAIBIKJBY2RGXTOCMELNWO2WJG/bundle.json","state":"https://pith.science/pith/OAIBIKJBY2RGXTOCMELNWO2WJG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OAIBIKJBY2RGXTOCMELNWO2WJG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:OAIBIKJBY2RGXTOCMELNWO2WJG","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3959e64d7a2edb3179b0a14621300d548ea4f8d34e1ef570eec33d12e2b66581","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-02T07:55:18Z","title_canon_sha256":"855da6eadf91afd67bfd248e05faee6d6319ce44ea1037326737f48da6fb77c3"},"schema_version":"1.0","source":{"id":"1210.0693","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.0693","created_at":"2026-05-18T03:44:14Z"},{"alias_kind":"arxiv_version","alias_value":"1210.0693v1","created_at":"2026-05-18T03:44:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0693","created_at":"2026-05-18T03:44:14Z"},{"alias_kind":"pith_short_12","alias_value":"OAIBIKJBY2RG","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OAIBIKJBY2RGXTOC","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OAIBIKJB","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:8e5740fbd7ed9497e138d9633af6e30c0a18e71fd1bdfc53845bd3be1f579689","target":"graph","created_at":"2026-05-18T03:44:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Kasper F. Trilingsgaard, Nuno K. Pratas, Petar Popovski, \\v{C}edomir Stefanovi\\'c","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-02T07:55:18Z","title":"Joint Estimation and Contention-Resolution Protocol for Wireless Random Access"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0693","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:93a8e9f2e8afd80f85180f9ca3bef356785c7b773186b83518615490c1ab1103","target":"record","created_at":"2026-05-18T03:44:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3959e64d7a2edb3179b0a14621300d548ea4f8d34e1ef570eec33d12e2b66581","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-02T07:55:18Z","title_canon_sha256":"855da6eadf91afd67bfd248e05faee6d6319ce44ea1037326737f48da6fb77c3"},"schema_version":"1.0","source":{"id":"1210.0693","kind":"arxiv","version":1}},"canonical_sha256":"7010142921c6a26bcdc26116db3b5649a0f57104a73f0ca64d587e4be2c8d09b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7010142921c6a26bcdc26116db3b5649a0f57104a73f0ca64d587e4be2c8d09b","first_computed_at":"2026-05-18T03:44:14.474789Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:44:14.474789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5JEh0WATpMXgX1zIR19OQMPHAPuexSQNV4FmFrsgXwX0Q7rkBKYMF7j1n9bVw6RYZGIyZ3SgemoH8FzLG5F6Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T03:44:14.475506Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.0693","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:93a8e9f2e8afd80f85180f9ca3bef356785c7b773186b83518615490c1ab1103","sha256:8e5740fbd7ed9497e138d9633af6e30c0a18e71fd1bdfc53845bd3be1f579689"],"state_sha256":"d84b5de03c331707a4ce3deeb50b52943c82490520b8a716ee800313476935ea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ABoTKnJbDo0pnUCn8dMcq/upOk5yztByXVxQ+LG0DQFdNuBLYb+lPxHfdaHT+V5xsS4xXBPHIFQSnYYtl2tdDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:08:11.702019Z","bundle_sha256":"af802a822f965a6469f252d22753b74364130ff34b83a45ca9951cb5d6b0ce19"}}