{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:5QX5JSULUI3ORX35XZUQPKHCKI","short_pith_number":"pith:5QX5JSUL","schema_version":"1.0","canonical_sha256":"ec2fd4ca8ba236e8df7dbe6907a8e252237421e0cfa0fe4ba52cafc1fec3e9ad","source":{"kind":"arxiv","id":"1206.5124","version":2},"attestation_state":"computed","paper":{"title":"On the ideal associated to a linear code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Edgar Mart\\'inez-Moro, Emilio Su\\'arez-Canedo, Irene M\\'arquez-Corbella","submitted_at":"2012-06-22T12:22:32Z","abstract_excerpt":"This article aims to explore the bridge between the algebraic structure of a linear code and the complete decoding process. To this end, we associate a specific binomial ideal $I_+(\\mathcal C)$ to an arbitrary linear code. The binomials involved in the reduced Gr\\\"obner basis of such an ideal relative to a degree-compatible ordering induce a uniquely defined test-set for the code, and this allows the description of a Hamming metric decoding procedure. Moreover, the binomials involved in the Graver basis of $I_+(\\mathcal C)$ provide a universal test-set which turns out to be a set containing th"},"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":"1206.5124","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-22T12:22:32Z","cross_cats_sorted":["math.AC","math.CO","math.IT"],"title_canon_sha256":"e1d52b7899d98b14ed322a97879989811feb41c6e143db2601061f5a7b52bdd9","abstract_canon_sha256":"961d937da209de2dc11e4f7cd587cecdb2d11bc53d6e9dd5664354927ec02cbf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:38.665770Z","signature_b64":"FVtQGYKsrhNqha3QDvFjn9R2GYpP/TKifh7bpt3hRU13wyQ1OfbhHvHU0z5G9mmoOivR1iMpXfTizZcoxOCuBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec2fd4ca8ba236e8df7dbe6907a8e252237421e0cfa0fe4ba52cafc1fec3e9ad","last_reissued_at":"2026-05-18T01:29:38.665259Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:38.665259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the ideal associated to a linear code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Edgar Mart\\'inez-Moro, Emilio Su\\'arez-Canedo, Irene M\\'arquez-Corbella","submitted_at":"2012-06-22T12:22:32Z","abstract_excerpt":"This article aims to explore the bridge between the algebraic structure of a linear code and the complete decoding process. To this end, we associate a specific binomial ideal $I_+(\\mathcal C)$ to an arbitrary linear code. The binomials involved in the reduced Gr\\\"obner basis of such an ideal relative to a degree-compatible ordering induce a uniquely defined test-set for the code, and this allows the description of a Hamming metric decoding procedure. Moreover, the binomials involved in the Graver basis of $I_+(\\mathcal C)$ provide a universal test-set which turns out to be a set containing th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.5124","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":"1206.5124","created_at":"2026-05-18T01:29:38.665329+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.5124v2","created_at":"2026-05-18T01:29:38.665329+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.5124","created_at":"2026-05-18T01:29:38.665329+00:00"},{"alias_kind":"pith_short_12","alias_value":"5QX5JSULUI3O","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"5QX5JSULUI3ORX35","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"5QX5JSUL","created_at":"2026-05-18T12:26:56.085431+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/5QX5JSULUI3ORX35XZUQPKHCKI","json":"https://pith.science/pith/5QX5JSULUI3ORX35XZUQPKHCKI.json","graph_json":"https://pith.science/api/pith-number/5QX5JSULUI3ORX35XZUQPKHCKI/graph.json","events_json":"https://pith.science/api/pith-number/5QX5JSULUI3ORX35XZUQPKHCKI/events.json","paper":"https://pith.science/paper/5QX5JSUL"},"agent_actions":{"view_html":"https://pith.science/pith/5QX5JSULUI3ORX35XZUQPKHCKI","download_json":"https://pith.science/pith/5QX5JSULUI3ORX35XZUQPKHCKI.json","view_paper":"https://pith.science/paper/5QX5JSUL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.5124&json=true","fetch_graph":"https://pith.science/api/pith-number/5QX5JSULUI3ORX35XZUQPKHCKI/graph.json","fetch_events":"https://pith.science/api/pith-number/5QX5JSULUI3ORX35XZUQPKHCKI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5QX5JSULUI3ORX35XZUQPKHCKI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5QX5JSULUI3ORX35XZUQPKHCKI/action/storage_attestation","attest_author":"https://pith.science/pith/5QX5JSULUI3ORX35XZUQPKHCKI/action/author_attestation","sign_citation":"https://pith.science/pith/5QX5JSULUI3ORX35XZUQPKHCKI/action/citation_signature","submit_replication":"https://pith.science/pith/5QX5JSULUI3ORX35XZUQPKHCKI/action/replication_record"}},"created_at":"2026-05-18T01:29:38.665329+00:00","updated_at":"2026-05-18T01:29:38.665329+00:00"}