{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:IT5BBFEI23SF57IBUT7PMSY6RR","short_pith_number":"pith:IT5BBFEI","schema_version":"1.0","canonical_sha256":"44fa109488d6e45efd01a4fef64b1e8c7e98e37bc91dc8a3dfd08e96dd11650f","source":{"kind":"arxiv","id":"2408.00836","version":2},"attestation_state":"computed","paper":{"title":"Classical Benchmarks for Variational Quantum Eigensolver Simulations of the Hubbard Model","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.str-el"],"primary_cat":"quant-ph","authors_text":"Abid Khan, Antonios M. Alvertis, Norm Tubman, Peter P. Orth, Thomas Iadecola","submitted_at":"2024-08-01T18:00:04Z","abstract_excerpt":"Simulating the Hubbard model is of great interest to a wide range of applications within condensed matter physics, however its solution on classical computers remains challenging in dimensions larger than one. The relative simplicity of this model, embodied by the sparseness of the Hamiltonian matrix, allows for its efficient implementation on quantum computers, and for its approximate solution using variational algorithms such as the variational quantum eigensolver. While these algorithms have been shown to reproduce the qualitative features of the Hubbard model, their quantitative accuracy i"},"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":"2408.00836","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-08-01T18:00:04Z","cross_cats_sorted":["cond-mat.str-el"],"title_canon_sha256":"af61f24e888c43d7c5f41e24c7faad0be17afb70589fdad7a327045eae6a61d4","abstract_canon_sha256":"bc07bee3a8ffe453c975250f468162fd1f9a18cee991211a2c50a5c9fd866209"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:06:08.440492Z","signature_b64":"qiT89T4qfHbYkiPwwVzpP1uIrCp15adDh0vUZ5Xoy6HpDIzqFPH7g5mw+dYZ6MYEdnklYXuzlFJy4R+hQ/jCAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44fa109488d6e45efd01a4fef64b1e8c7e98e37bc91dc8a3dfd08e96dd11650f","last_reissued_at":"2026-07-05T11:06:08.439996Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:06:08.439996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Classical Benchmarks for Variational Quantum Eigensolver Simulations of the Hubbard Model","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.str-el"],"primary_cat":"quant-ph","authors_text":"Abid Khan, Antonios M. Alvertis, Norm Tubman, Peter P. Orth, Thomas Iadecola","submitted_at":"2024-08-01T18:00:04Z","abstract_excerpt":"Simulating the Hubbard model is of great interest to a wide range of applications within condensed matter physics, however its solution on classical computers remains challenging in dimensions larger than one. The relative simplicity of this model, embodied by the sparseness of the Hamiltonian matrix, allows for its efficient implementation on quantum computers, and for its approximate solution using variational algorithms such as the variational quantum eigensolver. While these algorithms have been shown to reproduce the qualitative features of the Hubbard model, their quantitative accuracy i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.00836","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/2408.00836/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":"2408.00836","created_at":"2026-07-05T11:06:08.440054+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.00836v2","created_at":"2026-07-05T11:06:08.440054+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.00836","created_at":"2026-07-05T11:06:08.440054+00:00"},{"alias_kind":"pith_short_12","alias_value":"IT5BBFEI23SF","created_at":"2026-07-05T11:06:08.440054+00:00"},{"alias_kind":"pith_short_16","alias_value":"IT5BBFEI23SF57IB","created_at":"2026-07-05T11:06:08.440054+00:00"},{"alias_kind":"pith_short_8","alias_value":"IT5BBFEI","created_at":"2026-07-05T11:06:08.440054+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.05627","citing_title":"Loss-aware state space geometry for quantum variational algorithms","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IT5BBFEI23SF57IBUT7PMSY6RR","json":"https://pith.science/pith/IT5BBFEI23SF57IBUT7PMSY6RR.json","graph_json":"https://pith.science/api/pith-number/IT5BBFEI23SF57IBUT7PMSY6RR/graph.json","events_json":"https://pith.science/api/pith-number/IT5BBFEI23SF57IBUT7PMSY6RR/events.json","paper":"https://pith.science/paper/IT5BBFEI"},"agent_actions":{"view_html":"https://pith.science/pith/IT5BBFEI23SF57IBUT7PMSY6RR","download_json":"https://pith.science/pith/IT5BBFEI23SF57IBUT7PMSY6RR.json","view_paper":"https://pith.science/paper/IT5BBFEI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.00836&json=true","fetch_graph":"https://pith.science/api/pith-number/IT5BBFEI23SF57IBUT7PMSY6RR/graph.json","fetch_events":"https://pith.science/api/pith-number/IT5BBFEI23SF57IBUT7PMSY6RR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IT5BBFEI23SF57IBUT7PMSY6RR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IT5BBFEI23SF57IBUT7PMSY6RR/action/storage_attestation","attest_author":"https://pith.science/pith/IT5BBFEI23SF57IBUT7PMSY6RR/action/author_attestation","sign_citation":"https://pith.science/pith/IT5BBFEI23SF57IBUT7PMSY6RR/action/citation_signature","submit_replication":"https://pith.science/pith/IT5BBFEI23SF57IBUT7PMSY6RR/action/replication_record"}},"created_at":"2026-07-05T11:06:08.440054+00:00","updated_at":"2026-07-05T11:06:08.440054+00:00"}