{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:K6CXU5SYNW2U7MP674C5YLXGJH","short_pith_number":"pith:K6CXU5SY","schema_version":"1.0","canonical_sha256":"57857a76586db54fb1feff05dc2ee649e74ebe97e3b4814a9e28513e719f5a0e","source":{"kind":"arxiv","id":"1503.02577","version":1},"attestation_state":"computed","paper":{"title":"New Algorithms for Computing a Single Component of the Discrete Fourier Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","eess.SP","stat.ME"],"primary_cat":"cs.DM","authors_text":"G. Jer\\^onimo da Silva Jr., H.M. de Oliveira, R.M. Campello de Souza","submitted_at":"2015-03-09T17:39:44Z","abstract_excerpt":"This paper introduces the theory and hardware implementation of two new algorithms for computing a single component of the discrete Fourier transform. In terms of multiplicative complexity, both algorithms are more efficient, in general, than the well known Goertzel Algorithm."},"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.02577","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-03-09T17:39:44Z","cross_cats_sorted":["cs.DS","eess.SP","stat.ME"],"title_canon_sha256":"25e56c027936145df2d91eeb06f8cc4617a0698582de555ff0f1fd5f32b0d477","abstract_canon_sha256":"00f829152e6de64bb16ae3ecff4d73803a8e430a29e8d61288150a6377975fed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:21.671509Z","signature_b64":"XmOGLGNRao3Cj8sorFonaUrIEPwv/QiptKkC+YKXDC0h93IMGdlGOMYNWz1NvJnpbKh8IGcWATRbKXFHQwxBDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57857a76586db54fb1feff05dc2ee649e74ebe97e3b4814a9e28513e719f5a0e","last_reissued_at":"2026-05-18T00:25:21.670947Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:21.670947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Algorithms for Computing a Single Component of the Discrete Fourier Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","eess.SP","stat.ME"],"primary_cat":"cs.DM","authors_text":"G. Jer\\^onimo da Silva Jr., H.M. de Oliveira, R.M. Campello de Souza","submitted_at":"2015-03-09T17:39:44Z","abstract_excerpt":"This paper introduces the theory and hardware implementation of two new algorithms for computing a single component of the discrete Fourier transform. In terms of multiplicative complexity, both algorithms are more efficient, in general, than the well known Goertzel Algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02577","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.02577","created_at":"2026-05-18T00:25:21.671030+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.02577v1","created_at":"2026-05-18T00:25:21.671030+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02577","created_at":"2026-05-18T00:25:21.671030+00:00"},{"alias_kind":"pith_short_12","alias_value":"K6CXU5SYNW2U","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"K6CXU5SYNW2U7MP6","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"K6CXU5SY","created_at":"2026-05-18T12:29:27.538025+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/K6CXU5SYNW2U7MP674C5YLXGJH","json":"https://pith.science/pith/K6CXU5SYNW2U7MP674C5YLXGJH.json","graph_json":"https://pith.science/api/pith-number/K6CXU5SYNW2U7MP674C5YLXGJH/graph.json","events_json":"https://pith.science/api/pith-number/K6CXU5SYNW2U7MP674C5YLXGJH/events.json","paper":"https://pith.science/paper/K6CXU5SY"},"agent_actions":{"view_html":"https://pith.science/pith/K6CXU5SYNW2U7MP674C5YLXGJH","download_json":"https://pith.science/pith/K6CXU5SYNW2U7MP674C5YLXGJH.json","view_paper":"https://pith.science/paper/K6CXU5SY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.02577&json=true","fetch_graph":"https://pith.science/api/pith-number/K6CXU5SYNW2U7MP674C5YLXGJH/graph.json","fetch_events":"https://pith.science/api/pith-number/K6CXU5SYNW2U7MP674C5YLXGJH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K6CXU5SYNW2U7MP674C5YLXGJH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K6CXU5SYNW2U7MP674C5YLXGJH/action/storage_attestation","attest_author":"https://pith.science/pith/K6CXU5SYNW2U7MP674C5YLXGJH/action/author_attestation","sign_citation":"https://pith.science/pith/K6CXU5SYNW2U7MP674C5YLXGJH/action/citation_signature","submit_replication":"https://pith.science/pith/K6CXU5SYNW2U7MP674C5YLXGJH/action/replication_record"}},"created_at":"2026-05-18T00:25:21.671030+00:00","updated_at":"2026-05-18T00:25:21.671030+00:00"}