{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:FZS7ZYWFI3KETCXZ5EB2IFW5SQ","short_pith_number":"pith:FZS7ZYWF","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"},"canonical_sha256":"2e65fce2c546d4498af9e903a416dd9411ef824f820b2573fa2573d29880bc5b","source":{"kind":"arxiv","id":"1906.10806","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.10806","created_at":"2026-05-17T23:42:14Z"},{"alias_kind":"arxiv_version","alias_value":"1906.10806v1","created_at":"2026-05-17T23:42:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10806","created_at":"2026-05-17T23:42:14Z"},{"alias_kind":"pith_short_12","alias_value":"FZS7ZYWFI3KE","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"FZS7ZYWFI3KETCXZ","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"FZS7ZYWF","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:FZS7ZYWFI3KETCXZ5EB2IFW5SQ","target":"record","payload":{"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"},"canonical_sha256":"2e65fce2c546d4498af9e903a416dd9411ef824f820b2573fa2573d29880bc5b","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"},"source_kind":"arxiv","source_id":"1906.10806","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:42:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7PGNun5xUJ/1bSPOO26SDRm/wHy8wpcM8hjk0rPIw9Dj86TZhl8ur+a6pX8mBX1q+C4Eh9ACexWyvJU1rbWuBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:17:47.446869Z"},"content_sha256":"2900656b444a6ddff74e162f779ea8a1fc97eae817713beb25c13f4664304d2e","schema_version":"1.0","event_id":"sha256:2900656b444a6ddff74e162f779ea8a1fc97eae817713beb25c13f4664304d2e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:FZS7ZYWFI3KETCXZ5EB2IFW5SQ","target":"graph","payload":{"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"},"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:42:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wrAsM+8GrbkFir9185ztHlNGtEN89ZccmlMSVFIZDm28Y4ezdf9XRCxeomRsKC1e2yz6mBgFoxYjyzsXAsmnDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:17:47.447602Z"},"content_sha256":"703466bd5e180ad1a61a001acf2a3ed492f17a2c17ad7274ece5a54f11e1efba","schema_version":"1.0","event_id":"sha256:703466bd5e180ad1a61a001acf2a3ed492f17a2c17ad7274ece5a54f11e1efba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FZS7ZYWFI3KETCXZ5EB2IFW5SQ/bundle.json","state_url":"https://pith.science/pith/FZS7ZYWFI3KETCXZ5EB2IFW5SQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FZS7ZYWFI3KETCXZ5EB2IFW5SQ/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-31T03:17:47Z","links":{"resolver":"https://pith.science/pith/FZS7ZYWFI3KETCXZ5EB2IFW5SQ","bundle":"https://pith.science/pith/FZS7ZYWFI3KETCXZ5EB2IFW5SQ/bundle.json","state":"https://pith.science/pith/FZS7ZYWFI3KETCXZ5EB2IFW5SQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FZS7ZYWFI3KETCXZ5EB2IFW5SQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:FZS7ZYWFI3KETCXZ5EB2IFW5SQ","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":"6f11c4ed89c167b00c390aebf32998d12df5c2de54db08ebe939f8cbab289817","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-26T01:51:37Z","title_canon_sha256":"99d154b3eb758f006020975af76c544629d94d00c506e6939b18ebe22924469b"},"schema_version":"1.0","source":{"id":"1906.10806","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.10806","created_at":"2026-05-17T23:42:14Z"},{"alias_kind":"arxiv_version","alias_value":"1906.10806v1","created_at":"2026-05-17T23:42:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10806","created_at":"2026-05-17T23:42:14Z"},{"alias_kind":"pith_short_12","alias_value":"FZS7ZYWFI3KE","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"FZS7ZYWFI3KETCXZ","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"FZS7ZYWF","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:703466bd5e180ad1a61a001acf2a3ed492f17a2c17ad7274ece5a54f11e1efba","target":"graph","created_at":"2026-05-17T23:42:14Z","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":"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","authors_text":"Shancheng Zhao, Suihua Cai, Xiao Ma","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-26T01:51:37Z","title":"Free Ride on LDPC Coded Transmission"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.10806","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:2900656b444a6ddff74e162f779ea8a1fc97eae817713beb25c13f4664304d2e","target":"record","created_at":"2026-05-17T23:42:14Z","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":"6f11c4ed89c167b00c390aebf32998d12df5c2de54db08ebe939f8cbab289817","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-26T01:51:37Z","title_canon_sha256":"99d154b3eb758f006020975af76c544629d94d00c506e6939b18ebe22924469b"},"schema_version":"1.0","source":{"id":"1906.10806","kind":"arxiv","version":1}},"canonical_sha256":"2e65fce2c546d4498af9e903a416dd9411ef824f820b2573fa2573d29880bc5b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e65fce2c546d4498af9e903a416dd9411ef824f820b2573fa2573d29880bc5b","first_computed_at":"2026-05-17T23:42:14.725398Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:14.725398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0Az007VUv+IF+e8Y4aLlx0XsELi1+Lg+T5di2qcti008rFNh47/kSdS2ax8aptf8rcSMiU2AW6ybgjAIiOmCDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:14.726051Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.10806","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2900656b444a6ddff74e162f779ea8a1fc97eae817713beb25c13f4664304d2e","sha256:703466bd5e180ad1a61a001acf2a3ed492f17a2c17ad7274ece5a54f11e1efba"],"state_sha256":"995cc7e1bb59a5d10b5bfb0149f5eba2c284f629065c552567b17b6b16e48725"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lKCVf85Uvec505dM3fDVGRu9OLAXQ06k9wLCHZKRBgiBGDUDMLAfX676hYlk3gWykP61FBUzVCXil0UybmlXCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:17:47.451508Z","bundle_sha256":"368dae48b426cfb7cc0983cd2d06d3c4816d4108141b8119b84896f299f87fc6"}}