{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5G6VM42SYAHITKPHJ6D52JPU66","short_pith_number":"pith:5G6VM42S","canonical_record":{"source":{"id":"1905.02761","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-07T18:33:00Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"47b3b331930483884be23472ab217f04edf071035f235843117e61d919b5c011","abstract_canon_sha256":"050a989be0c1c85482c021747df592e8b5bb83058085072cf5f4373d00f69d5c"},"schema_version":"1.0"},"canonical_sha256":"e9bd567352c00e89a9e74f87dd25f4f793dd1865a8796062b9b168e406585d58","source":{"kind":"arxiv","id":"1905.02761","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.02761","created_at":"2026-05-17T23:46:45Z"},{"alias_kind":"arxiv_version","alias_value":"1905.02761v1","created_at":"2026-05-17T23:46:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.02761","created_at":"2026-05-17T23:46:45Z"},{"alias_kind":"pith_short_12","alias_value":"5G6VM42SYAHI","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5G6VM42SYAHITKPH","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5G6VM42S","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5G6VM42SYAHITKPHJ6D52JPU66","target":"record","payload":{"canonical_record":{"source":{"id":"1905.02761","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-07T18:33:00Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"47b3b331930483884be23472ab217f04edf071035f235843117e61d919b5c011","abstract_canon_sha256":"050a989be0c1c85482c021747df592e8b5bb83058085072cf5f4373d00f69d5c"},"schema_version":"1.0"},"canonical_sha256":"e9bd567352c00e89a9e74f87dd25f4f793dd1865a8796062b9b168e406585d58","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:45.449698Z","signature_b64":"35JdRxqovHcfni6JgnU3oln5yGPFDvTQiRycMADUsbhe/TIAVIlxaUS9dvL0vMbkaHYtwy4KpxBfmAcECzPwDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9bd567352c00e89a9e74f87dd25f4f793dd1865a8796062b9b168e406585d58","last_reissued_at":"2026-05-17T23:46:45.449168Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:45.449168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.02761","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-17T23:46:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OzNftk650kg597J4GDSPRZeCEc/YzexOIol2fV5zPfECq4vciIywQUFzcZ9HTK+rFJmDUOkE0b2IkCZg+MyFCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T14:15:00.491068Z"},"content_sha256":"066842dc391d3a33c74d0c3d7ea5e3c291a59f4cf814ff783d9d1e4a33a3b3b2","schema_version":"1.0","event_id":"sha256:066842dc391d3a33c74d0c3d7ea5e3c291a59f4cf814ff783d9d1e4a33a3b3b2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5G6VM42SYAHITKPHJ6D52JPU66","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Code Design Principles for Ultra-Reliable Random Access with Preassigned Patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Antti Laaksonen, Christopher Boyd, Olav Tirkkonen, Roope Vehkalahti","submitted_at":"2019-05-07T18:33:00Z","abstract_excerpt":"We study medium access control layer random access under the assumption that the receiver can perform successive interference cancellation, without feedback. During recent years, a number of protocols with impressive error performance have been suggested for this channel model. However, the random nature of these protocols causes an error floor which limits their usability when targeting ultra-reliable communications. In very recent works by Paolini et al. and Boyd et. al., it was shown that if each user employs predetermined combinatorial access patterns, this error floor disappears. In this "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.02761","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-17T23:46:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G0voB4ClMdMUx4Vl3x3CizDpQ2tGy23ljlk/sqAcvbZtB7u7Xp30FzSAbvWO8ygy0taIaZXrNdGluRCKJQjrBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T14:15:00.491478Z"},"content_sha256":"b809234be2a8aa724818f05ad15122de6d885df706bf0fa26703e8ac40ad2e3d","schema_version":"1.0","event_id":"sha256:b809234be2a8aa724818f05ad15122de6d885df706bf0fa26703e8ac40ad2e3d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5G6VM42SYAHITKPHJ6D52JPU66/bundle.json","state_url":"https://pith.science/pith/5G6VM42SYAHITKPHJ6D52JPU66/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5G6VM42SYAHITKPHJ6D52JPU66/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-21T14:15:00Z","links":{"resolver":"https://pith.science/pith/5G6VM42SYAHITKPHJ6D52JPU66","bundle":"https://pith.science/pith/5G6VM42SYAHITKPHJ6D52JPU66/bundle.json","state":"https://pith.science/pith/5G6VM42SYAHITKPHJ6D52JPU66/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5G6VM42SYAHITKPHJ6D52JPU66/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5G6VM42SYAHITKPHJ6D52JPU66","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":"050a989be0c1c85482c021747df592e8b5bb83058085072cf5f4373d00f69d5c","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-07T18:33:00Z","title_canon_sha256":"47b3b331930483884be23472ab217f04edf071035f235843117e61d919b5c011"},"schema_version":"1.0","source":{"id":"1905.02761","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.02761","created_at":"2026-05-17T23:46:45Z"},{"alias_kind":"arxiv_version","alias_value":"1905.02761v1","created_at":"2026-05-17T23:46:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.02761","created_at":"2026-05-17T23:46:45Z"},{"alias_kind":"pith_short_12","alias_value":"5G6VM42SYAHI","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5G6VM42SYAHITKPH","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5G6VM42S","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:b809234be2a8aa724818f05ad15122de6d885df706bf0fa26703e8ac40ad2e3d","target":"graph","created_at":"2026-05-17T23:46:45Z","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 study medium access control layer random access under the assumption that the receiver can perform successive interference cancellation, without feedback. During recent years, a number of protocols with impressive error performance have been suggested for this channel model. However, the random nature of these protocols causes an error floor which limits their usability when targeting ultra-reliable communications. In very recent works by Paolini et al. and Boyd et. al., it was shown that if each user employs predetermined combinatorial access patterns, this error floor disappears. In this ","authors_text":"Antti Laaksonen, Christopher Boyd, Olav Tirkkonen, Roope Vehkalahti","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-07T18:33:00Z","title":"Code Design Principles for Ultra-Reliable Random Access with Preassigned Patterns"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.02761","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:066842dc391d3a33c74d0c3d7ea5e3c291a59f4cf814ff783d9d1e4a33a3b3b2","target":"record","created_at":"2026-05-17T23:46:45Z","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":"050a989be0c1c85482c021747df592e8b5bb83058085072cf5f4373d00f69d5c","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-07T18:33:00Z","title_canon_sha256":"47b3b331930483884be23472ab217f04edf071035f235843117e61d919b5c011"},"schema_version":"1.0","source":{"id":"1905.02761","kind":"arxiv","version":1}},"canonical_sha256":"e9bd567352c00e89a9e74f87dd25f4f793dd1865a8796062b9b168e406585d58","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9bd567352c00e89a9e74f87dd25f4f793dd1865a8796062b9b168e406585d58","first_computed_at":"2026-05-17T23:46:45.449168Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:45.449168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"35JdRxqovHcfni6JgnU3oln5yGPFDvTQiRycMADUsbhe/TIAVIlxaUS9dvL0vMbkaHYtwy4KpxBfmAcECzPwDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:45.449698Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.02761","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:066842dc391d3a33c74d0c3d7ea5e3c291a59f4cf814ff783d9d1e4a33a3b3b2","sha256:b809234be2a8aa724818f05ad15122de6d885df706bf0fa26703e8ac40ad2e3d"],"state_sha256":"2fc6f565c5d5080e4c1186b46cb59a6fc441c1e8102a426af8cecf51dfa3f43c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Uojc9lehS4JMLOqLTmxy8n5LMXt4drvbBmz8JaDzC7qYgZpwyBBMGdLF3Yu1cQx1ILgpKGkBmXUK37M5XNgBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T14:15:00.493544Z","bundle_sha256":"f8bbed720add9c9ead081851a3bd844116c25145e6319c4e2ab10f38275e6f3e"}}