{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7RCTQHB5NIH7355CBM7VNMPKEO","short_pith_number":"pith:7RCTQHB5","schema_version":"1.0","canonical_sha256":"fc45381c3d6a0ffdf7a20b3f56b1ea23bad8e62f1aad925e13afc39935a05675","source":{"kind":"arxiv","id":"1703.01080","version":2},"attestation_state":"computed","paper":{"title":"Good cyclic codes and the uncertainty principle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.NT","math.RT"],"primary_cat":"cs.IT","authors_text":"Alexander Lubotzky, Emmanuel Kowalski, Shai Evra","submitted_at":"2017-03-03T08:54:25Z","abstract_excerpt":"A long standing problem in the area of error correcting codes asks whether there exist good cyclic codes. Most of the known results point in the direction of a negative answer.\n  The uncertainty principle is a classical result of harmonic analysis asserting that given a non-zero function $f$ on some abelian group, either $f$ or its Fourier transform $\\hat{f}$ has large support.\n  In this note, we observe a connection between these two subjects. We point out that even a weak version of the uncertainty principle for fields of positive characteristic would imply that good cyclic codes do exist. W"},"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":"1703.01080","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-03T08:54:25Z","cross_cats_sorted":["math.IT","math.NT","math.RT"],"title_canon_sha256":"95198336470831792ef47d6e41947ec409782745d252acd7159aeb7b5ac997c7","abstract_canon_sha256":"18dd9b7ca35b10fc711ab18b25b4f158a7b2a3006966548017642142668f59cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:12.474414Z","signature_b64":"00bVfbFHYZkL3yYyJQQAyP4brduwnGwgHjIouiI4jaL5O6IMOZCSOPi5ce5GOW+pNT3IadvXZtd2X6Pi4dj9BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc45381c3d6a0ffdf7a20b3f56b1ea23bad8e62f1aad925e13afc39935a05675","last_reissued_at":"2026-05-18T00:46:12.473835Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:12.473835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Good cyclic codes and the uncertainty principle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.NT","math.RT"],"primary_cat":"cs.IT","authors_text":"Alexander Lubotzky, Emmanuel Kowalski, Shai Evra","submitted_at":"2017-03-03T08:54:25Z","abstract_excerpt":"A long standing problem in the area of error correcting codes asks whether there exist good cyclic codes. Most of the known results point in the direction of a negative answer.\n  The uncertainty principle is a classical result of harmonic analysis asserting that given a non-zero function $f$ on some abelian group, either $f$ or its Fourier transform $\\hat{f}$ has large support.\n  In this note, we observe a connection between these two subjects. We point out that even a weak version of the uncertainty principle for fields of positive characteristic would imply that good cyclic codes do exist. W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.01080","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":"1703.01080","created_at":"2026-05-18T00:46:12.473931+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.01080v2","created_at":"2026-05-18T00:46:12.473931+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01080","created_at":"2026-05-18T00:46:12.473931+00:00"},{"alias_kind":"pith_short_12","alias_value":"7RCTQHB5NIH7","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7RCTQHB5NIH7355C","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7RCTQHB5","created_at":"2026-05-18T12:31:05.417338+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/7RCTQHB5NIH7355CBM7VNMPKEO","json":"https://pith.science/pith/7RCTQHB5NIH7355CBM7VNMPKEO.json","graph_json":"https://pith.science/api/pith-number/7RCTQHB5NIH7355CBM7VNMPKEO/graph.json","events_json":"https://pith.science/api/pith-number/7RCTQHB5NIH7355CBM7VNMPKEO/events.json","paper":"https://pith.science/paper/7RCTQHB5"},"agent_actions":{"view_html":"https://pith.science/pith/7RCTQHB5NIH7355CBM7VNMPKEO","download_json":"https://pith.science/pith/7RCTQHB5NIH7355CBM7VNMPKEO.json","view_paper":"https://pith.science/paper/7RCTQHB5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.01080&json=true","fetch_graph":"https://pith.science/api/pith-number/7RCTQHB5NIH7355CBM7VNMPKEO/graph.json","fetch_events":"https://pith.science/api/pith-number/7RCTQHB5NIH7355CBM7VNMPKEO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7RCTQHB5NIH7355CBM7VNMPKEO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7RCTQHB5NIH7355CBM7VNMPKEO/action/storage_attestation","attest_author":"https://pith.science/pith/7RCTQHB5NIH7355CBM7VNMPKEO/action/author_attestation","sign_citation":"https://pith.science/pith/7RCTQHB5NIH7355CBM7VNMPKEO/action/citation_signature","submit_replication":"https://pith.science/pith/7RCTQHB5NIH7355CBM7VNMPKEO/action/replication_record"}},"created_at":"2026-05-18T00:46:12.473931+00:00","updated_at":"2026-05-18T00:46:12.473931+00:00"}