{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:BR4RCMQQPVWDP57MBDAFEZPR75","short_pith_number":"pith:BR4RCMQQ","schema_version":"1.0","canonical_sha256":"0c791132107d6c37f7ec08c05265f1ff43949a26e5b588c50f4d1558fb7a904f","source":{"kind":"arxiv","id":"2401.08912","version":1},"attestation_state":"computed","paper":{"title":"Two-Stage Estimation and Variance Modeling for Latency-Constrained Variational Quantum Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Matt Menickelly, Sara Shashaani, Yunsoo Ha","submitted_at":"2024-01-17T01:54:24Z","abstract_excerpt":"The Quantum Approximate Optimization Algorithm (QAOA) has enjoyed increasing attention in noisy intermediate-scale quantum computing due to its application to combinatorial optimization problems. Because combinatorial optimization problems are NP-hard, QAOA could serve as a potential demonstration of quantum advantage in the future. As a hybrid quantum-classical algorithm, the classical component of QAOA resembles a simulation optimization problem, in which the simulation outcomes are attainable only through the quantum computer. The simulation that derives from QAOA exhibits two unique featur"},"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":"2401.08912","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-01-17T01:54:24Z","cross_cats_sorted":[],"title_canon_sha256":"54873319004c75d37088f5f01725f4fdd413f3b059cdf3dab9eabd2532cc8e77","abstract_canon_sha256":"11bc5bca6700248a02fced65c69d8d54aa7aa88b096f473910c93757d6678260"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:34:23.570340Z","signature_b64":"iBE3VVvvsAeLuqmtiS55BKK0amdDBMX4XvbmAz1d04aQxiBN5H7w4P5neLg3rO04zxqdeRNAwChnP0UkpJAxAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c791132107d6c37f7ec08c05265f1ff43949a26e5b588c50f4d1558fb7a904f","last_reissued_at":"2026-07-05T07:34:23.569804Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:34:23.569804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two-Stage Estimation and Variance Modeling for Latency-Constrained Variational Quantum Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Matt Menickelly, Sara Shashaani, Yunsoo Ha","submitted_at":"2024-01-17T01:54:24Z","abstract_excerpt":"The Quantum Approximate Optimization Algorithm (QAOA) has enjoyed increasing attention in noisy intermediate-scale quantum computing due to its application to combinatorial optimization problems. Because combinatorial optimization problems are NP-hard, QAOA could serve as a potential demonstration of quantum advantage in the future. As a hybrid quantum-classical algorithm, the classical component of QAOA resembles a simulation optimization problem, in which the simulation outcomes are attainable only through the quantum computer. The simulation that derives from QAOA exhibits two unique featur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.08912","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/2401.08912/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":"2401.08912","created_at":"2026-07-05T07:34:23.569862+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.08912v1","created_at":"2026-07-05T07:34:23.569862+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.08912","created_at":"2026-07-05T07:34:23.569862+00:00"},{"alias_kind":"pith_short_12","alias_value":"BR4RCMQQPVWD","created_at":"2026-07-05T07:34:23.569862+00:00"},{"alias_kind":"pith_short_16","alias_value":"BR4RCMQQPVWDP57M","created_at":"2026-07-05T07:34:23.569862+00:00"},{"alias_kind":"pith_short_8","alias_value":"BR4RCMQQ","created_at":"2026-07-05T07:34:23.569862+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.06600","citing_title":"RARL: Improving Medical VLM Reasoning and Generalization with Reinforcement Learning and LoRA under Data and Hardware Constraints","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BR4RCMQQPVWDP57MBDAFEZPR75","json":"https://pith.science/pith/BR4RCMQQPVWDP57MBDAFEZPR75.json","graph_json":"https://pith.science/api/pith-number/BR4RCMQQPVWDP57MBDAFEZPR75/graph.json","events_json":"https://pith.science/api/pith-number/BR4RCMQQPVWDP57MBDAFEZPR75/events.json","paper":"https://pith.science/paper/BR4RCMQQ"},"agent_actions":{"view_html":"https://pith.science/pith/BR4RCMQQPVWDP57MBDAFEZPR75","download_json":"https://pith.science/pith/BR4RCMQQPVWDP57MBDAFEZPR75.json","view_paper":"https://pith.science/paper/BR4RCMQQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.08912&json=true","fetch_graph":"https://pith.science/api/pith-number/BR4RCMQQPVWDP57MBDAFEZPR75/graph.json","fetch_events":"https://pith.science/api/pith-number/BR4RCMQQPVWDP57MBDAFEZPR75/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BR4RCMQQPVWDP57MBDAFEZPR75/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BR4RCMQQPVWDP57MBDAFEZPR75/action/storage_attestation","attest_author":"https://pith.science/pith/BR4RCMQQPVWDP57MBDAFEZPR75/action/author_attestation","sign_citation":"https://pith.science/pith/BR4RCMQQPVWDP57MBDAFEZPR75/action/citation_signature","submit_replication":"https://pith.science/pith/BR4RCMQQPVWDP57MBDAFEZPR75/action/replication_record"}},"created_at":"2026-07-05T07:34:23.569862+00:00","updated_at":"2026-07-05T07:34:23.569862+00:00"}