{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:34LKKAZ2N43RSHOZNKX7676YYP","short_pith_number":"pith:34LKKAZ2","schema_version":"1.0","canonical_sha256":"df16a5033a6f37191dd96aafff7fd8c3e3c303f0314d0a4a2ad3b41eb45fbaca","source":{"kind":"arxiv","id":"2509.15486","version":2},"attestation_state":"computed","paper":{"title":"Discrete Flow-Based Generative Models for Measurement Optimization in Quantum Computing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Isaac L. Huidobro-Meezs, Jun Dai, Rodrigo A. Vargas-Hern\\'andez","submitted_at":"2025-09-18T23:23:36Z","abstract_excerpt":"Achieving chemical accuracy in quantum simulations is often constrained by the measurement bottleneck: estimating operators requires a large number of shots, which remains costly even on fault-tolerant devices. Addressing this challenge involves a multi-objective optimization problem that balances the total shot count, the number of distinct measurement circuits, the total two-qubit gate count, and hardware-specific compilation constraints. Existing overlapping grouping methods, focused on reducing measurement counts, rely on an initial non-overlapping grouping of the Hamiltonian, generated th"},"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":"2509.15486","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-09-18T23:23:36Z","cross_cats_sorted":[],"title_canon_sha256":"4aae82d709ba0da775e8ccc43ed48c81ff732d9130bb17a79bca8818ef364575","abstract_canon_sha256":"07b08ea23760f15e2bf698ea6ab6686bf808897a81c30949c0c20fb57537d5c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-26T01:15:14.392609Z","signature_b64":"71jFYT9+lnav4LeSv8lG3FLu/pOoqDCE2IOrz+FIy0SQmwH77C9r3d8RjiVwCAjcr9C1KAgXSKwh1GFnskPkAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df16a5033a6f37191dd96aafff7fd8c3e3c303f0314d0a4a2ad3b41eb45fbaca","last_reissued_at":"2026-06-26T01:15:14.392194Z","signature_status":"signed_v1","first_computed_at":"2026-06-26T01:15:14.392194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Discrete Flow-Based Generative Models for Measurement Optimization in Quantum Computing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Isaac L. Huidobro-Meezs, Jun Dai, Rodrigo A. Vargas-Hern\\'andez","submitted_at":"2025-09-18T23:23:36Z","abstract_excerpt":"Achieving chemical accuracy in quantum simulations is often constrained by the measurement bottleneck: estimating operators requires a large number of shots, which remains costly even on fault-tolerant devices. Addressing this challenge involves a multi-objective optimization problem that balances the total shot count, the number of distinct measurement circuits, the total two-qubit gate count, and hardware-specific compilation constraints. Existing overlapping grouping methods, focused on reducing measurement counts, rely on an initial non-overlapping grouping of the Hamiltonian, generated th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.15486","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/2509.15486/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":"2509.15486","created_at":"2026-06-26T01:15:14.392249+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.15486v2","created_at":"2026-06-26T01:15:14.392249+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.15486","created_at":"2026-06-26T01:15:14.392249+00:00"},{"alias_kind":"pith_short_12","alias_value":"34LKKAZ2N43R","created_at":"2026-06-26T01:15:14.392249+00:00"},{"alias_kind":"pith_short_16","alias_value":"34LKKAZ2N43RSHOZ","created_at":"2026-06-26T01:15:14.392249+00:00"},{"alias_kind":"pith_short_8","alias_value":"34LKKAZ2","created_at":"2026-06-26T01:15:14.392249+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.05314","citing_title":"Machine learning for sample-based quantum diagonalization: generative configuration recovery and the classical-simulability frontier","ref_index":67,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/34LKKAZ2N43RSHOZNKX7676YYP","json":"https://pith.science/pith/34LKKAZ2N43RSHOZNKX7676YYP.json","graph_json":"https://pith.science/api/pith-number/34LKKAZ2N43RSHOZNKX7676YYP/graph.json","events_json":"https://pith.science/api/pith-number/34LKKAZ2N43RSHOZNKX7676YYP/events.json","paper":"https://pith.science/paper/34LKKAZ2"},"agent_actions":{"view_html":"https://pith.science/pith/34LKKAZ2N43RSHOZNKX7676YYP","download_json":"https://pith.science/pith/34LKKAZ2N43RSHOZNKX7676YYP.json","view_paper":"https://pith.science/paper/34LKKAZ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.15486&json=true","fetch_graph":"https://pith.science/api/pith-number/34LKKAZ2N43RSHOZNKX7676YYP/graph.json","fetch_events":"https://pith.science/api/pith-number/34LKKAZ2N43RSHOZNKX7676YYP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/34LKKAZ2N43RSHOZNKX7676YYP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/34LKKAZ2N43RSHOZNKX7676YYP/action/storage_attestation","attest_author":"https://pith.science/pith/34LKKAZ2N43RSHOZNKX7676YYP/action/author_attestation","sign_citation":"https://pith.science/pith/34LKKAZ2N43RSHOZNKX7676YYP/action/citation_signature","submit_replication":"https://pith.science/pith/34LKKAZ2N43RSHOZNKX7676YYP/action/replication_record"}},"created_at":"2026-06-26T01:15:14.392249+00:00","updated_at":"2026-06-26T01:15:14.392249+00:00"}