{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:PTR6KFLPIDLJVF3EEBSDOXZ57V","short_pith_number":"pith:PTR6KFLP","schema_version":"1.0","canonical_sha256":"7ce3e5156f40d69a97642064375f3dfd5fb9d9a933309f9a83d3e4031cf7668a","source":{"kind":"arxiv","id":"1010.0642","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1010.0642","created_at":"2026-05-18T00:59:10.748011+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.0642v1","created_at":"2026-05-18T00:59:10.748011+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0642","created_at":"2026-05-18T00:59:10.748011+00:00"},{"alias_kind":"pith_short_12","alias_value":"PTR6KFLPIDLJ","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"PTR6KFLPIDLJVF3E","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"PTR6KFLP","created_at":"2026-05-18T12:26:12.377268+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PTR6KFLPIDLJVF3EEBSDOXZ57V","json":"https://pith.science/pith/PTR6KFLPIDLJVF3EEBSDOXZ57V.json","graph_json":"https://pith.science/api/pith-number/PTR6KFLPIDLJVF3EEBSDOXZ57V/graph.json","events_json":"https://pith.science/api/pith-number/PTR6KFLPIDLJVF3EEBSDOXZ57V/events.json","paper":"https://pith.science/paper/PTR6KFLP"},"agent_actions":{"view_html":"https://pith.science/pith/PTR6KFLPIDLJVF3EEBSDOXZ57V","download_json":"https://pith.science/pith/PTR6KFLPIDLJVF3EEBSDOXZ57V.json","view_paper":"https://pith.science/paper/PTR6KFLP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.0642&json=true","fetch_graph":"https://pith.science/api/pith-number/PTR6KFLPIDLJVF3EEBSDOXZ57V/graph.json","fetch_events":"https://pith.science/api/pith-number/PTR6KFLPIDLJVF3EEBSDOXZ57V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PTR6KFLPIDLJVF3EEBSDOXZ57V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PTR6KFLPIDLJVF3EEBSDOXZ57V/action/storage_attestation","attest_author":"https://pith.science/pith/PTR6KFLPIDLJVF3EEBSDOXZ57V/action/author_attestation","sign_citation":"https://pith.science/pith/PTR6KFLPIDLJVF3EEBSDOXZ57V/action/citation_signature","submit_replication":"https://pith.science/pith/PTR6KFLPIDLJVF3EEBSDOXZ57V/action/replication_record"}},"created_at":"2026-05-18T00:59:10.748011+00:00","updated_at":"2026-05-18T00:59:10.748011+00:00"}