{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DBWYUL56VGCZYP52QORYPEL74A","short_pith_number":"pith:DBWYUL56","canonical_record":{"source":{"id":"1705.00420","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-05-01T04:51:50Z","cross_cats_sorted":[],"title_canon_sha256":"16fc2718f6e082baa32d520969d5c8d83d02b12d7d3a488c34c5648bdae0a938","abstract_canon_sha256":"b6e43e0c550d6d03c81d04f56afcf1eb9c04985b6ba5d912b35f6f58a0e002ae"},"schema_version":"1.0"},"canonical_sha256":"186d8a2fbea9859c3fba83a387917fe01e725fba32978550f90823dc21111f83","source":{"kind":"arxiv","id":"1705.00420","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.00420","created_at":"2026-05-18T00:45:17Z"},{"alias_kind":"arxiv_version","alias_value":"1705.00420v1","created_at":"2026-05-18T00:45:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00420","created_at":"2026-05-18T00:45:17Z"},{"alias_kind":"pith_short_12","alias_value":"DBWYUL56VGCZ","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DBWYUL56VGCZYP52","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DBWYUL56","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DBWYUL56VGCZYP52QORYPEL74A","target":"record","payload":{"canonical_record":{"source":{"id":"1705.00420","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-05-01T04:51:50Z","cross_cats_sorted":[],"title_canon_sha256":"16fc2718f6e082baa32d520969d5c8d83d02b12d7d3a488c34c5648bdae0a938","abstract_canon_sha256":"b6e43e0c550d6d03c81d04f56afcf1eb9c04985b6ba5d912b35f6f58a0e002ae"},"schema_version":"1.0"},"canonical_sha256":"186d8a2fbea9859c3fba83a387917fe01e725fba32978550f90823dc21111f83","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:17.297910Z","signature_b64":"IjCFw+KMG7eoi9O1doXMIrxpTB9yoWbuoEFGpBXeRpfFh2z0F+54h0zPiGnUBZfCgwsSJlaHZllGl+iC1xUbAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"186d8a2fbea9859c3fba83a387917fe01e725fba32978550f90823dc21111f83","last_reissued_at":"2026-05-18T00:45:17.297364Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:17.297364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.00420","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-18T00:45:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cC6knGvlRluxhKI96PRyjF9dfGsr9TKagcLlxNZXuJOi0Us1VpiaVi5a6KWfpKHiKScUdbLfczNEBbMVhGSuCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:14:15.799710Z"},"content_sha256":"ec2a14e613e0fd5e5d0d53453d0f1ed49f4e3d33800d7240d67267a103461d64","schema_version":"1.0","event_id":"sha256:ec2a14e613e0fd5e5d0d53453d0f1ed49f4e3d33800d7240d67267a103461d64"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DBWYUL56VGCZYP52QORYPEL74A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimizing Schedules for Quantum Annealing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bettina Heim, Daniel Herr, Ethan Brown, Guglielmo Mazzola, Mario K\\\"onz, Matthias Troyer","submitted_at":"2017-05-01T04:51:50Z","abstract_excerpt":"Classical and quantum annealing are two heuristic optimization methods that search for an optimal solution by slowly decreasing thermal or quantum fluctuations. Optimizing annealing schedules is important both for performance and fair comparisons between classical annealing, quantum annealing, and other algorithms. Here we present a heuristic approach for the optimization of annealing schedules for quantum annealing and apply it to 3D Ising spin glass problems. We find that if both classical and quantum annealing schedules are similarly optimized, classical annealing outperforms quantum anneal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00420","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-18T00:45:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CD3tXdt/oW2Mos+f29zxv4P6uv6J7N9OL8GRd/gvqGIwEkAzYz0AgmCe/R8vdw2KBKXAzNDi7TZZIb+2D87SBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:14:15.800454Z"},"content_sha256":"9cbe46bdc578c3406838ced01840550aea65cb5c8fc886778e2131ff2cb438f7","schema_version":"1.0","event_id":"sha256:9cbe46bdc578c3406838ced01840550aea65cb5c8fc886778e2131ff2cb438f7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DBWYUL56VGCZYP52QORYPEL74A/bundle.json","state_url":"https://pith.science/pith/DBWYUL56VGCZYP52QORYPEL74A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DBWYUL56VGCZYP52QORYPEL74A/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-05-30T23:14:15Z","links":{"resolver":"https://pith.science/pith/DBWYUL56VGCZYP52QORYPEL74A","bundle":"https://pith.science/pith/DBWYUL56VGCZYP52QORYPEL74A/bundle.json","state":"https://pith.science/pith/DBWYUL56VGCZYP52QORYPEL74A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DBWYUL56VGCZYP52QORYPEL74A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DBWYUL56VGCZYP52QORYPEL74A","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":"b6e43e0c550d6d03c81d04f56afcf1eb9c04985b6ba5d912b35f6f58a0e002ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-05-01T04:51:50Z","title_canon_sha256":"16fc2718f6e082baa32d520969d5c8d83d02b12d7d3a488c34c5648bdae0a938"},"schema_version":"1.0","source":{"id":"1705.00420","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.00420","created_at":"2026-05-18T00:45:17Z"},{"alias_kind":"arxiv_version","alias_value":"1705.00420v1","created_at":"2026-05-18T00:45:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00420","created_at":"2026-05-18T00:45:17Z"},{"alias_kind":"pith_short_12","alias_value":"DBWYUL56VGCZ","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DBWYUL56VGCZYP52","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DBWYUL56","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:9cbe46bdc578c3406838ced01840550aea65cb5c8fc886778e2131ff2cb438f7","target":"graph","created_at":"2026-05-18T00:45:17Z","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":"Classical and quantum annealing are two heuristic optimization methods that search for an optimal solution by slowly decreasing thermal or quantum fluctuations. Optimizing annealing schedules is important both for performance and fair comparisons between classical annealing, quantum annealing, and other algorithms. Here we present a heuristic approach for the optimization of annealing schedules for quantum annealing and apply it to 3D Ising spin glass problems. We find that if both classical and quantum annealing schedules are similarly optimized, classical annealing outperforms quantum anneal","authors_text":"Bettina Heim, Daniel Herr, Ethan Brown, Guglielmo Mazzola, Mario K\\\"onz, Matthias Troyer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-05-01T04:51:50Z","title":"Optimizing Schedules for Quantum Annealing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00420","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:ec2a14e613e0fd5e5d0d53453d0f1ed49f4e3d33800d7240d67267a103461d64","target":"record","created_at":"2026-05-18T00:45:17Z","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":"b6e43e0c550d6d03c81d04f56afcf1eb9c04985b6ba5d912b35f6f58a0e002ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-05-01T04:51:50Z","title_canon_sha256":"16fc2718f6e082baa32d520969d5c8d83d02b12d7d3a488c34c5648bdae0a938"},"schema_version":"1.0","source":{"id":"1705.00420","kind":"arxiv","version":1}},"canonical_sha256":"186d8a2fbea9859c3fba83a387917fe01e725fba32978550f90823dc21111f83","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"186d8a2fbea9859c3fba83a387917fe01e725fba32978550f90823dc21111f83","first_computed_at":"2026-05-18T00:45:17.297364Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:17.297364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IjCFw+KMG7eoi9O1doXMIrxpTB9yoWbuoEFGpBXeRpfFh2z0F+54h0zPiGnUBZfCgwsSJlaHZllGl+iC1xUbAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:17.297910Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.00420","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec2a14e613e0fd5e5d0d53453d0f1ed49f4e3d33800d7240d67267a103461d64","sha256:9cbe46bdc578c3406838ced01840550aea65cb5c8fc886778e2131ff2cb438f7"],"state_sha256":"3e33792ae71ed0ae287968cac41680a66c02bb3dcf6ca430b82960448858b982"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JddtJQ60H4LXlw/YppEa6FH5MBIWomFhyIRE8KI52+GW77aFFPQOTbpfLEUF8E0kaHczZ0STMhfjG7cmEIHVDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:14:15.808802Z","bundle_sha256":"43332a423e12e7d0000ff788dc21ee6c27feb3fcfcc0f64ce0ff86edad21d966"}}