{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:K3S4OTD5HZHV2TUXCFCMYLSVHB","short_pith_number":"pith:K3S4OTD5","canonical_record":{"source":{"id":"2004.02836","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-04-06T17:29:32Z","cross_cats_sorted":[],"title_canon_sha256":"6013bc6c5c78400d098e16532f489a73d8f8b384def0f075620048871c192f28","abstract_canon_sha256":"a25375c2bb7b9493d37d6b6ef2a1c26ac47c76c0912f1a4a6a5d3033dbc26f66"},"schema_version":"1.0"},"canonical_sha256":"56e5c74c7d3e4f5d4e971144cc2e55385917363b5739c18af236bb3587390086","source":{"kind":"arxiv","id":"2004.02836","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.02836","created_at":"2026-07-05T03:47:49Z"},{"alias_kind":"arxiv_version","alias_value":"2004.02836v3","created_at":"2026-07-05T03:47:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.02836","created_at":"2026-07-05T03:47:49Z"},{"alias_kind":"pith_short_12","alias_value":"K3S4OTD5HZHV","created_at":"2026-07-05T03:47:49Z"},{"alias_kind":"pith_short_16","alias_value":"K3S4OTD5HZHV2TUX","created_at":"2026-07-05T03:47:49Z"},{"alias_kind":"pith_short_8","alias_value":"K3S4OTD5","created_at":"2026-07-05T03:47:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:K3S4OTD5HZHV2TUXCFCMYLSVHB","target":"record","payload":{"canonical_record":{"source":{"id":"2004.02836","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-04-06T17:29:32Z","cross_cats_sorted":[],"title_canon_sha256":"6013bc6c5c78400d098e16532f489a73d8f8b384def0f075620048871c192f28","abstract_canon_sha256":"a25375c2bb7b9493d37d6b6ef2a1c26ac47c76c0912f1a4a6a5d3033dbc26f66"},"schema_version":"1.0"},"canonical_sha256":"56e5c74c7d3e4f5d4e971144cc2e55385917363b5739c18af236bb3587390086","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:47:49.461466Z","signature_b64":"ehoy+i/GwInosh8HX5/2DlwsLUFr3XpLJCznJnLN2mg+0vaQYvSgGNhCQSNyddN+dRA7CCh6v+5SjT4/9/B2Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56e5c74c7d3e4f5d4e971144cc2e55385917363b5739c18af236bb3587390086","last_reissued_at":"2026-07-05T03:47:49.461045Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:47:49.461045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2004.02836","source_version":3,"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-05T03:47:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C4mZ+9xTPPIgpiHKRXOqXFiwqJYZOjOFiHFSXfMY2NAQ+h9dOJk2W2+rS2G5QX+GLfMv/GJHgX7ROrilz+4MDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T23:55:39.340906Z"},"content_sha256":"cc1a709b069d87ed3ca164277bd88edd3cd72806a43242c0bb24b1f4d5bd2d07","schema_version":"1.0","event_id":"sha256:cc1a709b069d87ed3ca164277bd88edd3cd72806a43242c0bb24b1f4d5bd2d07"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:K3S4OTD5HZHV2TUXCFCMYLSVHB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimizing Quantum Annealing Schedules with Monte Carlo Tree Search enhanced with neural networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Chang-Yu Hsieh, Chee-Kong Lee, Shengyu Zhang, Yu Chen, Yu-Qin Chen","submitted_at":"2020-04-06T17:29:32Z","abstract_excerpt":"Quantum annealing is a practical approach to approximately implement the adiabatic quantum computational model under a real-world setting. The goal of an adiabatic algorithm is to prepare the ground state of a problem-encoded Hamiltonian at the end of an annealing path. This is typically achieved by driving the dynamical evolution of a quantum system slowly to enforce adiabaticity. Properly optimized annealing schedules often significantly accelerate the computational process. Inspired by the recent success of deep reinforcement learning such as DeepMind's AlphaZero, we propose a Monte Carlo T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.02836","kind":"arxiv","version":3},"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/2004.02836/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-05T03:47:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z2OFKMAI2P3yN/TQV2wRwc2jo0DZIlgMSmqi2YajTiRqL4cbzowKkXF6EG0Z8akwgV89QxQ3Vo1AqiyY8u3bBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T23:55:39.341832Z"},"content_sha256":"1f0f4a07ddbaee4cf0875c299a9f6c889192b09d50aaf0f44a1183b989e1b7f2","schema_version":"1.0","event_id":"sha256:1f0f4a07ddbaee4cf0875c299a9f6c889192b09d50aaf0f44a1183b989e1b7f2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K3S4OTD5HZHV2TUXCFCMYLSVHB/bundle.json","state_url":"https://pith.science/pith/K3S4OTD5HZHV2TUXCFCMYLSVHB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K3S4OTD5HZHV2TUXCFCMYLSVHB/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-05T23:55:39Z","links":{"resolver":"https://pith.science/pith/K3S4OTD5HZHV2TUXCFCMYLSVHB","bundle":"https://pith.science/pith/K3S4OTD5HZHV2TUXCFCMYLSVHB/bundle.json","state":"https://pith.science/pith/K3S4OTD5HZHV2TUXCFCMYLSVHB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K3S4OTD5HZHV2TUXCFCMYLSVHB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:K3S4OTD5HZHV2TUXCFCMYLSVHB","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":"a25375c2bb7b9493d37d6b6ef2a1c26ac47c76c0912f1a4a6a5d3033dbc26f66","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-04-06T17:29:32Z","title_canon_sha256":"6013bc6c5c78400d098e16532f489a73d8f8b384def0f075620048871c192f28"},"schema_version":"1.0","source":{"id":"2004.02836","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.02836","created_at":"2026-07-05T03:47:49Z"},{"alias_kind":"arxiv_version","alias_value":"2004.02836v3","created_at":"2026-07-05T03:47:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.02836","created_at":"2026-07-05T03:47:49Z"},{"alias_kind":"pith_short_12","alias_value":"K3S4OTD5HZHV","created_at":"2026-07-05T03:47:49Z"},{"alias_kind":"pith_short_16","alias_value":"K3S4OTD5HZHV2TUX","created_at":"2026-07-05T03:47:49Z"},{"alias_kind":"pith_short_8","alias_value":"K3S4OTD5","created_at":"2026-07-05T03:47:49Z"}],"graph_snapshots":[{"event_id":"sha256:1f0f4a07ddbaee4cf0875c299a9f6c889192b09d50aaf0f44a1183b989e1b7f2","target":"graph","created_at":"2026-07-05T03:47:49Z","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/2004.02836/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Quantum annealing is a practical approach to approximately implement the adiabatic quantum computational model under a real-world setting. The goal of an adiabatic algorithm is to prepare the ground state of a problem-encoded Hamiltonian at the end of an annealing path. This is typically achieved by driving the dynamical evolution of a quantum system slowly to enforce adiabaticity. Properly optimized annealing schedules often significantly accelerate the computational process. Inspired by the recent success of deep reinforcement learning such as DeepMind's AlphaZero, we propose a Monte Carlo T","authors_text":"Chang-Yu Hsieh, Chee-Kong Lee, Shengyu Zhang, Yu Chen, Yu-Qin Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-04-06T17:29:32Z","title":"Optimizing Quantum Annealing Schedules with Monte Carlo Tree Search enhanced with neural networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.02836","kind":"arxiv","version":3},"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:cc1a709b069d87ed3ca164277bd88edd3cd72806a43242c0bb24b1f4d5bd2d07","target":"record","created_at":"2026-07-05T03:47:49Z","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":"a25375c2bb7b9493d37d6b6ef2a1c26ac47c76c0912f1a4a6a5d3033dbc26f66","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-04-06T17:29:32Z","title_canon_sha256":"6013bc6c5c78400d098e16532f489a73d8f8b384def0f075620048871c192f28"},"schema_version":"1.0","source":{"id":"2004.02836","kind":"arxiv","version":3}},"canonical_sha256":"56e5c74c7d3e4f5d4e971144cc2e55385917363b5739c18af236bb3587390086","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"56e5c74c7d3e4f5d4e971144cc2e55385917363b5739c18af236bb3587390086","first_computed_at":"2026-07-05T03:47:49.461045Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:47:49.461045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ehoy+i/GwInosh8HX5/2DlwsLUFr3XpLJCznJnLN2mg+0vaQYvSgGNhCQSNyddN+dRA7CCh6v+5SjT4/9/B2Cw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:47:49.461466Z","signed_message":"canonical_sha256_bytes"},"source_id":"2004.02836","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc1a709b069d87ed3ca164277bd88edd3cd72806a43242c0bb24b1f4d5bd2d07","sha256:1f0f4a07ddbaee4cf0875c299a9f6c889192b09d50aaf0f44a1183b989e1b7f2"],"state_sha256":"abd07a39ba006dee2292d7984d080e93d09845f7cf58244a4ca0d6b4a191226c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SMX0IQr70RRGU3XyT2v9Fw2rQiYFYcxyzPPFK3NefxTBUUbV5MW5lLoFcku1cgeSpjI3YCZsZrrucDzut/zPDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T23:55:39.348319Z","bundle_sha256":"b9a4c26c34fe55f5a89d4d34a87bcf3cf3815cc5907c621adc491b67a4490e45"}}