{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:IRMW6EZWD7NFOYQUL3CODQDYBH","short_pith_number":"pith:IRMW6EZW","schema_version":"1.0","canonical_sha256":"44596f13361fda5762145ec4e1c07809f8d9c67b87e03802905c10bc3a24a729","source":{"kind":"arxiv","id":"1003.2762","version":2},"attestation_state":"computed","paper":{"title":"Entangled graphs: A classification of four-qubit entanglement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Masoud Gharahi Ghahi, Seyed Javad Akhtarshenas","submitted_at":"2010-03-14T06:19:34Z","abstract_excerpt":"We use the concept of \\textit{entangled graphs} with weighted edges to present a classification for four-qubit entanglement which is based neither on the LOCC nor the SLOCC. Entangled graphs, first introduced by Plesch et al. [Phys. Rev. A 67, (2003) 012322], are structures such that each qubit of a multi-qubit system is represented as a vertex and an edge between two vertices denotes bipartite entanglement between the corresponding qubits. Our classification is based on the use of generalized Schmidt decomposition of pure states of multi-qubit systems. We show that for every possible entangle"},"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":"1003.2762","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-03-14T06:19:34Z","cross_cats_sorted":[],"title_canon_sha256":"6e6ce15db95f01fa9c4f4ce6b8871626daa992e94e5a58ac63accc198bfd810a","abstract_canon_sha256":"e5d53df6c1fa80cf2d6d6531e48aaaa907fb81b0759d01f0d2a04be04a40ed52"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:28.059432Z","signature_b64":"MoJG8tTwxQ18mS/KiSRUwvsDGNcKCRmIgy3Ln9n4i6mwKBR2Y/ZGmh60PRJJ/TsEAr5cCKrnqPnTzNPHgDj9Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44596f13361fda5762145ec4e1c07809f8d9c67b87e03802905c10bc3a24a729","last_reissued_at":"2026-05-18T01:16:28.058871Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:28.058871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Entangled graphs: A classification of four-qubit entanglement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Masoud Gharahi Ghahi, Seyed Javad Akhtarshenas","submitted_at":"2010-03-14T06:19:34Z","abstract_excerpt":"We use the concept of \\textit{entangled graphs} with weighted edges to present a classification for four-qubit entanglement which is based neither on the LOCC nor the SLOCC. Entangled graphs, first introduced by Plesch et al. [Phys. Rev. A 67, (2003) 012322], are structures such that each qubit of a multi-qubit system is represented as a vertex and an edge between two vertices denotes bipartite entanglement between the corresponding qubits. Our classification is based on the use of generalized Schmidt decomposition of pure states of multi-qubit systems. We show that for every possible entangle"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.2762","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":""},"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":"1003.2762","created_at":"2026-05-18T01:16:28.058956+00:00"},{"alias_kind":"arxiv_version","alias_value":"1003.2762v2","created_at":"2026-05-18T01:16:28.058956+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.2762","created_at":"2026-05-18T01:16:28.058956+00:00"},{"alias_kind":"pith_short_12","alias_value":"IRMW6EZWD7NF","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"IRMW6EZWD7NFOYQU","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"IRMW6EZW","created_at":"2026-05-18T12:26:09.077623+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/IRMW6EZWD7NFOYQUL3CODQDYBH","json":"https://pith.science/pith/IRMW6EZWD7NFOYQUL3CODQDYBH.json","graph_json":"https://pith.science/api/pith-number/IRMW6EZWD7NFOYQUL3CODQDYBH/graph.json","events_json":"https://pith.science/api/pith-number/IRMW6EZWD7NFOYQUL3CODQDYBH/events.json","paper":"https://pith.science/paper/IRMW6EZW"},"agent_actions":{"view_html":"https://pith.science/pith/IRMW6EZWD7NFOYQUL3CODQDYBH","download_json":"https://pith.science/pith/IRMW6EZWD7NFOYQUL3CODQDYBH.json","view_paper":"https://pith.science/paper/IRMW6EZW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1003.2762&json=true","fetch_graph":"https://pith.science/api/pith-number/IRMW6EZWD7NFOYQUL3CODQDYBH/graph.json","fetch_events":"https://pith.science/api/pith-number/IRMW6EZWD7NFOYQUL3CODQDYBH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IRMW6EZWD7NFOYQUL3CODQDYBH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IRMW6EZWD7NFOYQUL3CODQDYBH/action/storage_attestation","attest_author":"https://pith.science/pith/IRMW6EZWD7NFOYQUL3CODQDYBH/action/author_attestation","sign_citation":"https://pith.science/pith/IRMW6EZWD7NFOYQUL3CODQDYBH/action/citation_signature","submit_replication":"https://pith.science/pith/IRMW6EZWD7NFOYQUL3CODQDYBH/action/replication_record"}},"created_at":"2026-05-18T01:16:28.058956+00:00","updated_at":"2026-05-18T01:16:28.058956+00:00"}