{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:KTE76S4UFJD2X3DQ4PJP64QDWY","short_pith_number":"pith:KTE76S4U","canonical_record":{"source":{"id":"1908.01607","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-05T13:26:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"48d50be0918c7e0e29662d149b6d1dcaa1ac9b412aa835846106990fb63e9115","abstract_canon_sha256":"f843638820f4a4e42cec6ffd60fc92fb81119b3cf55696410db97375162e6052"},"schema_version":"1.0"},"canonical_sha256":"54c9ff4b942a47abec70e3d2ff7203b61d4ec3c43a49f7d2d1a5470389a9a0e4","source":{"kind":"arxiv","id":"1908.01607","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.01607","created_at":"2026-07-04T23:51:32Z"},{"alias_kind":"arxiv_version","alias_value":"1908.01607v1","created_at":"2026-07-04T23:51:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01607","created_at":"2026-07-04T23:51:32Z"},{"alias_kind":"pith_short_12","alias_value":"KTE76S4UFJD2","created_at":"2026-07-04T23:51:32Z"},{"alias_kind":"pith_short_16","alias_value":"KTE76S4UFJD2X3DQ","created_at":"2026-07-04T23:51:32Z"},{"alias_kind":"pith_short_8","alias_value":"KTE76S4U","created_at":"2026-07-04T23:51:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:KTE76S4UFJD2X3DQ4PJP64QDWY","target":"record","payload":{"canonical_record":{"source":{"id":"1908.01607","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-05T13:26:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"48d50be0918c7e0e29662d149b6d1dcaa1ac9b412aa835846106990fb63e9115","abstract_canon_sha256":"f843638820f4a4e42cec6ffd60fc92fb81119b3cf55696410db97375162e6052"},"schema_version":"1.0"},"canonical_sha256":"54c9ff4b942a47abec70e3d2ff7203b61d4ec3c43a49f7d2d1a5470389a9a0e4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:51:32.133370Z","signature_b64":"42YW+1oncoVwR35i+uWTMIzUgZ34E5fJAzrCIyTpJgL9brzORhfdn+lZjHcnDky0Co/5sWKcOcJzoJz1Jc7/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54c9ff4b942a47abec70e3d2ff7203b61d4ec3c43a49f7d2d1a5470389a9a0e4","last_reissued_at":"2026-07-04T23:51:32.133012Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:51:32.133012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.01607","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-07-04T23:51:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eNKF3xUNlxNvHcwFM25q8XAlJRSGC6bUZJONfaqPkAQDvYDKlrfK+L8HJ+H2l9NvVcjIJ1nmjcm6jpQJzvyzDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T05:52:00.120176Z"},"content_sha256":"be4026f7fd21d51d6f2f128d78aa7d1883dedd1921acce1d3e6e7456a309d036","schema_version":"1.0","event_id":"sha256:be4026f7fd21d51d6f2f128d78aa7d1883dedd1921acce1d3e6e7456a309d036"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:KTE76S4UFJD2X3DQ4PJP64QDWY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Protograph LDPC Code Design for Asynchronous Random Access","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Balazs Matuz, Federico Clazzer, Mahyar Shirvanimoghaddam, Sachini Jayasooriya, Sarah J. Johnson","submitted_at":"2019-08-05T13:26:12Z","abstract_excerpt":"This work addresses the physical layer channel code design for an uncoordinated, frame- and slot-asynchronous random access protocol. Starting from the observation that collisions between two users yield very specific interference patterns, we define a surrogate channel model and propose different protograph low-density parity-check code designs. The proposed codes are both tested in a setup where the physical layer is abstracted, as well as on a more realistic channel model, where finite-length physical layer simulations of the entire asynchronous random access scheme, including decoding are "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01607","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.01607/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T23:51:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pNebyUxrnnPzvAV6Bj+H8Qbo85zXQU7Cq5XXXFUBnjoPt/hwD2VOiLRUbVkVBmbkm0TAgRNMmxBs2CZZ67iRBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T05:52:00.120813Z"},"content_sha256":"036b6fe0fe35eed4719550f630a24d6b9669eba1ef913b39d1623f85bfbc6131","schema_version":"1.0","event_id":"sha256:036b6fe0fe35eed4719550f630a24d6b9669eba1ef913b39d1623f85bfbc6131"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KTE76S4UFJD2X3DQ4PJP64QDWY/bundle.json","state_url":"https://pith.science/pith/KTE76S4UFJD2X3DQ4PJP64QDWY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KTE76S4UFJD2X3DQ4PJP64QDWY/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-08-21T05:52:00Z","links":{"resolver":"https://pith.science/pith/KTE76S4UFJD2X3DQ4PJP64QDWY","bundle":"https://pith.science/pith/KTE76S4UFJD2X3DQ4PJP64QDWY/bundle.json","state":"https://pith.science/pith/KTE76S4UFJD2X3DQ4PJP64QDWY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KTE76S4UFJD2X3DQ4PJP64QDWY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KTE76S4UFJD2X3DQ4PJP64QDWY","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":"f843638820f4a4e42cec6ffd60fc92fb81119b3cf55696410db97375162e6052","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-05T13:26:12Z","title_canon_sha256":"48d50be0918c7e0e29662d149b6d1dcaa1ac9b412aa835846106990fb63e9115"},"schema_version":"1.0","source":{"id":"1908.01607","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.01607","created_at":"2026-07-04T23:51:32Z"},{"alias_kind":"arxiv_version","alias_value":"1908.01607v1","created_at":"2026-07-04T23:51:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01607","created_at":"2026-07-04T23:51:32Z"},{"alias_kind":"pith_short_12","alias_value":"KTE76S4UFJD2","created_at":"2026-07-04T23:51:32Z"},{"alias_kind":"pith_short_16","alias_value":"KTE76S4UFJD2X3DQ","created_at":"2026-07-04T23:51:32Z"},{"alias_kind":"pith_short_8","alias_value":"KTE76S4U","created_at":"2026-07-04T23:51:32Z"}],"graph_snapshots":[{"event_id":"sha256:036b6fe0fe35eed4719550f630a24d6b9669eba1ef913b39d1623f85bfbc6131","target":"graph","created_at":"2026-07-04T23:51:32Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.01607/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This work addresses the physical layer channel code design for an uncoordinated, frame- and slot-asynchronous random access protocol. Starting from the observation that collisions between two users yield very specific interference patterns, we define a surrogate channel model and propose different protograph low-density parity-check code designs. The proposed codes are both tested in a setup where the physical layer is abstracted, as well as on a more realistic channel model, where finite-length physical layer simulations of the entire asynchronous random access scheme, including decoding are ","authors_text":"Balazs Matuz, Federico Clazzer, Mahyar Shirvanimoghaddam, Sachini Jayasooriya, Sarah J. Johnson","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-05T13:26:12Z","title":"Protograph LDPC Code Design for Asynchronous Random Access"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01607","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:be4026f7fd21d51d6f2f128d78aa7d1883dedd1921acce1d3e6e7456a309d036","target":"record","created_at":"2026-07-04T23:51:32Z","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":"f843638820f4a4e42cec6ffd60fc92fb81119b3cf55696410db97375162e6052","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-05T13:26:12Z","title_canon_sha256":"48d50be0918c7e0e29662d149b6d1dcaa1ac9b412aa835846106990fb63e9115"},"schema_version":"1.0","source":{"id":"1908.01607","kind":"arxiv","version":1}},"canonical_sha256":"54c9ff4b942a47abec70e3d2ff7203b61d4ec3c43a49f7d2d1a5470389a9a0e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"54c9ff4b942a47abec70e3d2ff7203b61d4ec3c43a49f7d2d1a5470389a9a0e4","first_computed_at":"2026-07-04T23:51:32.133012Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:51:32.133012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"42YW+1oncoVwR35i+uWTMIzUgZ34E5fJAzrCIyTpJgL9brzORhfdn+lZjHcnDky0Co/5sWKcOcJzoJz1Jc7/Ag==","signature_status":"signed_v1","signed_at":"2026-07-04T23:51:32.133370Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.01607","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be4026f7fd21d51d6f2f128d78aa7d1883dedd1921acce1d3e6e7456a309d036","sha256:036b6fe0fe35eed4719550f630a24d6b9669eba1ef913b39d1623f85bfbc6131"],"state_sha256":"eb7edb4253029d0cb03044804439d112f64b5e9034c2930159247cd26bb661b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zJy+8CYcoSKKsiXVDY0HNELAlVM4mQm8NGeqfQHG7IFKcZVmJna0aaByQMoE5E6aSKBburipQFX6KmyCT7TVCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T05:52:00.126100Z","bundle_sha256":"fb9b869ccb8cbbcae5a72f5605733281767eb08a06d942f817ba80884b70a2f6"}}