{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2001:2NTZGDIUZ5KGGI5ABYCC3XATHW","short_pith_number":"pith:2NTZGDIU","canonical_record":{"source":{"id":"quant-ph/0108048","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2001-08-09T21:09:00Z","cross_cats_sorted":[],"title_canon_sha256":"90364d2db1768a25c178ca36fadee10f1e571f02692e2742cbdebb75b31a7a41","abstract_canon_sha256":"82d122f4578aafe09024dab260ad181adf37b123d46f661d3857a8b2c22a2674"},"schema_version":"1.0"},"canonical_sha256":"d367930d14cf546323a00e042ddc133d8b37df7e54e26fad4d98a165db0eff6d","source":{"kind":"arxiv","id":"quant-ph/0108048","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0108048","created_at":"2026-07-04T14:45:41Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0108048v1","created_at":"2026-07-04T14:45:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0108048","created_at":"2026-07-04T14:45:41Z"},{"alias_kind":"pith_short_12","alias_value":"2NTZGDIUZ5KG","created_at":"2026-07-04T14:45:41Z"},{"alias_kind":"pith_short_16","alias_value":"2NTZGDIUZ5KGGI5A","created_at":"2026-07-04T14:45:41Z"},{"alias_kind":"pith_short_8","alias_value":"2NTZGDIU","created_at":"2026-07-04T14:45:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2001:2NTZGDIUZ5KGGI5ABYCC3XATHW","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0108048","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2001-08-09T21:09:00Z","cross_cats_sorted":[],"title_canon_sha256":"90364d2db1768a25c178ca36fadee10f1e571f02692e2742cbdebb75b31a7a41","abstract_canon_sha256":"82d122f4578aafe09024dab260ad181adf37b123d46f661d3857a8b2c22a2674"},"schema_version":"1.0"},"canonical_sha256":"d367930d14cf546323a00e042ddc133d8b37df7e54e26fad4d98a165db0eff6d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:45:41.072139Z","signature_b64":"bXnyPp33ZzEtrJxEb3FODQKbx5PhH7fdtvgUUQUEUe9u/4ZHP37qM4IGVMab7hJ+5tn2xzOWjbzvOehZ1QxuAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d367930d14cf546323a00e042ddc133d8b37df7e54e26fad4d98a165db0eff6d","last_reissued_at":"2026-07-04T14:45:41.071791Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:45:41.071791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0108048","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-04T14:45:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4fQdIrM40ddZ7xb4/2do0FBch2Si39f4JGj84eyYGH27nfxoaLeOwEyr50YtlJrx8saVZaNkhFpypnTlFyYDAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T14:22:40.053787Z"},"content_sha256":"e1d77c179dee3b32575d891d818dd0991a7eef6339a9da0116d13365d4371902","schema_version":"1.0","event_id":"sha256:e1d77c179dee3b32575d891d818dd0991a7eef6339a9da0116d13365d4371902"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2001:2NTZGDIUZ5KGGI5ABYCC3XATHW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robustness of adiabatic quantum computation","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew M. Childs, Edward Farhi, John Preskill","submitted_at":"2001-08-09T21:09:00Z","abstract_excerpt":"We study the fault tolerance of quantum computation by adiabatic evolution, a quantum algorithm for solving various combinatorial search problems. We describe an inherent robustness of adiabatic computation against two kinds of errors, unitary control errors and decoherence, and we study this robustness using numerical simulations of the algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0108048","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/quant-ph/0108048/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-04T14:45:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T3V2bbk4fqmVAfxksdQjtuSc6a1W98PHo9GaoM1+O3ohl6r60cGH1sAZPb3SBoEpQQUcrzxuD4tsPVgeGT7CBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T14:22:40.054087Z"},"content_sha256":"3fe61d1225a777f2d6e13574d53b2f1a3d747d8c42f2177838fffa748b625792","schema_version":"1.0","event_id":"sha256:3fe61d1225a777f2d6e13574d53b2f1a3d747d8c42f2177838fffa748b625792"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2NTZGDIUZ5KGGI5ABYCC3XATHW/bundle.json","state_url":"https://pith.science/pith/2NTZGDIUZ5KGGI5ABYCC3XATHW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2NTZGDIUZ5KGGI5ABYCC3XATHW/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-08-11T14:22:40Z","links":{"resolver":"https://pith.science/pith/2NTZGDIUZ5KGGI5ABYCC3XATHW","bundle":"https://pith.science/pith/2NTZGDIUZ5KGGI5ABYCC3XATHW/bundle.json","state":"https://pith.science/pith/2NTZGDIUZ5KGGI5ABYCC3XATHW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2NTZGDIUZ5KGGI5ABYCC3XATHW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2001:2NTZGDIUZ5KGGI5ABYCC3XATHW","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":"82d122f4578aafe09024dab260ad181adf37b123d46f661d3857a8b2c22a2674","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2001-08-09T21:09:00Z","title_canon_sha256":"90364d2db1768a25c178ca36fadee10f1e571f02692e2742cbdebb75b31a7a41"},"schema_version":"1.0","source":{"id":"quant-ph/0108048","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0108048","created_at":"2026-07-04T14:45:41Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0108048v1","created_at":"2026-07-04T14:45:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0108048","created_at":"2026-07-04T14:45:41Z"},{"alias_kind":"pith_short_12","alias_value":"2NTZGDIUZ5KG","created_at":"2026-07-04T14:45:41Z"},{"alias_kind":"pith_short_16","alias_value":"2NTZGDIUZ5KGGI5A","created_at":"2026-07-04T14:45:41Z"},{"alias_kind":"pith_short_8","alias_value":"2NTZGDIU","created_at":"2026-07-04T14:45:41Z"}],"graph_snapshots":[{"event_id":"sha256:3fe61d1225a777f2d6e13574d53b2f1a3d747d8c42f2177838fffa748b625792","target":"graph","created_at":"2026-07-04T14:45:41Z","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/quant-ph/0108048/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the fault tolerance of quantum computation by adiabatic evolution, a quantum algorithm for solving various combinatorial search problems. We describe an inherent robustness of adiabatic computation against two kinds of errors, unitary control errors and decoherence, and we study this robustness using numerical simulations of the algorithm.","authors_text":"Andrew M. Childs, Edward Farhi, John Preskill","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2001-08-09T21:09:00Z","title":"Robustness of adiabatic quantum computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0108048","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:e1d77c179dee3b32575d891d818dd0991a7eef6339a9da0116d13365d4371902","target":"record","created_at":"2026-07-04T14:45:41Z","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":"82d122f4578aafe09024dab260ad181adf37b123d46f661d3857a8b2c22a2674","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2001-08-09T21:09:00Z","title_canon_sha256":"90364d2db1768a25c178ca36fadee10f1e571f02692e2742cbdebb75b31a7a41"},"schema_version":"1.0","source":{"id":"quant-ph/0108048","kind":"arxiv","version":1}},"canonical_sha256":"d367930d14cf546323a00e042ddc133d8b37df7e54e26fad4d98a165db0eff6d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d367930d14cf546323a00e042ddc133d8b37df7e54e26fad4d98a165db0eff6d","first_computed_at":"2026-07-04T14:45:41.071791Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:45:41.071791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bXnyPp33ZzEtrJxEb3FODQKbx5PhH7fdtvgUUQUEUe9u/4ZHP37qM4IGVMab7hJ+5tn2xzOWjbzvOehZ1QxuAQ==","signature_status":"signed_v1","signed_at":"2026-07-04T14:45:41.072139Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0108048","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1d77c179dee3b32575d891d818dd0991a7eef6339a9da0116d13365d4371902","sha256:3fe61d1225a777f2d6e13574d53b2f1a3d747d8c42f2177838fffa748b625792"],"state_sha256":"5a006de1d4094d6842b2d5e166094f04e76b0130fb3e3385cb6d790b5f7a2968"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zBXDqYo8GtqAGvHSX2W/mnhAUeZeh3YFvCXtokdj9sg7dYsV2SSfU8uryXqC7b2hwfFkLnmZbbbbxFrwEkb/BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T14:22:40.056474Z","bundle_sha256":"9f3842c3bfa71c20003019bc0a5a5f28ab5ef6c8a72bda636ee9d699538b8ae9"}}