{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:FZS7ZYWFI3KETCXZ5EB2IFW5SQ","short_pith_number":"pith:FZS7ZYWF","schema_version":"1.0","canonical_sha256":"2e65fce2c546d4498af9e903a416dd9411ef824f820b2573fa2573d29880bc5b","source":{"kind":"arxiv","id":"1906.10806","version":1},"attestation_state":"computed","paper":{"title":"Free Ride on LDPC Coded Transmission","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Shancheng Zhao, Suihua Cai, Xiao Ma","submitted_at":"2019-06-26T01:51:37Z","abstract_excerpt":"In this paper, we formulate a new problem to cope with the transmission of extra bits over an existing coded transmission link (referred to as coded payload link) without any cost of extra transmission energy or extra bandwidth. This is possible since a gap to the channel capacity typically exists for a practical code. A new concept, termed as accessible capacity, is introduced to specify the maximum rate at which the superposition transmission of extra bits is reliable and has a negligible effect on the performance of the coded payload link. For a binary-input output-symmetric (BIOS) memoryle"},"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":"1906.10806","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-26T01:51:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"99d154b3eb758f006020975af76c544629d94d00c506e6939b18ebe22924469b","abstract_canon_sha256":"6f11c4ed89c167b00c390aebf32998d12df5c2de54db08ebe939f8cbab289817"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:14.726051Z","signature_b64":"0Az007VUv+IF+e8Y4aLlx0XsELi1+Lg+T5di2qcti008rFNh47/kSdS2ax8aptf8rcSMiU2AW6ybgjAIiOmCDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e65fce2c546d4498af9e903a416dd9411ef824f820b2573fa2573d29880bc5b","last_reissued_at":"2026-05-17T23:42:14.725398Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:14.725398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Free Ride on LDPC Coded Transmission","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Shancheng Zhao, Suihua Cai, Xiao Ma","submitted_at":"2019-06-26T01:51:37Z","abstract_excerpt":"In this paper, we formulate a new problem to cope with the transmission of extra bits over an existing coded transmission link (referred to as coded payload link) without any cost of extra transmission energy or extra bandwidth. This is possible since a gap to the channel capacity typically exists for a practical code. A new concept, termed as accessible capacity, is introduced to specify the maximum rate at which the superposition transmission of extra bits is reliable and has a negligible effect on the performance of the coded payload link. For a binary-input output-symmetric (BIOS) memoryle"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.10806","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":"1906.10806","created_at":"2026-05-17T23:42:14.725480+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.10806v1","created_at":"2026-05-17T23:42:14.725480+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10806","created_at":"2026-05-17T23:42:14.725480+00:00"},{"alias_kind":"pith_short_12","alias_value":"FZS7ZYWFI3KE","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"FZS7ZYWFI3KETCXZ","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"FZS7ZYWF","created_at":"2026-05-18T12:33:18.533446+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/FZS7ZYWFI3KETCXZ5EB2IFW5SQ","json":"https://pith.science/pith/FZS7ZYWFI3KETCXZ5EB2IFW5SQ.json","graph_json":"https://pith.science/api/pith-number/FZS7ZYWFI3KETCXZ5EB2IFW5SQ/graph.json","events_json":"https://pith.science/api/pith-number/FZS7ZYWFI3KETCXZ5EB2IFW5SQ/events.json","paper":"https://pith.science/paper/FZS7ZYWF"},"agent_actions":{"view_html":"https://pith.science/pith/FZS7ZYWFI3KETCXZ5EB2IFW5SQ","download_json":"https://pith.science/pith/FZS7ZYWFI3KETCXZ5EB2IFW5SQ.json","view_paper":"https://pith.science/paper/FZS7ZYWF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.10806&json=true","fetch_graph":"https://pith.science/api/pith-number/FZS7ZYWFI3KETCXZ5EB2IFW5SQ/graph.json","fetch_events":"https://pith.science/api/pith-number/FZS7ZYWFI3KETCXZ5EB2IFW5SQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FZS7ZYWFI3KETCXZ5EB2IFW5SQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FZS7ZYWFI3KETCXZ5EB2IFW5SQ/action/storage_attestation","attest_author":"https://pith.science/pith/FZS7ZYWFI3KETCXZ5EB2IFW5SQ/action/author_attestation","sign_citation":"https://pith.science/pith/FZS7ZYWFI3KETCXZ5EB2IFW5SQ/action/citation_signature","submit_replication":"https://pith.science/pith/FZS7ZYWFI3KETCXZ5EB2IFW5SQ/action/replication_record"}},"created_at":"2026-05-17T23:42:14.725480+00:00","updated_at":"2026-05-17T23:42:14.725480+00:00"}