{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:UIHEAHPWO3GZ7DBBJZNLAB46J5","short_pith_number":"pith:UIHEAHPW","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"},"canonical_sha256":"a20e401df676cd9f8c214e5ab0079e4f6296496513b7f384392c48c47c4ee674","source":{"kind":"arxiv","id":"2608.08433","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.08433","created_at":"2026-08-11T01:22:37Z"},{"alias_kind":"arxiv_version","alias_value":"2608.08433v1","created_at":"2026-08-11T01:22:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.08433","created_at":"2026-08-11T01:22:37Z"},{"alias_kind":"pith_short_12","alias_value":"UIHEAHPWO3GZ","created_at":"2026-08-11T01:22:37Z"},{"alias_kind":"pith_short_16","alias_value":"UIHEAHPWO3GZ7DBB","created_at":"2026-08-11T01:22:37Z"},{"alias_kind":"pith_short_8","alias_value":"UIHEAHPW","created_at":"2026-08-11T01:22:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:UIHEAHPWO3GZ7DBBJZNLAB46J5","target":"record","payload":{"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"},"canonical_sha256":"a20e401df676cd9f8c214e5ab0079e4f6296496513b7f384392c48c47c4ee674","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"},"source_kind":"arxiv","source_id":"2608.08433","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-08-11T01:22:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JHkNb0hIHKv4yrBxGMAs4LRjlhmNU238i5lB3mAHNJE9rkBQVyA/yq9JX6cvdLDBa7akkfmIN4zv/OsM/svvCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T05:46:40.048707Z"},"content_sha256":"ae4699e592bfd071f30030e23887af59aafc2b31841bdbc47dd48bb8cb9d9316","schema_version":"1.0","event_id":"sha256:ae4699e592bfd071f30030e23887af59aafc2b31841bdbc47dd48bb8cb9d9316"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:UIHEAHPWO3GZ7DBBJZNLAB46J5","target":"graph","payload":{"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"},"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-08-11T01:22:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GPWlwlasFj1cgwuiVPZxqH6DTQ5VVR4ukoQBfct0MDdvf0QClXtAlyqbDzjN8+h3jBsR3mEoYtOWl0O3CQtoDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T05:46:40.049320Z"},"content_sha256":"f899d3ff1b99018482ff49a909dc47d39ff2cc8d5e666de16b4e1f7817c09b7d","schema_version":"1.0","event_id":"sha256:f899d3ff1b99018482ff49a909dc47d39ff2cc8d5e666de16b4e1f7817c09b7d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UIHEAHPWO3GZ7DBBJZNLAB46J5/bundle.json","state_url":"https://pith.science/pith/UIHEAHPWO3GZ7DBBJZNLAB46J5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UIHEAHPWO3GZ7DBBJZNLAB46J5/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-08-15T05:46:40Z","links":{"resolver":"https://pith.science/pith/UIHEAHPWO3GZ7DBBJZNLAB46J5","bundle":"https://pith.science/pith/UIHEAHPWO3GZ7DBBJZNLAB46J5/bundle.json","state":"https://pith.science/pith/UIHEAHPWO3GZ7DBBJZNLAB46J5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UIHEAHPWO3GZ7DBBJZNLAB46J5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:UIHEAHPWO3GZ7DBBJZNLAB46J5","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":"9ae5d270816cd43d1a93c2a5a492df00a114958b0cf4037f3d3f18079777ad01","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2026-08-09T03:04:03Z","title_canon_sha256":"4c4aaa1012f10c1526793be491296071cdf7d7af3c8db97e3249d8be867b1d0c"},"schema_version":"1.0","source":{"id":"2608.08433","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.08433","created_at":"2026-08-11T01:22:37Z"},{"alias_kind":"arxiv_version","alias_value":"2608.08433v1","created_at":"2026-08-11T01:22:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.08433","created_at":"2026-08-11T01:22:37Z"},{"alias_kind":"pith_short_12","alias_value":"UIHEAHPWO3GZ","created_at":"2026-08-11T01:22:37Z"},{"alias_kind":"pith_short_16","alias_value":"UIHEAHPWO3GZ7DBB","created_at":"2026-08-11T01:22:37Z"},{"alias_kind":"pith_short_8","alias_value":"UIHEAHPW","created_at":"2026-08-11T01:22:37Z"}],"graph_snapshots":[{"event_id":"sha256:f899d3ff1b99018482ff49a909dc47d39ff2cc8d5e666de16b4e1f7817c09b7d","target":"graph","created_at":"2026-08-11T01:22:37Z","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/2608.08433/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Muhammad Faryad","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2026-08-09T03:04:03Z","title":"The Input Problem: A Permanent Bottleneck for Quantum Machine Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.08433","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:ae4699e592bfd071f30030e23887af59aafc2b31841bdbc47dd48bb8cb9d9316","target":"record","created_at":"2026-08-11T01:22:37Z","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":"9ae5d270816cd43d1a93c2a5a492df00a114958b0cf4037f3d3f18079777ad01","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2026-08-09T03:04:03Z","title_canon_sha256":"4c4aaa1012f10c1526793be491296071cdf7d7af3c8db97e3249d8be867b1d0c"},"schema_version":"1.0","source":{"id":"2608.08433","kind":"arxiv","version":1}},"canonical_sha256":"a20e401df676cd9f8c214e5ab0079e4f6296496513b7f384392c48c47c4ee674","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a20e401df676cd9f8c214e5ab0079e4f6296496513b7f384392c48c47c4ee674","first_computed_at":"2026-08-11T01:22:37.670818Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-11T01:22:37.670818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nUVZ+0GMECTFFenXa6aRftfcK32k//+L26fgysRgFSwmR+jaqF3JcEGbe1oIJbYDJUpBp2giPR9RGlzcbsKAAA==","signature_status":"signed_v1","signed_at":"2026-08-11T01:22:37.673304Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.08433","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae4699e592bfd071f30030e23887af59aafc2b31841bdbc47dd48bb8cb9d9316","sha256:f899d3ff1b99018482ff49a909dc47d39ff2cc8d5e666de16b4e1f7817c09b7d"],"state_sha256":"6d57dfee7e2a453336f08f440a453109afea8f93323fec5a22f4d851321194b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5wLwufOGdWaferw+52h/DGEo38X7eMKLQIpkyi5UAEnBBB3kaLYZ9/LrSCsAGOIwnzlP2bgRJElyFmcVvF4CBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T05:46:40.052649Z","bundle_sha256":"d7a2fd614cc9e9b88ab0977b51ce285fae689df9d5258b800e3b542849b95e47"}}