{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:LW3SMYXNMU2THDMLBFOOFFISS4","short_pith_number":"pith:LW3SMYXN","schema_version":"1.0","canonical_sha256":"5db72662ed6535338d8b095ce29512973ecfe0d046467851e8afa09687682922","source":{"kind":"arxiv","id":"1306.4849","version":1},"attestation_state":"computed","paper":{"title":"A generalization of bounds for cyclic codes, including the HT and BS bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Massimiliano Sala, Matteo Piva","submitted_at":"2013-06-20T12:27:49Z","abstract_excerpt":"We use the algebraic structure of cyclic codes and some properties of the discrete Fourier transform to give a reformulation of several classical bounds for the distance of cyclic codes, by extending techniques of linear algebra. We propose a bound, whose computational complexity is polynomial bounded, which is a generalization of the Hartmann-Tzeng bound and the Betti-Sala bound. In the majority of computed cases, our bound is the tightest among all known polynomial-time bounds, including the Roos bound."},"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":"1306.4849","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-20T12:27:49Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"6fc8b2dc15fe7a7dd6faedb5e7a88ceec32e6518e5dea2ac430baf57002dbdc8","abstract_canon_sha256":"5f4bad528270cde5d0bede527fad2525d835b8f5d20dc445a985ac771eb05f13"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:00.523877Z","signature_b64":"lhD+qIHPw/TCiZAXdDlwAsfDn290BEkHbwptO0hQCBe0ai2W4RQg6VNbzG2xgtSMUFIV5YAeDbtukeLIOuFKCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5db72662ed6535338d8b095ce29512973ecfe0d046467851e8afa09687682922","last_reissued_at":"2026-05-18T01:18:00.522900Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:00.522900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A generalization of bounds for cyclic codes, including the HT and BS bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Massimiliano Sala, Matteo Piva","submitted_at":"2013-06-20T12:27:49Z","abstract_excerpt":"We use the algebraic structure of cyclic codes and some properties of the discrete Fourier transform to give a reformulation of several classical bounds for the distance of cyclic codes, by extending techniques of linear algebra. We propose a bound, whose computational complexity is polynomial bounded, which is a generalization of the Hartmann-Tzeng bound and the Betti-Sala bound. In the majority of computed cases, our bound is the tightest among all known polynomial-time bounds, including the Roos bound."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.4849","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":"1306.4849","created_at":"2026-05-18T01:18:00.523066+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.4849v1","created_at":"2026-05-18T01:18:00.523066+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.4849","created_at":"2026-05-18T01:18:00.523066+00:00"},{"alias_kind":"pith_short_12","alias_value":"LW3SMYXNMU2T","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"LW3SMYXNMU2THDML","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"LW3SMYXN","created_at":"2026-05-18T12:27:51.066281+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/LW3SMYXNMU2THDMLBFOOFFISS4","json":"https://pith.science/pith/LW3SMYXNMU2THDMLBFOOFFISS4.json","graph_json":"https://pith.science/api/pith-number/LW3SMYXNMU2THDMLBFOOFFISS4/graph.json","events_json":"https://pith.science/api/pith-number/LW3SMYXNMU2THDMLBFOOFFISS4/events.json","paper":"https://pith.science/paper/LW3SMYXN"},"agent_actions":{"view_html":"https://pith.science/pith/LW3SMYXNMU2THDMLBFOOFFISS4","download_json":"https://pith.science/pith/LW3SMYXNMU2THDMLBFOOFFISS4.json","view_paper":"https://pith.science/paper/LW3SMYXN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.4849&json=true","fetch_graph":"https://pith.science/api/pith-number/LW3SMYXNMU2THDMLBFOOFFISS4/graph.json","fetch_events":"https://pith.science/api/pith-number/LW3SMYXNMU2THDMLBFOOFFISS4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LW3SMYXNMU2THDMLBFOOFFISS4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LW3SMYXNMU2THDMLBFOOFFISS4/action/storage_attestation","attest_author":"https://pith.science/pith/LW3SMYXNMU2THDMLBFOOFFISS4/action/author_attestation","sign_citation":"https://pith.science/pith/LW3SMYXNMU2THDMLBFOOFFISS4/action/citation_signature","submit_replication":"https://pith.science/pith/LW3SMYXNMU2THDMLBFOOFFISS4/action/replication_record"}},"created_at":"2026-05-18T01:18:00.523066+00:00","updated_at":"2026-05-18T01:18:00.523066+00:00"}