{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ALAPAIFXQ45TBBLFGQV3RZGN4T","short_pith_number":"pith:ALAPAIFX","canonical_record":{"source":{"id":"1807.09934","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-26T03:12:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"de412575d589757ff79ceb9db2133a689dc1ba4983e3b94017136ab0cc6e7dab","abstract_canon_sha256":"82d5dc66c26288721f57564cfc7d2f4764c18add4c9083630ba189a690ddac29"},"schema_version":"1.0"},"canonical_sha256":"02c0f020b7873b308565342bb8e4cde4f2fed98ff62a38c46d2794e20be74832","source":{"kind":"arxiv","id":"1807.09934","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.09934","created_at":"2026-05-18T00:09:46Z"},{"alias_kind":"arxiv_version","alias_value":"1807.09934v1","created_at":"2026-05-18T00:09:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09934","created_at":"2026-05-18T00:09:46Z"},{"alias_kind":"pith_short_12","alias_value":"ALAPAIFXQ45T","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"ALAPAIFXQ45TBBLF","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"ALAPAIFX","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ALAPAIFXQ45TBBLFGQV3RZGN4T","target":"record","payload":{"canonical_record":{"source":{"id":"1807.09934","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-26T03:12:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"de412575d589757ff79ceb9db2133a689dc1ba4983e3b94017136ab0cc6e7dab","abstract_canon_sha256":"82d5dc66c26288721f57564cfc7d2f4764c18add4c9083630ba189a690ddac29"},"schema_version":"1.0"},"canonical_sha256":"02c0f020b7873b308565342bb8e4cde4f2fed98ff62a38c46d2794e20be74832","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:46.038796Z","signature_b64":"WUTknr5yLYeCOagV0hLCPsVSIe07dwZGcTFSf7kCgy9iwE1W5Y+mn0accoPynjKI8Q9YcMv2ce9iOZ2Q9PFuBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02c0f020b7873b308565342bb8e4cde4f2fed98ff62a38c46d2794e20be74832","last_reissued_at":"2026-05-18T00:09:46.038016Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:46.038016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.09934","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-18T00:09:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2W82QCjsRdpsqM3zPjhLynitQxh2ioPhcZ1Q1g0R5XR+f8Wjn7eItopflKcCxH9/oRCXRZbCJrnuUvKlqMx6Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:32:17.247021Z"},"content_sha256":"06b0f85fb0ded3f712c13417e3ce323184c4ccccbdf6b9fac8db584b8aeeb959","schema_version":"1.0","event_id":"sha256:06b0f85fb0ded3f712c13417e3ce323184c4ccccbdf6b9fac8db584b8aeeb959"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ALAPAIFXQ45TBBLFGQV3RZGN4T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Strongly Asynchronous Massive Access Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniela Tuninetti, Natasha Devroye, Sara Shahi","submitted_at":"2018-07-26T03:12:07Z","abstract_excerpt":"This paper considers a Strongly Asynchronous and Slotted Massive Access Channel (SAS-MAC) where $K_n:=e^{n\\nu}$ different users transmit a randomly selected message among $M_n:=e^{nR}$ ones within a strong asynchronous window of length $A_n:=e^{n\\alpha}$ blocks, where each block lasts $n$ channel uses. A global probability of error is enforced, ensuring that all the users' identities and messages are correctly identified and decoded. Achievability bounds are derived for the case that different users have similar channels, the case that users' channels can be chosen from a set which has polynom"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.09934","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-18T00:09:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0kmMBwRBoBEiXDLlw7p/8qk83F6kUhLA1grglidcKhJB1yooOukUAHmhwZIPGJ/SKJlNWDvu3MWjApQvyY9fBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:32:17.247746Z"},"content_sha256":"62924d1d81554ae9d90bd3e6626a188f04bcbbc61f0f0ca9804bb8a033ca997e","schema_version":"1.0","event_id":"sha256:62924d1d81554ae9d90bd3e6626a188f04bcbbc61f0f0ca9804bb8a033ca997e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ALAPAIFXQ45TBBLFGQV3RZGN4T/bundle.json","state_url":"https://pith.science/pith/ALAPAIFXQ45TBBLFGQV3RZGN4T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ALAPAIFXQ45TBBLFGQV3RZGN4T/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-28T18:32:17Z","links":{"resolver":"https://pith.science/pith/ALAPAIFXQ45TBBLFGQV3RZGN4T","bundle":"https://pith.science/pith/ALAPAIFXQ45TBBLFGQV3RZGN4T/bundle.json","state":"https://pith.science/pith/ALAPAIFXQ45TBBLFGQV3RZGN4T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ALAPAIFXQ45TBBLFGQV3RZGN4T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ALAPAIFXQ45TBBLFGQV3RZGN4T","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":"82d5dc66c26288721f57564cfc7d2f4764c18add4c9083630ba189a690ddac29","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-26T03:12:07Z","title_canon_sha256":"de412575d589757ff79ceb9db2133a689dc1ba4983e3b94017136ab0cc6e7dab"},"schema_version":"1.0","source":{"id":"1807.09934","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.09934","created_at":"2026-05-18T00:09:46Z"},{"alias_kind":"arxiv_version","alias_value":"1807.09934v1","created_at":"2026-05-18T00:09:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09934","created_at":"2026-05-18T00:09:46Z"},{"alias_kind":"pith_short_12","alias_value":"ALAPAIFXQ45T","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"ALAPAIFXQ45TBBLF","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"ALAPAIFX","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:62924d1d81554ae9d90bd3e6626a188f04bcbbc61f0f0ca9804bb8a033ca997e","target":"graph","created_at":"2026-05-18T00:09:46Z","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":"This paper considers a Strongly Asynchronous and Slotted Massive Access Channel (SAS-MAC) where $K_n:=e^{n\\nu}$ different users transmit a randomly selected message among $M_n:=e^{nR}$ ones within a strong asynchronous window of length $A_n:=e^{n\\alpha}$ blocks, where each block lasts $n$ channel uses. A global probability of error is enforced, ensuring that all the users' identities and messages are correctly identified and decoded. Achievability bounds are derived for the case that different users have similar channels, the case that users' channels can be chosen from a set which has polynom","authors_text":"Daniela Tuninetti, Natasha Devroye, Sara Shahi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-26T03:12:07Z","title":"The Strongly Asynchronous Massive Access Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.09934","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:06b0f85fb0ded3f712c13417e3ce323184c4ccccbdf6b9fac8db584b8aeeb959","target":"record","created_at":"2026-05-18T00:09:46Z","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":"82d5dc66c26288721f57564cfc7d2f4764c18add4c9083630ba189a690ddac29","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-26T03:12:07Z","title_canon_sha256":"de412575d589757ff79ceb9db2133a689dc1ba4983e3b94017136ab0cc6e7dab"},"schema_version":"1.0","source":{"id":"1807.09934","kind":"arxiv","version":1}},"canonical_sha256":"02c0f020b7873b308565342bb8e4cde4f2fed98ff62a38c46d2794e20be74832","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"02c0f020b7873b308565342bb8e4cde4f2fed98ff62a38c46d2794e20be74832","first_computed_at":"2026-05-18T00:09:46.038016Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:46.038016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WUTknr5yLYeCOagV0hLCPsVSIe07dwZGcTFSf7kCgy9iwE1W5Y+mn0accoPynjKI8Q9YcMv2ce9iOZ2Q9PFuBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:46.038796Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.09934","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06b0f85fb0ded3f712c13417e3ce323184c4ccccbdf6b9fac8db584b8aeeb959","sha256:62924d1d81554ae9d90bd3e6626a188f04bcbbc61f0f0ca9804bb8a033ca997e"],"state_sha256":"0eb3b2ea3e4b20927bbd3f632e556b22468eaea94a7f80003b764cdbc0ce45e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hLWMQyeRla0pVeq87JXKsunhvAL9Xaz5DNm1Xk7DulrgepsqOghW64l5QuMsLAGTuSjzdAxth3qXb8IGVrYpCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T18:32:17.252196Z","bundle_sha256":"da61003b9e8e05b8a3799c1ca43690f9aa14e54dd59846429d2990b7bc130061"}}