{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:65BEP27QLUMIWWG7UIMOXBAEPV","short_pith_number":"pith:65BEP27Q","canonical_record":{"source":{"id":"quant-ph/0601190","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2006-01-30T19:22:23Z","cross_cats_sorted":["cond-mat.other"],"title_canon_sha256":"35242ee8c0a4be6a7951ef1ac49e50e0cf1b919f5d975c6a480fcc7f7cfad596","abstract_canon_sha256":"1cc906c2c962d48ed4d5acd1241e06ca203b93eae6c200d682663338da3bd90c"},"schema_version":"1.0"},"canonical_sha256":"f74247ebf05d188b58dfa218eb84047d4d884878819d4b65fa64f0ac1f768d59","source":{"kind":"arxiv","id":"quant-ph/0601190","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0601190","created_at":"2026-05-18T01:37:57Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0601190v2","created_at":"2026-05-18T01:37:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0601190","created_at":"2026-05-18T01:37:57Z"},{"alias_kind":"pith_short_12","alias_value":"65BEP27QLUMI","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"65BEP27QLUMIWWG7","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"65BEP27Q","created_at":"2026-05-18T12:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:65BEP27QLUMIWWG7UIMOXBAEPV","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0601190","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2006-01-30T19:22:23Z","cross_cats_sorted":["cond-mat.other"],"title_canon_sha256":"35242ee8c0a4be6a7951ef1ac49e50e0cf1b919f5d975c6a480fcc7f7cfad596","abstract_canon_sha256":"1cc906c2c962d48ed4d5acd1241e06ca203b93eae6c200d682663338da3bd90c"},"schema_version":"1.0"},"canonical_sha256":"f74247ebf05d188b58dfa218eb84047d4d884878819d4b65fa64f0ac1f768d59","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:57.173147Z","signature_b64":"Ha3Yelaz9PHveUPNxFKmm5j2hEdjAJH32FImPlwLZPF5WhPpihJEx+Iyw4eSqYf8KfXeOkacDbUtXHn8XCABAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f74247ebf05d188b58dfa218eb84047d4d884878819d4b65fa64f0ac1f768d59","last_reissued_at":"2026-05-18T01:37:57.172479Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:57.172479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0601190","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":"9CUiFpu4mtnypMCSERdB3yMTDjqxxX9BwuWTHe3upA9jmHUsLvE3PUjuHBfpVk9cMoS5okTJGfxXnpWA358hAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:13:43.215360Z"},"content_sha256":"06d59f763df8e0f23dbb547f09fbdaf38adea956d3e13afd955302fdb574c4d1","schema_version":"1.0","event_id":"sha256:06d59f763df8e0f23dbb547f09fbdaf38adea956d3e13afd955302fdb574c4d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:65BEP27QLUMIWWG7UIMOXBAEPV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimal resources for linear optical one-way computing","license":"","headline":"","cross_cats":["cond-mat.other"],"primary_cat":"quant-ph","authors_text":"D. Gross, J. Eisert, K. Kieling","submitted_at":"2006-01-30T19:22:23Z","abstract_excerpt":"We address the question of how many maximally entangled photon pairs are needed in order to build up cluster states for quantum computing using the toolbox of linear optics. As the needed gates in dual-rail encoding are necessarily probabilistic with known optimal success probability, this question amounts to finding the optimal strategy for building up cluster states, from the perspective of classical control. We develop a notion of classical strategies, and present rigorous statements on the ultimate maximal and minimal use of resources of the globally optimal strategy. We find that this str"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0601190","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":"aHtNWm4A8G16D+4zvCjB/7pCR+VymluYUGAj8WUiqSgqlZLNtMTigvmwCp+ylGj+DfhYmAIBsxaEOcM4RqLeAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:13:43.215727Z"},"content_sha256":"53fe05f5fe7c64bb469d21eb60b915e9731b1d08d7fc329d0e26ec2d77a99f18","schema_version":"1.0","event_id":"sha256:53fe05f5fe7c64bb469d21eb60b915e9731b1d08d7fc329d0e26ec2d77a99f18"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/65BEP27QLUMIWWG7UIMOXBAEPV/bundle.json","state_url":"https://pith.science/pith/65BEP27QLUMIWWG7UIMOXBAEPV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/65BEP27QLUMIWWG7UIMOXBAEPV/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-07T09:13:43Z","links":{"resolver":"https://pith.science/pith/65BEP27QLUMIWWG7UIMOXBAEPV","bundle":"https://pith.science/pith/65BEP27QLUMIWWG7UIMOXBAEPV/bundle.json","state":"https://pith.science/pith/65BEP27QLUMIWWG7UIMOXBAEPV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/65BEP27QLUMIWWG7UIMOXBAEPV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:65BEP27QLUMIWWG7UIMOXBAEPV","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":"1cc906c2c962d48ed4d5acd1241e06ca203b93eae6c200d682663338da3bd90c","cross_cats_sorted":["cond-mat.other"],"license":"","primary_cat":"quant-ph","submitted_at":"2006-01-30T19:22:23Z","title_canon_sha256":"35242ee8c0a4be6a7951ef1ac49e50e0cf1b919f5d975c6a480fcc7f7cfad596"},"schema_version":"1.0","source":{"id":"quant-ph/0601190","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0601190","created_at":"2026-05-18T01:37:57Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0601190v2","created_at":"2026-05-18T01:37:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0601190","created_at":"2026-05-18T01:37:57Z"},{"alias_kind":"pith_short_12","alias_value":"65BEP27QLUMI","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"65BEP27QLUMIWWG7","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"65BEP27Q","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:53fe05f5fe7c64bb469d21eb60b915e9731b1d08d7fc329d0e26ec2d77a99f18","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":"We address the question of how many maximally entangled photon pairs are needed in order to build up cluster states for quantum computing using the toolbox of linear optics. As the needed gates in dual-rail encoding are necessarily probabilistic with known optimal success probability, this question amounts to finding the optimal strategy for building up cluster states, from the perspective of classical control. We develop a notion of classical strategies, and present rigorous statements on the ultimate maximal and minimal use of resources of the globally optimal strategy. We find that this str","authors_text":"D. Gross, J. Eisert, K. Kieling","cross_cats":["cond-mat.other"],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2006-01-30T19:22:23Z","title":"Minimal resources for linear optical one-way computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0601190","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:06d59f763df8e0f23dbb547f09fbdaf38adea956d3e13afd955302fdb574c4d1","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":"1cc906c2c962d48ed4d5acd1241e06ca203b93eae6c200d682663338da3bd90c","cross_cats_sorted":["cond-mat.other"],"license":"","primary_cat":"quant-ph","submitted_at":"2006-01-30T19:22:23Z","title_canon_sha256":"35242ee8c0a4be6a7951ef1ac49e50e0cf1b919f5d975c6a480fcc7f7cfad596"},"schema_version":"1.0","source":{"id":"quant-ph/0601190","kind":"arxiv","version":2}},"canonical_sha256":"f74247ebf05d188b58dfa218eb84047d4d884878819d4b65fa64f0ac1f768d59","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f74247ebf05d188b58dfa218eb84047d4d884878819d4b65fa64f0ac1f768d59","first_computed_at":"2026-05-18T01:37:57.172479Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:57.172479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ha3Yelaz9PHveUPNxFKmm5j2hEdjAJH32FImPlwLZPF5WhPpihJEx+Iyw4eSqYf8KfXeOkacDbUtXHn8XCABAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:57.173147Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0601190","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06d59f763df8e0f23dbb547f09fbdaf38adea956d3e13afd955302fdb574c4d1","sha256:53fe05f5fe7c64bb469d21eb60b915e9731b1d08d7fc329d0e26ec2d77a99f18"],"state_sha256":"d90a8b4c082e1c4eeefe5a78daf06d56d988f412d88ca9dd6642c46c1d7b7ee0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xwd1kEG6Wxj0raddeBsMaypzKG/wIumyPeX5QeVB1lNxV25n3H7ZgMotLCVd9a4u5zhS6wnUpJf7tuPH+FrsBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T09:13:43.217798Z","bundle_sha256":"29b62e5cdd496d2765d41a2b2dcd7989499c509517ce03fb4a54feb2151016b2"}}