{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:P2SHEIBOVWRQUU7HRF33SDEGYT","short_pith_number":"pith:P2SHEIBO","schema_version":"1.0","canonical_sha256":"7ea472202eada30a53e78977b90c86c4fef623e453e64a1d94fe2e46158633cc","source":{"kind":"arxiv","id":"2507.11458","version":1},"attestation_state":"computed","paper":{"title":"Entanglement Classification in the Graph States: The generalization to $n$-Qubits States using the Entanglement Matrix","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Sameer Sharma","submitted_at":"2025-07-15T16:30:46Z","abstract_excerpt":"Graph states represent a significant class of multi-partite entangled quantum states with applications in quantum error correction, quantum communication, and quantum computation. In this work, we introduce a novel formalism called the Entanglement Matrix for quantifying and classifying entanglement in n-qubit graph states. Leveraging concepts from graph theory and quantum information, we develop a systematic approach to analyze entanglement by identifying primary and secondary midpoints in graph representations, where midpoints correspond to controlled-Z gate operations between qubits. Using "},"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":"2507.11458","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2025-07-15T16:30:46Z","cross_cats_sorted":[],"title_canon_sha256":"6fb11747371819e5269c797a813503f1fadfda23e8818c0154eddf02b44cd592","abstract_canon_sha256":"38dd6156188b5955469324838143c29f026d1febcff47be11ad56f21b2fb2d41"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:37:39.539993Z","signature_b64":"sHtAWvTQgrPgE3lMeaV27DufKfwum8th68ZeKMUnp/XNYU8fYKYDOLv/Vub5BmV5mfj2KLMR4t3Qpnt25c0nDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ea472202eada30a53e78977b90c86c4fef623e453e64a1d94fe2e46158633cc","last_reissued_at":"2026-07-05T11:37:39.539518Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:37:39.539518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Entanglement Classification in the Graph States: The generalization to $n$-Qubits States using the Entanglement Matrix","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Sameer Sharma","submitted_at":"2025-07-15T16:30:46Z","abstract_excerpt":"Graph states represent a significant class of multi-partite entangled quantum states with applications in quantum error correction, quantum communication, and quantum computation. In this work, we introduce a novel formalism called the Entanglement Matrix for quantifying and classifying entanglement in n-qubit graph states. Leveraging concepts from graph theory and quantum information, we develop a systematic approach to analyze entanglement by identifying primary and secondary midpoints in graph representations, where midpoints correspond to controlled-Z gate operations between qubits. Using "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.11458","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.11458/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":"2507.11458","created_at":"2026-07-05T11:37:39.539581+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.11458v1","created_at":"2026-07-05T11:37:39.539581+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.11458","created_at":"2026-07-05T11:37:39.539581+00:00"},{"alias_kind":"pith_short_12","alias_value":"P2SHEIBOVWRQ","created_at":"2026-07-05T11:37:39.539581+00:00"},{"alias_kind":"pith_short_16","alias_value":"P2SHEIBOVWRQUU7H","created_at":"2026-07-05T11:37:39.539581+00:00"},{"alias_kind":"pith_short_8","alias_value":"P2SHEIBO","created_at":"2026-07-05T11:37:39.539581+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2508.04777","citing_title":"Absolutely maximally entangled pure states of multipartite quantum systems","ref_index":102,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P2SHEIBOVWRQUU7HRF33SDEGYT","json":"https://pith.science/pith/P2SHEIBOVWRQUU7HRF33SDEGYT.json","graph_json":"https://pith.science/api/pith-number/P2SHEIBOVWRQUU7HRF33SDEGYT/graph.json","events_json":"https://pith.science/api/pith-number/P2SHEIBOVWRQUU7HRF33SDEGYT/events.json","paper":"https://pith.science/paper/P2SHEIBO"},"agent_actions":{"view_html":"https://pith.science/pith/P2SHEIBOVWRQUU7HRF33SDEGYT","download_json":"https://pith.science/pith/P2SHEIBOVWRQUU7HRF33SDEGYT.json","view_paper":"https://pith.science/paper/P2SHEIBO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.11458&json=true","fetch_graph":"https://pith.science/api/pith-number/P2SHEIBOVWRQUU7HRF33SDEGYT/graph.json","fetch_events":"https://pith.science/api/pith-number/P2SHEIBOVWRQUU7HRF33SDEGYT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P2SHEIBOVWRQUU7HRF33SDEGYT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P2SHEIBOVWRQUU7HRF33SDEGYT/action/storage_attestation","attest_author":"https://pith.science/pith/P2SHEIBOVWRQUU7HRF33SDEGYT/action/author_attestation","sign_citation":"https://pith.science/pith/P2SHEIBOVWRQUU7HRF33SDEGYT/action/citation_signature","submit_replication":"https://pith.science/pith/P2SHEIBOVWRQUU7HRF33SDEGYT/action/replication_record"}},"created_at":"2026-07-05T11:37:39.539581+00:00","updated_at":"2026-07-05T11:37:39.539581+00:00"}