{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LXNJIV6ZVFJQS32IFLY4AEC4N2","short_pith_number":"pith:LXNJIV6Z","schema_version":"1.0","canonical_sha256":"5dda9457d9a953096f482af1c0105c6e8f13288d6baded689f30924f6d6993a7","source":{"kind":"arxiv","id":"1811.04085","version":1},"attestation_state":"computed","paper":{"title":"Binding Complexity and Multiparty Entanglement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"hep-th","authors_text":"Arjun Kar, Matthew DeCross, Onkar Parrikar, Vijay Balasubramanian","submitted_at":"2018-11-09T19:00:00Z","abstract_excerpt":"We introduce \"binding complexity\", a new notion of circuit complexity which quantifies the difficulty of distributing entanglement among multiple parties, each consisting of many local degrees of freedom. We define binding complexity of a given state as the minimal number of quantum gates that must act between parties to prepare it. To illustrate the new notion we compute it in a toy model for a scalar field theory, using certain multiparty entangled states which are analogous to configurations that are known in AdS/CFT to correspond to multiboundary wormholes. Pursuing this analogy, we show t"},"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":"1811.04085","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"hep-th","submitted_at":"2018-11-09T19:00:00Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"a195a40f24ff9654a8bbcf6e2396d157982b9d8a0564fb67cf3f8f5d10234bec","abstract_canon_sha256":"28ed6b82cc162bbb4e74091035e829cb38e87eabe6fb5f7a9d595f123032da81"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:57.304011Z","signature_b64":"2E4TH0hceleBBDHbFS44njaJljAxWbB20RUg6mvd18Z3llfm4wA8EsIu3bOW2Ie+sdgbC7D/trc7Tg1fi1ChBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5dda9457d9a953096f482af1c0105c6e8f13288d6baded689f30924f6d6993a7","last_reissued_at":"2026-05-17T23:53:57.303237Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:57.303237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Binding Complexity and Multiparty Entanglement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"hep-th","authors_text":"Arjun Kar, Matthew DeCross, Onkar Parrikar, Vijay Balasubramanian","submitted_at":"2018-11-09T19:00:00Z","abstract_excerpt":"We introduce \"binding complexity\", a new notion of circuit complexity which quantifies the difficulty of distributing entanglement among multiple parties, each consisting of many local degrees of freedom. We define binding complexity of a given state as the minimal number of quantum gates that must act between parties to prepare it. To illustrate the new notion we compute it in a toy model for a scalar field theory, using certain multiparty entangled states which are analogous to configurations that are known in AdS/CFT to correspond to multiboundary wormholes. Pursuing this analogy, we show t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.04085","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1811.04085","created_at":"2026-05-17T23:53:57.303373+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.04085v1","created_at":"2026-05-17T23:53:57.303373+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.04085","created_at":"2026-05-17T23:53:57.303373+00:00"},{"alias_kind":"pith_short_12","alias_value":"LXNJIV6ZVFJQ","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LXNJIV6ZVFJQS32I","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LXNJIV6Z","created_at":"2026-05-18T12:32:37.024351+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LXNJIV6ZVFJQS32IFLY4AEC4N2","json":"https://pith.science/pith/LXNJIV6ZVFJQS32IFLY4AEC4N2.json","graph_json":"https://pith.science/api/pith-number/LXNJIV6ZVFJQS32IFLY4AEC4N2/graph.json","events_json":"https://pith.science/api/pith-number/LXNJIV6ZVFJQS32IFLY4AEC4N2/events.json","paper":"https://pith.science/paper/LXNJIV6Z"},"agent_actions":{"view_html":"https://pith.science/pith/LXNJIV6ZVFJQS32IFLY4AEC4N2","download_json":"https://pith.science/pith/LXNJIV6ZVFJQS32IFLY4AEC4N2.json","view_paper":"https://pith.science/paper/LXNJIV6Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.04085&json=true","fetch_graph":"https://pith.science/api/pith-number/LXNJIV6ZVFJQS32IFLY4AEC4N2/graph.json","fetch_events":"https://pith.science/api/pith-number/LXNJIV6ZVFJQS32IFLY4AEC4N2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LXNJIV6ZVFJQS32IFLY4AEC4N2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LXNJIV6ZVFJQS32IFLY4AEC4N2/action/storage_attestation","attest_author":"https://pith.science/pith/LXNJIV6ZVFJQS32IFLY4AEC4N2/action/author_attestation","sign_citation":"https://pith.science/pith/LXNJIV6ZVFJQS32IFLY4AEC4N2/action/citation_signature","submit_replication":"https://pith.science/pith/LXNJIV6ZVFJQS32IFLY4AEC4N2/action/replication_record"}},"created_at":"2026-05-17T23:53:57.303373+00:00","updated_at":"2026-05-17T23:53:57.303373+00:00"}