{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6AWGYDHFQ2AULXXP6BSX7FKM7F","short_pith_number":"pith:6AWGYDHF","canonical_record":{"source":{"id":"1310.7536","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-28T19:03:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"de6a87ee970915766f3ff679ccea287b30d0be90d8d411ab67285b50d9304ed1","abstract_canon_sha256":"520c262d9d12fa4c4a99fae4054467768f6b873a451f24f41034a00f865d44b7"},"schema_version":"1.0"},"canonical_sha256":"f02c6c0ce5868145deeff0657f954cf9669e1f92337902893edb740f219323fe","source":{"kind":"arxiv","id":"1310.7536","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.7536","created_at":"2026-05-18T02:18:51Z"},{"alias_kind":"arxiv_version","alias_value":"1310.7536v1","created_at":"2026-05-18T02:18:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.7536","created_at":"2026-05-18T02:18:51Z"},{"alias_kind":"pith_short_12","alias_value":"6AWGYDHFQ2AU","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6AWGYDHFQ2AULXXP","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6AWGYDHF","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6AWGYDHFQ2AULXXP6BSX7FKM7F","target":"record","payload":{"canonical_record":{"source":{"id":"1310.7536","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-28T19:03:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"de6a87ee970915766f3ff679ccea287b30d0be90d8d411ab67285b50d9304ed1","abstract_canon_sha256":"520c262d9d12fa4c4a99fae4054467768f6b873a451f24f41034a00f865d44b7"},"schema_version":"1.0"},"canonical_sha256":"f02c6c0ce5868145deeff0657f954cf9669e1f92337902893edb740f219323fe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:51.977569Z","signature_b64":"f1iMtfU717xKaUGKBC5j3Qn2r3AwCJc+w+8XXpthtfyt+cD0czD28PTOuD90uQnVKJOKA4JAOo/Il/U99J8RAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f02c6c0ce5868145deeff0657f954cf9669e1f92337902893edb740f219323fe","last_reissued_at":"2026-05-18T02:18:51.976975Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:51.976975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.7536","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-18T02:18:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xn8WeMZ+rU17ippFYgrNf+M+nvF1jf9Kug0hL6bS+fgYY4azDqtksKvHerTzUCMPUKBE/jfJrg5kbFCb+c+5Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:11:56.504557Z"},"content_sha256":"04b157a3e6f1491ccb6f140899f47df7b2554c0e68f4a236943bdd4ac1a958ed","schema_version":"1.0","event_id":"sha256:04b157a3e6f1491ccb6f140899f47df7b2554c0e68f4a236943bdd4ac1a958ed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6AWGYDHFQ2AULXXP6BSX7FKM7F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Constructions of Codes for Asymmetric Channels via Concatenation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bei Zeng, Graeme Smith, John Smolin, Markus Grassl, Peter Shor","submitted_at":"2013-10-28T19:03:20Z","abstract_excerpt":"We present new constructions of codes for asymmetric channels for both binary and nonbinary alphabets, based on methods of generalized code concatenation. For the binary asymmetric channel, our methods construct nonlinear single-error-correcting codes from ternary outer codes. We show that some of the Varshamov-Tenengol'ts-Constantin-Rao codes, a class of binary nonlinear codes for this channel, have a nice structure when viewed as ternary codes. In many cases, our ternary construction yields even better codes. For the nonbinary asymmetric channel, our methods construct linear codes for many l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.7536","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-18T02:18:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jVSlDF8U5hq2ciKi6AhJwUh/9cAbj2tctjPyj/7y9E0djD43VvVuHQKtq5Dod+47m950sdI2Ee0e2bEeN//XDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:11:56.505214Z"},"content_sha256":"d503f9a6df672102fb687a8b9fde28ecfe5b535107070e847b7ab737404158ed","schema_version":"1.0","event_id":"sha256:d503f9a6df672102fb687a8b9fde28ecfe5b535107070e847b7ab737404158ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6AWGYDHFQ2AULXXP6BSX7FKM7F/bundle.json","state_url":"https://pith.science/pith/6AWGYDHFQ2AULXXP6BSX7FKM7F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6AWGYDHFQ2AULXXP6BSX7FKM7F/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-30T17:11:56Z","links":{"resolver":"https://pith.science/pith/6AWGYDHFQ2AULXXP6BSX7FKM7F","bundle":"https://pith.science/pith/6AWGYDHFQ2AULXXP6BSX7FKM7F/bundle.json","state":"https://pith.science/pith/6AWGYDHFQ2AULXXP6BSX7FKM7F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6AWGYDHFQ2AULXXP6BSX7FKM7F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6AWGYDHFQ2AULXXP6BSX7FKM7F","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":"520c262d9d12fa4c4a99fae4054467768f6b873a451f24f41034a00f865d44b7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-28T19:03:20Z","title_canon_sha256":"de6a87ee970915766f3ff679ccea287b30d0be90d8d411ab67285b50d9304ed1"},"schema_version":"1.0","source":{"id":"1310.7536","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.7536","created_at":"2026-05-18T02:18:51Z"},{"alias_kind":"arxiv_version","alias_value":"1310.7536v1","created_at":"2026-05-18T02:18:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.7536","created_at":"2026-05-18T02:18:51Z"},{"alias_kind":"pith_short_12","alias_value":"6AWGYDHFQ2AU","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6AWGYDHFQ2AULXXP","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6AWGYDHF","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:d503f9a6df672102fb687a8b9fde28ecfe5b535107070e847b7ab737404158ed","target":"graph","created_at":"2026-05-18T02:18:51Z","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":"We present new constructions of codes for asymmetric channels for both binary and nonbinary alphabets, based on methods of generalized code concatenation. For the binary asymmetric channel, our methods construct nonlinear single-error-correcting codes from ternary outer codes. We show that some of the Varshamov-Tenengol'ts-Constantin-Rao codes, a class of binary nonlinear codes for this channel, have a nice structure when viewed as ternary codes. In many cases, our ternary construction yields even better codes. For the nonbinary asymmetric channel, our methods construct linear codes for many l","authors_text":"Bei Zeng, Graeme Smith, John Smolin, Markus Grassl, Peter Shor","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-28T19:03:20Z","title":"New Constructions of Codes for Asymmetric Channels via Concatenation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.7536","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:04b157a3e6f1491ccb6f140899f47df7b2554c0e68f4a236943bdd4ac1a958ed","target":"record","created_at":"2026-05-18T02:18:51Z","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":"520c262d9d12fa4c4a99fae4054467768f6b873a451f24f41034a00f865d44b7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-28T19:03:20Z","title_canon_sha256":"de6a87ee970915766f3ff679ccea287b30d0be90d8d411ab67285b50d9304ed1"},"schema_version":"1.0","source":{"id":"1310.7536","kind":"arxiv","version":1}},"canonical_sha256":"f02c6c0ce5868145deeff0657f954cf9669e1f92337902893edb740f219323fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f02c6c0ce5868145deeff0657f954cf9669e1f92337902893edb740f219323fe","first_computed_at":"2026-05-18T02:18:51.976975Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:51.976975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f1iMtfU717xKaUGKBC5j3Qn2r3AwCJc+w+8XXpthtfyt+cD0czD28PTOuD90uQnVKJOKA4JAOo/Il/U99J8RAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:51.977569Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.7536","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04b157a3e6f1491ccb6f140899f47df7b2554c0e68f4a236943bdd4ac1a958ed","sha256:d503f9a6df672102fb687a8b9fde28ecfe5b535107070e847b7ab737404158ed"],"state_sha256":"da3ebc0bd898fbeb299f599ddfcbbfdc3d54589206594bfd3bebf8996c57abfc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xzHgOnJTYuRRJWS8ogeLjix8gQAEfBOBXAItttBK5eBt/t1yni2SqI94vd7ynMWC2xo08xq01TlxFDGVVVrZCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T17:11:56.508458Z","bundle_sha256":"f88369707b3c116433502058b05c1069d27eb28f20959da5df60bed95ad474ed"}}