{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:NOQEFQJQV62QG6VMOIXDEASBH4","short_pith_number":"pith:NOQEFQJQ","canonical_record":{"source":{"id":"quant-ph/0504111","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2005-04-14T23:23:10Z","cross_cats_sorted":["cond-mat.other"],"title_canon_sha256":"d175a717351edd8c1459018933ccadcdfa5020506c645667b9d36385d80fc1e6","abstract_canon_sha256":"96b5726cdc47efe0a8692922f219dba5268616c8031cbfe2302ea5de30ec0b9d"},"schema_version":"1.0"},"canonical_sha256":"6ba042c130afb5037aac722e3202413f03d66b301cad7776e5a819412cb46adf","source":{"kind":"arxiv","id":"quant-ph/0504111","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0504111","created_at":"2026-05-18T01:37:57Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0504111v2","created_at":"2026-05-18T01:37:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0504111","created_at":"2026-05-18T01:37:57Z"},{"alias_kind":"pith_short_12","alias_value":"NOQEFQJQV62Q","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"NOQEFQJQV62QG6VM","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"NOQEFQJQ","created_at":"2026-05-18T12:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:NOQEFQJQV62QG6VMOIXDEASBH4","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0504111","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2005-04-14T23:23:10Z","cross_cats_sorted":["cond-mat.other"],"title_canon_sha256":"d175a717351edd8c1459018933ccadcdfa5020506c645667b9d36385d80fc1e6","abstract_canon_sha256":"96b5726cdc47efe0a8692922f219dba5268616c8031cbfe2302ea5de30ec0b9d"},"schema_version":"1.0"},"canonical_sha256":"6ba042c130afb5037aac722e3202413f03d66b301cad7776e5a819412cb46adf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:57.866874Z","signature_b64":"zBd4HADr/7+dj3pAx+TR72tpY1zi8yIUlX50J1IF6jo9oK4FJfqIj0ZH5AOpqTIEDaNfVzi8RdCeVnk3OI/CAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ba042c130afb5037aac722e3202413f03d66b301cad7776e5a819412cb46adf","last_reissued_at":"2026-05-18T01:37:57.866289Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:57.866289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0504111","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:37:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"987/jj8eUe3ZZduGEoGjswe2/n7smziWCLAvfkIBy0aYkv54qrFw6mimtZYWexcjxKeETNvHUBsU9q2LMeHuBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:43:55.098870Z"},"content_sha256":"824ba43ab8e47632f30201ff87c06d7bc6b6bf88b54bf1103559f4a07ba19ec3","schema_version":"1.0","event_id":"sha256:824ba43ab8e47632f30201ff87c06d7bc6b6bf88b54bf1103559f4a07ba19ec3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:NOQEFQJQV62QG6VMOIXDEASBH4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Graph State Construction Under the Barrett and Kok Scheme","license":"","headline":"","cross_cats":["cond-mat.other"],"primary_cat":"quant-ph","authors_text":"Simon C. Benjamin","submitted_at":"2005-04-14T23:23:10Z","abstract_excerpt":"Recently Barrett and Kok (BK) proposed an elegant method for entangling separated matter qubits. They outlined a strategy for using their entangling operation (EO) to build graph states, the resource for one-way quantum computing. However by viewing their EO as a graph fusion event, one perceives that each successful event introduces an ideal redundant graph edge, which growth strategies should exploit. For example, if each EO succeeds with probability p=0.4 then a highly connected graph can be formed with an overhead of only about ten EO attempts per graph edge. The BK scheme then becomes com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0504111","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:37:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BirE8fCnBGcHVRbRxOvPy44k+ACpd6Uddv0JKk4hWaxHey1LBp7Xi8hSmtqKNq+xuKjs75JCrh0y9A5S2jQlBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:43:55.099247Z"},"content_sha256":"e20738f789dffed31bf0ab8ac46668e91495f180a3543ee1ca9f6756e08a5210","schema_version":"1.0","event_id":"sha256:e20738f789dffed31bf0ab8ac46668e91495f180a3543ee1ca9f6756e08a5210"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NOQEFQJQV62QG6VMOIXDEASBH4/bundle.json","state_url":"https://pith.science/pith/NOQEFQJQV62QG6VMOIXDEASBH4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NOQEFQJQV62QG6VMOIXDEASBH4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T14:43:55Z","links":{"resolver":"https://pith.science/pith/NOQEFQJQV62QG6VMOIXDEASBH4","bundle":"https://pith.science/pith/NOQEFQJQV62QG6VMOIXDEASBH4/bundle.json","state":"https://pith.science/pith/NOQEFQJQV62QG6VMOIXDEASBH4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NOQEFQJQV62QG6VMOIXDEASBH4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:NOQEFQJQV62QG6VMOIXDEASBH4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"96b5726cdc47efe0a8692922f219dba5268616c8031cbfe2302ea5de30ec0b9d","cross_cats_sorted":["cond-mat.other"],"license":"","primary_cat":"quant-ph","submitted_at":"2005-04-14T23:23:10Z","title_canon_sha256":"d175a717351edd8c1459018933ccadcdfa5020506c645667b9d36385d80fc1e6"},"schema_version":"1.0","source":{"id":"quant-ph/0504111","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0504111","created_at":"2026-05-18T01:37:57Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0504111v2","created_at":"2026-05-18T01:37:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0504111","created_at":"2026-05-18T01:37:57Z"},{"alias_kind":"pith_short_12","alias_value":"NOQEFQJQV62Q","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"NOQEFQJQV62QG6VM","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"NOQEFQJQ","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:e20738f789dffed31bf0ab8ac46668e91495f180a3543ee1ca9f6756e08a5210","target":"graph","created_at":"2026-05-18T01:37:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Recently Barrett and Kok (BK) proposed an elegant method for entangling separated matter qubits. They outlined a strategy for using their entangling operation (EO) to build graph states, the resource for one-way quantum computing. However by viewing their EO as a graph fusion event, one perceives that each successful event introduces an ideal redundant graph edge, which growth strategies should exploit. For example, if each EO succeeds with probability p=0.4 then a highly connected graph can be formed with an overhead of only about ten EO attempts per graph edge. The BK scheme then becomes com","authors_text":"Simon C. Benjamin","cross_cats":["cond-mat.other"],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2005-04-14T23:23:10Z","title":"Efficient Graph State Construction Under the Barrett and Kok Scheme"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0504111","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:824ba43ab8e47632f30201ff87c06d7bc6b6bf88b54bf1103559f4a07ba19ec3","target":"record","created_at":"2026-05-18T01:37:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"96b5726cdc47efe0a8692922f219dba5268616c8031cbfe2302ea5de30ec0b9d","cross_cats_sorted":["cond-mat.other"],"license":"","primary_cat":"quant-ph","submitted_at":"2005-04-14T23:23:10Z","title_canon_sha256":"d175a717351edd8c1459018933ccadcdfa5020506c645667b9d36385d80fc1e6"},"schema_version":"1.0","source":{"id":"quant-ph/0504111","kind":"arxiv","version":2}},"canonical_sha256":"6ba042c130afb5037aac722e3202413f03d66b301cad7776e5a819412cb46adf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ba042c130afb5037aac722e3202413f03d66b301cad7776e5a819412cb46adf","first_computed_at":"2026-05-18T01:37:57.866289Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:57.866289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zBd4HADr/7+dj3pAx+TR72tpY1zi8yIUlX50J1IF6jo9oK4FJfqIj0ZH5AOpqTIEDaNfVzi8RdCeVnk3OI/CAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:57.866874Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0504111","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:824ba43ab8e47632f30201ff87c06d7bc6b6bf88b54bf1103559f4a07ba19ec3","sha256:e20738f789dffed31bf0ab8ac46668e91495f180a3543ee1ca9f6756e08a5210"],"state_sha256":"d11ad623f02908d17648a50ad669a4fac0480f3be4bed73b73799dcc8e2f868e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wo0BwNGqvmYCSEjalAvevBK6na36Yt+ib4Oz4KDu6Mc+Baz2RJ5UPKVepYtLGepC7wYtPfpmT52WguWRKngmBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:43:55.101347Z","bundle_sha256":"1ffe192841ce8d8c6f21872ba566f71e3192167c8b5ba82a5e648d9dca72a7ba"}}