{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:U7IP7ASZGGVYGRPHGVZ5W3XSR2","short_pith_number":"pith:U7IP7ASZ","canonical_record":{"source":{"id":"2510.03389","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-10-03T18:00:00Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d3b6d196256fddbe09554c06e8f3b1ef4f3bc777c5f2bad38c64f1fa03d01b43","abstract_canon_sha256":"481251659d7abfe0e56e9bf54495c972d28fb0115fb8acc693e9ebfc5a012fda"},"schema_version":"1.0"},"canonical_sha256":"a7d0ff825931ab8345e73573db6ef28e902e4840f6324e1fbde2dda58a72993a","source":{"kind":"arxiv","id":"2510.03389","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.03389","created_at":"2026-06-09T01:04:39Z"},{"alias_kind":"arxiv_version","alias_value":"2510.03389v2","created_at":"2026-06-09T01:04:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.03389","created_at":"2026-06-09T01:04:39Z"},{"alias_kind":"pith_short_12","alias_value":"U7IP7ASZGGVY","created_at":"2026-06-09T01:04:39Z"},{"alias_kind":"pith_short_16","alias_value":"U7IP7ASZGGVYGRPH","created_at":"2026-06-09T01:04:39Z"},{"alias_kind":"pith_short_8","alias_value":"U7IP7ASZ","created_at":"2026-06-09T01:04:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:U7IP7ASZGGVYGRPHGVZ5W3XSR2","target":"record","payload":{"canonical_record":{"source":{"id":"2510.03389","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-10-03T18:00:00Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d3b6d196256fddbe09554c06e8f3b1ef4f3bc777c5f2bad38c64f1fa03d01b43","abstract_canon_sha256":"481251659d7abfe0e56e9bf54495c972d28fb0115fb8acc693e9ebfc5a012fda"},"schema_version":"1.0"},"canonical_sha256":"a7d0ff825931ab8345e73573db6ef28e902e4840f6324e1fbde2dda58a72993a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T01:04:39.395893Z","signature_b64":"oST+tG/UXaxzpaMStSTkm7Ycr4u9Nnn6oDGdEL5nv8i3lZp5LWZ1/9Av4Kx10IfsKB9StBobwWvjXQY+uVRmCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7d0ff825931ab8345e73573db6ef28e902e4840f6324e1fbde2dda58a72993a","last_reissued_at":"2026-06-09T01:04:39.395379Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T01:04:39.395379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2510.03389","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-06-09T01:04:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DTeQyYZ+VDqdvYAtcSNuXFNFr0vBE+/KuP9K3AlHA4/CCTzMbo6OjHAYVAxqwLo14af8+yi9XjWW5x9+6EM1DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T19:50:39.308413Z"},"content_sha256":"001ba3da1c5eb916ec3e170eac410e4ed21d7aafd2aa0716b5948ca73636d055","schema_version":"1.0","event_id":"sha256:001ba3da1c5eb916ec3e170eac410e4ed21d7aafd2aa0716b5948ca73636d055"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:U7IP7ASZGGVYGRPHGVZ5W3XSR2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum feature-map learning with reduced resource overhead","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"quant-ph","authors_text":"Elham Torabian, Jonas J\\\"ager, Philipp Els\\\"asser","submitted_at":"2025-10-03T18:00:00Z","abstract_excerpt":"Current quantum computers require algorithms that use limited resources economically. In quantum machine learning, success hinges on quantum feature-maps, which embed classical data into the state space of qubits. We introduce Quantum Feature-Map Learning via Analytic Iterative Reconstructions (Q-FLAIR), an algorithm that reduces quantum resource overhead in iterative feature-map circuit construction. It shifts workloads to a classical computer via partial analytic reconstructions of the quantum model, using only a few evaluations. For each probed gate addition to the ansatz, the simultaneous "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.03389","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2510.03389/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-06-09T01:04:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YJNfAD+MOAObfosQXNcy/k9OZFU90I5zO4jtce9oKkp93OXxYR5qyMYWjSBzzyn1GDA4dXV0PBKAUClxBZjxBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T19:50:39.309318Z"},"content_sha256":"3b2254fa9bbbd61053a7e5a564247f220c901e9e3d4922cc94c4c55f0f1b50fc","schema_version":"1.0","event_id":"sha256:3b2254fa9bbbd61053a7e5a564247f220c901e9e3d4922cc94c4c55f0f1b50fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U7IP7ASZGGVYGRPHGVZ5W3XSR2/bundle.json","state_url":"https://pith.science/pith/U7IP7ASZGGVYGRPHGVZ5W3XSR2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U7IP7ASZGGVYGRPHGVZ5W3XSR2/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-05T19:50:39Z","links":{"resolver":"https://pith.science/pith/U7IP7ASZGGVYGRPHGVZ5W3XSR2","bundle":"https://pith.science/pith/U7IP7ASZGGVYGRPHGVZ5W3XSR2/bundle.json","state":"https://pith.science/pith/U7IP7ASZGGVYGRPHGVZ5W3XSR2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U7IP7ASZGGVYGRPHGVZ5W3XSR2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:U7IP7ASZGGVYGRPHGVZ5W3XSR2","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":"481251659d7abfe0e56e9bf54495c972d28fb0115fb8acc693e9ebfc5a012fda","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-10-03T18:00:00Z","title_canon_sha256":"d3b6d196256fddbe09554c06e8f3b1ef4f3bc777c5f2bad38c64f1fa03d01b43"},"schema_version":"1.0","source":{"id":"2510.03389","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.03389","created_at":"2026-06-09T01:04:39Z"},{"alias_kind":"arxiv_version","alias_value":"2510.03389v2","created_at":"2026-06-09T01:04:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.03389","created_at":"2026-06-09T01:04:39Z"},{"alias_kind":"pith_short_12","alias_value":"U7IP7ASZGGVY","created_at":"2026-06-09T01:04:39Z"},{"alias_kind":"pith_short_16","alias_value":"U7IP7ASZGGVYGRPH","created_at":"2026-06-09T01:04:39Z"},{"alias_kind":"pith_short_8","alias_value":"U7IP7ASZ","created_at":"2026-06-09T01:04:39Z"}],"graph_snapshots":[{"event_id":"sha256:3b2254fa9bbbd61053a7e5a564247f220c901e9e3d4922cc94c4c55f0f1b50fc","target":"graph","created_at":"2026-06-09T01:04:39Z","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/2510.03389/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Current quantum computers require algorithms that use limited resources economically. In quantum machine learning, success hinges on quantum feature-maps, which embed classical data into the state space of qubits. We introduce Quantum Feature-Map Learning via Analytic Iterative Reconstructions (Q-FLAIR), an algorithm that reduces quantum resource overhead in iterative feature-map circuit construction. It shifts workloads to a classical computer via partial analytic reconstructions of the quantum model, using only a few evaluations. For each probed gate addition to the ansatz, the simultaneous ","authors_text":"Elham Torabian, Jonas J\\\"ager, Philipp Els\\\"asser","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-10-03T18:00:00Z","title":"Quantum feature-map learning with reduced resource overhead"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.03389","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:001ba3da1c5eb916ec3e170eac410e4ed21d7aafd2aa0716b5948ca73636d055","target":"record","created_at":"2026-06-09T01:04:39Z","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":"481251659d7abfe0e56e9bf54495c972d28fb0115fb8acc693e9ebfc5a012fda","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-10-03T18:00:00Z","title_canon_sha256":"d3b6d196256fddbe09554c06e8f3b1ef4f3bc777c5f2bad38c64f1fa03d01b43"},"schema_version":"1.0","source":{"id":"2510.03389","kind":"arxiv","version":2}},"canonical_sha256":"a7d0ff825931ab8345e73573db6ef28e902e4840f6324e1fbde2dda58a72993a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a7d0ff825931ab8345e73573db6ef28e902e4840f6324e1fbde2dda58a72993a","first_computed_at":"2026-06-09T01:04:39.395379Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-09T01:04:39.395379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oST+tG/UXaxzpaMStSTkm7Ycr4u9Nnn6oDGdEL5nv8i3lZp5LWZ1/9Av4Kx10IfsKB9StBobwWvjXQY+uVRmCQ==","signature_status":"signed_v1","signed_at":"2026-06-09T01:04:39.395893Z","signed_message":"canonical_sha256_bytes"},"source_id":"2510.03389","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:001ba3da1c5eb916ec3e170eac410e4ed21d7aafd2aa0716b5948ca73636d055","sha256:3b2254fa9bbbd61053a7e5a564247f220c901e9e3d4922cc94c4c55f0f1b50fc"],"state_sha256":"c71726540345988d33167d93f20d1650778c3158baccb26014c5c193a894cfd6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g568qzMbC1567vUfND2OwQeuTe6/+gfPVQbSCqU0Q0IzFpB/TYUIdU92BrL/HnKNcaM9fNtI9QQBLKH9vo6bDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T19:50:39.317850Z","bundle_sha256":"f1ef548843471ff6c35f2f4d158af73aef73630055cc030c8be2f639766909cd"}}