{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:3NLW3VSOUSUZ5TLNFBIF2PLMA2","short_pith_number":"pith:3NLW3VSO","schema_version":"1.0","canonical_sha256":"db576dd64ea4a99ecd6d28505d3d6c069d7820ed9aeef8634390d28a25581ddb","source":{"kind":"arxiv","id":"2501.05977","version":1},"attestation_state":"computed","paper":{"title":"The Hitchhiker's Guide to QSP pre-processing","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"S. E. Skelton","submitted_at":"2025-01-10T14:01:37Z","abstract_excerpt":"Quantum signal processing (QSP) relies on a historically costly pre-processing step, \"QSP-processing/phase-factor finding.\" QSP-processing is now a developed topic within quantum algorithms literature, and a beginner accessible review of QSP-processing is overdue. This work provides a whirlwind tour through QSP conventions and pre-processing methods, beginning from a pedagogically accessible QSP convention. We then review QSP conventions associated with three common polynomial types: real polynomials with definite parity, sums of reciprocal/anti-reciprocal Chebyshev polynomials, and complex po"},"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":"2501.05977","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2025-01-10T14:01:37Z","cross_cats_sorted":[],"title_canon_sha256":"5d47b1c9973cad8d5452a63f046119d65f1794b3621d6fdcc2f9e7f28c18a4d2","abstract_canon_sha256":"0f2466833273af5bf7356068721d009aadb4b6e72af17e812fa5a1c3c9fae4b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:59:31.019850Z","signature_b64":"32wntB8+6uDkTJrVSfETRCCIH90cV1isA5L3A7L0gbDBlndGlSY7nSjWMqlUjiUwFAfcfmcx+/LTUREuv4RiDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db576dd64ea4a99ecd6d28505d3d6c069d7820ed9aeef8634390d28a25581ddb","last_reissued_at":"2026-07-05T09:59:31.019435Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:59:31.019435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Hitchhiker's Guide to QSP pre-processing","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"S. E. Skelton","submitted_at":"2025-01-10T14:01:37Z","abstract_excerpt":"Quantum signal processing (QSP) relies on a historically costly pre-processing step, \"QSP-processing/phase-factor finding.\" QSP-processing is now a developed topic within quantum algorithms literature, and a beginner accessible review of QSP-processing is overdue. This work provides a whirlwind tour through QSP conventions and pre-processing methods, beginning from a pedagogically accessible QSP convention. We then review QSP conventions associated with three common polynomial types: real polynomials with definite parity, sums of reciprocal/anti-reciprocal Chebyshev polynomials, and complex po"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.05977","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/2501.05977/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":"2501.05977","created_at":"2026-07-05T09:59:31.019491+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.05977v1","created_at":"2026-07-05T09:59:31.019491+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.05977","created_at":"2026-07-05T09:59:31.019491+00:00"},{"alias_kind":"pith_short_12","alias_value":"3NLW3VSOUSUZ","created_at":"2026-07-05T09:59:31.019491+00:00"},{"alias_kind":"pith_short_16","alias_value":"3NLW3VSOUSUZ5TLN","created_at":"2026-07-05T09:59:31.019491+00:00"},{"alias_kind":"pith_short_8","alias_value":"3NLW3VSO","created_at":"2026-07-05T09:59:31.019491+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.22463","citing_title":"Quantum analog-encoding for correlated Gaussian vectors and their exponentiation with application to rough volatility","ref_index":44,"is_internal_anchor":false},{"citing_arxiv_id":"2604.22463","citing_title":"Quantum analog-encoding for correlated Gaussian vectors and their exponentiation with application to rough volatility","ref_index":44,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3NLW3VSOUSUZ5TLNFBIF2PLMA2","json":"https://pith.science/pith/3NLW3VSOUSUZ5TLNFBIF2PLMA2.json","graph_json":"https://pith.science/api/pith-number/3NLW3VSOUSUZ5TLNFBIF2PLMA2/graph.json","events_json":"https://pith.science/api/pith-number/3NLW3VSOUSUZ5TLNFBIF2PLMA2/events.json","paper":"https://pith.science/paper/3NLW3VSO"},"agent_actions":{"view_html":"https://pith.science/pith/3NLW3VSOUSUZ5TLNFBIF2PLMA2","download_json":"https://pith.science/pith/3NLW3VSOUSUZ5TLNFBIF2PLMA2.json","view_paper":"https://pith.science/paper/3NLW3VSO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.05977&json=true","fetch_graph":"https://pith.science/api/pith-number/3NLW3VSOUSUZ5TLNFBIF2PLMA2/graph.json","fetch_events":"https://pith.science/api/pith-number/3NLW3VSOUSUZ5TLNFBIF2PLMA2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3NLW3VSOUSUZ5TLNFBIF2PLMA2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3NLW3VSOUSUZ5TLNFBIF2PLMA2/action/storage_attestation","attest_author":"https://pith.science/pith/3NLW3VSOUSUZ5TLNFBIF2PLMA2/action/author_attestation","sign_citation":"https://pith.science/pith/3NLW3VSOUSUZ5TLNFBIF2PLMA2/action/citation_signature","submit_replication":"https://pith.science/pith/3NLW3VSOUSUZ5TLNFBIF2PLMA2/action/replication_record"}},"created_at":"2026-07-05T09:59:31.019491+00:00","updated_at":"2026-07-05T09:59:31.019491+00:00"}