{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DOOP7352OHWUYK6Z6KRPTP3F5S","short_pith_number":"pith:DOOP7352","canonical_record":{"source":{"id":"1807.07397","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-07-19T13:27:35Z","cross_cats_sorted":[],"title_canon_sha256":"e225612d7fe85443b7c95a0ff8f8d9c44f9d8f5178a013e4f2dbfbbea8a74a17","abstract_canon_sha256":"19d93cc8b27a161dce3dccde6863b1e1c218abc1d0f6252795539394f7a66574"},"schema_version":"1.0"},"canonical_sha256":"1b9cffefba71ed4c2bd9f2a2f9bf65ec8a78275c7941024104f2208ba6e50837","source":{"kind":"arxiv","id":"1807.07397","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.07397","created_at":"2026-05-18T00:10:09Z"},{"alias_kind":"arxiv_version","alias_value":"1807.07397v2","created_at":"2026-05-18T00:10:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07397","created_at":"2026-05-18T00:10:09Z"},{"alias_kind":"pith_short_12","alias_value":"DOOP7352OHWU","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DOOP7352OHWUYK6Z","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DOOP7352","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DOOP7352OHWUYK6Z6KRPTP3F5S","target":"record","payload":{"canonical_record":{"source":{"id":"1807.07397","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-07-19T13:27:35Z","cross_cats_sorted":[],"title_canon_sha256":"e225612d7fe85443b7c95a0ff8f8d9c44f9d8f5178a013e4f2dbfbbea8a74a17","abstract_canon_sha256":"19d93cc8b27a161dce3dccde6863b1e1c218abc1d0f6252795539394f7a66574"},"schema_version":"1.0"},"canonical_sha256":"1b9cffefba71ed4c2bd9f2a2f9bf65ec8a78275c7941024104f2208ba6e50837","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:09.728922Z","signature_b64":"HmQfNqRqRnp93PvhqY4ClLcKi0YFWsC/YO0WivLBkW10xppNcSdkjAHlp3mQvRNJxZ/pgQt5LMUMk98JDyWCDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b9cffefba71ed4c2bd9f2a2f9bf65ec8a78275c7941024104f2208ba6e50837","last_reissued_at":"2026-05-18T00:10:09.728195Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:09.728195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.07397","source_version":2,"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:10:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Frlpr3shAZEkYnHYJMnW63FfcdAMNZ4dKz4frr77ASAcWgTY6Ptp61kObgpJV38Dwv6b4aNgdpzEJmlPj6sAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:39:41.839525Z"},"content_sha256":"58620e3e72bfdf2cb8bc1fbef0273b385f188a76b26ebc674393bdfa8e51f06d","schema_version":"1.0","event_id":"sha256:58620e3e72bfdf2cb8bc1fbef0273b385f188a76b26ebc674393bdfa8e51f06d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DOOP7352OHWUYK6Z6KRPTP3F5S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Real Sparse Fast DCT for Vectors with Short Support","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Gerlind Plonka, Sina Bittens","submitted_at":"2018-07-19T13:27:35Z","abstract_excerpt":"In this paper we present a new fast and deterministic algorithm for the inverse discrete cosine transform of type II for reconstructing the input vector $\\mathbf x\\in\\mathbb R^N$, $N=2^J$, with short support of length $m$ from its discrete cosine transform $\\mathbf x^{\\widehat{\\mathrm{II}}}=C^{\\mathrm{II}}_N\\mathbf x$ if an upper bound $M\\geq m$ is known. The resulting algorithm only uses real arithmetic, has a runtime of $\\mathcal{O}\\left(M\\log M+m\\log_2\\frac{N}{M}\\right)$ and requires $\\mathcal{O}\\left(M+m\\log_2\\frac{N}{M}\\right)$ samples of $\\mathbf x^{\\widehat{\\mathrm{II}}}$. For $m,M\\righ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07397","kind":"arxiv","version":2},"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:10:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tAcMKJ800CobC04N/6wIdBadSQvyXqD7mZrZXRejWmGemDyj3q423PU5vMlygUJxkhWNfO6irgXRcL1WeOvvAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:39:41.840164Z"},"content_sha256":"fedd1d752b6870de9cce054c4a5062563894de53f7bd0a46b3e88e363e3e65a0","schema_version":"1.0","event_id":"sha256:fedd1d752b6870de9cce054c4a5062563894de53f7bd0a46b3e88e363e3e65a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DOOP7352OHWUYK6Z6KRPTP3F5S/bundle.json","state_url":"https://pith.science/pith/DOOP7352OHWUYK6Z6KRPTP3F5S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DOOP7352OHWUYK6Z6KRPTP3F5S/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-11T02:39:41Z","links":{"resolver":"https://pith.science/pith/DOOP7352OHWUYK6Z6KRPTP3F5S","bundle":"https://pith.science/pith/DOOP7352OHWUYK6Z6KRPTP3F5S/bundle.json","state":"https://pith.science/pith/DOOP7352OHWUYK6Z6KRPTP3F5S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DOOP7352OHWUYK6Z6KRPTP3F5S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DOOP7352OHWUYK6Z6KRPTP3F5S","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":"19d93cc8b27a161dce3dccde6863b1e1c218abc1d0f6252795539394f7a66574","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-07-19T13:27:35Z","title_canon_sha256":"e225612d7fe85443b7c95a0ff8f8d9c44f9d8f5178a013e4f2dbfbbea8a74a17"},"schema_version":"1.0","source":{"id":"1807.07397","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.07397","created_at":"2026-05-18T00:10:09Z"},{"alias_kind":"arxiv_version","alias_value":"1807.07397v2","created_at":"2026-05-18T00:10:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07397","created_at":"2026-05-18T00:10:09Z"},{"alias_kind":"pith_short_12","alias_value":"DOOP7352OHWU","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DOOP7352OHWUYK6Z","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DOOP7352","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:fedd1d752b6870de9cce054c4a5062563894de53f7bd0a46b3e88e363e3e65a0","target":"graph","created_at":"2026-05-18T00:10:09Z","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 present a new fast and deterministic algorithm for the inverse discrete cosine transform of type II for reconstructing the input vector $\\mathbf x\\in\\mathbb R^N$, $N=2^J$, with short support of length $m$ from its discrete cosine transform $\\mathbf x^{\\widehat{\\mathrm{II}}}=C^{\\mathrm{II}}_N\\mathbf x$ if an upper bound $M\\geq m$ is known. The resulting algorithm only uses real arithmetic, has a runtime of $\\mathcal{O}\\left(M\\log M+m\\log_2\\frac{N}{M}\\right)$ and requires $\\mathcal{O}\\left(M+m\\log_2\\frac{N}{M}\\right)$ samples of $\\mathbf x^{\\widehat{\\mathrm{II}}}$. For $m,M\\righ","authors_text":"Gerlind Plonka, Sina Bittens","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-07-19T13:27:35Z","title":"Real Sparse Fast DCT for Vectors with Short Support"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07397","kind":"arxiv","version":2},"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:58620e3e72bfdf2cb8bc1fbef0273b385f188a76b26ebc674393bdfa8e51f06d","target":"record","created_at":"2026-05-18T00:10:09Z","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":"19d93cc8b27a161dce3dccde6863b1e1c218abc1d0f6252795539394f7a66574","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-07-19T13:27:35Z","title_canon_sha256":"e225612d7fe85443b7c95a0ff8f8d9c44f9d8f5178a013e4f2dbfbbea8a74a17"},"schema_version":"1.0","source":{"id":"1807.07397","kind":"arxiv","version":2}},"canonical_sha256":"1b9cffefba71ed4c2bd9f2a2f9bf65ec8a78275c7941024104f2208ba6e50837","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b9cffefba71ed4c2bd9f2a2f9bf65ec8a78275c7941024104f2208ba6e50837","first_computed_at":"2026-05-18T00:10:09.728195Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:09.728195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HmQfNqRqRnp93PvhqY4ClLcKi0YFWsC/YO0WivLBkW10xppNcSdkjAHlp3mQvRNJxZ/pgQt5LMUMk98JDyWCDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:09.728922Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.07397","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:58620e3e72bfdf2cb8bc1fbef0273b385f188a76b26ebc674393bdfa8e51f06d","sha256:fedd1d752b6870de9cce054c4a5062563894de53f7bd0a46b3e88e363e3e65a0"],"state_sha256":"f76dbf743e35874751046b8104c84ca468ae2f9ca331411cb32058dcb22f42ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rCbpzDx2UwC33Bof9mV1JoT3UQWeKyQMu9C3ATVFnOo5+3qOa43XpTeXRP8jWSyrVNs/IKKyyjrO/imJmzKTDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T02:39:41.843680Z","bundle_sha256":"b5b8650255b8e71ac9f5fad97ca66e68ed8e2f60fbdf138c64e323881c8c4f11"}}