{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:67MM3L3BR3BOG3GOEYGCTHIUCH","short_pith_number":"pith:67MM3L3B","canonical_record":{"source":{"id":"1107.0234","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-07-01T14:16:33Z","cross_cats_sorted":["cs.DS","cs.NI"],"title_canon_sha256":"0219a8a6715f8e98021373e005356d2573059cd0a161f6abc55c9380aa6c3d63","abstract_canon_sha256":"7588596d5a74241446e867ddd3cbc9ef15ec9b014667deef05f4af1dfede30d6"},"schema_version":"1.0"},"canonical_sha256":"f7d8cdaf618ec2e36cce260c299d1411ce640feeefc4786ff67fc2f838f1232f","source":{"kind":"arxiv","id":"1107.0234","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.0234","created_at":"2026-05-18T04:19:02Z"},{"alias_kind":"arxiv_version","alias_value":"1107.0234v1","created_at":"2026-05-18T04:19:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.0234","created_at":"2026-05-18T04:19:02Z"},{"alias_kind":"pith_short_12","alias_value":"67MM3L3BR3BO","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"67MM3L3BR3BOG3GO","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"67MM3L3B","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:67MM3L3BR3BOG3GOEYGCTHIUCH","target":"record","payload":{"canonical_record":{"source":{"id":"1107.0234","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-07-01T14:16:33Z","cross_cats_sorted":["cs.DS","cs.NI"],"title_canon_sha256":"0219a8a6715f8e98021373e005356d2573059cd0a161f6abc55c9380aa6c3d63","abstract_canon_sha256":"7588596d5a74241446e867ddd3cbc9ef15ec9b014667deef05f4af1dfede30d6"},"schema_version":"1.0"},"canonical_sha256":"f7d8cdaf618ec2e36cce260c299d1411ce640feeefc4786ff67fc2f838f1232f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:02.411401Z","signature_b64":"lTSpazSxIKQep9GnkblFZnZnBe/1R9nbcd/uGwbu4HVVTotaQcC3/fONmQCA5+PMshTrs76pSJfLzYsDHm7CAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7d8cdaf618ec2e36cce260c299d1411ce640feeefc4786ff67fc2f838f1232f","last_reissued_at":"2026-05-18T04:19:02.410768Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:02.410768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.0234","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-18T04:19:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yZckn0/q+yHbASbK+k1TvnT2mGW35NRLrLw/SUo8vveRjuwBy2i5gurMyoKJf6yJrNBZ5lxozT7w/zvQEQpFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:58:21.349969Z"},"content_sha256":"5f5ee89c71b265757c90f37b52cc0d1bce6ec4cfdd766d31c063675ccff90ba6","schema_version":"1.0","event_id":"sha256:5f5ee89c71b265757c90f37b52cc0d1bce6ec4cfdd766d31c063675ccff90ba6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:67MM3L3BR3BOG3GOEYGCTHIUCH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unbounded Contention Resolution in Multiple-Access Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.NI"],"primary_cat":"cs.DC","authors_text":"Antonio Fern\\'andez Anta, Jorge Ram\\'on Mu\\~noz, Miguel A. Mosteiro","submitted_at":"2011-07-01T14:16:33Z","abstract_excerpt":"A frequent problem in settings where a unique resource must be shared among users is how to resolve the contention that arises when all of them must use it, but the resource allows only for one user each time. The application of efficient solutions for this problem spans a myriad of settings such as radio communication networks or databases. For the case where the number of users is unknown, recent work has yielded fruitful results for local area networks and radio networks, although either a (possibly loose) upper bound on the number of users needs to be known, or the solution is suboptimal, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.0234","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-18T04:19:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YCJLhIhfHF40/ASB5cKxX99DnodxYQZ5RtWQcJ7T1ApoecKYsVmHtTe6ed2uz3yBWpoOiiijOBQxkwVxbvVCCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:58:21.350311Z"},"content_sha256":"f0c73b5e0537d476cea421349fdcf3ff629ea0a8445f582498a9bfb20dab2a1b","schema_version":"1.0","event_id":"sha256:f0c73b5e0537d476cea421349fdcf3ff629ea0a8445f582498a9bfb20dab2a1b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/67MM3L3BR3BOG3GOEYGCTHIUCH/bundle.json","state_url":"https://pith.science/pith/67MM3L3BR3BOG3GOEYGCTHIUCH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/67MM3L3BR3BOG3GOEYGCTHIUCH/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-06-24T06:58:21Z","links":{"resolver":"https://pith.science/pith/67MM3L3BR3BOG3GOEYGCTHIUCH","bundle":"https://pith.science/pith/67MM3L3BR3BOG3GOEYGCTHIUCH/bundle.json","state":"https://pith.science/pith/67MM3L3BR3BOG3GOEYGCTHIUCH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/67MM3L3BR3BOG3GOEYGCTHIUCH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:67MM3L3BR3BOG3GOEYGCTHIUCH","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":"7588596d5a74241446e867ddd3cbc9ef15ec9b014667deef05f4af1dfede30d6","cross_cats_sorted":["cs.DS","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-07-01T14:16:33Z","title_canon_sha256":"0219a8a6715f8e98021373e005356d2573059cd0a161f6abc55c9380aa6c3d63"},"schema_version":"1.0","source":{"id":"1107.0234","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.0234","created_at":"2026-05-18T04:19:02Z"},{"alias_kind":"arxiv_version","alias_value":"1107.0234v1","created_at":"2026-05-18T04:19:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.0234","created_at":"2026-05-18T04:19:02Z"},{"alias_kind":"pith_short_12","alias_value":"67MM3L3BR3BO","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"67MM3L3BR3BOG3GO","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"67MM3L3B","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:f0c73b5e0537d476cea421349fdcf3ff629ea0a8445f582498a9bfb20dab2a1b","target":"graph","created_at":"2026-05-18T04:19:02Z","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":"A frequent problem in settings where a unique resource must be shared among users is how to resolve the contention that arises when all of them must use it, but the resource allows only for one user each time. The application of efficient solutions for this problem spans a myriad of settings such as radio communication networks or databases. For the case where the number of users is unknown, recent work has yielded fruitful results for local area networks and radio networks, although either a (possibly loose) upper bound on the number of users needs to be known, or the solution is suboptimal, ","authors_text":"Antonio Fern\\'andez Anta, Jorge Ram\\'on Mu\\~noz, Miguel A. Mosteiro","cross_cats":["cs.DS","cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-07-01T14:16:33Z","title":"Unbounded Contention Resolution in Multiple-Access Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.0234","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:5f5ee89c71b265757c90f37b52cc0d1bce6ec4cfdd766d31c063675ccff90ba6","target":"record","created_at":"2026-05-18T04:19:02Z","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":"7588596d5a74241446e867ddd3cbc9ef15ec9b014667deef05f4af1dfede30d6","cross_cats_sorted":["cs.DS","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-07-01T14:16:33Z","title_canon_sha256":"0219a8a6715f8e98021373e005356d2573059cd0a161f6abc55c9380aa6c3d63"},"schema_version":"1.0","source":{"id":"1107.0234","kind":"arxiv","version":1}},"canonical_sha256":"f7d8cdaf618ec2e36cce260c299d1411ce640feeefc4786ff67fc2f838f1232f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7d8cdaf618ec2e36cce260c299d1411ce640feeefc4786ff67fc2f838f1232f","first_computed_at":"2026-05-18T04:19:02.410768Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:19:02.410768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lTSpazSxIKQep9GnkblFZnZnBe/1R9nbcd/uGwbu4HVVTotaQcC3/fONmQCA5+PMshTrs76pSJfLzYsDHm7CAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:19:02.411401Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.0234","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f5ee89c71b265757c90f37b52cc0d1bce6ec4cfdd766d31c063675ccff90ba6","sha256:f0c73b5e0537d476cea421349fdcf3ff629ea0a8445f582498a9bfb20dab2a1b"],"state_sha256":"fe7a06dfea788f184e8270854f4c83e1734161033a1b5c91152e5f2b7238c1e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"arM/bNgHg4Y6NPjujPWt9NIzPSEPHqOkFM5i2gZtXOR5WCdqvLEnCrLyhu8GeH4GH4IRl03I8aE8GPzmCOzWDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T06:58:21.352234Z","bundle_sha256":"442902e2d13c53b35c553b3eade66b8a31be8b9fef4fb9a50fe8688b15b7b63b"}}