{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:IK4FH3TE76YLUJL6267DIKHQOD","short_pith_number":"pith:IK4FH3TE","schema_version":"1.0","canonical_sha256":"42b853ee64ffb0ba257ed7be3428f070c88d7a15ee0cdce3292b0c139006040f","source":{"kind":"arxiv","id":"1209.0617","version":1},"attestation_state":"computed","paper":{"title":"Fast Fourier Optimization: Sparsity Matters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.OC","authors_text":"Robert J. Vanderbei","submitted_at":"2012-09-04T11:55:09Z","abstract_excerpt":"Many interesting and fundamentally practical optimization problems, ranging from optics, to signal processing, to radar and acoustics, involve constraints on the Fourier transform of a function. It is well-known that the {\\em fast Fourier transform} (fft) is a recursive algorithm that can dramatically improve the efficiency for computing the discrete Fourier transform. However, because it is recursive, it is difficult to embed into a linear optimization problem. In this paper, we explain the main idea behind the fast Fourier transform and show how to adapt it in such a manner as to make it enc"},"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":"1209.0617","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-09-04T11:55:09Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"84f5a38b721ab6ded4763720ff437f20ed8819771da0a737620479362bcf0e76","abstract_canon_sha256":"f3adad24a8905c809add4ef359b0c4b2faa2320fee4e4a8effcfab8b69500cdb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:17.664294Z","signature_b64":"/FPHxOyADZ1bczaf5lOS9D7w6vIEfGjOkGY8NigCw2ZJYHzPzgValGo0DrTcsQDUnBFNx4r5xHUzK7gtudaRBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42b853ee64ffb0ba257ed7be3428f070c88d7a15ee0cdce3292b0c139006040f","last_reissued_at":"2026-05-18T03:46:17.663609Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:17.663609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Fourier Optimization: Sparsity Matters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.OC","authors_text":"Robert J. Vanderbei","submitted_at":"2012-09-04T11:55:09Z","abstract_excerpt":"Many interesting and fundamentally practical optimization problems, ranging from optics, to signal processing, to radar and acoustics, involve constraints on the Fourier transform of a function. It is well-known that the {\\em fast Fourier transform} (fft) is a recursive algorithm that can dramatically improve the efficiency for computing the discrete Fourier transform. However, because it is recursive, it is difficult to embed into a linear optimization problem. In this paper, we explain the main idea behind the fast Fourier transform and show how to adapt it in such a manner as to make it enc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0617","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":"1209.0617","created_at":"2026-05-18T03:46:17.663712+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.0617v1","created_at":"2026-05-18T03:46:17.663712+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0617","created_at":"2026-05-18T03:46:17.663712+00:00"},{"alias_kind":"pith_short_12","alias_value":"IK4FH3TE76YL","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"IK4FH3TE76YLUJL6","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"IK4FH3TE","created_at":"2026-05-18T12:27:09.501522+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/IK4FH3TE76YLUJL6267DIKHQOD","json":"https://pith.science/pith/IK4FH3TE76YLUJL6267DIKHQOD.json","graph_json":"https://pith.science/api/pith-number/IK4FH3TE76YLUJL6267DIKHQOD/graph.json","events_json":"https://pith.science/api/pith-number/IK4FH3TE76YLUJL6267DIKHQOD/events.json","paper":"https://pith.science/paper/IK4FH3TE"},"agent_actions":{"view_html":"https://pith.science/pith/IK4FH3TE76YLUJL6267DIKHQOD","download_json":"https://pith.science/pith/IK4FH3TE76YLUJL6267DIKHQOD.json","view_paper":"https://pith.science/paper/IK4FH3TE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.0617&json=true","fetch_graph":"https://pith.science/api/pith-number/IK4FH3TE76YLUJL6267DIKHQOD/graph.json","fetch_events":"https://pith.science/api/pith-number/IK4FH3TE76YLUJL6267DIKHQOD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IK4FH3TE76YLUJL6267DIKHQOD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IK4FH3TE76YLUJL6267DIKHQOD/action/storage_attestation","attest_author":"https://pith.science/pith/IK4FH3TE76YLUJL6267DIKHQOD/action/author_attestation","sign_citation":"https://pith.science/pith/IK4FH3TE76YLUJL6267DIKHQOD/action/citation_signature","submit_replication":"https://pith.science/pith/IK4FH3TE76YLUJL6267DIKHQOD/action/replication_record"}},"created_at":"2026-05-18T03:46:17.663712+00:00","updated_at":"2026-05-18T03:46:17.663712+00:00"}