{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:O5XVK7UQAPUIJAZVHM7EV2XKLM","short_pith_number":"pith:O5XVK7UQ","schema_version":"1.0","canonical_sha256":"776f557e9003e88483353b3e4aeaea5b247536c257dc3ed5e0745f7b5cd69a21","source":{"kind":"arxiv","id":"2311.04277","version":2},"attestation_state":"computed","paper":{"title":"The Complexity of Being Entangled","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"hep-th","authors_text":"Giuseppe Policastro, Shira Chapman, Stefano Baiguera, Tal Schwartzman","submitted_at":"2023-11-07T19:00:02Z","abstract_excerpt":"Nielsen's approach to quantum state complexity relates the minimal number of quantum gates required to prepare a state to the length of geodesics computed with a certain norm on the manifold of unitary transformations. For a bipartite system, we investigate binding complexity, which corresponds to norms in which gates acting on a single subsystem are free of cost. We reduce the problem to the study of geodesics on the manifold of Schmidt coefficients, equipped with an appropriate metric. Binding complexity is closely related to other quantities such as distributed computing and quantum communi"},"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":"2311.04277","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"hep-th","submitted_at":"2023-11-07T19:00:02Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"6d16f1fdac01add7bf645dacbdfeb2af00914287e66ea83aa78aa564502bb1cc","abstract_canon_sha256":"354f7fa8766ad72c0e904a7f0175ed5b5e37838f341dbe50be3a840e30c6fca1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:08:09.814932Z","signature_b64":"EFJbNnPumxjfvoKxKvQGQY1uaY3B4kP4aHzg2MTvFFPGJKEizW+C4BIZFfZQwX6ratfUvCBwWQQ6rmDEG8C2BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"776f557e9003e88483353b3e4aeaea5b247536c257dc3ed5e0745f7b5cd69a21","last_reissued_at":"2026-07-05T09:08:09.814489Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:08:09.814489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of Being Entangled","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"hep-th","authors_text":"Giuseppe Policastro, Shira Chapman, Stefano Baiguera, Tal Schwartzman","submitted_at":"2023-11-07T19:00:02Z","abstract_excerpt":"Nielsen's approach to quantum state complexity relates the minimal number of quantum gates required to prepare a state to the length of geodesics computed with a certain norm on the manifold of unitary transformations. For a bipartite system, we investigate binding complexity, which corresponds to norms in which gates acting on a single subsystem are free of cost. We reduce the problem to the study of geodesics on the manifold of Schmidt coefficients, equipped with an appropriate metric. Binding complexity is closely related to other quantities such as distributed computing and quantum communi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.04277","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/2311.04277/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":"2311.04277","created_at":"2026-07-05T09:08:09.814551+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.04277v2","created_at":"2026-07-05T09:08:09.814551+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.04277","created_at":"2026-07-05T09:08:09.814551+00:00"},{"alias_kind":"pith_short_12","alias_value":"O5XVK7UQAPUI","created_at":"2026-07-05T09:08:09.814551+00:00"},{"alias_kind":"pith_short_16","alias_value":"O5XVK7UQAPUIJAZV","created_at":"2026-07-05T09:08:09.814551+00:00"},{"alias_kind":"pith_short_8","alias_value":"O5XVK7UQ","created_at":"2026-07-05T09:08:09.814551+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.22118","citing_title":"CFT Complexity and Penalty Factors","ref_index":41,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O5XVK7UQAPUIJAZVHM7EV2XKLM","json":"https://pith.science/pith/O5XVK7UQAPUIJAZVHM7EV2XKLM.json","graph_json":"https://pith.science/api/pith-number/O5XVK7UQAPUIJAZVHM7EV2XKLM/graph.json","events_json":"https://pith.science/api/pith-number/O5XVK7UQAPUIJAZVHM7EV2XKLM/events.json","paper":"https://pith.science/paper/O5XVK7UQ"},"agent_actions":{"view_html":"https://pith.science/pith/O5XVK7UQAPUIJAZVHM7EV2XKLM","download_json":"https://pith.science/pith/O5XVK7UQAPUIJAZVHM7EV2XKLM.json","view_paper":"https://pith.science/paper/O5XVK7UQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.04277&json=true","fetch_graph":"https://pith.science/api/pith-number/O5XVK7UQAPUIJAZVHM7EV2XKLM/graph.json","fetch_events":"https://pith.science/api/pith-number/O5XVK7UQAPUIJAZVHM7EV2XKLM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O5XVK7UQAPUIJAZVHM7EV2XKLM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O5XVK7UQAPUIJAZVHM7EV2XKLM/action/storage_attestation","attest_author":"https://pith.science/pith/O5XVK7UQAPUIJAZVHM7EV2XKLM/action/author_attestation","sign_citation":"https://pith.science/pith/O5XVK7UQAPUIJAZVHM7EV2XKLM/action/citation_signature","submit_replication":"https://pith.science/pith/O5XVK7UQAPUIJAZVHM7EV2XKLM/action/replication_record"}},"created_at":"2026-07-05T09:08:09.814551+00:00","updated_at":"2026-07-05T09:08:09.814551+00:00"}