{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:KE3UXAPK4BQFE6F56RGCVJOC5R","short_pith_number":"pith:KE3UXAPK","schema_version":"1.0","canonical_sha256":"51374b81eae0605278bdf44c2aa5c2ec79231804b9741a294a952e54c30b17ed","source":{"kind":"arxiv","id":"1309.1848","version":1},"attestation_state":"computed","paper":{"title":"Optimal multi-configuration approximation of an N-fermion wave function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.mtrl-sci","cond-mat.str-el","math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"J. M. Zhang, Marcus Kollar","submitted_at":"2013-09-07T10:24:51Z","abstract_excerpt":"We propose a simple iterative algorithm to construct the optimal multi-configuration approximation of an $N$-fermion wave function. That is, $M\\geq N $ single-particle orbitals are sought iteratively so that the projection of the given wave function in the $C_M^N$-dimensional configuration subspace is maximized. The algorithm has a monotonic convergence property and can be easily parallelized. The significance of the algorithm on the study of entanglement in a multi-fermion system and its implication on the multi-configuration time-dependent Hartree-Fock (MCTDHF) are discussed. The ground stat"},"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":"1309.1848","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-09-07T10:24:51Z","cross_cats_sorted":["cond-mat.mtrl-sci","cond-mat.str-el","math-ph","math.MP"],"title_canon_sha256":"f98b3756e320fded341e6f4d838e7c4cba91bb228c09283f09b2b2e077230176","abstract_canon_sha256":"dfffb50ce8690f6dbecc85f901d176ec6311e9804275f51bfc6aa1bc149b67a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:57.024569Z","signature_b64":"mimEMayfq+POrpppEK8nHaxjVC36SW8w9pjVHuBxIltIQIC+cSt5orl1Iyo+/zVzq7glS3O/SWLUguwXfxE0BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51374b81eae0605278bdf44c2aa5c2ec79231804b9741a294a952e54c30b17ed","last_reissued_at":"2026-05-18T03:02:57.024043Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:57.024043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal multi-configuration approximation of an N-fermion wave function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.mtrl-sci","cond-mat.str-el","math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"J. M. Zhang, Marcus Kollar","submitted_at":"2013-09-07T10:24:51Z","abstract_excerpt":"We propose a simple iterative algorithm to construct the optimal multi-configuration approximation of an $N$-fermion wave function. That is, $M\\geq N $ single-particle orbitals are sought iteratively so that the projection of the given wave function in the $C_M^N$-dimensional configuration subspace is maximized. The algorithm has a monotonic convergence property and can be easily parallelized. The significance of the algorithm on the study of entanglement in a multi-fermion system and its implication on the multi-configuration time-dependent Hartree-Fock (MCTDHF) are discussed. The ground stat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1848","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":""},"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":"1309.1848","created_at":"2026-05-18T03:02:57.024113+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.1848v1","created_at":"2026-05-18T03:02:57.024113+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1848","created_at":"2026-05-18T03:02:57.024113+00:00"},{"alias_kind":"pith_short_12","alias_value":"KE3UXAPK4BQF","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"KE3UXAPK4BQFE6F5","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"KE3UXAPK","created_at":"2026-05-18T12:27:49.015174+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/KE3UXAPK4BQFE6F56RGCVJOC5R","json":"https://pith.science/pith/KE3UXAPK4BQFE6F56RGCVJOC5R.json","graph_json":"https://pith.science/api/pith-number/KE3UXAPK4BQFE6F56RGCVJOC5R/graph.json","events_json":"https://pith.science/api/pith-number/KE3UXAPK4BQFE6F56RGCVJOC5R/events.json","paper":"https://pith.science/paper/KE3UXAPK"},"agent_actions":{"view_html":"https://pith.science/pith/KE3UXAPK4BQFE6F56RGCVJOC5R","download_json":"https://pith.science/pith/KE3UXAPK4BQFE6F56RGCVJOC5R.json","view_paper":"https://pith.science/paper/KE3UXAPK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.1848&json=true","fetch_graph":"https://pith.science/api/pith-number/KE3UXAPK4BQFE6F56RGCVJOC5R/graph.json","fetch_events":"https://pith.science/api/pith-number/KE3UXAPK4BQFE6F56RGCVJOC5R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KE3UXAPK4BQFE6F56RGCVJOC5R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KE3UXAPK4BQFE6F56RGCVJOC5R/action/storage_attestation","attest_author":"https://pith.science/pith/KE3UXAPK4BQFE6F56RGCVJOC5R/action/author_attestation","sign_citation":"https://pith.science/pith/KE3UXAPK4BQFE6F56RGCVJOC5R/action/citation_signature","submit_replication":"https://pith.science/pith/KE3UXAPK4BQFE6F56RGCVJOC5R/action/replication_record"}},"created_at":"2026-05-18T03:02:57.024113+00:00","updated_at":"2026-05-18T03:02:57.024113+00:00"}