{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:VMHI5JC6S6A3O3P7G7ZJKVL6TT","short_pith_number":"pith:VMHI5JC6","canonical_record":{"source":{"id":"1101.0076","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2010-12-30T12:58:06Z","cross_cats_sorted":["cs.DM","math.CO","math.MP"],"title_canon_sha256":"34245d192a88227cca561e886fec3c202a1925acc56deff5ace3c9fba1bc1681","abstract_canon_sha256":"452d7da53d94ded5b2f0026f6bb9000f009355654bd4ce3b018c88bdd3e34fb4"},"schema_version":"1.0"},"canonical_sha256":"ab0e8ea45e9781b76dff37f295557e9cd28340443c51510f4a6c0bfeb7b4ff22","source":{"kind":"arxiv","id":"1101.0076","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.0076","created_at":"2026-05-18T00:59:10Z"},{"alias_kind":"arxiv_version","alias_value":"1101.0076v1","created_at":"2026-05-18T00:59:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.0076","created_at":"2026-05-18T00:59:10Z"},{"alias_kind":"pith_short_12","alias_value":"VMHI5JC6S6A3","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"VMHI5JC6S6A3O3P7","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"VMHI5JC6","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:VMHI5JC6S6A3O3P7G7ZJKVL6TT","target":"record","payload":{"canonical_record":{"source":{"id":"1101.0076","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2010-12-30T12:58:06Z","cross_cats_sorted":["cs.DM","math.CO","math.MP"],"title_canon_sha256":"34245d192a88227cca561e886fec3c202a1925acc56deff5ace3c9fba1bc1681","abstract_canon_sha256":"452d7da53d94ded5b2f0026f6bb9000f009355654bd4ce3b018c88bdd3e34fb4"},"schema_version":"1.0"},"canonical_sha256":"ab0e8ea45e9781b76dff37f295557e9cd28340443c51510f4a6c0bfeb7b4ff22","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:10.567994Z","signature_b64":"4JA2na6Q6R8nHHjQNPyzaUjXPai5csDhQVHJddeZAds5uvJ6CH6besmn1I6d8ETsJSTvcHNwNxB2Dm1kJ9NJDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab0e8ea45e9781b76dff37f295557e9cd28340443c51510f4a6c0bfeb7b4ff22","last_reissued_at":"2026-05-18T00:59:10.567400Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:10.567400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.0076","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-18T00:59:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SiQDQFO0IkvQ1TkpVqkOOU5XN6RFt85qjyg5DeB1IgPG0QLD0pxnod6vJbqdtRFHBhKQZIy/AyaSudWafIEABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T17:51:28.425556Z"},"content_sha256":"d9bb687fb8783198b5bf4d8d37afc9475294de67f2a275555c93c95553db9560","schema_version":"1.0","event_id":"sha256:d9bb687fb8783198b5bf4d8d37afc9475294de67f2a275555c93c95553db9560"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:VMHI5JC6S6A3O3P7G7ZJKVL6TT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recovering Missing Slices of the Discrete Fourier Transform using Ghosts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.MP"],"primary_cat":"math-ph","authors_text":"Andrew Kingston, Imants Svalbe, JeanPierre Guedon, Nicolas Normand, Shekhar Chandra","submitted_at":"2010-12-30T12:58:06Z","abstract_excerpt":"The Discrete Fourier Transform (DFT) underpins the solution to many inverse problems commonly possessing missing or un-measured frequency information. This incomplete coverage of Fourier space always produces systematic artefacts called Ghosts. In this paper, a fast and exact method for de-convolving cyclic artefacts caused by missing slices of the DFT is presented. The slices discussed here originate from the exact partitioning of DFT space, under the projective Discrete Radon Transform, called the Discrete Fourier Slice Theorem. The method has a computational complexity of O(n log2 n) (where"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.0076","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-18T00:59:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OT1doY3gxYOBxknZYeFGVc3sswM/2Y2stGSm6u7XVfZikJykELqDytGyUSmwQGA9DFuBJ32w6k0jOA3iuyW7Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T17:51:28.425895Z"},"content_sha256":"9c2d70949df17d246afe5ba6791b2273b586775bb4ce7e6383fbda63d85edf09","schema_version":"1.0","event_id":"sha256:9c2d70949df17d246afe5ba6791b2273b586775bb4ce7e6383fbda63d85edf09"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VMHI5JC6S6A3O3P7G7ZJKVL6TT/bundle.json","state_url":"https://pith.science/pith/VMHI5JC6S6A3O3P7G7ZJKVL6TT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VMHI5JC6S6A3O3P7G7ZJKVL6TT/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-28T17:51:28Z","links":{"resolver":"https://pith.science/pith/VMHI5JC6S6A3O3P7G7ZJKVL6TT","bundle":"https://pith.science/pith/VMHI5JC6S6A3O3P7G7ZJKVL6TT/bundle.json","state":"https://pith.science/pith/VMHI5JC6S6A3O3P7G7ZJKVL6TT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VMHI5JC6S6A3O3P7G7ZJKVL6TT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:VMHI5JC6S6A3O3P7G7ZJKVL6TT","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":"452d7da53d94ded5b2f0026f6bb9000f009355654bd4ce3b018c88bdd3e34fb4","cross_cats_sorted":["cs.DM","math.CO","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2010-12-30T12:58:06Z","title_canon_sha256":"34245d192a88227cca561e886fec3c202a1925acc56deff5ace3c9fba1bc1681"},"schema_version":"1.0","source":{"id":"1101.0076","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.0076","created_at":"2026-05-18T00:59:10Z"},{"alias_kind":"arxiv_version","alias_value":"1101.0076v1","created_at":"2026-05-18T00:59:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.0076","created_at":"2026-05-18T00:59:10Z"},{"alias_kind":"pith_short_12","alias_value":"VMHI5JC6S6A3","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"VMHI5JC6S6A3O3P7","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"VMHI5JC6","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:9c2d70949df17d246afe5ba6791b2273b586775bb4ce7e6383fbda63d85edf09","target":"graph","created_at":"2026-05-18T00:59:10Z","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":"The Discrete Fourier Transform (DFT) underpins the solution to many inverse problems commonly possessing missing or un-measured frequency information. This incomplete coverage of Fourier space always produces systematic artefacts called Ghosts. In this paper, a fast and exact method for de-convolving cyclic artefacts caused by missing slices of the DFT is presented. The slices discussed here originate from the exact partitioning of DFT space, under the projective Discrete Radon Transform, called the Discrete Fourier Slice Theorem. The method has a computational complexity of O(n log2 n) (where","authors_text":"Andrew Kingston, Imants Svalbe, JeanPierre Guedon, Nicolas Normand, Shekhar Chandra","cross_cats":["cs.DM","math.CO","math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2010-12-30T12:58:06Z","title":"Recovering Missing Slices of the Discrete Fourier Transform using Ghosts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.0076","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:d9bb687fb8783198b5bf4d8d37afc9475294de67f2a275555c93c95553db9560","target":"record","created_at":"2026-05-18T00:59:10Z","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":"452d7da53d94ded5b2f0026f6bb9000f009355654bd4ce3b018c88bdd3e34fb4","cross_cats_sorted":["cs.DM","math.CO","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2010-12-30T12:58:06Z","title_canon_sha256":"34245d192a88227cca561e886fec3c202a1925acc56deff5ace3c9fba1bc1681"},"schema_version":"1.0","source":{"id":"1101.0076","kind":"arxiv","version":1}},"canonical_sha256":"ab0e8ea45e9781b76dff37f295557e9cd28340443c51510f4a6c0bfeb7b4ff22","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab0e8ea45e9781b76dff37f295557e9cd28340443c51510f4a6c0bfeb7b4ff22","first_computed_at":"2026-05-18T00:59:10.567400Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:10.567400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4JA2na6Q6R8nHHjQNPyzaUjXPai5csDhQVHJddeZAds5uvJ6CH6besmn1I6d8ETsJSTvcHNwNxB2Dm1kJ9NJDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:10.567994Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.0076","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d9bb687fb8783198b5bf4d8d37afc9475294de67f2a275555c93c95553db9560","sha256:9c2d70949df17d246afe5ba6791b2273b586775bb4ce7e6383fbda63d85edf09"],"state_sha256":"55f52a3592f5e683eddf0b961a3e2da9fb9f7ec0223fec916c200045beb71f7a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/gDsggl/orzWO7hCJjqdkgm6HL2MWAy4nva/QzSKUtEmXskuJrgtanweZDloxzKEHxisMsNJQFN8P+qjGh+uCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T17:51:28.427751Z","bundle_sha256":"644c35eaca8f2c67ebc2c6ca036d8b7627d60b5a7328070a598334dd5d643e7e"}}