{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:GL4ZXJ7P2UMDZ6OMMFZLTHUS4F","short_pith_number":"pith:GL4ZXJ7P","canonical_record":{"source":{"id":"0705.1904","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2007-05-14T10:43:22Z","cross_cats_sorted":[],"title_canon_sha256":"f510c1973830449205fd29f1e034620519646a904eae5cadae78a71fd329adb4","abstract_canon_sha256":"da3526df36b1901e11cec3fe34067d42e827899f667de035df2cc9090be5e00d"},"schema_version":"1.0"},"canonical_sha256":"32f99ba7efd5183cf9cc6172b99e92e17c9739cb72c1d1dff93f5fc7ab7e6252","source":{"kind":"arxiv","id":"0705.1904","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0705.1904","created_at":"2026-07-04T15:04:09Z"},{"alias_kind":"arxiv_version","alias_value":"0705.1904v1","created_at":"2026-07-04T15:04:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0705.1904","created_at":"2026-07-04T15:04:09Z"},{"alias_kind":"pith_short_12","alias_value":"GL4ZXJ7P2UMD","created_at":"2026-07-04T15:04:09Z"},{"alias_kind":"pith_short_16","alias_value":"GL4ZXJ7P2UMDZ6OM","created_at":"2026-07-04T15:04:09Z"},{"alias_kind":"pith_short_8","alias_value":"GL4ZXJ7P","created_at":"2026-07-04T15:04:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:GL4ZXJ7P2UMDZ6OMMFZLTHUS4F","target":"record","payload":{"canonical_record":{"source":{"id":"0705.1904","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2007-05-14T10:43:22Z","cross_cats_sorted":[],"title_canon_sha256":"f510c1973830449205fd29f1e034620519646a904eae5cadae78a71fd329adb4","abstract_canon_sha256":"da3526df36b1901e11cec3fe34067d42e827899f667de035df2cc9090be5e00d"},"schema_version":"1.0"},"canonical_sha256":"32f99ba7efd5183cf9cc6172b99e92e17c9739cb72c1d1dff93f5fc7ab7e6252","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:04:09.180114Z","signature_b64":"X2puuDrf1fWsUtJ/2MIH9WdIk2m0yytuQY9NLAnn6SV1hPk/JWkHY/WlNh8KX/l5tKVnrV6ypTsue5v82iH0Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32f99ba7efd5183cf9cc6172b99e92e17c9739cb72c1d1dff93f5fc7ab7e6252","last_reissued_at":"2026-07-04T15:04:09.179802Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:04:09.179802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0705.1904","source_version":1,"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-07-04T15:04:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vdVXFmudhawzhz0YJ/afkPKd1ht49VICY9RQbIqXT0btTvAU842BQJtj4jY6OhN39uvN4XqchhFQBMxnxJwJDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:59:13.455699Z"},"content_sha256":"e133aeb4f402f0a85a34a1fcc0ee3831880ec42d59b86e8b68366c041f8880e2","schema_version":"1.0","event_id":"sha256:e133aeb4f402f0a85a34a1fcc0ee3831880ec42d59b86e8b68366c041f8880e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:GL4ZXJ7P2UMDZ6OMMFZLTHUS4F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Loss Tolerant Linear Optical Quantum Memory By Measurement Based Quantum Computing","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Browne, Michael Varnava, Terry Rudolph","submitted_at":"2007-05-14T10:43:22Z","abstract_excerpt":"We give a scheme for loss tolerantly building a linear optical quantum memory which itself is tolerant to qubit loss. We use the encoding recently introduced in [Phys. Rev. Lett. 97, 120501, (2006)] and give a method for efficiently achieving this. The entire approach resides within the \"One-way\" model for quantum computing. Our results suggest that it is possible to build a loss tolerant quantum memory, such that if the requirement is to keep the data stored over arbitrarily long times then this is possible with only polynomially increasing resources and logarithmically increasing individual "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0705.1904","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0705.1904/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T15:04:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fdpaFKaj9gbdZ+BnJDus7NAWVt7lT/PZwalEXCNHlLSkdASmNpGsANFCvAVpIoFsL5ej5KIKtlGByEF3V0PXBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:59:13.456343Z"},"content_sha256":"6a295b827db43818fb5f7bffaca2b897520c345047e15039b968c5ead59ab471","schema_version":"1.0","event_id":"sha256:6a295b827db43818fb5f7bffaca2b897520c345047e15039b968c5ead59ab471"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GL4ZXJ7P2UMDZ6OMMFZLTHUS4F/bundle.json","state_url":"https://pith.science/pith/GL4ZXJ7P2UMDZ6OMMFZLTHUS4F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GL4ZXJ7P2UMDZ6OMMFZLTHUS4F/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-07-07T04:59:13Z","links":{"resolver":"https://pith.science/pith/GL4ZXJ7P2UMDZ6OMMFZLTHUS4F","bundle":"https://pith.science/pith/GL4ZXJ7P2UMDZ6OMMFZLTHUS4F/bundle.json","state":"https://pith.science/pith/GL4ZXJ7P2UMDZ6OMMFZLTHUS4F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GL4ZXJ7P2UMDZ6OMMFZLTHUS4F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:GL4ZXJ7P2UMDZ6OMMFZLTHUS4F","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":"da3526df36b1901e11cec3fe34067d42e827899f667de035df2cc9090be5e00d","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2007-05-14T10:43:22Z","title_canon_sha256":"f510c1973830449205fd29f1e034620519646a904eae5cadae78a71fd329adb4"},"schema_version":"1.0","source":{"id":"0705.1904","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0705.1904","created_at":"2026-07-04T15:04:09Z"},{"alias_kind":"arxiv_version","alias_value":"0705.1904v1","created_at":"2026-07-04T15:04:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0705.1904","created_at":"2026-07-04T15:04:09Z"},{"alias_kind":"pith_short_12","alias_value":"GL4ZXJ7P2UMD","created_at":"2026-07-04T15:04:09Z"},{"alias_kind":"pith_short_16","alias_value":"GL4ZXJ7P2UMDZ6OM","created_at":"2026-07-04T15:04:09Z"},{"alias_kind":"pith_short_8","alias_value":"GL4ZXJ7P","created_at":"2026-07-04T15:04:09Z"}],"graph_snapshots":[{"event_id":"sha256:6a295b827db43818fb5f7bffaca2b897520c345047e15039b968c5ead59ab471","target":"graph","created_at":"2026-07-04T15:04:09Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/0705.1904/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We give a scheme for loss tolerantly building a linear optical quantum memory which itself is tolerant to qubit loss. We use the encoding recently introduced in [Phys. Rev. Lett. 97, 120501, (2006)] and give a method for efficiently achieving this. The entire approach resides within the \"One-way\" model for quantum computing. Our results suggest that it is possible to build a loss tolerant quantum memory, such that if the requirement is to keep the data stored over arbitrarily long times then this is possible with only polynomially increasing resources and logarithmically increasing individual ","authors_text":"Daniel Browne, Michael Varnava, Terry Rudolph","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2007-05-14T10:43:22Z","title":"Loss Tolerant Linear Optical Quantum Memory By Measurement Based Quantum Computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0705.1904","kind":"arxiv","version":1},"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:e133aeb4f402f0a85a34a1fcc0ee3831880ec42d59b86e8b68366c041f8880e2","target":"record","created_at":"2026-07-04T15:04:09Z","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":"da3526df36b1901e11cec3fe34067d42e827899f667de035df2cc9090be5e00d","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2007-05-14T10:43:22Z","title_canon_sha256":"f510c1973830449205fd29f1e034620519646a904eae5cadae78a71fd329adb4"},"schema_version":"1.0","source":{"id":"0705.1904","kind":"arxiv","version":1}},"canonical_sha256":"32f99ba7efd5183cf9cc6172b99e92e17c9739cb72c1d1dff93f5fc7ab7e6252","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"32f99ba7efd5183cf9cc6172b99e92e17c9739cb72c1d1dff93f5fc7ab7e6252","first_computed_at":"2026-07-04T15:04:09.179802Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:04:09.179802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X2puuDrf1fWsUtJ/2MIH9WdIk2m0yytuQY9NLAnn6SV1hPk/JWkHY/WlNh8KX/l5tKVnrV6ypTsue5v82iH0Cg==","signature_status":"signed_v1","signed_at":"2026-07-04T15:04:09.180114Z","signed_message":"canonical_sha256_bytes"},"source_id":"0705.1904","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e133aeb4f402f0a85a34a1fcc0ee3831880ec42d59b86e8b68366c041f8880e2","sha256:6a295b827db43818fb5f7bffaca2b897520c345047e15039b968c5ead59ab471"],"state_sha256":"eef38c9259e77a1e14926e31749d36cc11a6306bb169c4f86d751f6ce630d3ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zvZhbJ7bUqM6HphOub8ZipbZLSQDeoLEy3AoxGoQP2hQa8ZCBzVbtzyMqVz4q6xUVmlTpel3wvKRUjN0b6NjDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T04:59:13.459481Z","bundle_sha256":"7465647d28b401e39f6cdb3a20a1d8076fa2054a4e1e5be4bd225deb03d3fb74"}}