{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:SPY2EIINK576QDPCWMSXWSWNRG","short_pith_number":"pith:SPY2EIIN","schema_version":"1.0","canonical_sha256":"93f1a2210d577fe80de2b3257b4acd898cb5f02816dcf4da5f36b6d133241aed","source":{"kind":"arxiv","id":"2606.08794","version":1},"attestation_state":"computed","paper":{"title":"Graph Neural Networks for Fast Operator Selection in Adaptive VQE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","physics.chem-ph"],"primary_cat":"quant-ph","authors_text":"Hadi H. Arefi, Javad Vahedi","submitted_at":"2026-06-07T19:18:47Z","abstract_excerpt":"Adaptive variational quantum algorithms like ADAPT-VQE construct tailored ans\\\"atze by iteratively selecting operators from a pool using gradient-based criteria. While this avoids oversized parameter spaces, repeatedly scanning the full pool incurs a classical cost that scales linearly with pool size-a major bottleneck for systems with long-range interactions or large operator sets. Here, we reformulate adaptive operator selection as a graph-based decision problem and introduce a graph neural network (GNN) policy that predicts the next entangling operator directly from the interaction graph an"},"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":"2606.08794","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-06-07T19:18:47Z","cross_cats_sorted":["cond-mat.dis-nn","physics.chem-ph"],"title_canon_sha256":"1ddc63b7d9ecf0f2653aeaa1a6f2b6a8c9426c6932c031f576334ba1579ca863","abstract_canon_sha256":"45cb1459bbca0c4af8a71dd5f5feaf363c3ba153fd56dd51b65c5cdf143e3cdf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T02:07:39.626243Z","signature_b64":"EybwxT7i1g2RAhW4h91MJopsqktgzyvgSzyhIVKtbCocjZ/9+VwnIwqZdu892IU7M8Hp4xM0uRliMBBS1AUAAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93f1a2210d577fe80de2b3257b4acd898cb5f02816dcf4da5f36b6d133241aed","last_reissued_at":"2026-06-09T02:07:39.625325Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T02:07:39.625325Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Neural Networks for Fast Operator Selection in Adaptive VQE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","physics.chem-ph"],"primary_cat":"quant-ph","authors_text":"Hadi H. Arefi, Javad Vahedi","submitted_at":"2026-06-07T19:18:47Z","abstract_excerpt":"Adaptive variational quantum algorithms like ADAPT-VQE construct tailored ans\\\"atze by iteratively selecting operators from a pool using gradient-based criteria. While this avoids oversized parameter spaces, repeatedly scanning the full pool incurs a classical cost that scales linearly with pool size-a major bottleneck for systems with long-range interactions or large operator sets. Here, we reformulate adaptive operator selection as a graph-based decision problem and introduce a graph neural network (GNN) policy that predicts the next entangling operator directly from the interaction graph an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.08794","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/2606.08794/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":"2606.08794","created_at":"2026-06-09T02:07:39.625477+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.08794v1","created_at":"2026-06-09T02:07:39.625477+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.08794","created_at":"2026-06-09T02:07:39.625477+00:00"},{"alias_kind":"pith_short_12","alias_value":"SPY2EIINK576","created_at":"2026-06-09T02:07:39.625477+00:00"},{"alias_kind":"pith_short_16","alias_value":"SPY2EIINK576QDPC","created_at":"2026-06-09T02:07:39.625477+00:00"},{"alias_kind":"pith_short_8","alias_value":"SPY2EIIN","created_at":"2026-06-09T02:07:39.625477+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/SPY2EIINK576QDPCWMSXWSWNRG","json":"https://pith.science/pith/SPY2EIINK576QDPCWMSXWSWNRG.json","graph_json":"https://pith.science/api/pith-number/SPY2EIINK576QDPCWMSXWSWNRG/graph.json","events_json":"https://pith.science/api/pith-number/SPY2EIINK576QDPCWMSXWSWNRG/events.json","paper":"https://pith.science/paper/SPY2EIIN"},"agent_actions":{"view_html":"https://pith.science/pith/SPY2EIINK576QDPCWMSXWSWNRG","download_json":"https://pith.science/pith/SPY2EIINK576QDPCWMSXWSWNRG.json","view_paper":"https://pith.science/paper/SPY2EIIN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.08794&json=true","fetch_graph":"https://pith.science/api/pith-number/SPY2EIINK576QDPCWMSXWSWNRG/graph.json","fetch_events":"https://pith.science/api/pith-number/SPY2EIINK576QDPCWMSXWSWNRG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SPY2EIINK576QDPCWMSXWSWNRG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SPY2EIINK576QDPCWMSXWSWNRG/action/storage_attestation","attest_author":"https://pith.science/pith/SPY2EIINK576QDPCWMSXWSWNRG/action/author_attestation","sign_citation":"https://pith.science/pith/SPY2EIINK576QDPCWMSXWSWNRG/action/citation_signature","submit_replication":"https://pith.science/pith/SPY2EIINK576QDPCWMSXWSWNRG/action/replication_record"}},"created_at":"2026-06-09T02:07:39.625477+00:00","updated_at":"2026-06-09T02:07:39.625477+00:00"}