{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:DUEPOETUEJSWVVD4YSLAPMNS65","short_pith_number":"pith:DUEPOETU","canonical_record":{"source":{"id":"2408.03026","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-08-06T08:19:51Z","cross_cats_sorted":["cond-mat.dis-nn"],"title_canon_sha256":"40729823b01e7dba69cdaee28851a8d6a0cea3fb335eedf3eca29cbb5e013724","abstract_canon_sha256":"9a87d4298aee4656a913940073c59e93e51cf278b103df5fb24078276d637fdb"},"schema_version":"1.0"},"canonical_sha256":"1d08f7127422656ad47cc49607b1b2f77f2d1f0f01386fd03d21f7a8629903e9","source":{"kind":"arxiv","id":"2408.03026","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.03026","created_at":"2026-07-05T09:56:53Z"},{"alias_kind":"arxiv_version","alias_value":"2408.03026v3","created_at":"2026-07-05T09:56:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.03026","created_at":"2026-07-05T09:56:53Z"},{"alias_kind":"pith_short_12","alias_value":"DUEPOETUEJSW","created_at":"2026-07-05T09:56:53Z"},{"alias_kind":"pith_short_16","alias_value":"DUEPOETUEJSWVVD4","created_at":"2026-07-05T09:56:53Z"},{"alias_kind":"pith_short_8","alias_value":"DUEPOETU","created_at":"2026-07-05T09:56:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:DUEPOETUEJSWVVD4YSLAPMNS65","target":"record","payload":{"canonical_record":{"source":{"id":"2408.03026","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-08-06T08:19:51Z","cross_cats_sorted":["cond-mat.dis-nn"],"title_canon_sha256":"40729823b01e7dba69cdaee28851a8d6a0cea3fb335eedf3eca29cbb5e013724","abstract_canon_sha256":"9a87d4298aee4656a913940073c59e93e51cf278b103df5fb24078276d637fdb"},"schema_version":"1.0"},"canonical_sha256":"1d08f7127422656ad47cc49607b1b2f77f2d1f0f01386fd03d21f7a8629903e9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:56:53.546615Z","signature_b64":"EqDWnLU+1vAjvfMgxvH1BOw1q/KFg2C8+g2P4PY7mUnWx2irKXw2i7pT2EOV6RzSyz3fQa1lTSkmq90YClVqAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d08f7127422656ad47cc49607b1b2f77f2d1f0f01386fd03d21f7a8629903e9","last_reissued_at":"2026-07-05T09:56:53.546153Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:56:53.546153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2408.03026","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-05T09:56:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x5ewL/N2xK578EgpqPATU+PTHjOYYxURTmsegU639TwlG2D5gaw2za0Y2ZQcrd4/uedy9swx04FlgKND+O7EBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T17:57:23.475831Z"},"content_sha256":"47b05097d7cd422715ce7004b3f685c8999558953a451141f41598a271bb36ae","schema_version":"1.0","event_id":"sha256:47b05097d7cd422715ce7004b3f685c8999558953a451141f41598a271bb36ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:DUEPOETUEJSWVVD4YSLAPMNS65","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deep Unfolded Local Quantum Annealing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.dis-nn"],"primary_cat":"quant-ph","authors_text":"Satoshi Takabe, Shunta Arai","submitted_at":"2024-08-06T08:19:51Z","abstract_excerpt":"Local quantum annealing (LQA), an iterative algorithm, is designed to solve combinatorial optimization problems. It draws inspiration from QA, which utilizes adiabatic time evolution to determine the global minimum of a given objective function. In the original LQA, the classical Hamiltonian is minimized via gradient descent. The performance of LQA depends on the choice of the parameters. Owing to the non-convex nature of the original cost function, LQA often becomes trapped in local minima, limiting its effectiveness. To address this challenge, we combine LQA with a deep unfolding scheme, whi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.03026","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/2408.03026/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-05T09:56:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zYM+5/q3VBVURszevWtcFZqdGx5Ce35jn8PHjqfbEL61+zaZx6qkYOU8djM0AR7Rxdm0VA4GOQECLpdwfMR0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T17:57:23.476367Z"},"content_sha256":"a8f59586efbcf390a86a81fc2fc9c4a2729ce92cb8b51b3d00483bd09b5532a5","schema_version":"1.0","event_id":"sha256:a8f59586efbcf390a86a81fc2fc9c4a2729ce92cb8b51b3d00483bd09b5532a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DUEPOETUEJSWVVD4YSLAPMNS65/bundle.json","state_url":"https://pith.science/pith/DUEPOETUEJSWVVD4YSLAPMNS65/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DUEPOETUEJSWVVD4YSLAPMNS65/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-07T17:57:23Z","links":{"resolver":"https://pith.science/pith/DUEPOETUEJSWVVD4YSLAPMNS65","bundle":"https://pith.science/pith/DUEPOETUEJSWVVD4YSLAPMNS65/bundle.json","state":"https://pith.science/pith/DUEPOETUEJSWVVD4YSLAPMNS65/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DUEPOETUEJSWVVD4YSLAPMNS65/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:DUEPOETUEJSWVVD4YSLAPMNS65","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":"9a87d4298aee4656a913940073c59e93e51cf278b103df5fb24078276d637fdb","cross_cats_sorted":["cond-mat.dis-nn"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-08-06T08:19:51Z","title_canon_sha256":"40729823b01e7dba69cdaee28851a8d6a0cea3fb335eedf3eca29cbb5e013724"},"schema_version":"1.0","source":{"id":"2408.03026","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.03026","created_at":"2026-07-05T09:56:53Z"},{"alias_kind":"arxiv_version","alias_value":"2408.03026v3","created_at":"2026-07-05T09:56:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.03026","created_at":"2026-07-05T09:56:53Z"},{"alias_kind":"pith_short_12","alias_value":"DUEPOETUEJSW","created_at":"2026-07-05T09:56:53Z"},{"alias_kind":"pith_short_16","alias_value":"DUEPOETUEJSWVVD4","created_at":"2026-07-05T09:56:53Z"},{"alias_kind":"pith_short_8","alias_value":"DUEPOETU","created_at":"2026-07-05T09:56:53Z"}],"graph_snapshots":[{"event_id":"sha256:a8f59586efbcf390a86a81fc2fc9c4a2729ce92cb8b51b3d00483bd09b5532a5","target":"graph","created_at":"2026-07-05T09:56:53Z","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/2408.03026/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Local quantum annealing (LQA), an iterative algorithm, is designed to solve combinatorial optimization problems. It draws inspiration from QA, which utilizes adiabatic time evolution to determine the global minimum of a given objective function. In the original LQA, the classical Hamiltonian is minimized via gradient descent. The performance of LQA depends on the choice of the parameters. Owing to the non-convex nature of the original cost function, LQA often becomes trapped in local minima, limiting its effectiveness. To address this challenge, we combine LQA with a deep unfolding scheme, whi","authors_text":"Satoshi Takabe, Shunta Arai","cross_cats":["cond-mat.dis-nn"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-08-06T08:19:51Z","title":"Deep Unfolded Local Quantum Annealing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.03026","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:47b05097d7cd422715ce7004b3f685c8999558953a451141f41598a271bb36ae","target":"record","created_at":"2026-07-05T09:56:53Z","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":"9a87d4298aee4656a913940073c59e93e51cf278b103df5fb24078276d637fdb","cross_cats_sorted":["cond-mat.dis-nn"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-08-06T08:19:51Z","title_canon_sha256":"40729823b01e7dba69cdaee28851a8d6a0cea3fb335eedf3eca29cbb5e013724"},"schema_version":"1.0","source":{"id":"2408.03026","kind":"arxiv","version":3}},"canonical_sha256":"1d08f7127422656ad47cc49607b1b2f77f2d1f0f01386fd03d21f7a8629903e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d08f7127422656ad47cc49607b1b2f77f2d1f0f01386fd03d21f7a8629903e9","first_computed_at":"2026-07-05T09:56:53.546153Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:56:53.546153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EqDWnLU+1vAjvfMgxvH1BOw1q/KFg2C8+g2P4PY7mUnWx2irKXw2i7pT2EOV6RzSyz3fQa1lTSkmq90YClVqAg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:56:53.546615Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.03026","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:47b05097d7cd422715ce7004b3f685c8999558953a451141f41598a271bb36ae","sha256:a8f59586efbcf390a86a81fc2fc9c4a2729ce92cb8b51b3d00483bd09b5532a5"],"state_sha256":"6f77a86634c10f2283d5bedccbcc1e328f40bed9c5ad1a3c69e8fc089ddc2085"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ruA7NGPi1xUtCEvgJ87QdE0yp/IT4nmyCSAULeMfNuDh6vnct4AlnTincbP+d2FCv0Lqju+DS0fYY7kazRPPBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T17:57:23.481713Z","bundle_sha256":"8c677d75d48a5a4261b7e875c058bf4ee30d4e0c698ff6a7c68c36ac21792759"}}