{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:QFBMC6S72HL7XOYQOTCOJGHP3I","short_pith_number":"pith:QFBMC6S7","canonical_record":{"source":{"id":"1002.2970","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-02-15T22:22:45Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"41d977b69096f210b43bd85073d66c7c172f1e796e5172aa705b402e1e36f642","abstract_canon_sha256":"2ff32c6d1c0854a69ae68c5aa121d6a94a2f120ba4968ef026272aeb4cfa1dbd"},"schema_version":"1.0"},"canonical_sha256":"8142c17a5fd1d7fbbb1074c4e498efda1d6dfd6ca9d52c4b7ff6eb82f777f020","source":{"kind":"arxiv","id":"1002.2970","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1002.2970","created_at":"2026-05-18T04:14:18Z"},{"alias_kind":"arxiv_version","alias_value":"1002.2970v1","created_at":"2026-05-18T04:14:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.2970","created_at":"2026-05-18T04:14:18Z"},{"alias_kind":"pith_short_12","alias_value":"QFBMC6S72HL7","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"QFBMC6S72HL7XOYQ","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"QFBMC6S7","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:QFBMC6S72HL7XOYQOTCOJGHP3I","target":"record","payload":{"canonical_record":{"source":{"id":"1002.2970","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-02-15T22:22:45Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"41d977b69096f210b43bd85073d66c7c172f1e796e5172aa705b402e1e36f642","abstract_canon_sha256":"2ff32c6d1c0854a69ae68c5aa121d6a94a2f120ba4968ef026272aeb4cfa1dbd"},"schema_version":"1.0"},"canonical_sha256":"8142c17a5fd1d7fbbb1074c4e498efda1d6dfd6ca9d52c4b7ff6eb82f777f020","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:18.263717Z","signature_b64":"5zv/VX1BxUP/bxg3DesB6wkgPnGVT+LQwRvPLdBOjSpZMZN0yVPwF/I1RbYn8Kwb5XpgZXe69ZKfF2KIVWVnAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8142c17a5fd1d7fbbb1074c4e498efda1d6dfd6ca9d52c4b7ff6eb82f777f020","last_reissued_at":"2026-05-18T04:14:18.263184Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:18.263184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1002.2970","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-05-18T04:14:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"338t9j8H1irsK4wkWTSKYvoGM6EWyE+E67CFhBKl4RvSVL9HG+JcafUcsEUwQYbx7kHJ8eOB96DTU5Vy5dJqCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:52:52.449114Z"},"content_sha256":"b8560354ebd38a03fd9a2cb7d3f321da98b692ad2e6fb7592648cba8f82babe3","schema_version":"1.0","event_id":"sha256:b8560354ebd38a03fd9a2cb7d3f321da98b692ad2e6fb7592648cba8f82babe3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:QFBMC6S72HL7XOYQOTCOJGHP3I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum Online Memory Checking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Qingqing Yuan, Wim van Dam","submitted_at":"2010-02-15T22:22:45Z","abstract_excerpt":"The problem of memory checking considers storing files on an unreliable public server whose memory can be modified by a malicious party. The main task is to design an online memory checker with the capability to verify that the information on the server has not been corrupted. To store n bits of public information, the memory checker has s private reliable bits for verification purpose; while to retrieve each bit of public information the checker communicates t bits with the public memory. Earlier work showed that, for classical memory checkers, the lower bound s*t \\in Omega(n) holds. In this "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.2970","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"},"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-18T04:14:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zoEqkC1NiVduDri37PGek7zhmHSR5fmUbS720BVzbRAncuFTbt1Gl/gHJZypekjNUKf5A3wtCntGMqVfsnR/CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:52:52.449768Z"},"content_sha256":"e56984573f8e6282240372123aa39b9a7051054c91e1c3fe8a30ecebcfe85a48","schema_version":"1.0","event_id":"sha256:e56984573f8e6282240372123aa39b9a7051054c91e1c3fe8a30ecebcfe85a48"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QFBMC6S72HL7XOYQOTCOJGHP3I/bundle.json","state_url":"https://pith.science/pith/QFBMC6S72HL7XOYQOTCOJGHP3I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QFBMC6S72HL7XOYQOTCOJGHP3I/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-12T09:52:52Z","links":{"resolver":"https://pith.science/pith/QFBMC6S72HL7XOYQOTCOJGHP3I","bundle":"https://pith.science/pith/QFBMC6S72HL7XOYQOTCOJGHP3I/bundle.json","state":"https://pith.science/pith/QFBMC6S72HL7XOYQOTCOJGHP3I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QFBMC6S72HL7XOYQOTCOJGHP3I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:QFBMC6S72HL7XOYQOTCOJGHP3I","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":"2ff32c6d1c0854a69ae68c5aa121d6a94a2f120ba4968ef026272aeb4cfa1dbd","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-02-15T22:22:45Z","title_canon_sha256":"41d977b69096f210b43bd85073d66c7c172f1e796e5172aa705b402e1e36f642"},"schema_version":"1.0","source":{"id":"1002.2970","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1002.2970","created_at":"2026-05-18T04:14:18Z"},{"alias_kind":"arxiv_version","alias_value":"1002.2970v1","created_at":"2026-05-18T04:14:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.2970","created_at":"2026-05-18T04:14:18Z"},{"alias_kind":"pith_short_12","alias_value":"QFBMC6S72HL7","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"QFBMC6S72HL7XOYQ","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"QFBMC6S7","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:e56984573f8e6282240372123aa39b9a7051054c91e1c3fe8a30ecebcfe85a48","target":"graph","created_at":"2026-05-18T04:14:18Z","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":"The problem of memory checking considers storing files on an unreliable public server whose memory can be modified by a malicious party. The main task is to design an online memory checker with the capability to verify that the information on the server has not been corrupted. To store n bits of public information, the memory checker has s private reliable bits for verification purpose; while to retrieve each bit of public information the checker communicates t bits with the public memory. Earlier work showed that, for classical memory checkers, the lower bound s*t \\in Omega(n) holds. In this ","authors_text":"Qingqing Yuan, Wim van Dam","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-02-15T22:22:45Z","title":"Quantum Online Memory Checking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.2970","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:b8560354ebd38a03fd9a2cb7d3f321da98b692ad2e6fb7592648cba8f82babe3","target":"record","created_at":"2026-05-18T04:14:18Z","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":"2ff32c6d1c0854a69ae68c5aa121d6a94a2f120ba4968ef026272aeb4cfa1dbd","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-02-15T22:22:45Z","title_canon_sha256":"41d977b69096f210b43bd85073d66c7c172f1e796e5172aa705b402e1e36f642"},"schema_version":"1.0","source":{"id":"1002.2970","kind":"arxiv","version":1}},"canonical_sha256":"8142c17a5fd1d7fbbb1074c4e498efda1d6dfd6ca9d52c4b7ff6eb82f777f020","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8142c17a5fd1d7fbbb1074c4e498efda1d6dfd6ca9d52c4b7ff6eb82f777f020","first_computed_at":"2026-05-18T04:14:18.263184Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:14:18.263184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5zv/VX1BxUP/bxg3DesB6wkgPnGVT+LQwRvPLdBOjSpZMZN0yVPwF/I1RbYn8Kwb5XpgZXe69ZKfF2KIVWVnAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:14:18.263717Z","signed_message":"canonical_sha256_bytes"},"source_id":"1002.2970","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b8560354ebd38a03fd9a2cb7d3f321da98b692ad2e6fb7592648cba8f82babe3","sha256:e56984573f8e6282240372123aa39b9a7051054c91e1c3fe8a30ecebcfe85a48"],"state_sha256":"e50c94740fb9de0d43ec307b74e162ab629b298021575910fb851243b961e255"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kqAzVHVnIgn7tdzIGgcEaAc5+yR/aOQSmWsp27mXu416EdqJ0MYiSMe/PWgz0likN13awdqT9lNec5j38xblCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T09:52:52.453265Z","bundle_sha256":"10224d6f09fd18a902b50c3d2e09908c2f8eb34eb61ecca983fb1bd9934dcced"}}