{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:LJGNBCH53SFL4DNKOYK4JDZ5MA","short_pith_number":"pith:LJGNBCH5","schema_version":"1.0","canonical_sha256":"5a4cd088fddc8abe0daa7615c48f3d6019ff006c7a499245c7a2f405b8890bb0","source":{"kind":"arxiv","id":"0902.0500","version":1},"attestation_state":"computed","paper":{"title":"Graphs States and the necessity of Euler Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ross Duncan, Simon Perdrix","submitted_at":"2009-02-03T12:58:47Z","abstract_excerpt":"Coecke and Duncan recently introduced a categorical formalisation of the interaction of complementary quantum observables. In this paper we use their diagrammatic language to study graph states, a computationally interesting class of quantum states. We give a graphical proof of the fixpoint property of graph states. We then introduce a new equation, for the Euler decomposition of the Hadamard gate, and demonstrate that Van den Nest's theorem--locally equivalent graphs represent the same entanglement--is equivalent to this new axiom. Finally we prove that the Euler decomposition equation is not"},"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":"0902.0500","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-02-03T12:58:47Z","cross_cats_sorted":[],"title_canon_sha256":"366d22a2809fbaa3ffe9ee2085c0f75a42bab689cca5bfc5dfc32dba93e4c209","abstract_canon_sha256":"2a85f3ab9927ef2394cc90e3fb15ff198af03bcebc1df7e209a89d2b4506b51c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:36.027212Z","signature_b64":"bJUl8JpnsVkoEbxUlHvAWGbbvHqBLHm5r+WWqFiGOXToxkU07bzVddu236vi+/dAFh3mZ1jR4qcEduw/O1GrCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a4cd088fddc8abe0daa7615c48f3d6019ff006c7a499245c7a2f405b8890bb0","last_reissued_at":"2026-05-18T03:20:36.026408Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:36.026408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graphs States and the necessity of Euler Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ross Duncan, Simon Perdrix","submitted_at":"2009-02-03T12:58:47Z","abstract_excerpt":"Coecke and Duncan recently introduced a categorical formalisation of the interaction of complementary quantum observables. In this paper we use their diagrammatic language to study graph states, a computationally interesting class of quantum states. We give a graphical proof of the fixpoint property of graph states. We then introduce a new equation, for the Euler decomposition of the Hadamard gate, and demonstrate that Van den Nest's theorem--locally equivalent graphs represent the same entanglement--is equivalent to this new axiom. Finally we prove that the Euler decomposition equation is not"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0902.0500","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":"0902.0500","created_at":"2026-05-18T03:20:36.026541+00:00"},{"alias_kind":"arxiv_version","alias_value":"0902.0500v1","created_at":"2026-05-18T03:20:36.026541+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0902.0500","created_at":"2026-05-18T03:20:36.026541+00:00"},{"alias_kind":"pith_short_12","alias_value":"LJGNBCH53SFL","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"LJGNBCH53SFL4DNK","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"LJGNBCH5","created_at":"2026-05-18T12:26:00.592388+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2309.13014","citing_title":"Completeness of qufinite ZXW calculus, a graphical language for finite-dimensional quantum theory","ref_index":34,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LJGNBCH53SFL4DNKOYK4JDZ5MA","json":"https://pith.science/pith/LJGNBCH53SFL4DNKOYK4JDZ5MA.json","graph_json":"https://pith.science/api/pith-number/LJGNBCH53SFL4DNKOYK4JDZ5MA/graph.json","events_json":"https://pith.science/api/pith-number/LJGNBCH53SFL4DNKOYK4JDZ5MA/events.json","paper":"https://pith.science/paper/LJGNBCH5"},"agent_actions":{"view_html":"https://pith.science/pith/LJGNBCH53SFL4DNKOYK4JDZ5MA","download_json":"https://pith.science/pith/LJGNBCH53SFL4DNKOYK4JDZ5MA.json","view_paper":"https://pith.science/paper/LJGNBCH5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0902.0500&json=true","fetch_graph":"https://pith.science/api/pith-number/LJGNBCH53SFL4DNKOYK4JDZ5MA/graph.json","fetch_events":"https://pith.science/api/pith-number/LJGNBCH53SFL4DNKOYK4JDZ5MA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LJGNBCH53SFL4DNKOYK4JDZ5MA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LJGNBCH53SFL4DNKOYK4JDZ5MA/action/storage_attestation","attest_author":"https://pith.science/pith/LJGNBCH53SFL4DNKOYK4JDZ5MA/action/author_attestation","sign_citation":"https://pith.science/pith/LJGNBCH53SFL4DNKOYK4JDZ5MA/action/citation_signature","submit_replication":"https://pith.science/pith/LJGNBCH53SFL4DNKOYK4JDZ5MA/action/replication_record"}},"created_at":"2026-05-18T03:20:36.026541+00:00","updated_at":"2026-05-18T03:20:36.026541+00:00"}