{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:PTR6KFLPIDLJVF3EEBSDOXZ57V","short_pith_number":"pith:PTR6KFLP","canonical_record":{"source":{"id":"1010.0642","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-04T17:06:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"33714b6a529359aa91409635f67a86471209446527f036efbbefed382185eb49","abstract_canon_sha256":"12e087eac08c0b4081e8c6949ce3fa6ffbd53ea1c5830de78d2bbb939f70cb38"},"schema_version":"1.0"},"canonical_sha256":"7ce3e5156f40d69a97642064375f3dfd5fb9d9a933309f9a83d3e4031cf7668a","source":{"kind":"arxiv","id":"1010.0642","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.0642","created_at":"2026-05-18T00:59:10Z"},{"alias_kind":"arxiv_version","alias_value":"1010.0642v1","created_at":"2026-05-18T00:59:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0642","created_at":"2026-05-18T00:59:10Z"},{"alias_kind":"pith_short_12","alias_value":"PTR6KFLPIDLJ","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"PTR6KFLPIDLJVF3E","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"PTR6KFLP","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:PTR6KFLPIDLJVF3EEBSDOXZ57V","target":"record","payload":{"canonical_record":{"source":{"id":"1010.0642","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-04T17:06:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"33714b6a529359aa91409635f67a86471209446527f036efbbefed382185eb49","abstract_canon_sha256":"12e087eac08c0b4081e8c6949ce3fa6ffbd53ea1c5830de78d2bbb939f70cb38"},"schema_version":"1.0"},"canonical_sha256":"7ce3e5156f40d69a97642064375f3dfd5fb9d9a933309f9a83d3e4031cf7668a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:10.748590Z","signature_b64":"fk0gxRW0b7cq/KPNZDcJFTByOR82SpqsiuQMJOyILZdrAbjHHnIl1tRvjYxD/+PXmh4u5LtVJob1d8/WH6WADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ce3e5156f40d69a97642064375f3dfd5fb9d9a933309f9a83d3e4031cf7668a","last_reissued_at":"2026-05-18T00:59:10.747910Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:10.747910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.0642","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:59:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LliXneyUbHVsZwnDlQ+n46jw48IGSykiyUd7a+/k16jsxOayPgvgLk5QSE9oJLS7sNrh7+Aj7WQvSzIPp8zmBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T08:13:24.488529Z"},"content_sha256":"2cd945945aaf167b2819f69098b451978299ca2d3e727002255866a8c7554933","schema_version":"1.0","event_id":"sha256:2cd945945aaf167b2819f69098b451978299ca2d3e727002255866a8c7554933"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:PTR6KFLPIDLJVF3EEBSDOXZ57V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Error Performance of Channel Coding in Random Access Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jie Luo, Zheng Wang","submitted_at":"2010-10-04T17:06:10Z","abstract_excerpt":"A new channel coding approach was proposed in [1] for random multiple access communication over the discrete-time memoryless channel. The coding approach allows users to choose their communication rates independently without sharing the rate information among each other or with the receiver. The receiver will either decode the message or report a collision depending on whether reliable message recovery is possible. It was shown that, asymptotically as the codeword length goes to infinity, the set of communication rates supporting reliable message recovery can be characterized by an achievable "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.0642","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:59:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rCvJ9FcbXpYGhCYUOXBkApAKH1a6bvvsPNs1hptzwGp90OP2kY3noqdhCjGm+Cmdk65/hujsLSkMTgAVyFniAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T08:13:24.488887Z"},"content_sha256":"e5fd4a7302269d6dd2fea5a087a45bdbc867898d9acae014943029b654fd069e","schema_version":"1.0","event_id":"sha256:e5fd4a7302269d6dd2fea5a087a45bdbc867898d9acae014943029b654fd069e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PTR6KFLPIDLJVF3EEBSDOXZ57V/bundle.json","state_url":"https://pith.science/pith/PTR6KFLPIDLJVF3EEBSDOXZ57V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PTR6KFLPIDLJVF3EEBSDOXZ57V/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-05T08:13:24Z","links":{"resolver":"https://pith.science/pith/PTR6KFLPIDLJVF3EEBSDOXZ57V","bundle":"https://pith.science/pith/PTR6KFLPIDLJVF3EEBSDOXZ57V/bundle.json","state":"https://pith.science/pith/PTR6KFLPIDLJVF3EEBSDOXZ57V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PTR6KFLPIDLJVF3EEBSDOXZ57V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:PTR6KFLPIDLJVF3EEBSDOXZ57V","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":"12e087eac08c0b4081e8c6949ce3fa6ffbd53ea1c5830de78d2bbb939f70cb38","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-04T17:06:10Z","title_canon_sha256":"33714b6a529359aa91409635f67a86471209446527f036efbbefed382185eb49"},"schema_version":"1.0","source":{"id":"1010.0642","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.0642","created_at":"2026-05-18T00:59:10Z"},{"alias_kind":"arxiv_version","alias_value":"1010.0642v1","created_at":"2026-05-18T00:59:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0642","created_at":"2026-05-18T00:59:10Z"},{"alias_kind":"pith_short_12","alias_value":"PTR6KFLPIDLJ","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"PTR6KFLPIDLJVF3E","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"PTR6KFLP","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:e5fd4a7302269d6dd2fea5a087a45bdbc867898d9acae014943029b654fd069e","target":"graph","created_at":"2026-05-18T00:59:10Z","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 new channel coding approach was proposed in [1] for random multiple access communication over the discrete-time memoryless channel. The coding approach allows users to choose their communication rates independently without sharing the rate information among each other or with the receiver. The receiver will either decode the message or report a collision depending on whether reliable message recovery is possible. It was shown that, asymptotically as the codeword length goes to infinity, the set of communication rates supporting reliable message recovery can be characterized by an achievable ","authors_text":"Jie Luo, Zheng Wang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-04T17:06:10Z","title":"Error Performance of Channel Coding in Random Access Communication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.0642","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:2cd945945aaf167b2819f69098b451978299ca2d3e727002255866a8c7554933","target":"record","created_at":"2026-05-18T00:59:10Z","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":"12e087eac08c0b4081e8c6949ce3fa6ffbd53ea1c5830de78d2bbb939f70cb38","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-04T17:06:10Z","title_canon_sha256":"33714b6a529359aa91409635f67a86471209446527f036efbbefed382185eb49"},"schema_version":"1.0","source":{"id":"1010.0642","kind":"arxiv","version":1}},"canonical_sha256":"7ce3e5156f40d69a97642064375f3dfd5fb9d9a933309f9a83d3e4031cf7668a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ce3e5156f40d69a97642064375f3dfd5fb9d9a933309f9a83d3e4031cf7668a","first_computed_at":"2026-05-18T00:59:10.747910Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:10.747910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fk0gxRW0b7cq/KPNZDcJFTByOR82SpqsiuQMJOyILZdrAbjHHnIl1tRvjYxD/+PXmh4u5LtVJob1d8/WH6WADw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:10.748590Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.0642","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2cd945945aaf167b2819f69098b451978299ca2d3e727002255866a8c7554933","sha256:e5fd4a7302269d6dd2fea5a087a45bdbc867898d9acae014943029b654fd069e"],"state_sha256":"2854cbd9cdde6622c95c52f25258e8e2e94347084e5b8c6362ee419225e0d45b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Srp843Id2yDO5JLVShvMdKjba/B+/sSoSS82Aite8wMuknPLEOmMpNknx4v0pH6W6C4Vw62DzEHMrDUppAdWCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T08:13:24.490928Z","bundle_sha256":"bfca52e2df61f892727b3bc183f4be3e09fa618234514eae42adde3b868eaada"}}