{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:YMLUP2PROBCHVKGWV5JSVB5FKD","short_pith_number":"pith:YMLUP2PR","schema_version":"1.0","canonical_sha256":"c31747e9f170447aa8d6af532a87a550cbc34db93f0c718533cc02cfbaab3211","source":{"kind":"arxiv","id":"1105.1520","version":1},"attestation_state":"computed","paper":{"title":"Linear Analog Codes: The Good and The Bad","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jing (Tiffany) Li, Kai Xie","submitted_at":"2011-05-08T13:52:13Z","abstract_excerpt":"This paper studies the theory of linear analog error correction coding. Since classical concepts of minimum Hamming distance and minimum Euclidean distance fail in the analog context, a new metric, termed the \"minimum (squared Euclidean) distance ratio,\" is defined. It is shown that linear analog codes that achieve the largest possible value of minimum distance ratio also achieve the smallest possible mean square error (MSE). Based on this achievability, a concept of \"maximum distance ratio expansible (MDRE)\" is established, in a spirit similar to maximum distance separable (MDS). Existing cod"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1105.1520","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-08T13:52:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"11d00eabdeac54e3321690325867915d186768751926415aee61b78f38176ebc","abstract_canon_sha256":"6476a8459be1018650a83808b0fddbe0158d3e99b5f5ef197887855c2b5a2ab9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:39.290916Z","signature_b64":"aek5h+DcD9EGScIoW5jNKef6PF5XZzkSD7bWIzMP5iwnFxI0XeR96kUgFDfu7wQag7O6jqcFgaQyVDlG17mdAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c31747e9f170447aa8d6af532a87a550cbc34db93f0c718533cc02cfbaab3211","last_reissued_at":"2026-05-18T04:22:39.290532Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:39.290532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Analog Codes: The Good and The Bad","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jing (Tiffany) Li, Kai Xie","submitted_at":"2011-05-08T13:52:13Z","abstract_excerpt":"This paper studies the theory of linear analog error correction coding. Since classical concepts of minimum Hamming distance and minimum Euclidean distance fail in the analog context, a new metric, termed the \"minimum (squared Euclidean) distance ratio,\" is defined. It is shown that linear analog codes that achieve the largest possible value of minimum distance ratio also achieve the smallest possible mean square error (MSE). Based on this achievability, a concept of \"maximum distance ratio expansible (MDRE)\" is established, in a spirit similar to maximum distance separable (MDS). Existing cod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.1520","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1105.1520","created_at":"2026-05-18T04:22:39.290584+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.1520v1","created_at":"2026-05-18T04:22:39.290584+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.1520","created_at":"2026-05-18T04:22:39.290584+00:00"},{"alias_kind":"pith_short_12","alias_value":"YMLUP2PROBCH","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"YMLUP2PROBCHVKGW","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"YMLUP2PR","created_at":"2026-05-18T12:26:47.523578+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YMLUP2PROBCHVKGWV5JSVB5FKD","json":"https://pith.science/pith/YMLUP2PROBCHVKGWV5JSVB5FKD.json","graph_json":"https://pith.science/api/pith-number/YMLUP2PROBCHVKGWV5JSVB5FKD/graph.json","events_json":"https://pith.science/api/pith-number/YMLUP2PROBCHVKGWV5JSVB5FKD/events.json","paper":"https://pith.science/paper/YMLUP2PR"},"agent_actions":{"view_html":"https://pith.science/pith/YMLUP2PROBCHVKGWV5JSVB5FKD","download_json":"https://pith.science/pith/YMLUP2PROBCHVKGWV5JSVB5FKD.json","view_paper":"https://pith.science/paper/YMLUP2PR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.1520&json=true","fetch_graph":"https://pith.science/api/pith-number/YMLUP2PROBCHVKGWV5JSVB5FKD/graph.json","fetch_events":"https://pith.science/api/pith-number/YMLUP2PROBCHVKGWV5JSVB5FKD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YMLUP2PROBCHVKGWV5JSVB5FKD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YMLUP2PROBCHVKGWV5JSVB5FKD/action/storage_attestation","attest_author":"https://pith.science/pith/YMLUP2PROBCHVKGWV5JSVB5FKD/action/author_attestation","sign_citation":"https://pith.science/pith/YMLUP2PROBCHVKGWV5JSVB5FKD/action/citation_signature","submit_replication":"https://pith.science/pith/YMLUP2PROBCHVKGWV5JSVB5FKD/action/replication_record"}},"created_at":"2026-05-18T04:22:39.290584+00:00","updated_at":"2026-05-18T04:22:39.290584+00:00"}