{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5EXDWYVKB4WBXRGKUAE23D2O7N","short_pith_number":"pith:5EXDWYVK","schema_version":"1.0","canonical_sha256":"e92e3b62aa0f2c1bc4caa009ad8f4efb6e4b4252c3627e239b3a53d1a9bcdcf7","source":{"kind":"arxiv","id":"2504.21197","version":1},"attestation_state":"computed","paper":{"title":"Spectral Methods via FFTs in Emerging Machine Number Formats: OFP8, Bfloat16, Posit, and Takum Arithmetics","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"John Gustafson, Laslo Hunhold","submitted_at":"2025-04-29T22:04:16Z","abstract_excerpt":"The Fast Fourier Transform (FFT) is one of the most widely used algorithms in high performance computing, with critical applications in spectral analysis for both signal processing and the numerical solution of partial differential equations (PDEs). These data-intensive workloads are primarily constrained by the memory wall, motivating the exploration of emerging number formats -- such as OFP8 (E4M3 and E5M2), bfloat16, and the tapered-precision posit and takum formats -- as potential alternatives to conventional IEEE 754 floating-point representations.\n  This paper evaluates the accuracy and "},"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":"2504.21197","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2025-04-29T22:04:16Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"6a6b83e6edb522ebc96ba181263117e97b31222d68a1709adfacdc3b4e967f21","abstract_canon_sha256":"ac04d4909ef656afd5334e918827559bcbfed52373ae2e93f104f54bad07852f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:55:58.751619Z","signature_b64":"CZMwNRJuWMlIj54ITPgMX0fZsl9RLXoZHEj+FMiCWZcb4ZEzIuth/DarWmBtlPPBtPe3qS2nWfMLS+J+mpC/CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e92e3b62aa0f2c1bc4caa009ad8f4efb6e4b4252c3627e239b3a53d1a9bcdcf7","last_reissued_at":"2026-07-05T10:55:58.751141Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:55:58.751141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spectral Methods via FFTs in Emerging Machine Number Formats: OFP8, Bfloat16, Posit, and Takum Arithmetics","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"John Gustafson, Laslo Hunhold","submitted_at":"2025-04-29T22:04:16Z","abstract_excerpt":"The Fast Fourier Transform (FFT) is one of the most widely used algorithms in high performance computing, with critical applications in spectral analysis for both signal processing and the numerical solution of partial differential equations (PDEs). These data-intensive workloads are primarily constrained by the memory wall, motivating the exploration of emerging number formats -- such as OFP8 (E4M3 and E5M2), bfloat16, and the tapered-precision posit and takum formats -- as potential alternatives to conventional IEEE 754 floating-point representations.\n  This paper evaluates the accuracy and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.21197","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.21197/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2504.21197","created_at":"2026-07-05T10:55:58.751198+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.21197v1","created_at":"2026-07-05T10:55:58.751198+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.21197","created_at":"2026-07-05T10:55:58.751198+00:00"},{"alias_kind":"pith_short_12","alias_value":"5EXDWYVKB4WB","created_at":"2026-07-05T10:55:58.751198+00:00"},{"alias_kind":"pith_short_16","alias_value":"5EXDWYVKB4WBXRGK","created_at":"2026-07-05T10:55:58.751198+00:00"},{"alias_kind":"pith_short_8","alias_value":"5EXDWYVK","created_at":"2026-07-05T10:55:58.751198+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.28451","citing_title":"Range, Not Precision: Block-Floating-Point Half-Precision FFT and SAR Imaging on Apple Silicon","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5EXDWYVKB4WBXRGKUAE23D2O7N","json":"https://pith.science/pith/5EXDWYVKB4WBXRGKUAE23D2O7N.json","graph_json":"https://pith.science/api/pith-number/5EXDWYVKB4WBXRGKUAE23D2O7N/graph.json","events_json":"https://pith.science/api/pith-number/5EXDWYVKB4WBXRGKUAE23D2O7N/events.json","paper":"https://pith.science/paper/5EXDWYVK"},"agent_actions":{"view_html":"https://pith.science/pith/5EXDWYVKB4WBXRGKUAE23D2O7N","download_json":"https://pith.science/pith/5EXDWYVKB4WBXRGKUAE23D2O7N.json","view_paper":"https://pith.science/paper/5EXDWYVK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.21197&json=true","fetch_graph":"https://pith.science/api/pith-number/5EXDWYVKB4WBXRGKUAE23D2O7N/graph.json","fetch_events":"https://pith.science/api/pith-number/5EXDWYVKB4WBXRGKUAE23D2O7N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5EXDWYVKB4WBXRGKUAE23D2O7N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5EXDWYVKB4WBXRGKUAE23D2O7N/action/storage_attestation","attest_author":"https://pith.science/pith/5EXDWYVKB4WBXRGKUAE23D2O7N/action/author_attestation","sign_citation":"https://pith.science/pith/5EXDWYVKB4WBXRGKUAE23D2O7N/action/citation_signature","submit_replication":"https://pith.science/pith/5EXDWYVKB4WBXRGKUAE23D2O7N/action/replication_record"}},"created_at":"2026-07-05T10:55:58.751198+00:00","updated_at":"2026-07-05T10:55:58.751198+00:00"}