{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:663NTGH3DN4EP4ITA6ANYNKHXC","short_pith_number":"pith:663NTGH3","schema_version":"1.0","canonical_sha256":"f7b6d998fb1b7847f1130780dc3547b8a63c59cb1bd6962a390a56b00d8f4948","source":{"kind":"arxiv","id":"1101.5411","version":1},"attestation_state":"computed","paper":{"title":"Efficient Algorithms for Searching Optimal Shortened Cyclic Single-Burst-Correcting Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Ana Lucila Sandoval Orozco, Jos\\'e Ren\\'e Fuentes Cortez, Luis Javier Garc\\'ia Villalba, Mario Blaum","submitted_at":"2011-01-27T23:04:43Z","abstract_excerpt":"In a previous work it was shown that the best measure for the efficiency of a single burst-correcting code is obtained using the Gallager bound as opposed to the Reiger bound. In this paper, an efficient algorithm that searches for the best (shortened) cyclic burst-correcting codes is presented. Using this algorithm, extensive tables that either tie existing constructions or improve them are obtained for burst lengths up to b=10."},"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":"1101.5411","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-01-27T23:04:43Z","cross_cats_sorted":[],"title_canon_sha256":"3520ae53ddb2ae7fb4b5588fddec9e198b7cf24825a6dc2a91b67070048326ff","abstract_canon_sha256":"f26a2cb08f8815c9923fab5465d671417197cd6c555f8e9f8f4bdd8e1425063a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:30:35.062201Z","signature_b64":"tgfaBMkTuNcb0fbxziyYEM+CK4WVs6iy5Rbiv5dj1ajOm32mX9TAxWBcdoyrrUyD757oWXqEenVOOhdbbtdQAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7b6d998fb1b7847f1130780dc3547b8a63c59cb1bd6962a390a56b00d8f4948","last_reissued_at":"2026-05-18T04:30:35.061674Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:30:35.061674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Algorithms for Searching Optimal Shortened Cyclic Single-Burst-Correcting Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Ana Lucila Sandoval Orozco, Jos\\'e Ren\\'e Fuentes Cortez, Luis Javier Garc\\'ia Villalba, Mario Blaum","submitted_at":"2011-01-27T23:04:43Z","abstract_excerpt":"In a previous work it was shown that the best measure for the efficiency of a single burst-correcting code is obtained using the Gallager bound as opposed to the Reiger bound. In this paper, an efficient algorithm that searches for the best (shortened) cyclic burst-correcting codes is presented. Using this algorithm, extensive tables that either tie existing constructions or improve them are obtained for burst lengths up to b=10."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.5411","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":"1101.5411","created_at":"2026-05-18T04:30:35.061770+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.5411v1","created_at":"2026-05-18T04:30:35.061770+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.5411","created_at":"2026-05-18T04:30:35.061770+00:00"},{"alias_kind":"pith_short_12","alias_value":"663NTGH3DN4E","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"663NTGH3DN4EP4IT","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"663NTGH3","created_at":"2026-05-18T12:26:22.705136+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/663NTGH3DN4EP4ITA6ANYNKHXC","json":"https://pith.science/pith/663NTGH3DN4EP4ITA6ANYNKHXC.json","graph_json":"https://pith.science/api/pith-number/663NTGH3DN4EP4ITA6ANYNKHXC/graph.json","events_json":"https://pith.science/api/pith-number/663NTGH3DN4EP4ITA6ANYNKHXC/events.json","paper":"https://pith.science/paper/663NTGH3"},"agent_actions":{"view_html":"https://pith.science/pith/663NTGH3DN4EP4ITA6ANYNKHXC","download_json":"https://pith.science/pith/663NTGH3DN4EP4ITA6ANYNKHXC.json","view_paper":"https://pith.science/paper/663NTGH3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.5411&json=true","fetch_graph":"https://pith.science/api/pith-number/663NTGH3DN4EP4ITA6ANYNKHXC/graph.json","fetch_events":"https://pith.science/api/pith-number/663NTGH3DN4EP4ITA6ANYNKHXC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/663NTGH3DN4EP4ITA6ANYNKHXC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/663NTGH3DN4EP4ITA6ANYNKHXC/action/storage_attestation","attest_author":"https://pith.science/pith/663NTGH3DN4EP4ITA6ANYNKHXC/action/author_attestation","sign_citation":"https://pith.science/pith/663NTGH3DN4EP4ITA6ANYNKHXC/action/citation_signature","submit_replication":"https://pith.science/pith/663NTGH3DN4EP4ITA6ANYNKHXC/action/replication_record"}},"created_at":"2026-05-18T04:30:35.061770+00:00","updated_at":"2026-05-18T04:30:35.061770+00:00"}