{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:UQVIW4TKQADLPHGKP6MLCYZVTW","short_pith_number":"pith:UQVIW4TK","schema_version":"1.0","canonical_sha256":"a42a8b726a8006b79cca7f98b163359db9f97e5ded34ffe74ff4a2bd1b6e2c67","source":{"kind":"arxiv","id":"1405.7464","version":2},"attestation_state":"computed","paper":{"title":"Cross-Error Correcting Integer Codes over $\\mathbb{Z}_{2^m}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anna-Lena Trautmann, Emanuele Viterbo","submitted_at":"2014-05-29T05:08:12Z","abstract_excerpt":"In this work we investigate codes in $\\mathbb{Z}_{2^m}^n$ that can correct errors that occur in just one coordinate of the codeword, with a magnitude of up to a given parameter $t$. We will show upper bounds on these cross codes, derive constructions for linear codes and respective decoding algorithm. The constructions (and decoding algorithms) are given for length $n = 2$ and $n = 3$, but for general $m$ and $t$."},"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":"1405.7464","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-29T05:08:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"601cfe02387f596ddacdd01e250aee3d1174d4df134c367346b714de2d999499","abstract_canon_sha256":"0ce3efa084210e2d63092cdeca5220669193356e2a654ec4f58f33ed77080a69"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:03.532026Z","signature_b64":"y7mgpOTRdq3y9WIi4xviRbCdbSqxbz3A/9yDzQzJmUUOWrgyjyYNJDkKegyY0rXSuIzOZQEy/RiAVK6utcz9Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a42a8b726a8006b79cca7f98b163359db9f97e5ded34ffe74ff4a2bd1b6e2c67","last_reissued_at":"2026-05-18T02:41:03.531500Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:03.531500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cross-Error Correcting Integer Codes over $\\mathbb{Z}_{2^m}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anna-Lena Trautmann, Emanuele Viterbo","submitted_at":"2014-05-29T05:08:12Z","abstract_excerpt":"In this work we investigate codes in $\\mathbb{Z}_{2^m}^n$ that can correct errors that occur in just one coordinate of the codeword, with a magnitude of up to a given parameter $t$. We will show upper bounds on these cross codes, derive constructions for linear codes and respective decoding algorithm. The constructions (and decoding algorithms) are given for length $n = 2$ and $n = 3$, but for general $m$ and $t$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.7464","kind":"arxiv","version":2},"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":"1405.7464","created_at":"2026-05-18T02:41:03.531582+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.7464v2","created_at":"2026-05-18T02:41:03.531582+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7464","created_at":"2026-05-18T02:41:03.531582+00:00"},{"alias_kind":"pith_short_12","alias_value":"UQVIW4TKQADL","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"UQVIW4TKQADLPHGK","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"UQVIW4TK","created_at":"2026-05-18T12:28:52.271510+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/UQVIW4TKQADLPHGKP6MLCYZVTW","json":"https://pith.science/pith/UQVIW4TKQADLPHGKP6MLCYZVTW.json","graph_json":"https://pith.science/api/pith-number/UQVIW4TKQADLPHGKP6MLCYZVTW/graph.json","events_json":"https://pith.science/api/pith-number/UQVIW4TKQADLPHGKP6MLCYZVTW/events.json","paper":"https://pith.science/paper/UQVIW4TK"},"agent_actions":{"view_html":"https://pith.science/pith/UQVIW4TKQADLPHGKP6MLCYZVTW","download_json":"https://pith.science/pith/UQVIW4TKQADLPHGKP6MLCYZVTW.json","view_paper":"https://pith.science/paper/UQVIW4TK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.7464&json=true","fetch_graph":"https://pith.science/api/pith-number/UQVIW4TKQADLPHGKP6MLCYZVTW/graph.json","fetch_events":"https://pith.science/api/pith-number/UQVIW4TKQADLPHGKP6MLCYZVTW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UQVIW4TKQADLPHGKP6MLCYZVTW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UQVIW4TKQADLPHGKP6MLCYZVTW/action/storage_attestation","attest_author":"https://pith.science/pith/UQVIW4TKQADLPHGKP6MLCYZVTW/action/author_attestation","sign_citation":"https://pith.science/pith/UQVIW4TKQADLPHGKP6MLCYZVTW/action/citation_signature","submit_replication":"https://pith.science/pith/UQVIW4TKQADLPHGKP6MLCYZVTW/action/replication_record"}},"created_at":"2026-05-18T02:41:03.531582+00:00","updated_at":"2026-05-18T02:41:03.531582+00:00"}