{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DK3BIRG4UPNSXHR2GQATDXBSQH","short_pith_number":"pith:DK3BIRG4","schema_version":"1.0","canonical_sha256":"1ab61444dca3db2b9e3a340131dc3281eadbb647b8672395170a8fb44f6322a3","source":{"kind":"arxiv","id":"1507.06082","version":2},"attestation_state":"computed","paper":{"title":"Determining X-chains in graph states","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dagmar Bru{\\ss}, Hermann Kampermann, Jun-Yi Wu","submitted_at":"2015-07-22T07:29:59Z","abstract_excerpt":"The representation of graph states in the X-basis as well as the calculation of graph state overlaps can efficiently be performed by using the concept of X-Chains [Phys. Rev. A 92(1) 012322]. We present a necessary and sufficient criterion for X-chains and show that they can efficiently be determined by Bareiss algorithm. An analytical approach for searching X-chain groups of a graph state is proposed. Furthermore we generalize the concept of X-chains to so-called Euler chains, whose induced subgraphs are Eulerian. This approach helps to determine if a given vertex set is an X-chain and we sho"},"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":"1507.06082","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-07-22T07:29:59Z","cross_cats_sorted":[],"title_canon_sha256":"f07bb48e49367fec584db68cc6e6c666aa22bc2fa8a3ecf88c7400ed9c22b4a5","abstract_canon_sha256":"4de45acc2e1370152fe84e7ce2e8fbd903bd3915687aaf3a4417c781a331b6b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:03.664348Z","signature_b64":"B3n1KOfXYUYGqO7h31viqhtuWJi7g9wYAJfUB0f2nOGxBZ06AhjOYWx86bKm5ZXp1CXbh76Zc/kK0G7qN92oAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ab61444dca3db2b9e3a340131dc3281eadbb647b8672395170a8fb44f6322a3","last_reissued_at":"2026-05-18T01:23:03.663632Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:03.663632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Determining X-chains in graph states","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dagmar Bru{\\ss}, Hermann Kampermann, Jun-Yi Wu","submitted_at":"2015-07-22T07:29:59Z","abstract_excerpt":"The representation of graph states in the X-basis as well as the calculation of graph state overlaps can efficiently be performed by using the concept of X-Chains [Phys. Rev. A 92(1) 012322]. We present a necessary and sufficient criterion for X-chains and show that they can efficiently be determined by Bareiss algorithm. An analytical approach for searching X-chain groups of a graph state is proposed. Furthermore we generalize the concept of X-chains to so-called Euler chains, whose induced subgraphs are Eulerian. This approach helps to determine if a given vertex set is an X-chain and we sho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06082","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":"1507.06082","created_at":"2026-05-18T01:23:03.663750+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.06082v2","created_at":"2026-05-18T01:23:03.663750+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06082","created_at":"2026-05-18T01:23:03.663750+00:00"},{"alias_kind":"pith_short_12","alias_value":"DK3BIRG4UPNS","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DK3BIRG4UPNSXHR2","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DK3BIRG4","created_at":"2026-05-18T12:29:17.054201+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/DK3BIRG4UPNSXHR2GQATDXBSQH","json":"https://pith.science/pith/DK3BIRG4UPNSXHR2GQATDXBSQH.json","graph_json":"https://pith.science/api/pith-number/DK3BIRG4UPNSXHR2GQATDXBSQH/graph.json","events_json":"https://pith.science/api/pith-number/DK3BIRG4UPNSXHR2GQATDXBSQH/events.json","paper":"https://pith.science/paper/DK3BIRG4"},"agent_actions":{"view_html":"https://pith.science/pith/DK3BIRG4UPNSXHR2GQATDXBSQH","download_json":"https://pith.science/pith/DK3BIRG4UPNSXHR2GQATDXBSQH.json","view_paper":"https://pith.science/paper/DK3BIRG4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.06082&json=true","fetch_graph":"https://pith.science/api/pith-number/DK3BIRG4UPNSXHR2GQATDXBSQH/graph.json","fetch_events":"https://pith.science/api/pith-number/DK3BIRG4UPNSXHR2GQATDXBSQH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DK3BIRG4UPNSXHR2GQATDXBSQH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DK3BIRG4UPNSXHR2GQATDXBSQH/action/storage_attestation","attest_author":"https://pith.science/pith/DK3BIRG4UPNSXHR2GQATDXBSQH/action/author_attestation","sign_citation":"https://pith.science/pith/DK3BIRG4UPNSXHR2GQATDXBSQH/action/citation_signature","submit_replication":"https://pith.science/pith/DK3BIRG4UPNSXHR2GQATDXBSQH/action/replication_record"}},"created_at":"2026-05-18T01:23:03.663750+00:00","updated_at":"2026-05-18T01:23:03.663750+00:00"}