{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:3AOFWLBJSYZXVF7F5XQJTU4TCR","short_pith_number":"pith:3AOFWLBJ","schema_version":"1.0","canonical_sha256":"d81c5b2c2996337a97e5ede099d3931469e124d85f0ce744c8fc6fe77a918bbb","source":{"kind":"arxiv","id":"1503.03293","version":1},"attestation_state":"computed","paper":{"title":"Fourier Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"E.S.V. Freire, H.M. de Oliveira, R.M. Campello de Souza","submitted_at":"2015-03-11T12:14:10Z","abstract_excerpt":"A new family of error-correcting codes, called Fourier codes, is introduced. The code parity-check matrix, dimension and an upper bound on its minimum distance are obtained from the eigenstructure of the Fourier number theoretic transform. A decoding technique for such codes is proposed."},"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":"1503.03293","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-11T12:14:10Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"505f067af4214723f627b40a67adb9765ca2230232b2390a186c5131f79765a9","abstract_canon_sha256":"d8b6357d8b7f1b492487fbc89b00031826b062b3e5646b648a9d55927368b7f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:03.867157Z","signature_b64":"+conx9N/pwaVqWyFkpuGXVW5KHXUyzFmd9Kphh0g7wZzX3eMD9hFowMBLto3BHellMQcowBPt+5a/xlIG3ZgDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d81c5b2c2996337a97e5ede099d3931469e124d85f0ce744c8fc6fe77a918bbb","last_reissued_at":"2026-05-18T02:25:03.866802Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:03.866802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fourier Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"E.S.V. Freire, H.M. de Oliveira, R.M. Campello de Souza","submitted_at":"2015-03-11T12:14:10Z","abstract_excerpt":"A new family of error-correcting codes, called Fourier codes, is introduced. The code parity-check matrix, dimension and an upper bound on its minimum distance are obtained from the eigenstructure of the Fourier number theoretic transform. A decoding technique for such codes is proposed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.03293","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":"1503.03293","created_at":"2026-05-18T02:25:03.866856+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.03293v1","created_at":"2026-05-18T02:25:03.866856+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.03293","created_at":"2026-05-18T02:25:03.866856+00:00"},{"alias_kind":"pith_short_12","alias_value":"3AOFWLBJSYZX","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"3AOFWLBJSYZXVF7F","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"3AOFWLBJ","created_at":"2026-05-18T12:29:02.477457+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/3AOFWLBJSYZXVF7F5XQJTU4TCR","json":"https://pith.science/pith/3AOFWLBJSYZXVF7F5XQJTU4TCR.json","graph_json":"https://pith.science/api/pith-number/3AOFWLBJSYZXVF7F5XQJTU4TCR/graph.json","events_json":"https://pith.science/api/pith-number/3AOFWLBJSYZXVF7F5XQJTU4TCR/events.json","paper":"https://pith.science/paper/3AOFWLBJ"},"agent_actions":{"view_html":"https://pith.science/pith/3AOFWLBJSYZXVF7F5XQJTU4TCR","download_json":"https://pith.science/pith/3AOFWLBJSYZXVF7F5XQJTU4TCR.json","view_paper":"https://pith.science/paper/3AOFWLBJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.03293&json=true","fetch_graph":"https://pith.science/api/pith-number/3AOFWLBJSYZXVF7F5XQJTU4TCR/graph.json","fetch_events":"https://pith.science/api/pith-number/3AOFWLBJSYZXVF7F5XQJTU4TCR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3AOFWLBJSYZXVF7F5XQJTU4TCR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3AOFWLBJSYZXVF7F5XQJTU4TCR/action/storage_attestation","attest_author":"https://pith.science/pith/3AOFWLBJSYZXVF7F5XQJTU4TCR/action/author_attestation","sign_citation":"https://pith.science/pith/3AOFWLBJSYZXVF7F5XQJTU4TCR/action/citation_signature","submit_replication":"https://pith.science/pith/3AOFWLBJSYZXVF7F5XQJTU4TCR/action/replication_record"}},"created_at":"2026-05-18T02:25:03.866856+00:00","updated_at":"2026-05-18T02:25:03.866856+00:00"}