{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:VCEFFAZSSK3DEMNT4LFK65FS5F","short_pith_number":"pith:VCEFFAZS","schema_version":"1.0","canonical_sha256":"a88852833292b63231b3e2caaf74b2e95bbd2a28419eb6e0dc4f5c07fd7f161e","source":{"kind":"arxiv","id":"2601.16734","version":2},"attestation_state":"computed","paper":{"title":"SeeMPS: A Python-based Matrix Product State and Tensor Train Library","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"quant-ph","authors_text":"Jorge Gidi, Juan Jos\\'e Garc\\'ia-Ripoll, Juan Jos\\'e Rodr\\'iguez-Aldavero, Paula Garc\\'ia-Molina","submitted_at":"2026-01-23T13:31:16Z","abstract_excerpt":"We introduce SeeMPS, a Python library dedicated to implementing tensor network algorithms based on the well-known Matrix Product States (MPS) and Quantized Tensor Train (QTT) formalisms. SeeMPS is implemented as a complete finite precision linear algebra package where exponentially large vector spaces are compressed using the MPS/TT formalism. It enables both low-level operations, such as vector addition, linear transformations, and Hadamard products, as well as high-level algorithms, including the approximation of linear equations, eigenvalue computations, and exponentially efficient Fourier "},"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":"2601.16734","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-01-23T13:31:16Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"f0c1eff8dc7d0ca023cadaac7c35cdcff7fb8027bb5a828939e770737c474313","abstract_canon_sha256":"df2912fc02326212e88871d4e65f56eb86ddeb4376edb4e32105ac5873ed73d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-28T02:23:24.141789Z","signature_b64":"XAVZkHU7IjXUVKpbgFw+YHCFarlBkdA0g6PPY+dpH3Ns19dwD6FbshwCf9OHelceadN1dSoT+eBe71oQiilbAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a88852833292b63231b3e2caaf74b2e95bbd2a28419eb6e0dc4f5c07fd7f161e","last_reissued_at":"2026-07-28T02:23:24.140851Z","signature_status":"signed_v1","first_computed_at":"2026-07-28T02:23:24.140851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SeeMPS: A Python-based Matrix Product State and Tensor Train Library","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"quant-ph","authors_text":"Jorge Gidi, Juan Jos\\'e Garc\\'ia-Ripoll, Juan Jos\\'e Rodr\\'iguez-Aldavero, Paula Garc\\'ia-Molina","submitted_at":"2026-01-23T13:31:16Z","abstract_excerpt":"We introduce SeeMPS, a Python library dedicated to implementing tensor network algorithms based on the well-known Matrix Product States (MPS) and Quantized Tensor Train (QTT) formalisms. SeeMPS is implemented as a complete finite precision linear algebra package where exponentially large vector spaces are compressed using the MPS/TT formalism. It enables both low-level operations, such as vector addition, linear transformations, and Hadamard products, as well as high-level algorithms, including the approximation of linear equations, eigenvalue computations, and exponentially efficient Fourier "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.16734","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/2601.16734/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":"2601.16734","created_at":"2026-07-28T02:23:24.141291+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.16734v2","created_at":"2026-07-28T02:23:24.141291+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.16734","created_at":"2026-07-28T02:23:24.141291+00:00"},{"alias_kind":"pith_short_12","alias_value":"VCEFFAZSSK3D","created_at":"2026-07-28T02:23:24.141291+00:00"},{"alias_kind":"pith_short_16","alias_value":"VCEFFAZSSK3DEMNT","created_at":"2026-07-28T02:23:24.141291+00:00"},{"alias_kind":"pith_short_8","alias_value":"VCEFFAZS","created_at":"2026-07-28T02:23:24.141291+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.28369","citing_title":"Performance Benchmarking: Software for the Density Matrix Renormalization Group","ref_index":49,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VCEFFAZSSK3DEMNT4LFK65FS5F","json":"https://pith.science/pith/VCEFFAZSSK3DEMNT4LFK65FS5F.json","graph_json":"https://pith.science/api/pith-number/VCEFFAZSSK3DEMNT4LFK65FS5F/graph.json","events_json":"https://pith.science/api/pith-number/VCEFFAZSSK3DEMNT4LFK65FS5F/events.json","paper":"https://pith.science/paper/VCEFFAZS"},"agent_actions":{"view_html":"https://pith.science/pith/VCEFFAZSSK3DEMNT4LFK65FS5F","download_json":"https://pith.science/pith/VCEFFAZSSK3DEMNT4LFK65FS5F.json","view_paper":"https://pith.science/paper/VCEFFAZS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.16734&json=true","fetch_graph":"https://pith.science/api/pith-number/VCEFFAZSSK3DEMNT4LFK65FS5F/graph.json","fetch_events":"https://pith.science/api/pith-number/VCEFFAZSSK3DEMNT4LFK65FS5F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VCEFFAZSSK3DEMNT4LFK65FS5F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VCEFFAZSSK3DEMNT4LFK65FS5F/action/storage_attestation","attest_author":"https://pith.science/pith/VCEFFAZSSK3DEMNT4LFK65FS5F/action/author_attestation","sign_citation":"https://pith.science/pith/VCEFFAZSSK3DEMNT4LFK65FS5F/action/citation_signature","submit_replication":"https://pith.science/pith/VCEFFAZSSK3DEMNT4LFK65FS5F/action/replication_record"}},"created_at":"2026-07-28T02:23:24.141291+00:00","updated_at":"2026-07-28T02:23:24.141291+00:00"}