{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2003:W2YQJJVTNLXLJULWINTW7YPHZZ","short_pith_number":"pith:W2YQJJVT","schema_version":"1.0","canonical_sha256":"b6b104a6b36aeeb4d17643676fe1e7ce41a046d9c380f4c514cd2f9995f01935","source":{"kind":"arxiv","id":"quant-ph/0307130","version":7},"attestation_state":"computed","paper":{"title":"Multi-party entanglement in graph states","license":"","headline":"","cross_cats":["cond-mat"],"primary_cat":"quant-ph","authors_text":"H.J. Briegel, J. Eisert, M. Hein","submitted_at":"2003-07-18T15:19:21Z","abstract_excerpt":"Graph states are multi-particle entangled states that correspond to mathematical graphs, where the vertices of the graph take the role of quantum spin systems and edges represent Ising interactions. They are many-body spin states of distributed quantum systems that play a significant role in quantum error correction, multi-party quantum communication, and quantum computation within the framework of the one-way quantum computer. We characterize and quantify the genuine multi-particle entanglement of such graph states in terms of the Schmidt measure, to which we provide upper and lower bounds in"},"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":"quant-ph/0307130","kind":"arxiv","version":7},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2003-07-18T15:19:21Z","cross_cats_sorted":["cond-mat"],"title_canon_sha256":"ee3077475cf9eccbd4c78c668f2ca727ef9b90a802af317311e52cb839a92386","abstract_canon_sha256":"392683d752a734862bfc9dce08bf537c444997403a79b2a3df1bc87f2a387880"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:46:21.792870Z","signature_b64":"vRd/VZU5zVmevdFU2f6ziudD20LqlmboLPBb+2nYGlrdhlwTSriXU3dBVZqrkXfHn4kbseGXpzTxQtdSQhphAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6b104a6b36aeeb4d17643676fe1e7ce41a046d9c380f4c514cd2f9995f01935","last_reissued_at":"2026-07-04T14:46:21.792516Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:46:21.792516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-party entanglement in graph states","license":"","headline":"","cross_cats":["cond-mat"],"primary_cat":"quant-ph","authors_text":"H.J. Briegel, J. Eisert, M. Hein","submitted_at":"2003-07-18T15:19:21Z","abstract_excerpt":"Graph states are multi-particle entangled states that correspond to mathematical graphs, where the vertices of the graph take the role of quantum spin systems and edges represent Ising interactions. They are many-body spin states of distributed quantum systems that play a significant role in quantum error correction, multi-party quantum communication, and quantum computation within the framework of the one-way quantum computer. We characterize and quantify the genuine multi-particle entanglement of such graph states in terms of the Schmidt measure, to which we provide upper and lower bounds in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0307130","kind":"arxiv","version":7},"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/quant-ph/0307130/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":"quant-ph/0307130","created_at":"2026-07-04T14:46:21.792574+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0307130v7","created_at":"2026-07-04T14:46:21.792574+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0307130","created_at":"2026-07-04T14:46:21.792574+00:00"},{"alias_kind":"pith_short_12","alias_value":"W2YQJJVTNLXL","created_at":"2026-07-04T14:46:21.792574+00:00"},{"alias_kind":"pith_short_16","alias_value":"W2YQJJVTNLXLJULW","created_at":"2026-07-04T14:46:21.792574+00:00"},{"alias_kind":"pith_short_8","alias_value":"W2YQJJVT","created_at":"2026-07-04T14:46:21.792574+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":5,"sample":[{"citing_arxiv_id":"2606.00210","citing_title":"Constraints on four-party entanglement in holography","ref_index":30,"is_internal_anchor":true},{"citing_arxiv_id":"2606.00210","citing_title":"Constraints on four-party entanglement in holography","ref_index":33,"is_internal_anchor":true},{"citing_arxiv_id":"1906.10929","citing_title":"Entanglement Certification $-$ From Theory to Experiment","ref_index":184,"is_internal_anchor":true},{"citing_arxiv_id":"2603.08847","citing_title":"The Structure of Circle Graph States","ref_index":10,"is_internal_anchor":true},{"citing_arxiv_id":"2604.03294","citing_title":"Expressibility of neural quantum states: a Walsh-complexity perspective","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/W2YQJJVTNLXLJULWINTW7YPHZZ","json":"https://pith.science/pith/W2YQJJVTNLXLJULWINTW7YPHZZ.json","graph_json":"https://pith.science/api/pith-number/W2YQJJVTNLXLJULWINTW7YPHZZ/graph.json","events_json":"https://pith.science/api/pith-number/W2YQJJVTNLXLJULWINTW7YPHZZ/events.json","paper":"https://pith.science/paper/W2YQJJVT"},"agent_actions":{"view_html":"https://pith.science/pith/W2YQJJVTNLXLJULWINTW7YPHZZ","download_json":"https://pith.science/pith/W2YQJJVTNLXLJULWINTW7YPHZZ.json","view_paper":"https://pith.science/paper/W2YQJJVT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0307130&json=true","fetch_graph":"https://pith.science/api/pith-number/W2YQJJVTNLXLJULWINTW7YPHZZ/graph.json","fetch_events":"https://pith.science/api/pith-number/W2YQJJVTNLXLJULWINTW7YPHZZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W2YQJJVTNLXLJULWINTW7YPHZZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W2YQJJVTNLXLJULWINTW7YPHZZ/action/storage_attestation","attest_author":"https://pith.science/pith/W2YQJJVTNLXLJULWINTW7YPHZZ/action/author_attestation","sign_citation":"https://pith.science/pith/W2YQJJVTNLXLJULWINTW7YPHZZ/action/citation_signature","submit_replication":"https://pith.science/pith/W2YQJJVTNLXLJULWINTW7YPHZZ/action/replication_record"}},"created_at":"2026-07-04T14:46:21.792574+00:00","updated_at":"2026-07-04T14:46:21.792574+00:00"}