{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:RERAYJ32W2D5L3TLYIN2LMUJY7","short_pith_number":"pith:RERAYJ32","canonical_record":{"source":{"id":"0802.1554","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.NA","submitted_at":"2008-02-12T02:10:41Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"2429150f14bf5a537f3a9f9e2397c67bb299b4211a733368d80006b70412834d","abstract_canon_sha256":"ac3b216589eb0077c7a83e4c417f25e97a0874bf9524b782a8698bd41743eb7d"},"schema_version":"1.0"},"canonical_sha256":"89220c277ab687d5ee6bc21ba5b289c7f772332faa329f4a00af5044d1fd1ca3","source":{"kind":"arxiv","id":"0802.1554","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0802.1554","created_at":"2026-06-03T22:06:04Z"},{"alias_kind":"arxiv_version","alias_value":"0802.1554v1","created_at":"2026-06-03T22:06:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0802.1554","created_at":"2026-06-03T22:06:04Z"},{"alias_kind":"pith_short_12","alias_value":"RERAYJ32W2D5","created_at":"2026-06-03T22:06:04Z"},{"alias_kind":"pith_short_16","alias_value":"RERAYJ32W2D5L3TL","created_at":"2026-06-03T22:06:04Z"},{"alias_kind":"pith_short_8","alias_value":"RERAYJ32","created_at":"2026-06-03T22:06:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:RERAYJ32W2D5L3TLYIN2LMUJY7","target":"record","payload":{"canonical_record":{"source":{"id":"0802.1554","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.NA","submitted_at":"2008-02-12T02:10:41Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"2429150f14bf5a537f3a9f9e2397c67bb299b4211a733368d80006b70412834d","abstract_canon_sha256":"ac3b216589eb0077c7a83e4c417f25e97a0874bf9524b782a8698bd41743eb7d"},"schema_version":"1.0"},"canonical_sha256":"89220c277ab687d5ee6bc21ba5b289c7f772332faa329f4a00af5044d1fd1ca3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T22:06:04.411372Z","signature_b64":"9VO7YOYQATamtp/5nIpTWC7mcwnqgNhjtMHe7DvdEIUq940tAH8GJTIVExA/h5IR1Nz+hmFXtOCJf50vwUeoDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89220c277ab687d5ee6bc21ba5b289c7f772332faa329f4a00af5044d1fd1ca3","last_reissued_at":"2026-06-03T22:06:04.410963Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T22:06:04.410963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0802.1554","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-06-03T22:06:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KZiNhkLNmWpSzCcfJEifBooMvW1PXUz8SyUWgrg2g12fHRkI3ZTrud1RG4vsykcZlANL+TJOQNCUOT9n8TGBDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T14:27:00.919209Z"},"content_sha256":"7908b3c6ea38af820d649cd66724b416d52d9927b7f49422c3c937126594659c","schema_version":"1.0","event_id":"sha256:7908b3c6ea38af820d649cd66724b416d52d9927b7f49422c3c937126594659c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:RERAYJ32W2D5L3TLYIN2LMUJY7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Computation of Partial Fourier Transforms","license":"","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Lexing Ying, Sergey Fomel","submitted_at":"2008-02-12T02:10:41Z","abstract_excerpt":"We introduce two efficient algorithms for computing the partial\n  Fourier transforms in one and two dimensions. Our study is motivated by the wave extrapolation procedure in reflection seismology. In both algorithms, the main idea is to decompose the summation domain of into simpler components in a multiscale way. Existing fast algorithms are then applied to each component to obtain optimal complexity. The algorithm in 1D is exact and takes $O(N\\log^2 N)$ steps. Our solution in 2D is an approximate but accurate algorithm that takes $O(N^2 \\log^2 N)$ steps. In both cases, the complexities are a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0802.1554","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/0802.1554/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"},"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-06-03T22:06:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zkXDJGR7+/LYBfUlScfzgLHCOBtU4Nq4k+bmqsovSdOVb99ScoPJDXdgtZQa40U+LpwKijGxaCcOIRhqQW+CAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T14:27:00.919600Z"},"content_sha256":"2fef2022d8ada46621b102b079e4253b861b412290a2717ab22fb95ff84bda57","schema_version":"1.0","event_id":"sha256:2fef2022d8ada46621b102b079e4253b861b412290a2717ab22fb95ff84bda57"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RERAYJ32W2D5L3TLYIN2LMUJY7/bundle.json","state_url":"https://pith.science/pith/RERAYJ32W2D5L3TLYIN2LMUJY7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RERAYJ32W2D5L3TLYIN2LMUJY7/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-07-04T14:27:00Z","links":{"resolver":"https://pith.science/pith/RERAYJ32W2D5L3TLYIN2LMUJY7","bundle":"https://pith.science/pith/RERAYJ32W2D5L3TLYIN2LMUJY7/bundle.json","state":"https://pith.science/pith/RERAYJ32W2D5L3TLYIN2LMUJY7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RERAYJ32W2D5L3TLYIN2LMUJY7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:RERAYJ32W2D5L3TLYIN2LMUJY7","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":"ac3b216589eb0077c7a83e4c417f25e97a0874bf9524b782a8698bd41743eb7d","cross_cats_sorted":["cs.NA"],"license":"","primary_cat":"math.NA","submitted_at":"2008-02-12T02:10:41Z","title_canon_sha256":"2429150f14bf5a537f3a9f9e2397c67bb299b4211a733368d80006b70412834d"},"schema_version":"1.0","source":{"id":"0802.1554","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0802.1554","created_at":"2026-06-03T22:06:04Z"},{"alias_kind":"arxiv_version","alias_value":"0802.1554v1","created_at":"2026-06-03T22:06:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0802.1554","created_at":"2026-06-03T22:06:04Z"},{"alias_kind":"pith_short_12","alias_value":"RERAYJ32W2D5","created_at":"2026-06-03T22:06:04Z"},{"alias_kind":"pith_short_16","alias_value":"RERAYJ32W2D5L3TL","created_at":"2026-06-03T22:06:04Z"},{"alias_kind":"pith_short_8","alias_value":"RERAYJ32","created_at":"2026-06-03T22:06:04Z"}],"graph_snapshots":[{"event_id":"sha256:2fef2022d8ada46621b102b079e4253b861b412290a2717ab22fb95ff84bda57","target":"graph","created_at":"2026-06-03T22:06:04Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/0802.1554/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce two efficient algorithms for computing the partial\n  Fourier transforms in one and two dimensions. Our study is motivated by the wave extrapolation procedure in reflection seismology. In both algorithms, the main idea is to decompose the summation domain of into simpler components in a multiscale way. Existing fast algorithms are then applied to each component to obtain optimal complexity. The algorithm in 1D is exact and takes $O(N\\log^2 N)$ steps. Our solution in 2D is an approximate but accurate algorithm that takes $O(N^2 \\log^2 N)$ steps. In both cases, the complexities are a","authors_text":"Lexing Ying, Sergey Fomel","cross_cats":["cs.NA"],"headline":"","license":"","primary_cat":"math.NA","submitted_at":"2008-02-12T02:10:41Z","title":"Fast Computation of Partial Fourier Transforms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0802.1554","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:7908b3c6ea38af820d649cd66724b416d52d9927b7f49422c3c937126594659c","target":"record","created_at":"2026-06-03T22:06:04Z","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":"ac3b216589eb0077c7a83e4c417f25e97a0874bf9524b782a8698bd41743eb7d","cross_cats_sorted":["cs.NA"],"license":"","primary_cat":"math.NA","submitted_at":"2008-02-12T02:10:41Z","title_canon_sha256":"2429150f14bf5a537f3a9f9e2397c67bb299b4211a733368d80006b70412834d"},"schema_version":"1.0","source":{"id":"0802.1554","kind":"arxiv","version":1}},"canonical_sha256":"89220c277ab687d5ee6bc21ba5b289c7f772332faa329f4a00af5044d1fd1ca3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"89220c277ab687d5ee6bc21ba5b289c7f772332faa329f4a00af5044d1fd1ca3","first_computed_at":"2026-06-03T22:06:04.410963Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T22:06:04.410963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9VO7YOYQATamtp/5nIpTWC7mcwnqgNhjtMHe7DvdEIUq940tAH8GJTIVExA/h5IR1Nz+hmFXtOCJf50vwUeoDg==","signature_status":"signed_v1","signed_at":"2026-06-03T22:06:04.411372Z","signed_message":"canonical_sha256_bytes"},"source_id":"0802.1554","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7908b3c6ea38af820d649cd66724b416d52d9927b7f49422c3c937126594659c","sha256:2fef2022d8ada46621b102b079e4253b861b412290a2717ab22fb95ff84bda57"],"state_sha256":"004ebc7e869bec9629dbdd2dcabe09611411f2cd0ed4736915e5c30c64a34e9b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4rDM3/C4nG1UV9HNUfMndtk4I8I3nBrP15BxDjONlqBodbbJDW7khN2osS0kzx2p4FQLI67HjgYLXIZgc8iiAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T14:27:00.921617Z","bundle_sha256":"d05050a3c3f047e7a0099c2fd15cf72360d367f0e5b1796d2fad9ec0b142d9ac"}}