{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:RLQI2LC2OSGD7CIMWD5EUBUUI5","short_pith_number":"pith:RLQI2LC2","schema_version":"1.0","canonical_sha256":"8ae08d2c5a748c3f890cb0fa4a0694477c6f0e0722e74d1ebdd5f800db9c8779","source":{"kind":"arxiv","id":"2411.03096","version":2},"attestation_state":"computed","paper":{"title":"On the Complexity of Pure-State Consistency of Local Density Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Dorian Rudolph, Jonas Kamminga","submitted_at":"2024-11-05T13:43:21Z","abstract_excerpt":"In this work we investigate the computational complexity of the pure consistency of local density matrices (PureCLDM) and pure N-representability (Pure-N-Representability; analog of PureCLDM for bosonic or fermionic systems) problems. In these problems the input is a set of reduced density matrices and the task is to determine whether there exists a global pure state consistent with these reduced density matrices. While mixed CLDM, i.e. where the global state can be mixed, was proven to be QMA-complete by Broadbent and Grilo [JoC 2022], almost nothing was known about the complexity of the pure"},"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":"2411.03096","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-11-05T13:43:21Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"162ee50202aef910bd065b5554ab1b158d74614107a9bea3975305b8322652b7","abstract_canon_sha256":"940c1d7992b004a0a859d0a7ed12e78c37f2ad25ec4148f33c29e8b9cdc23028"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:45:56.891744Z","signature_b64":"YmSov3H62K5lvDf9+/UnIa9AwjZ/7khhIbjvFOvV3cuyt1D7zGSHzayLAksqmuHLdjDUn0CJAFCVzO1GhOTdDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ae08d2c5a748c3f890cb0fa4a0694477c6f0e0722e74d1ebdd5f800db9c8779","last_reissued_at":"2026-07-05T10:45:56.891329Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:45:56.891329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Complexity of Pure-State Consistency of Local Density Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Dorian Rudolph, Jonas Kamminga","submitted_at":"2024-11-05T13:43:21Z","abstract_excerpt":"In this work we investigate the computational complexity of the pure consistency of local density matrices (PureCLDM) and pure N-representability (Pure-N-Representability; analog of PureCLDM for bosonic or fermionic systems) problems. In these problems the input is a set of reduced density matrices and the task is to determine whether there exists a global pure state consistent with these reduced density matrices. While mixed CLDM, i.e. where the global state can be mixed, was proven to be QMA-complete by Broadbent and Grilo [JoC 2022], almost nothing was known about the complexity of the pure"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.03096","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/2411.03096/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":"2411.03096","created_at":"2026-07-05T10:45:56.891387+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.03096v2","created_at":"2026-07-05T10:45:56.891387+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.03096","created_at":"2026-07-05T10:45:56.891387+00:00"},{"alias_kind":"pith_short_12","alias_value":"RLQI2LC2OSGD","created_at":"2026-07-05T10:45:56.891387+00:00"},{"alias_kind":"pith_short_16","alias_value":"RLQI2LC2OSGD7CIM","created_at":"2026-07-05T10:45:56.891387+00:00"},{"alias_kind":"pith_short_8","alias_value":"RLQI2LC2","created_at":"2026-07-05T10:45:56.891387+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.27886","citing_title":"The power of unentanglement without destructive interference","ref_index":67,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RLQI2LC2OSGD7CIMWD5EUBUUI5","json":"https://pith.science/pith/RLQI2LC2OSGD7CIMWD5EUBUUI5.json","graph_json":"https://pith.science/api/pith-number/RLQI2LC2OSGD7CIMWD5EUBUUI5/graph.json","events_json":"https://pith.science/api/pith-number/RLQI2LC2OSGD7CIMWD5EUBUUI5/events.json","paper":"https://pith.science/paper/RLQI2LC2"},"agent_actions":{"view_html":"https://pith.science/pith/RLQI2LC2OSGD7CIMWD5EUBUUI5","download_json":"https://pith.science/pith/RLQI2LC2OSGD7CIMWD5EUBUUI5.json","view_paper":"https://pith.science/paper/RLQI2LC2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.03096&json=true","fetch_graph":"https://pith.science/api/pith-number/RLQI2LC2OSGD7CIMWD5EUBUUI5/graph.json","fetch_events":"https://pith.science/api/pith-number/RLQI2LC2OSGD7CIMWD5EUBUUI5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RLQI2LC2OSGD7CIMWD5EUBUUI5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RLQI2LC2OSGD7CIMWD5EUBUUI5/action/storage_attestation","attest_author":"https://pith.science/pith/RLQI2LC2OSGD7CIMWD5EUBUUI5/action/author_attestation","sign_citation":"https://pith.science/pith/RLQI2LC2OSGD7CIMWD5EUBUUI5/action/citation_signature","submit_replication":"https://pith.science/pith/RLQI2LC2OSGD7CIMWD5EUBUUI5/action/replication_record"}},"created_at":"2026-07-05T10:45:56.891387+00:00","updated_at":"2026-07-05T10:45:56.891387+00:00"}