{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4TSBB5N26HMCXPFU5HF5M6QT4D","short_pith_number":"pith:4TSBB5N2","canonical_record":{"source":{"id":"1409.5757","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2014-09-19T18:48:58Z","cross_cats_sorted":["cs.DC","cs.DS","cs.PF"],"title_canon_sha256":"e3e5fabd5df1ecc4c0e15b3ebada85d7f95da2d605a96e68f8e78c33cd057c1f","abstract_canon_sha256":"eede235ab8147ea25a5fdba4257163bc0eaa4c1715b8890661f1db66927c5b7a"},"schema_version":"1.0"},"canonical_sha256":"e4e410f5baf1d82bbcb4e9cbd67a13e0c9f847f1810879d21021e58ff964c9a6","source":{"kind":"arxiv","id":"1409.5757","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.5757","created_at":"2026-05-18T01:11:18Z"},{"alias_kind":"arxiv_version","alias_value":"1409.5757v1","created_at":"2026-05-18T01:11:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.5757","created_at":"2026-05-18T01:11:18Z"},{"alias_kind":"pith_short_12","alias_value":"4TSBB5N26HMC","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4TSBB5N26HMCXPFU","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4TSBB5N2","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4TSBB5N26HMCXPFU5HF5M6QT4D","target":"record","payload":{"canonical_record":{"source":{"id":"1409.5757","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2014-09-19T18:48:58Z","cross_cats_sorted":["cs.DC","cs.DS","cs.PF"],"title_canon_sha256":"e3e5fabd5df1ecc4c0e15b3ebada85d7f95da2d605a96e68f8e78c33cd057c1f","abstract_canon_sha256":"eede235ab8147ea25a5fdba4257163bc0eaa4c1715b8890661f1db66927c5b7a"},"schema_version":"1.0"},"canonical_sha256":"e4e410f5baf1d82bbcb4e9cbd67a13e0c9f847f1810879d21021e58ff964c9a6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:18.530133Z","signature_b64":"varEjRmf46CqyEPcIiIbxEtZ9E25bqnVIshSkCQiE+5Ooo0PSA5uby9u1VhQ7pn6XLuKCFKdHMAr3YokiL2RAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4e410f5baf1d82bbcb4e9cbd67a13e0c9f847f1810879d21021e58ff964c9a6","last_reissued_at":"2026-05-18T01:11:18.529657Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:18.529657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.5757","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:11:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ifp7ermadxKOs/dtpquQDGWUgnyR0hkVgLoaQH3nv9wsfbSOEEZh7LBCLTe1Fz2lLkQDc4bnnlDhPB46dpiYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:56:45.986177Z"},"content_sha256":"e69e248990ea99321e8a6a74d853c1c099a3155698ef0768b20b7b87ddcb4ef2","schema_version":"1.0","event_id":"sha256:e69e248990ea99321e8a6a74d853c1c099a3155698ef0768b20b7b87ddcb4ef2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4TSBB5N26HMCXPFU5HF5M6QT4D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Intel Cilk Plus for Complex Parallel Algorithms: \"Enormous Fast Fourier Transform\" (EFFT) Library","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DS","cs.PF"],"primary_cat":"cs.MS","authors_text":"Andrey Vladimirov, Ryo Asai","submitted_at":"2014-09-19T18:48:58Z","abstract_excerpt":"In this paper we demonstrate the methodology for parallelizing the computation of large one-dimensional discrete fast Fourier transforms (DFFTs) on multi-core Intel Xeon processors. DFFTs based on the recursive Cooley-Tukey method have to control cache utilization, memory bandwidth and vector hardware usage, and at the same time scale across multiple threads or compute nodes. Our method builds on single-threaded Intel Math Kernel Library (MKL) implementation of DFFT, and uses the Intel Cilk Plus framework for thread parallelism. We demonstrate the ability of Intel Cilk Plus to handle parallel "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.5757","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:11:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jN/y2n1xGE6wjOtOnI3nOA/3o2xXFZnTTr4y1P05BFtcBhBPaT/3EbiVWVWZxgzZ+pjCWR5Cf6D5pGvJmzsJBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:56:45.986574Z"},"content_sha256":"34da600e66890b0e15c9d115f562a7ae57346190e4fb3c3c707c18c529b2cf64","schema_version":"1.0","event_id":"sha256:34da600e66890b0e15c9d115f562a7ae57346190e4fb3c3c707c18c529b2cf64"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4TSBB5N26HMCXPFU5HF5M6QT4D/bundle.json","state_url":"https://pith.science/pith/4TSBB5N26HMCXPFU5HF5M6QT4D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4TSBB5N26HMCXPFU5HF5M6QT4D/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T20:56:45Z","links":{"resolver":"https://pith.science/pith/4TSBB5N26HMCXPFU5HF5M6QT4D","bundle":"https://pith.science/pith/4TSBB5N26HMCXPFU5HF5M6QT4D/bundle.json","state":"https://pith.science/pith/4TSBB5N26HMCXPFU5HF5M6QT4D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4TSBB5N26HMCXPFU5HF5M6QT4D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4TSBB5N26HMCXPFU5HF5M6QT4D","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"eede235ab8147ea25a5fdba4257163bc0eaa4c1715b8890661f1db66927c5b7a","cross_cats_sorted":["cs.DC","cs.DS","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2014-09-19T18:48:58Z","title_canon_sha256":"e3e5fabd5df1ecc4c0e15b3ebada85d7f95da2d605a96e68f8e78c33cd057c1f"},"schema_version":"1.0","source":{"id":"1409.5757","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.5757","created_at":"2026-05-18T01:11:18Z"},{"alias_kind":"arxiv_version","alias_value":"1409.5757v1","created_at":"2026-05-18T01:11:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.5757","created_at":"2026-05-18T01:11:18Z"},{"alias_kind":"pith_short_12","alias_value":"4TSBB5N26HMC","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4TSBB5N26HMCXPFU","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4TSBB5N2","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:34da600e66890b0e15c9d115f562a7ae57346190e4fb3c3c707c18c529b2cf64","target":"graph","created_at":"2026-05-18T01:11:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this paper we demonstrate the methodology for parallelizing the computation of large one-dimensional discrete fast Fourier transforms (DFFTs) on multi-core Intel Xeon processors. DFFTs based on the recursive Cooley-Tukey method have to control cache utilization, memory bandwidth and vector hardware usage, and at the same time scale across multiple threads or compute nodes. Our method builds on single-threaded Intel Math Kernel Library (MKL) implementation of DFFT, and uses the Intel Cilk Plus framework for thread parallelism. We demonstrate the ability of Intel Cilk Plus to handle parallel ","authors_text":"Andrey Vladimirov, Ryo Asai","cross_cats":["cs.DC","cs.DS","cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2014-09-19T18:48:58Z","title":"Intel Cilk Plus for Complex Parallel Algorithms: \"Enormous Fast Fourier Transform\" (EFFT) Library"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.5757","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e69e248990ea99321e8a6a74d853c1c099a3155698ef0768b20b7b87ddcb4ef2","target":"record","created_at":"2026-05-18T01:11:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"eede235ab8147ea25a5fdba4257163bc0eaa4c1715b8890661f1db66927c5b7a","cross_cats_sorted":["cs.DC","cs.DS","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2014-09-19T18:48:58Z","title_canon_sha256":"e3e5fabd5df1ecc4c0e15b3ebada85d7f95da2d605a96e68f8e78c33cd057c1f"},"schema_version":"1.0","source":{"id":"1409.5757","kind":"arxiv","version":1}},"canonical_sha256":"e4e410f5baf1d82bbcb4e9cbd67a13e0c9f847f1810879d21021e58ff964c9a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4e410f5baf1d82bbcb4e9cbd67a13e0c9f847f1810879d21021e58ff964c9a6","first_computed_at":"2026-05-18T01:11:18.529657Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:18.529657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"varEjRmf46CqyEPcIiIbxEtZ9E25bqnVIshSkCQiE+5Ooo0PSA5uby9u1VhQ7pn6XLuKCFKdHMAr3YokiL2RAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:18.530133Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.5757","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e69e248990ea99321e8a6a74d853c1c099a3155698ef0768b20b7b87ddcb4ef2","sha256:34da600e66890b0e15c9d115f562a7ae57346190e4fb3c3c707c18c529b2cf64"],"state_sha256":"6431423b65e1782d5b23d1eeb23459e780b6f667e623f099597b61ec5bce94f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RogqwLtVOlZIYs22oSV+uNHPrwjjWG/9wSOoDyPnEMWiU13y6zPsUL4mj/LihsQRyUY64GN+LDIm7T+B6xhzAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:56:45.988826Z","bundle_sha256":"a7bb7f44e584476e5645d9561b0165b5d0fd626f2f4b9aa5035bb8c32aab35d9"}}