{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:LW3SMYXNMU2THDMLBFOOFFISS4","short_pith_number":"pith:LW3SMYXN","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"},"canonical_sha256":"5db72662ed6535338d8b095ce29512973ecfe0d046467851e8afa09687682922","source":{"kind":"arxiv","id":"1306.4849","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.4849","created_at":"2026-05-18T01:18:00Z"},{"alias_kind":"arxiv_version","alias_value":"1306.4849v1","created_at":"2026-05-18T01:18:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.4849","created_at":"2026-05-18T01:18:00Z"},{"alias_kind":"pith_short_12","alias_value":"LW3SMYXNMU2T","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LW3SMYXNMU2THDML","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LW3SMYXN","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:LW3SMYXNMU2THDMLBFOOFFISS4","target":"record","payload":{"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"},"canonical_sha256":"5db72662ed6535338d8b095ce29512973ecfe0d046467851e8afa09687682922","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"},"source_kind":"arxiv","source_id":"1306.4849","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:18:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L9nneguKHHjmG3ce7yTdF7OhMeUez1LvlJ8PJHD01/bL8gV1AyZKcPFNHoY3C1m83cVNaItA1fRLX7QYvAuCCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:32:54.828363Z"},"content_sha256":"cd8bb8251792031ac0f583dfb1fc738364f02ce1fec7f23722a7007ba078f332","schema_version":"1.0","event_id":"sha256:cd8bb8251792031ac0f583dfb1fc738364f02ce1fec7f23722a7007ba078f332"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:LW3SMYXNMU2THDMLBFOOFFISS4","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:18:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CgcF9wWenk8Np10Vty9MO4ahBZJ98NLwks40+v2y9pBSuL1FEyHsh1e61rCzBIhOwYBdARS0X05WPxXNOgmbBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:32:54.828713Z"},"content_sha256":"54ec13f9569de0a2b054b2f87bc2f0bca6892beaa3978ec31e055bc8328588f3","schema_version":"1.0","event_id":"sha256:54ec13f9569de0a2b054b2f87bc2f0bca6892beaa3978ec31e055bc8328588f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LW3SMYXNMU2THDMLBFOOFFISS4/bundle.json","state_url":"https://pith.science/pith/LW3SMYXNMU2THDMLBFOOFFISS4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LW3SMYXNMU2THDMLBFOOFFISS4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T23:32:54Z","links":{"resolver":"https://pith.science/pith/LW3SMYXNMU2THDMLBFOOFFISS4","bundle":"https://pith.science/pith/LW3SMYXNMU2THDMLBFOOFFISS4/bundle.json","state":"https://pith.science/pith/LW3SMYXNMU2THDMLBFOOFFISS4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LW3SMYXNMU2THDMLBFOOFFISS4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:LW3SMYXNMU2THDMLBFOOFFISS4","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":"5f4bad528270cde5d0bede527fad2525d835b8f5d20dc445a985ac771eb05f13","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-20T12:27:49Z","title_canon_sha256":"6fc8b2dc15fe7a7dd6faedb5e7a88ceec32e6518e5dea2ac430baf57002dbdc8"},"schema_version":"1.0","source":{"id":"1306.4849","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.4849","created_at":"2026-05-18T01:18:00Z"},{"alias_kind":"arxiv_version","alias_value":"1306.4849v1","created_at":"2026-05-18T01:18:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.4849","created_at":"2026-05-18T01:18:00Z"},{"alias_kind":"pith_short_12","alias_value":"LW3SMYXNMU2T","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LW3SMYXNMU2THDML","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LW3SMYXN","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:54ec13f9569de0a2b054b2f87bc2f0bca6892beaa3978ec31e055bc8328588f3","target":"graph","created_at":"2026-05-18T01:18:00Z","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":"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.","authors_text":"Massimiliano Sala, Matteo Piva","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-20T12:27:49Z","title":"A generalization of bounds for cyclic codes, including the HT and BS bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.4849","kind":"arxiv","version":1},"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:cd8bb8251792031ac0f583dfb1fc738364f02ce1fec7f23722a7007ba078f332","target":"record","created_at":"2026-05-18T01:18:00Z","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":"5f4bad528270cde5d0bede527fad2525d835b8f5d20dc445a985ac771eb05f13","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-20T12:27:49Z","title_canon_sha256":"6fc8b2dc15fe7a7dd6faedb5e7a88ceec32e6518e5dea2ac430baf57002dbdc8"},"schema_version":"1.0","source":{"id":"1306.4849","kind":"arxiv","version":1}},"canonical_sha256":"5db72662ed6535338d8b095ce29512973ecfe0d046467851e8afa09687682922","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5db72662ed6535338d8b095ce29512973ecfe0d046467851e8afa09687682922","first_computed_at":"2026-05-18T01:18:00.522900Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:00.522900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lhD+qIHPw/TCiZAXdDlwAsfDn290BEkHbwptO0hQCBe0ai2W4RQg6VNbzG2xgtSMUFIV5YAeDbtukeLIOuFKCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:00.523877Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.4849","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd8bb8251792031ac0f583dfb1fc738364f02ce1fec7f23722a7007ba078f332","sha256:54ec13f9569de0a2b054b2f87bc2f0bca6892beaa3978ec31e055bc8328588f3"],"state_sha256":"04eaa90dc8f5cedf610326f6a6af13bb1b9a00a51377ca4634346b83c1755e8e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lByq4bQ6jFV1oYGxO/Hc8ljRbISvfz9YtaApzAiZ9uqLfyKiDhQvv8qbBiii69VVzWl0TYOBb0THAhBwhpDSBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T23:32:54.830603Z","bundle_sha256":"d27cc1c1d4456ca914e8a1af6de7c8977ef7a0845fc8546438ad0fdb4a878654"}}