{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:QO5MMTGZDZKAU3F5ATQEVP2W47","short_pith_number":"pith:QO5MMTGZ","schema_version":"1.0","canonical_sha256":"83bac64cd91e540a6cbd04e04abf56e7e7458a01a802a0ab0db75af841bb89f8","source":{"kind":"arxiv","id":"2410.02758","version":3},"attestation_state":"computed","paper":{"title":"Pseudoentanglement from tensor networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.stat-mech","hep-th"],"primary_cat":"quant-ph","authors_text":"Matteo Ippoliti, Xiaozhou Feng, Zihan Cheng","submitted_at":"2024-10-03T17:59:09Z","abstract_excerpt":"Pseudoentangled states are defined by their ability to hide their entanglement structure: they are indistinguishable from random states to any observer with polynomial resources, yet can have much less entanglement than random states. Existing constructions of pseudoentanglement based on phase- and/or subset-states are limited in the entanglement structures they can hide: e.g., the states may have low entanglement on a single cut, on all cuts at once, or on local cuts in one dimension. Here we introduce new constructions of pseudoentangled states based on (pseudo)random tensor networks that af"},"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":"2410.02758","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-10-03T17:59:09Z","cross_cats_sorted":["cond-mat.stat-mech","hep-th"],"title_canon_sha256":"6a934e1a818d5a1dd7737eb7c30dede460fd4dad65c4bfe7bd7267751efc1d0b","abstract_canon_sha256":"ecfa10ae38a3953fa56d6d197b1e09a6a3b21fcc42770da3f5a8341147e9a293"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:34:44.013984Z","signature_b64":"n4JtNQdyk3P5JqhCGf+GqjLmiaSkmJ8ce2it1nGWaen3wlkvh629sW0BzGZYrDRfeYLDJWMN8BjN64eOYHPuBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83bac64cd91e540a6cbd04e04abf56e7e7458a01a802a0ab0db75af841bb89f8","last_reissued_at":"2026-07-05T11:34:44.013490Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:34:44.013490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pseudoentanglement from tensor networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.stat-mech","hep-th"],"primary_cat":"quant-ph","authors_text":"Matteo Ippoliti, Xiaozhou Feng, Zihan Cheng","submitted_at":"2024-10-03T17:59:09Z","abstract_excerpt":"Pseudoentangled states are defined by their ability to hide their entanglement structure: they are indistinguishable from random states to any observer with polynomial resources, yet can have much less entanglement than random states. Existing constructions of pseudoentanglement based on phase- and/or subset-states are limited in the entanglement structures they can hide: e.g., the states may have low entanglement on a single cut, on all cuts at once, or on local cuts in one dimension. Here we introduce new constructions of pseudoentangled states based on (pseudo)random tensor networks that af"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.02758","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/2410.02758/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":"2410.02758","created_at":"2026-07-05T11:34:44.013558+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.02758v3","created_at":"2026-07-05T11:34:44.013558+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.02758","created_at":"2026-07-05T11:34:44.013558+00:00"},{"alias_kind":"pith_short_12","alias_value":"QO5MMTGZDZKA","created_at":"2026-07-05T11:34:44.013558+00:00"},{"alias_kind":"pith_short_16","alias_value":"QO5MMTGZDZKAU3F5","created_at":"2026-07-05T11:34:44.013558+00:00"},{"alias_kind":"pith_short_8","alias_value":"QO5MMTGZ","created_at":"2026-07-05T11:34:44.013558+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.17650","citing_title":"Near-Term Pseudorandom and Pseudoresource Quantum States","ref_index":56,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QO5MMTGZDZKAU3F5ATQEVP2W47","json":"https://pith.science/pith/QO5MMTGZDZKAU3F5ATQEVP2W47.json","graph_json":"https://pith.science/api/pith-number/QO5MMTGZDZKAU3F5ATQEVP2W47/graph.json","events_json":"https://pith.science/api/pith-number/QO5MMTGZDZKAU3F5ATQEVP2W47/events.json","paper":"https://pith.science/paper/QO5MMTGZ"},"agent_actions":{"view_html":"https://pith.science/pith/QO5MMTGZDZKAU3F5ATQEVP2W47","download_json":"https://pith.science/pith/QO5MMTGZDZKAU3F5ATQEVP2W47.json","view_paper":"https://pith.science/paper/QO5MMTGZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.02758&json=true","fetch_graph":"https://pith.science/api/pith-number/QO5MMTGZDZKAU3F5ATQEVP2W47/graph.json","fetch_events":"https://pith.science/api/pith-number/QO5MMTGZDZKAU3F5ATQEVP2W47/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QO5MMTGZDZKAU3F5ATQEVP2W47/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QO5MMTGZDZKAU3F5ATQEVP2W47/action/storage_attestation","attest_author":"https://pith.science/pith/QO5MMTGZDZKAU3F5ATQEVP2W47/action/author_attestation","sign_citation":"https://pith.science/pith/QO5MMTGZDZKAU3F5ATQEVP2W47/action/citation_signature","submit_replication":"https://pith.science/pith/QO5MMTGZDZKAU3F5ATQEVP2W47/action/replication_record"}},"created_at":"2026-07-05T11:34:44.013558+00:00","updated_at":"2026-07-05T11:34:44.013558+00:00"}