{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PORGDGU33F5U6QG4636FX2I3YZ","short_pith_number":"pith:PORGDGU3","canonical_record":{"source":{"id":"1701.07112","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-24T23:49:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ec30ea0177bfef3e343afec6dc8aa3c8305e4607189ec3c3417697c6cc11a548","abstract_canon_sha256":"226e60ba5d7049da532cb217eb05b8aac0d6a4968d621d82f496db0909907b98"},"schema_version":"1.0"},"canonical_sha256":"7ba2619a9bd97b4f40dcf6fc5be91bc661ce287586145bfcfbc3ce6f8c9e621f","source":{"kind":"arxiv","id":"1701.07112","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.07112","created_at":"2026-05-18T00:52:07Z"},{"alias_kind":"arxiv_version","alias_value":"1701.07112v1","created_at":"2026-05-18T00:52:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07112","created_at":"2026-05-18T00:52:07Z"},{"alias_kind":"pith_short_12","alias_value":"PORGDGU33F5U","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PORGDGU33F5U6QG4","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PORGDGU3","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PORGDGU33F5U6QG4636FX2I3YZ","target":"record","payload":{"canonical_record":{"source":{"id":"1701.07112","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-24T23:49:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ec30ea0177bfef3e343afec6dc8aa3c8305e4607189ec3c3417697c6cc11a548","abstract_canon_sha256":"226e60ba5d7049da532cb217eb05b8aac0d6a4968d621d82f496db0909907b98"},"schema_version":"1.0"},"canonical_sha256":"7ba2619a9bd97b4f40dcf6fc5be91bc661ce287586145bfcfbc3ce6f8c9e621f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:07.474074Z","signature_b64":"IbyGxoFDdANjreG2A8cNWJg+ilZJCUmDbXxhyTmlboTts9kGZyC2zm5pIPgXNemxpfGkydHpoYbPOAfSCOdLBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ba2619a9bd97b4f40dcf6fc5be91bc661ce287586145bfcfbc3ce6f8c9e621f","last_reissued_at":"2026-05-18T00:52:07.473470Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:07.473470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.07112","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:52:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HUumohhV6rLlQdoc60kkp8bE3qzUXUTF65TTgv1pgJFuTxsr9B1Bkf3ImfLLWk6py8N7JPr/CyCxYs5xBdTcBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T12:00:19.428421Z"},"content_sha256":"9ad414048106c17c8a8f938659d2bdd4d5d324dafc6da7742afade732b4c072d","schema_version":"1.0","event_id":"sha256:9ad414048106c17c8a8f938659d2bdd4d5d324dafc6da7742afade732b4c072d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PORGDGU33F5U6QG4636FX2I3YZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Attaining Capacity with Algebraic Geometry Codes through the $(U|U+V)$ Construction and Koetter-Vardy Soft Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Irene Marquez-Corbella, Jean-Pierre Tillich","submitted_at":"2017-01-24T23:49:04Z","abstract_excerpt":"In this paper we show how to attain the capacity of discrete symmetric channels with polynomial time decoding complexity by considering iterated $(U|U+V)$ constructions with Reed-Solomon code or algebraic geometry code components. These codes are decoded with a recursive computation of the {\\em a posteriori} probabilities of the code symbols together with the Koetter-Vardy soft decoder used for decoding the code components in polynomial time. We show that when the number of levels of the iterated $(U|U+V)$ construction tends to infinity, we attain the capacity of any discrete symmetric channel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07112","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:52:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9pHmAIghJxqGZpwcsQ0XHF2YAINUmoWSpaS5IiH+COQIA0iHgVz6jySBTyJtECxV3H1gfVIC2Pa5F6v8eeBuBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T12:00:19.429006Z"},"content_sha256":"eb3908ae5b0462a43802954a11276c17ff5f303b70601c7386a44cf0c4008548","schema_version":"1.0","event_id":"sha256:eb3908ae5b0462a43802954a11276c17ff5f303b70601c7386a44cf0c4008548"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PORGDGU33F5U6QG4636FX2I3YZ/bundle.json","state_url":"https://pith.science/pith/PORGDGU33F5U6QG4636FX2I3YZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PORGDGU33F5U6QG4636FX2I3YZ/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-07T12:00:19Z","links":{"resolver":"https://pith.science/pith/PORGDGU33F5U6QG4636FX2I3YZ","bundle":"https://pith.science/pith/PORGDGU33F5U6QG4636FX2I3YZ/bundle.json","state":"https://pith.science/pith/PORGDGU33F5U6QG4636FX2I3YZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PORGDGU33F5U6QG4636FX2I3YZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PORGDGU33F5U6QG4636FX2I3YZ","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":"226e60ba5d7049da532cb217eb05b8aac0d6a4968d621d82f496db0909907b98","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-24T23:49:04Z","title_canon_sha256":"ec30ea0177bfef3e343afec6dc8aa3c8305e4607189ec3c3417697c6cc11a548"},"schema_version":"1.0","source":{"id":"1701.07112","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.07112","created_at":"2026-05-18T00:52:07Z"},{"alias_kind":"arxiv_version","alias_value":"1701.07112v1","created_at":"2026-05-18T00:52:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07112","created_at":"2026-05-18T00:52:07Z"},{"alias_kind":"pith_short_12","alias_value":"PORGDGU33F5U","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PORGDGU33F5U6QG4","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PORGDGU3","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:eb3908ae5b0462a43802954a11276c17ff5f303b70601c7386a44cf0c4008548","target":"graph","created_at":"2026-05-18T00:52:07Z","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 show how to attain the capacity of discrete symmetric channels with polynomial time decoding complexity by considering iterated $(U|U+V)$ constructions with Reed-Solomon code or algebraic geometry code components. These codes are decoded with a recursive computation of the {\\em a posteriori} probabilities of the code symbols together with the Koetter-Vardy soft decoder used for decoding the code components in polynomial time. We show that when the number of levels of the iterated $(U|U+V)$ construction tends to infinity, we attain the capacity of any discrete symmetric channel","authors_text":"Irene Marquez-Corbella, Jean-Pierre Tillich","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-24T23:49:04Z","title":"Attaining Capacity with Algebraic Geometry Codes through the $(U|U+V)$ Construction and Koetter-Vardy Soft Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07112","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:9ad414048106c17c8a8f938659d2bdd4d5d324dafc6da7742afade732b4c072d","target":"record","created_at":"2026-05-18T00:52:07Z","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":"226e60ba5d7049da532cb217eb05b8aac0d6a4968d621d82f496db0909907b98","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-24T23:49:04Z","title_canon_sha256":"ec30ea0177bfef3e343afec6dc8aa3c8305e4607189ec3c3417697c6cc11a548"},"schema_version":"1.0","source":{"id":"1701.07112","kind":"arxiv","version":1}},"canonical_sha256":"7ba2619a9bd97b4f40dcf6fc5be91bc661ce287586145bfcfbc3ce6f8c9e621f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ba2619a9bd97b4f40dcf6fc5be91bc661ce287586145bfcfbc3ce6f8c9e621f","first_computed_at":"2026-05-18T00:52:07.473470Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:07.473470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IbyGxoFDdANjreG2A8cNWJg+ilZJCUmDbXxhyTmlboTts9kGZyC2zm5pIPgXNemxpfGkydHpoYbPOAfSCOdLBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:07.474074Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.07112","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ad414048106c17c8a8f938659d2bdd4d5d324dafc6da7742afade732b4c072d","sha256:eb3908ae5b0462a43802954a11276c17ff5f303b70601c7386a44cf0c4008548"],"state_sha256":"d60d21da0885ebf20206d90f770eee2fedf10d42617c70200480d6151f7312c6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z8FsciaBxTNnDKKqcnhYWfkKrUwAsrUys/aiJ9h8VZ+jZBmqWxv+AM5pC6FVs1UVkUWOOpsEGAGKKUHn+tg8Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T12:00:19.431773Z","bundle_sha256":"88e10c2a23125e2b2b529f46128ccfc8f1fc31645ad0cd12f78dad43ef1ad2b0"}}