{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:UIHEAHPWO3GZ7DBBJZNLAB46J5","short_pith_number":"pith:UIHEAHPW","schema_version":"1.0","canonical_sha256":"a20e401df676cd9f8c214e5ab0079e4f6296496513b7f384392c48c47c4ee674","source":{"kind":"arxiv","id":"2608.08433","version":1},"attestation_state":"computed","paper":{"title":"The Input Problem: A Permanent Bottleneck for Quantum Machine Learning","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Muhammad Faryad","submitted_at":"2026-08-09T03:04:03Z","abstract_excerpt":"Quantum algorithms are conventionally presented with their input state supplied for free. When the input is classical data, this convention conceals a cost that is frequently larger than the algorithm it precedes. We review what the three standard encodings, such as basis encoding, amplitude encoding, and Grover--Rudolph distribution loading, actually cost once transpiled to a hardware gate set, and argue that the resulting $\\Theta(N)$ bound is a counting theorem rather than an engineering limitation that improved hardware will remove. Measured gate counts for a representative loading task are"},"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":"2608.08433","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2026-08-09T03:04:03Z","cross_cats_sorted":[],"title_canon_sha256":"4c4aaa1012f10c1526793be491296071cdf7d7af3c8db97e3249d8be867b1d0c","abstract_canon_sha256":"9ae5d270816cd43d1a93c2a5a492df00a114958b0cf4037f3d3f18079777ad01"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-11T01:22:37.673304Z","signature_b64":"nUVZ+0GMECTFFenXa6aRftfcK32k//+L26fgysRgFSwmR+jaqF3JcEGbe1oIJbYDJUpBp2giPR9RGlzcbsKAAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a20e401df676cd9f8c214e5ab0079e4f6296496513b7f384392c48c47c4ee674","last_reissued_at":"2026-08-11T01:22:37.670818Z","signature_status":"signed_v1","first_computed_at":"2026-08-11T01:22:37.670818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Input Problem: A Permanent Bottleneck for Quantum Machine Learning","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Muhammad Faryad","submitted_at":"2026-08-09T03:04:03Z","abstract_excerpt":"Quantum algorithms are conventionally presented with their input state supplied for free. When the input is classical data, this convention conceals a cost that is frequently larger than the algorithm it precedes. We review what the three standard encodings, such as basis encoding, amplitude encoding, and Grover--Rudolph distribution loading, actually cost once transpiled to a hardware gate set, and argue that the resulting $\\Theta(N)$ bound is a counting theorem rather than an engineering limitation that improved hardware will remove. Measured gate counts for a representative loading task are"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.08433","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/2608.08433/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":"2608.08433","created_at":"2026-08-11T01:22:37.671597+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.08433v1","created_at":"2026-08-11T01:22:37.671597+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.08433","created_at":"2026-08-11T01:22:37.671597+00:00"},{"alias_kind":"pith_short_12","alias_value":"UIHEAHPWO3GZ","created_at":"2026-08-11T01:22:37.671597+00:00"},{"alias_kind":"pith_short_16","alias_value":"UIHEAHPWO3GZ7DBB","created_at":"2026-08-11T01:22:37.671597+00:00"},{"alias_kind":"pith_short_8","alias_value":"UIHEAHPW","created_at":"2026-08-11T01:22:37.671597+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UIHEAHPWO3GZ7DBBJZNLAB46J5","json":"https://pith.science/pith/UIHEAHPWO3GZ7DBBJZNLAB46J5.json","graph_json":"https://pith.science/api/pith-number/UIHEAHPWO3GZ7DBBJZNLAB46J5/graph.json","events_json":"https://pith.science/api/pith-number/UIHEAHPWO3GZ7DBBJZNLAB46J5/events.json","paper":"https://pith.science/paper/UIHEAHPW"},"agent_actions":{"view_html":"https://pith.science/pith/UIHEAHPWO3GZ7DBBJZNLAB46J5","download_json":"https://pith.science/pith/UIHEAHPWO3GZ7DBBJZNLAB46J5.json","view_paper":"https://pith.science/paper/UIHEAHPW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.08433&json=true","fetch_graph":"https://pith.science/api/pith-number/UIHEAHPWO3GZ7DBBJZNLAB46J5/graph.json","fetch_events":"https://pith.science/api/pith-number/UIHEAHPWO3GZ7DBBJZNLAB46J5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UIHEAHPWO3GZ7DBBJZNLAB46J5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UIHEAHPWO3GZ7DBBJZNLAB46J5/action/storage_attestation","attest_author":"https://pith.science/pith/UIHEAHPWO3GZ7DBBJZNLAB46J5/action/author_attestation","sign_citation":"https://pith.science/pith/UIHEAHPWO3GZ7DBBJZNLAB46J5/action/citation_signature","submit_replication":"https://pith.science/pith/UIHEAHPWO3GZ7DBBJZNLAB46J5/action/replication_record"}},"created_at":"2026-08-11T01:22:37.671597+00:00","updated_at":"2026-08-11T01:22:37.671597+00:00"}