{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:6MUMH47PVDXGGQIDH7GIYDRDDN","short_pith_number":"pith:6MUMH47P","schema_version":"1.0","canonical_sha256":"f328c3f3efa8ee6341033fcc8c0e231b64f42e16ba3a7f1a48ed3da4a6cd78cd","source":{"kind":"arxiv","id":"1105.0007","version":2},"attestation_state":"computed","paper":{"title":"Reducing Memory Cost of Exact Diagonalization using Singular Value Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.DS","hep-lat"],"primary_cat":"cond-mat.str-el","authors_text":"Assa Auerbach, Marvin Weinstein, V. Ravi Chandra","submitted_at":"2011-04-29T20:00:09Z","abstract_excerpt":"We present a modified Lanczos algorithm to diagonalize lattice Hamiltonians with dramatically reduced memory requirements, {\\em without restricting to variational ansatzes}. The lattice of size $N$ is partitioned into two subclusters. At each iteration the Lanczos vector is projected into two sets of $n_{{\\rm svd}}$ smaller subcluster vectors using singular value decomposition. For low entanglement entropy $S_{ee}$, (satisfied by short range Hamiltonians), the truncation error is expected to vanish as $\\exp(-n_{{\\rm svd}}^{1/S_{ee}})$. Convergence is tested for the Heisenberg model on Kagom\\'e"},"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":"1105.0007","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.str-el","submitted_at":"2011-04-29T20:00:09Z","cross_cats_sorted":["cond-mat.stat-mech","cs.DS","hep-lat"],"title_canon_sha256":"50551602dadb0ece6414a97f35837a82d4d6ff4613b81d52517c424c84e15f73","abstract_canon_sha256":"c6a2e6219787359cf7a564b1b844eaaab1a943aab0c6fecf8cd972d9ccc77ac7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:34.686468Z","signature_b64":"kVDjM2yrmPdsBe6AgBnkbXxFDVUM0V5jny23z9INTtLzuStvOreSLwhl86aabQmMDlfYmTepI/LssN1Ac2ANBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f328c3f3efa8ee6341033fcc8c0e231b64f42e16ba3a7f1a48ed3da4a6cd78cd","last_reissued_at":"2026-05-18T04:08:34.685903Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:34.685903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reducing Memory Cost of Exact Diagonalization using Singular Value Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.DS","hep-lat"],"primary_cat":"cond-mat.str-el","authors_text":"Assa Auerbach, Marvin Weinstein, V. Ravi Chandra","submitted_at":"2011-04-29T20:00:09Z","abstract_excerpt":"We present a modified Lanczos algorithm to diagonalize lattice Hamiltonians with dramatically reduced memory requirements, {\\em without restricting to variational ansatzes}. The lattice of size $N$ is partitioned into two subclusters. At each iteration the Lanczos vector is projected into two sets of $n_{{\\rm svd}}$ smaller subcluster vectors using singular value decomposition. For low entanglement entropy $S_{ee}$, (satisfied by short range Hamiltonians), the truncation error is expected to vanish as $\\exp(-n_{{\\rm svd}}^{1/S_{ee}})$. Convergence is tested for the Heisenberg model on Kagom\\'e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0007","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":""},"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":"1105.0007","created_at":"2026-05-18T04:08:34.685986+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.0007v2","created_at":"2026-05-18T04:08:34.685986+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0007","created_at":"2026-05-18T04:08:34.685986+00:00"},{"alias_kind":"pith_short_12","alias_value":"6MUMH47PVDXG","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"6MUMH47PVDXGGQID","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"6MUMH47P","created_at":"2026-05-18T12:26:22.705136+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/6MUMH47PVDXGGQIDH7GIYDRDDN","json":"https://pith.science/pith/6MUMH47PVDXGGQIDH7GIYDRDDN.json","graph_json":"https://pith.science/api/pith-number/6MUMH47PVDXGGQIDH7GIYDRDDN/graph.json","events_json":"https://pith.science/api/pith-number/6MUMH47PVDXGGQIDH7GIYDRDDN/events.json","paper":"https://pith.science/paper/6MUMH47P"},"agent_actions":{"view_html":"https://pith.science/pith/6MUMH47PVDXGGQIDH7GIYDRDDN","download_json":"https://pith.science/pith/6MUMH47PVDXGGQIDH7GIYDRDDN.json","view_paper":"https://pith.science/paper/6MUMH47P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.0007&json=true","fetch_graph":"https://pith.science/api/pith-number/6MUMH47PVDXGGQIDH7GIYDRDDN/graph.json","fetch_events":"https://pith.science/api/pith-number/6MUMH47PVDXGGQIDH7GIYDRDDN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6MUMH47PVDXGGQIDH7GIYDRDDN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6MUMH47PVDXGGQIDH7GIYDRDDN/action/storage_attestation","attest_author":"https://pith.science/pith/6MUMH47PVDXGGQIDH7GIYDRDDN/action/author_attestation","sign_citation":"https://pith.science/pith/6MUMH47PVDXGGQIDH7GIYDRDDN/action/citation_signature","submit_replication":"https://pith.science/pith/6MUMH47PVDXGGQIDH7GIYDRDDN/action/replication_record"}},"created_at":"2026-05-18T04:08:34.685986+00:00","updated_at":"2026-05-18T04:08:34.685986+00:00"}