{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:PMBIWFTRWCU3LVJGE7TZB6EN4N","short_pith_number":"pith:PMBIWFTR","schema_version":"1.0","canonical_sha256":"7b028b1671b0a9b5d52627e790f88de36f442e42bb831eda6152df253a95988c","source":{"kind":"arxiv","id":"2312.07516","version":3},"attestation_state":"computed","paper":{"title":"Learning finitely correlated states: stability of the spectral reconstruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET","cs.LG"],"primary_cat":"quant-ph","authors_text":"Andreas Winter, Cambyse Rouz\\'e, Josep Lumbreras, Marco Fanizza, Niklas Galke","submitted_at":"2023-12-12T18:47:12Z","abstract_excerpt":"Matrix product operators allow efficient descriptions (or realizations) of states on a 1D lattice. We consider the task of learning a realization of minimal dimension from copies of an unknown state, such that the resulting operator is close to the density matrix in trace norm. For finitely correlated translation-invariant states on an infinite chain, a realization of minimal dimension can be exactly reconstructed via linear algebra operations from the marginals of a size depending on the representation dimension. We establish a bound on the trace norm error for an algorithm that estimates a c"},"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":"2312.07516","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-12-12T18:47:12Z","cross_cats_sorted":["cs.ET","cs.LG"],"title_canon_sha256":"5a49296874399f51564d12dcb33652ff2d7cf078285db7823130039f5922263d","abstract_canon_sha256":"2b156205634e423f58d2b8e99e08d0babe1c3dbc279fa8b90cdd3d4637112586"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:25:03.960831Z","signature_b64":"Zlu4FrJrr9KbSYkmkRNwQPwXinXk8qmyjCk0yqu0X8j0w1t4jMMK+fv14AJwX6MwcHdaJiJG48gqshWMAihnAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b028b1671b0a9b5d52627e790f88de36f442e42bb831eda6152df253a95988c","last_reissued_at":"2026-07-05T10:25:03.960304Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:25:03.960304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning finitely correlated states: stability of the spectral reconstruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET","cs.LG"],"primary_cat":"quant-ph","authors_text":"Andreas Winter, Cambyse Rouz\\'e, Josep Lumbreras, Marco Fanizza, Niklas Galke","submitted_at":"2023-12-12T18:47:12Z","abstract_excerpt":"Matrix product operators allow efficient descriptions (or realizations) of states on a 1D lattice. We consider the task of learning a realization of minimal dimension from copies of an unknown state, such that the resulting operator is close to the density matrix in trace norm. For finitely correlated translation-invariant states on an infinite chain, a realization of minimal dimension can be exactly reconstructed via linear algebra operations from the marginals of a size depending on the representation dimension. We establish a bound on the trace norm error for an algorithm that estimates a c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.07516","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/2312.07516/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":"2312.07516","created_at":"2026-07-05T10:25:03.960371+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.07516v3","created_at":"2026-07-05T10:25:03.960371+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.07516","created_at":"2026-07-05T10:25:03.960371+00:00"},{"alias_kind":"pith_short_12","alias_value":"PMBIWFTRWCU3","created_at":"2026-07-05T10:25:03.960371+00:00"},{"alias_kind":"pith_short_16","alias_value":"PMBIWFTRWCU3LVJG","created_at":"2026-07-05T10:25:03.960371+00:00"},{"alias_kind":"pith_short_8","alias_value":"PMBIWFTR","created_at":"2026-07-05T10:25:03.960371+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2402.18500","citing_title":"Conditional Independence of 1D Gibbs States with Applications to Efficient Learning","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2604.04462","citing_title":"A Demon that remembers: An agential approach towards quantum thermodynamics of temporal correlations","ref_index":117,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PMBIWFTRWCU3LVJGE7TZB6EN4N","json":"https://pith.science/pith/PMBIWFTRWCU3LVJGE7TZB6EN4N.json","graph_json":"https://pith.science/api/pith-number/PMBIWFTRWCU3LVJGE7TZB6EN4N/graph.json","events_json":"https://pith.science/api/pith-number/PMBIWFTRWCU3LVJGE7TZB6EN4N/events.json","paper":"https://pith.science/paper/PMBIWFTR"},"agent_actions":{"view_html":"https://pith.science/pith/PMBIWFTRWCU3LVJGE7TZB6EN4N","download_json":"https://pith.science/pith/PMBIWFTRWCU3LVJGE7TZB6EN4N.json","view_paper":"https://pith.science/paper/PMBIWFTR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.07516&json=true","fetch_graph":"https://pith.science/api/pith-number/PMBIWFTRWCU3LVJGE7TZB6EN4N/graph.json","fetch_events":"https://pith.science/api/pith-number/PMBIWFTRWCU3LVJGE7TZB6EN4N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PMBIWFTRWCU3LVJGE7TZB6EN4N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PMBIWFTRWCU3LVJGE7TZB6EN4N/action/storage_attestation","attest_author":"https://pith.science/pith/PMBIWFTRWCU3LVJGE7TZB6EN4N/action/author_attestation","sign_citation":"https://pith.science/pith/PMBIWFTRWCU3LVJGE7TZB6EN4N/action/citation_signature","submit_replication":"https://pith.science/pith/PMBIWFTRWCU3LVJGE7TZB6EN4N/action/replication_record"}},"created_at":"2026-07-05T10:25:03.960371+00:00","updated_at":"2026-07-05T10:25:03.960371+00:00"}