{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:4EQLNVV2IRANSJTDSPTQED7ADH","short_pith_number":"pith:4EQLNVV2","schema_version":"1.0","canonical_sha256":"e120b6d6ba4440d9266393e7020fe019ec0ace687b3b03bee5f2d1155b2e6171","source":{"kind":"arxiv","id":"2408.02010","version":3},"attestation_state":"computed","paper":{"title":"Tensor Network Python (TeNPy) version 1","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.str-el","authors_text":"Anton Romen, Bartholomew Andrews, Daniel Parker, Frank Pollmann, Gunnar M\\\"oller, Jack Kemp, Jakob Unfried, Jan Geiger, Johannes Hauschild, K\\'evin H\\'emery, Leon Schoonderwoerd, Ludwig Zweng, Marcus Bintz, Markus Drescher, Martin Hefel, Maximilian Schulz, Michael P. Zaletel, Michael Rader, Nico Kirchner, Philipp Thoma, Philip Zechmann, Roger S. K. Mong, Sajant Anand, Samuel Scalet, Stefan Divic, Tomohiro Soejima, Umberto Borla, Vincent S. Liu, Wilhelm Kadow, Yantao Wu","submitted_at":"2024-08-04T12:27:10Z","abstract_excerpt":"TeNPy (short for 'Tensor Network Python') is a python library for the simulation of strongly correlated quantum systems with tensor networks. The philosophy of this library is to achieve a balance of readability and usability for new-comers, while at the same time providing powerful algorithms for experts. The focus is on MPS algorithms for 1D and 2D lattices, such as DMRG ground state search, as well as dynamics using TEBD, TDVP, or MPO evolution. This article is a companion to the recent version 1.0 release of TeNPy and gives a brief overview of the package."},"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.02010","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cond-mat.str-el","submitted_at":"2024-08-04T12:27:10Z","cross_cats_sorted":[],"title_canon_sha256":"c8880b1c81d10bb62708dbe446d448ca6a6975d795bd1d418c1d96254bcb543e","abstract_canon_sha256":"229db23c79037e6bd4f3a68a14d3ae2c43e893292d71cfd232e47860d14a3f9c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:40:41.700781Z","signature_b64":"F5W1o1dGjcpN/vrM3StA2risoX4+FL568+Q6gMlempn5yo1CZ/0xx2ui14+3zYoz0bB138aH/1SesTbXy2nOCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e120b6d6ba4440d9266393e7020fe019ec0ace687b3b03bee5f2d1155b2e6171","last_reissued_at":"2026-07-05T09:40:41.700272Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:40:41.700272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tensor Network Python (TeNPy) version 1","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.str-el","authors_text":"Anton Romen, Bartholomew Andrews, Daniel Parker, Frank Pollmann, Gunnar M\\\"oller, Jack Kemp, Jakob Unfried, Jan Geiger, Johannes Hauschild, K\\'evin H\\'emery, Leon Schoonderwoerd, Ludwig Zweng, Marcus Bintz, Markus Drescher, Martin Hefel, Maximilian Schulz, Michael P. Zaletel, Michael Rader, Nico Kirchner, Philipp Thoma, Philip Zechmann, Roger S. K. Mong, Sajant Anand, Samuel Scalet, Stefan Divic, Tomohiro Soejima, Umberto Borla, Vincent S. Liu, Wilhelm Kadow, Yantao Wu","submitted_at":"2024-08-04T12:27:10Z","abstract_excerpt":"TeNPy (short for 'Tensor Network Python') is a python library for the simulation of strongly correlated quantum systems with tensor networks. The philosophy of this library is to achieve a balance of readability and usability for new-comers, while at the same time providing powerful algorithms for experts. The focus is on MPS algorithms for 1D and 2D lattices, such as DMRG ground state search, as well as dynamics using TEBD, TDVP, or MPO evolution. This article is a companion to the recent version 1.0 release of TeNPy and gives a brief overview of the package."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.02010","kind":"arxiv","version":3},"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.02010/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.02010","created_at":"2026-07-05T09:40:41.700340+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.02010v3","created_at":"2026-07-05T09:40:41.700340+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.02010","created_at":"2026-07-05T09:40:41.700340+00:00"},{"alias_kind":"pith_short_12","alias_value":"4EQLNVV2IRAN","created_at":"2026-07-05T09:40:41.700340+00:00"},{"alias_kind":"pith_short_16","alias_value":"4EQLNVV2IRANSJTD","created_at":"2026-07-05T09:40:41.700340+00:00"},{"alias_kind":"pith_short_8","alias_value":"4EQLNVV2","created_at":"2026-07-05T09:40:41.700340+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.26208","citing_title":"Mapping twist fields to local operators via tensor networks","ref_index":35,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4EQLNVV2IRANSJTDSPTQED7ADH","json":"https://pith.science/pith/4EQLNVV2IRANSJTDSPTQED7ADH.json","graph_json":"https://pith.science/api/pith-number/4EQLNVV2IRANSJTDSPTQED7ADH/graph.json","events_json":"https://pith.science/api/pith-number/4EQLNVV2IRANSJTDSPTQED7ADH/events.json","paper":"https://pith.science/paper/4EQLNVV2"},"agent_actions":{"view_html":"https://pith.science/pith/4EQLNVV2IRANSJTDSPTQED7ADH","download_json":"https://pith.science/pith/4EQLNVV2IRANSJTDSPTQED7ADH.json","view_paper":"https://pith.science/paper/4EQLNVV2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.02010&json=true","fetch_graph":"https://pith.science/api/pith-number/4EQLNVV2IRANSJTDSPTQED7ADH/graph.json","fetch_events":"https://pith.science/api/pith-number/4EQLNVV2IRANSJTDSPTQED7ADH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4EQLNVV2IRANSJTDSPTQED7ADH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4EQLNVV2IRANSJTDSPTQED7ADH/action/storage_attestation","attest_author":"https://pith.science/pith/4EQLNVV2IRANSJTDSPTQED7ADH/action/author_attestation","sign_citation":"https://pith.science/pith/4EQLNVV2IRANSJTDSPTQED7ADH/action/citation_signature","submit_replication":"https://pith.science/pith/4EQLNVV2IRANSJTDSPTQED7ADH/action/replication_record"}},"created_at":"2026-07-05T09:40:41.700340+00:00","updated_at":"2026-07-05T09:40:41.700340+00:00"}