{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:MJBHXBWS7KNK53PO6HEETM7QEJ","short_pith_number":"pith:MJBHXBWS","canonical_record":{"source":{"id":"2110.04782","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-10-10T12:51:31Z","cross_cats_sorted":["cond-mat.dis-nn","cs.AI","cs.LG"],"title_canon_sha256":"4b5379d468fe396f37ab9f1b4eada15108baf7ba3587442b1f1ab66e611e8baa","abstract_canon_sha256":"665a05163566aebef217f4c4741dfb0e501cafca28bd43db6998f59b408a4305"},"schema_version":"1.0"},"canonical_sha256":"62427b86d2fa9aaeedeef1c849b3f02276344e78f4f46627c00ff2c3ec69ce0e","source":{"kind":"arxiv","id":"2110.04782","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.04782","created_at":"2026-07-05T04:36:19Z"},{"alias_kind":"arxiv_version","alias_value":"2110.04782v1","created_at":"2026-07-05T04:36:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.04782","created_at":"2026-07-05T04:36:19Z"},{"alias_kind":"pith_short_12","alias_value":"MJBHXBWS7KNK","created_at":"2026-07-05T04:36:19Z"},{"alias_kind":"pith_short_16","alias_value":"MJBHXBWS7KNK53PO","created_at":"2026-07-05T04:36:19Z"},{"alias_kind":"pith_short_8","alias_value":"MJBHXBWS","created_at":"2026-07-05T04:36:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:MJBHXBWS7KNK53PO6HEETM7QEJ","target":"record","payload":{"canonical_record":{"source":{"id":"2110.04782","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-10-10T12:51:31Z","cross_cats_sorted":["cond-mat.dis-nn","cs.AI","cs.LG"],"title_canon_sha256":"4b5379d468fe396f37ab9f1b4eada15108baf7ba3587442b1f1ab66e611e8baa","abstract_canon_sha256":"665a05163566aebef217f4c4741dfb0e501cafca28bd43db6998f59b408a4305"},"schema_version":"1.0"},"canonical_sha256":"62427b86d2fa9aaeedeef1c849b3f02276344e78f4f46627c00ff2c3ec69ce0e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:36:19.926213Z","signature_b64":"UJKpIJkjgsRBj6GplZHi4f8A0SYQjqGOtFRtxwNk4FoKhaVY1mEqURP6IWjvFgmCwc0ERaZ1hl+WI5ofqAKiDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62427b86d2fa9aaeedeef1c849b3f02276344e78f4f46627c00ff2c3ec69ce0e","last_reissued_at":"2026-07-05T04:36:19.925745Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:36:19.925745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2110.04782","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-05T04:36:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rtiTXkdpfdZNhavYQUgHRTnLERv6EoVvFp46mboDx8PbSEeTwBCwvW8oSlUZDLMXU3JIbDv8/DtHAEOd+7dYDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T16:53:02.398061Z"},"content_sha256":"09d08a579b9608caec003d2deb2a80ff5096f8900d1952254379736869da80e7","schema_version":"1.0","event_id":"sha256:09d08a579b9608caec003d2deb2a80ff5096f8900d1952254379736869da80e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:MJBHXBWS7KNK53PO6HEETM7QEJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hard instance learning for quantum adiabatic prime factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cs.AI","cs.LG"],"primary_cat":"quant-ph","authors_text":"Jian Lin, Junping Zhang, Xiaopeng Li, Zhengfeng Zhang","submitted_at":"2021-10-10T12:51:31Z","abstract_excerpt":"Prime factorization is a difficult problem with classical computing, whose exponential hardness is the foundation of Rivest-Shamir-Adleman (RSA) cryptography. With programmable quantum devices, adiabatic quantum computing has been proposed as a plausible approach to solve prime factorization, having promising advantage over classical computing. Here, we find there are certain hard instances that are consistently intractable for both classical simulated annealing and un-configured adiabatic quantum computing (AQC). Aiming at an automated architecture for optimal configuration of quantum adiabat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.04782","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/2110.04782/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-05T04:36:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"37qgfLcMTlU0iGTsmhYbnOjW/UCAnTS0QK6Z1FxGFpfPB//zVvtS3XafvRKBxc4LEjUER49LV3RGt6afI7XvDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T16:53:02.399007Z"},"content_sha256":"1cbebf7caf7c3d3c3feb9d6716a6ede4a3d840da08c110fc1d7c9b8f0abf0014","schema_version":"1.0","event_id":"sha256:1cbebf7caf7c3d3c3feb9d6716a6ede4a3d840da08c110fc1d7c9b8f0abf0014"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MJBHXBWS7KNK53PO6HEETM7QEJ/bundle.json","state_url":"https://pith.science/pith/MJBHXBWS7KNK53PO6HEETM7QEJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MJBHXBWS7KNK53PO6HEETM7QEJ/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-12T16:53:02Z","links":{"resolver":"https://pith.science/pith/MJBHXBWS7KNK53PO6HEETM7QEJ","bundle":"https://pith.science/pith/MJBHXBWS7KNK53PO6HEETM7QEJ/bundle.json","state":"https://pith.science/pith/MJBHXBWS7KNK53PO6HEETM7QEJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MJBHXBWS7KNK53PO6HEETM7QEJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:MJBHXBWS7KNK53PO6HEETM7QEJ","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":"665a05163566aebef217f4c4741dfb0e501cafca28bd43db6998f59b408a4305","cross_cats_sorted":["cond-mat.dis-nn","cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-10-10T12:51:31Z","title_canon_sha256":"4b5379d468fe396f37ab9f1b4eada15108baf7ba3587442b1f1ab66e611e8baa"},"schema_version":"1.0","source":{"id":"2110.04782","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.04782","created_at":"2026-07-05T04:36:19Z"},{"alias_kind":"arxiv_version","alias_value":"2110.04782v1","created_at":"2026-07-05T04:36:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.04782","created_at":"2026-07-05T04:36:19Z"},{"alias_kind":"pith_short_12","alias_value":"MJBHXBWS7KNK","created_at":"2026-07-05T04:36:19Z"},{"alias_kind":"pith_short_16","alias_value":"MJBHXBWS7KNK53PO","created_at":"2026-07-05T04:36:19Z"},{"alias_kind":"pith_short_8","alias_value":"MJBHXBWS","created_at":"2026-07-05T04:36:19Z"}],"graph_snapshots":[{"event_id":"sha256:1cbebf7caf7c3d3c3feb9d6716a6ede4a3d840da08c110fc1d7c9b8f0abf0014","target":"graph","created_at":"2026-07-05T04:36:19Z","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/2110.04782/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Prime factorization is a difficult problem with classical computing, whose exponential hardness is the foundation of Rivest-Shamir-Adleman (RSA) cryptography. With programmable quantum devices, adiabatic quantum computing has been proposed as a plausible approach to solve prime factorization, having promising advantage over classical computing. Here, we find there are certain hard instances that are consistently intractable for both classical simulated annealing and un-configured adiabatic quantum computing (AQC). Aiming at an automated architecture for optimal configuration of quantum adiabat","authors_text":"Jian Lin, Junping Zhang, Xiaopeng Li, Zhengfeng Zhang","cross_cats":["cond-mat.dis-nn","cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-10-10T12:51:31Z","title":"Hard instance learning for quantum adiabatic prime factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.04782","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:09d08a579b9608caec003d2deb2a80ff5096f8900d1952254379736869da80e7","target":"record","created_at":"2026-07-05T04:36:19Z","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":"665a05163566aebef217f4c4741dfb0e501cafca28bd43db6998f59b408a4305","cross_cats_sorted":["cond-mat.dis-nn","cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-10-10T12:51:31Z","title_canon_sha256":"4b5379d468fe396f37ab9f1b4eada15108baf7ba3587442b1f1ab66e611e8baa"},"schema_version":"1.0","source":{"id":"2110.04782","kind":"arxiv","version":1}},"canonical_sha256":"62427b86d2fa9aaeedeef1c849b3f02276344e78f4f46627c00ff2c3ec69ce0e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62427b86d2fa9aaeedeef1c849b3f02276344e78f4f46627c00ff2c3ec69ce0e","first_computed_at":"2026-07-05T04:36:19.925745Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:36:19.925745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UJKpIJkjgsRBj6GplZHi4f8A0SYQjqGOtFRtxwNk4FoKhaVY1mEqURP6IWjvFgmCwc0ERaZ1hl+WI5ofqAKiDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:36:19.926213Z","signed_message":"canonical_sha256_bytes"},"source_id":"2110.04782","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09d08a579b9608caec003d2deb2a80ff5096f8900d1952254379736869da80e7","sha256:1cbebf7caf7c3d3c3feb9d6716a6ede4a3d840da08c110fc1d7c9b8f0abf0014"],"state_sha256":"91af7fafa0b389b538ecd650429424a79402fd0dc5c20f131ec7bc3296bea58d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wlXEb6cIY3TdjVVSHONQcMwK9RvaYadbLJA47nXyAhdMEA5g5D1fpmyUuCNr+l75rnui7ZZDl78HhBnG8FilAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T16:53:02.419179Z","bundle_sha256":"28590d283496ec2586dddec42a0750a651323fd090b36b2c4503b9c857d51b09"}}