{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:22XEMV2CILZU6GX3QLIF3Q2T37","short_pith_number":"pith:22XEMV2C","canonical_record":{"source":{"id":"1410.6094","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-22T16:14:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c84b184acaf4dc327fd36c040ee9f3012be36a8f9d41786accac7b90c4f00c3b","abstract_canon_sha256":"d101dfccc8c905495cd5b6be6ce130ecfc69c86cd9bd5c2137911c32c0dd948e"},"schema_version":"1.0"},"canonical_sha256":"d6ae46574242f34f1afb82d05dc353dff59ff8a6a098e7e2d29bf18ea7d1c410","source":{"kind":"arxiv","id":"1410.6094","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.6094","created_at":"2026-05-18T02:39:32Z"},{"alias_kind":"arxiv_version","alias_value":"1410.6094v1","created_at":"2026-05-18T02:39:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6094","created_at":"2026-05-18T02:39:32Z"},{"alias_kind":"pith_short_12","alias_value":"22XEMV2CILZU","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"22XEMV2CILZU6GX3","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"22XEMV2C","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:22XEMV2CILZU6GX3QLIF3Q2T37","target":"record","payload":{"canonical_record":{"source":{"id":"1410.6094","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-22T16:14:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c84b184acaf4dc327fd36c040ee9f3012be36a8f9d41786accac7b90c4f00c3b","abstract_canon_sha256":"d101dfccc8c905495cd5b6be6ce130ecfc69c86cd9bd5c2137911c32c0dd948e"},"schema_version":"1.0"},"canonical_sha256":"d6ae46574242f34f1afb82d05dc353dff59ff8a6a098e7e2d29bf18ea7d1c410","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:32.598124Z","signature_b64":"kPftdXUbKTiFT9kc5FlCo15r50AzJWIYdLWkrIbwI2DF6v+rgPtmUQgj7pzfPbN8MpBIzQ/l2w72JiNhZasNDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6ae46574242f34f1afb82d05dc353dff59ff8a6a098e7e2d29bf18ea7d1c410","last_reissued_at":"2026-05-18T02:39:32.597661Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:32.597661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.6094","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:39:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ke6KaeRbg95tlOC4anLoH9JzBm0B8fpb8PKRnZxI/YK5UMEth/jjxo+iH6ZycMTJz3Wt5QEylrJ0H5ft0HfLDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T18:53:41.093129Z"},"content_sha256":"a53e69773e0cbc0cb66509eb63fd7272218c0baa92cff8eeba9b65d4bada192f","schema_version":"1.0","event_id":"sha256:a53e69773e0cbc0cb66509eb63fd7272218c0baa92cff8eeba9b65d4bada192f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:22XEMV2CILZU6GX3QLIF3Q2T37","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fuchsian codes with arbitrarily high code rate","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Camilla Hollanti, Dion\\'is Rem\\'on, Iv\\'an Blanco-Chac\\'on, Montserrat Alsina","submitted_at":"2014-10-22T16:14:21Z","abstract_excerpt":"Recently, so-called Fuchsian codes have been proposed in [I. Blanco-Chac\\'on et al., \"Nonuniform Fuchsian codes for noisy channels\", J. of the Franklin Institute 2014] for communication over channels subject to additive white Gaussian noise (AWGN). The two main advantages of Fuchsian codes are their ability to compress information, i.e., high code rate, and their logarithmic decoding complexity. In this paper, we improve the first property further by constructing Fuchsian codes with arbitrarily high code rates while maintaining logarithmic decoding complexity. Namely, in the case of Fuchsian g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6094","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:39:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xArgulNF+Di2OFS+/O0w2J8s2Lj1NNxxy7CXWli9lLbxg2QIh32E4hsCvKTU+ht+z4tKyF+KFfgLQd3CnROUBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T18:53:41.093498Z"},"content_sha256":"8fb8fdefabcc58aa7343e8e5406896c7b45e8b35320fd2342e4e1edf9e7754e8","schema_version":"1.0","event_id":"sha256:8fb8fdefabcc58aa7343e8e5406896c7b45e8b35320fd2342e4e1edf9e7754e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/22XEMV2CILZU6GX3QLIF3Q2T37/bundle.json","state_url":"https://pith.science/pith/22XEMV2CILZU6GX3QLIF3Q2T37/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/22XEMV2CILZU6GX3QLIF3Q2T37/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-20T18:53:41Z","links":{"resolver":"https://pith.science/pith/22XEMV2CILZU6GX3QLIF3Q2T37","bundle":"https://pith.science/pith/22XEMV2CILZU6GX3QLIF3Q2T37/bundle.json","state":"https://pith.science/pith/22XEMV2CILZU6GX3QLIF3Q2T37/state.json","well_known_bundle":"https://pith.science/.well-known/pith/22XEMV2CILZU6GX3QLIF3Q2T37/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:22XEMV2CILZU6GX3QLIF3Q2T37","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":"d101dfccc8c905495cd5b6be6ce130ecfc69c86cd9bd5c2137911c32c0dd948e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-22T16:14:21Z","title_canon_sha256":"c84b184acaf4dc327fd36c040ee9f3012be36a8f9d41786accac7b90c4f00c3b"},"schema_version":"1.0","source":{"id":"1410.6094","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.6094","created_at":"2026-05-18T02:39:32Z"},{"alias_kind":"arxiv_version","alias_value":"1410.6094v1","created_at":"2026-05-18T02:39:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6094","created_at":"2026-05-18T02:39:32Z"},{"alias_kind":"pith_short_12","alias_value":"22XEMV2CILZU","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"22XEMV2CILZU6GX3","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"22XEMV2C","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:8fb8fdefabcc58aa7343e8e5406896c7b45e8b35320fd2342e4e1edf9e7754e8","target":"graph","created_at":"2026-05-18T02:39:32Z","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":"Recently, so-called Fuchsian codes have been proposed in [I. Blanco-Chac\\'on et al., \"Nonuniform Fuchsian codes for noisy channels\", J. of the Franklin Institute 2014] for communication over channels subject to additive white Gaussian noise (AWGN). The two main advantages of Fuchsian codes are their ability to compress information, i.e., high code rate, and their logarithmic decoding complexity. In this paper, we improve the first property further by constructing Fuchsian codes with arbitrarily high code rates while maintaining logarithmic decoding complexity. Namely, in the case of Fuchsian g","authors_text":"Camilla Hollanti, Dion\\'is Rem\\'on, Iv\\'an Blanco-Chac\\'on, Montserrat Alsina","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-22T16:14:21Z","title":"Fuchsian codes with arbitrarily high code rate"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6094","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:a53e69773e0cbc0cb66509eb63fd7272218c0baa92cff8eeba9b65d4bada192f","target":"record","created_at":"2026-05-18T02:39:32Z","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":"d101dfccc8c905495cd5b6be6ce130ecfc69c86cd9bd5c2137911c32c0dd948e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-22T16:14:21Z","title_canon_sha256":"c84b184acaf4dc327fd36c040ee9f3012be36a8f9d41786accac7b90c4f00c3b"},"schema_version":"1.0","source":{"id":"1410.6094","kind":"arxiv","version":1}},"canonical_sha256":"d6ae46574242f34f1afb82d05dc353dff59ff8a6a098e7e2d29bf18ea7d1c410","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d6ae46574242f34f1afb82d05dc353dff59ff8a6a098e7e2d29bf18ea7d1c410","first_computed_at":"2026-05-18T02:39:32.597661Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:32.597661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kPftdXUbKTiFT9kc5FlCo15r50AzJWIYdLWkrIbwI2DF6v+rgPtmUQgj7pzfPbN8MpBIzQ/l2w72JiNhZasNDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:32.598124Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.6094","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a53e69773e0cbc0cb66509eb63fd7272218c0baa92cff8eeba9b65d4bada192f","sha256:8fb8fdefabcc58aa7343e8e5406896c7b45e8b35320fd2342e4e1edf9e7754e8"],"state_sha256":"e636305c0aa8ea921b420b46d20c2f10b4286277fc02f63d906a36cc568d8ede"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zMGgFPov1wQ7RkzhmaglKH8u6XJCnl/NlB9VwMbrTxFWmEv407A1jMX9iwKZqrLZNXLWvc5L95CHGUtXTPPHDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T18:53:41.095392Z","bundle_sha256":"7c306e0629313c0dd14349d6d3ddc462b39c0497bfce96c8ecc5a5dd9e4f1643"}}