{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:JT5SZOFTMIAT5AGGDJG3XFW5OU","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":"46df11a6b19bad22c6c009e3229b437ea8748395153410742c8bb238c262d9e3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-03T13:39:56Z","title_canon_sha256":"96dc59a58311c09f4fed07a438821eee05825ea762f31dd57b5e047ee64cf901"},"schema_version":"1.0","source":{"id":"1203.0653","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.0653","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"arxiv_version","alias_value":"1203.0653v2","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.0653","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"pith_short_12","alias_value":"JT5SZOFTMIAT","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JT5SZOFTMIAT5AGG","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JT5SZOFT","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:41914a2c48e8b714e4987043f6d3d696bb2d931647e5c78e1fadb5d467f72d1a","target":"graph","created_at":"2026-05-18T02:21:17Z","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":"The set of all error--correcting block codes over a fixed alphabet with $q$ letters determines a recursively enumerable set of rational points in the unit square with coordinates $(R,\\delta)$:= (relative transmission rate, relative minimal distance). Limit points of this set form a closed subset, defined by $R\\le \\alpha_q(\\delta)$, where $\\alpha_q(\\delta)$ is a continuous decreasing function called asymptotic bound. Its existence was proved by the first--named author in 1981 ([Man1]), but no approaches to the computation of this function are known, and in [Man5] it was even suggested that this","authors_text":"Matilde Marcolli, Yuri I. Manin","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-03T13:39:56Z","title":"Kolmogorov complexity and the asymptotic bound for error-correcting codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.0653","kind":"arxiv","version":2},"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:d6df8667492348f8a16c921f7b05659303ec1f1bb2db418af8607caf4d0bf87f","target":"record","created_at":"2026-05-18T02:21:17Z","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":"46df11a6b19bad22c6c009e3229b437ea8748395153410742c8bb238c262d9e3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-03T13:39:56Z","title_canon_sha256":"96dc59a58311c09f4fed07a438821eee05825ea762f31dd57b5e047ee64cf901"},"schema_version":"1.0","source":{"id":"1203.0653","kind":"arxiv","version":2}},"canonical_sha256":"4cfb2cb8b362013e80c61a4dbb96dd7526cd96771c8d2ffc092cc24e28c4dff5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4cfb2cb8b362013e80c61a4dbb96dd7526cd96771c8d2ffc092cc24e28c4dff5","first_computed_at":"2026-05-18T02:21:17.300049Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:17.300049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hcaJ0O5HoegltejZFJdxP0IIDVGXLyrbXtgC5vUiGMGQSPZnc4lQxDT4CA35pea1gKGEBdMJyFTP0DFAMsu+AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:17.300623Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.0653","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6df8667492348f8a16c921f7b05659303ec1f1bb2db418af8607caf4d0bf87f","sha256:41914a2c48e8b714e4987043f6d3d696bb2d931647e5c78e1fadb5d467f72d1a"],"state_sha256":"9782e9ba758bacc78ca51b77d9080b188a45552bb4ffdb5b1f6685ab04085272"}