{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:ERPMIIT7BEBISFKUUJJZALE7VW","short_pith_number":"pith:ERPMIIT7","schema_version":"1.0","canonical_sha256":"245ec4227f0902891554a253902c9fad8722e18b4397e285a5ca943909f6cb78","source":{"kind":"arxiv","id":"2112.04722","version":2},"attestation_state":"computed","paper":{"title":"Krylov complexity of many-body localization: Operator localization in Krylov basis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cond-mat.dis-nn","authors_text":"Cheng-Ju Lin, Fabian Ballar Trigueros","submitted_at":"2021-12-09T06:50:19Z","abstract_excerpt":"We study the operator growth problem and its complexity in the many-body localization (MBL) system from the Lanczos algorithm perspective. Using the Krylov basis, the operator growth problem can be viewed as a single-particle hopping problem on a semi-infinite chain with the hopping amplitudes given by the Lanczos coefficients. We find that, in the MBL systems, the Lanczos coefficients scale as $\\sim n/\\ln(n)$ asymptotically, same as in the ergodic systems, but with an additional even-odd alteration and an effective randomness. We use a simple linear extrapolation scheme as an attempt to extra"},"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":"2112.04722","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2021-12-09T06:50:19Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"d96ce222fbac574a7df2b88d9b25c09418f9677d4e6bf1c4f23d43e528691d1b","abstract_canon_sha256":"fd27e830f6b9957b0d82038bb321b0d8da8cefc420da53e024e3bf0ddeb1a7cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:53:18.019201Z","signature_b64":"lCBDvt10BzpNcXbJkBOybOiBmubrf+spaTMuYboqkCmmlipbhHJqGeSeKr3ssQ4LCZdDZItAg4PT9pJdre95CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"245ec4227f0902891554a253902c9fad8722e18b4397e285a5ca943909f6cb78","last_reissued_at":"2026-07-05T04:53:18.018771Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:53:18.018771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Krylov complexity of many-body localization: Operator localization in Krylov basis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cond-mat.dis-nn","authors_text":"Cheng-Ju Lin, Fabian Ballar Trigueros","submitted_at":"2021-12-09T06:50:19Z","abstract_excerpt":"We study the operator growth problem and its complexity in the many-body localization (MBL) system from the Lanczos algorithm perspective. Using the Krylov basis, the operator growth problem can be viewed as a single-particle hopping problem on a semi-infinite chain with the hopping amplitudes given by the Lanczos coefficients. We find that, in the MBL systems, the Lanczos coefficients scale as $\\sim n/\\ln(n)$ asymptotically, same as in the ergodic systems, but with an additional even-odd alteration and an effective randomness. We use a simple linear extrapolation scheme as an attempt to extra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.04722","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/2112.04722/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":"2112.04722","created_at":"2026-07-05T04:53:18.018825+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.04722v2","created_at":"2026-07-05T04:53:18.018825+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.04722","created_at":"2026-07-05T04:53:18.018825+00:00"},{"alias_kind":"pith_short_12","alias_value":"ERPMIIT7BEBI","created_at":"2026-07-05T04:53:18.018825+00:00"},{"alias_kind":"pith_short_16","alias_value":"ERPMIIT7BEBISFKU","created_at":"2026-07-05T04:53:18.018825+00:00"},{"alias_kind":"pith_short_8","alias_value":"ERPMIIT7","created_at":"2026-07-05T04:53:18.018825+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2412.08925","citing_title":"Generalized CV Conjecture and Krylov Complexity in Two-Mode Hermitian Systems via Information Geometry","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ERPMIIT7BEBISFKUUJJZALE7VW","json":"https://pith.science/pith/ERPMIIT7BEBISFKUUJJZALE7VW.json","graph_json":"https://pith.science/api/pith-number/ERPMIIT7BEBISFKUUJJZALE7VW/graph.json","events_json":"https://pith.science/api/pith-number/ERPMIIT7BEBISFKUUJJZALE7VW/events.json","paper":"https://pith.science/paper/ERPMIIT7"},"agent_actions":{"view_html":"https://pith.science/pith/ERPMIIT7BEBISFKUUJJZALE7VW","download_json":"https://pith.science/pith/ERPMIIT7BEBISFKUUJJZALE7VW.json","view_paper":"https://pith.science/paper/ERPMIIT7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.04722&json=true","fetch_graph":"https://pith.science/api/pith-number/ERPMIIT7BEBISFKUUJJZALE7VW/graph.json","fetch_events":"https://pith.science/api/pith-number/ERPMIIT7BEBISFKUUJJZALE7VW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ERPMIIT7BEBISFKUUJJZALE7VW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ERPMIIT7BEBISFKUUJJZALE7VW/action/storage_attestation","attest_author":"https://pith.science/pith/ERPMIIT7BEBISFKUUJJZALE7VW/action/author_attestation","sign_citation":"https://pith.science/pith/ERPMIIT7BEBISFKUUJJZALE7VW/action/citation_signature","submit_replication":"https://pith.science/pith/ERPMIIT7BEBISFKUUJJZALE7VW/action/replication_record"}},"created_at":"2026-07-05T04:53:18.018825+00:00","updated_at":"2026-07-05T04:53:18.018825+00:00"}