{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:G2WHSAHNUKWDBLUFADZQMGCDVU","short_pith_number":"pith:G2WHSAHN","schema_version":"1.0","canonical_sha256":"36ac7900eda2ac30ae8500f3061843ad38895a6fb9b4fef37798a8dc580dafc7","source":{"kind":"arxiv","id":"2502.19576","version":2},"attestation_state":"computed","paper":{"title":"An Analysis of First- and Quasi-Second-Order Optimization Algorithms in Variational Monte Carlo","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn"],"primary_cat":"cond-mat.str-el","authors_text":"Garnet Kin-Lic Chan, Ruojing Peng","submitted_at":"2025-02-26T21:38:47Z","abstract_excerpt":"Many quantum many-body wavefunctions, such as Jastrow-Slater, tensor network, and neural quantum states, are studied with the variational Monte Carlo technique, where stochastic optimization is usually performed to obtain a faithful approximation to the ground-state of a given Hamiltonian. While first-order gradient descent methods are commonly used for such optimizations, quasi-second-order optimization formulations offer the potential of faster convergence under certain theoretical conditions, but with a similar cost per sample to first-order methods. However, the relative performance of fir"},"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":"2502.19576","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.str-el","submitted_at":"2025-02-26T21:38:47Z","cross_cats_sorted":["cond-mat.dis-nn"],"title_canon_sha256":"7ea242c4b6e4d5da130b6d0d61aa28779f1de8e856514b2d5aaaba01133c6b3a","abstract_canon_sha256":"8ae14b50f2cc0f49e89a6c2a463a6b0ef22a3140982b598ffa5aee1cef825a32"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:56:17.913001Z","signature_b64":"V/vRNBrbPytcJTZInQKXceorwAZ0GgGUV+IPx/9S5kbTa9vXZgHIqH7Kv74tN0ah2Nrm/9ZBnVcPA/gNnvdHBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36ac7900eda2ac30ae8500f3061843ad38895a6fb9b4fef37798a8dc580dafc7","last_reissued_at":"2026-07-05T11:56:17.912406Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:56:17.912406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Analysis of First- and Quasi-Second-Order Optimization Algorithms in Variational Monte Carlo","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn"],"primary_cat":"cond-mat.str-el","authors_text":"Garnet Kin-Lic Chan, Ruojing Peng","submitted_at":"2025-02-26T21:38:47Z","abstract_excerpt":"Many quantum many-body wavefunctions, such as Jastrow-Slater, tensor network, and neural quantum states, are studied with the variational Monte Carlo technique, where stochastic optimization is usually performed to obtain a faithful approximation to the ground-state of a given Hamiltonian. While first-order gradient descent methods are commonly used for such optimizations, quasi-second-order optimization formulations offer the potential of faster convergence under certain theoretical conditions, but with a similar cost per sample to first-order methods. However, the relative performance of fir"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.19576","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/2502.19576/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":"2502.19576","created_at":"2026-07-05T11:56:17.912479+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.19576v2","created_at":"2026-07-05T11:56:17.912479+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.19576","created_at":"2026-07-05T11:56:17.912479+00:00"},{"alias_kind":"pith_short_12","alias_value":"G2WHSAHNUKWD","created_at":"2026-07-05T11:56:17.912479+00:00"},{"alias_kind":"pith_short_16","alias_value":"G2WHSAHNUKWDBLUF","created_at":"2026-07-05T11:56:17.912479+00:00"},{"alias_kind":"pith_short_8","alias_value":"G2WHSAHN","created_at":"2026-07-05T11:56:17.912479+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.07825","citing_title":"Projected Inverse Iteration: An Eigenvalue Approach to Ground-State Computation with Neural Quantum States","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2606.02474","citing_title":"Approximating Hartree-Fock theory via an efficiently local reformulation","ref_index":253,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G2WHSAHNUKWDBLUFADZQMGCDVU","json":"https://pith.science/pith/G2WHSAHNUKWDBLUFADZQMGCDVU.json","graph_json":"https://pith.science/api/pith-number/G2WHSAHNUKWDBLUFADZQMGCDVU/graph.json","events_json":"https://pith.science/api/pith-number/G2WHSAHNUKWDBLUFADZQMGCDVU/events.json","paper":"https://pith.science/paper/G2WHSAHN"},"agent_actions":{"view_html":"https://pith.science/pith/G2WHSAHNUKWDBLUFADZQMGCDVU","download_json":"https://pith.science/pith/G2WHSAHNUKWDBLUFADZQMGCDVU.json","view_paper":"https://pith.science/paper/G2WHSAHN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.19576&json=true","fetch_graph":"https://pith.science/api/pith-number/G2WHSAHNUKWDBLUFADZQMGCDVU/graph.json","fetch_events":"https://pith.science/api/pith-number/G2WHSAHNUKWDBLUFADZQMGCDVU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G2WHSAHNUKWDBLUFADZQMGCDVU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G2WHSAHNUKWDBLUFADZQMGCDVU/action/storage_attestation","attest_author":"https://pith.science/pith/G2WHSAHNUKWDBLUFADZQMGCDVU/action/author_attestation","sign_citation":"https://pith.science/pith/G2WHSAHNUKWDBLUFADZQMGCDVU/action/citation_signature","submit_replication":"https://pith.science/pith/G2WHSAHNUKWDBLUFADZQMGCDVU/action/replication_record"}},"created_at":"2026-07-05T11:56:17.912479+00:00","updated_at":"2026-07-05T11:56:17.912479+00:00"}