{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:L77FZSMQADGBVYBI3UXJPRG3A5","short_pith_number":"pith:L77FZSMQ","schema_version":"1.0","canonical_sha256":"5ffe5cc99000cc1ae028dd2e97c4db075e22f258687bc2a3c0771d13416a9fb5","source":{"kind":"arxiv","id":"1712.05561","version":1},"attestation_state":"computed","paper":{"title":"Design of Quantum Annealing Machine for Prime Factoring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.mes-hall","cond-mat.supr-con","cs.ET"],"primary_cat":"quant-ph","authors_text":"H. Koike, K. Imafuku, M. Hidaka, M. Maezawa, S. Kawabata","submitted_at":"2017-12-15T07:06:33Z","abstract_excerpt":"We propose a prime factoring machine operated in a frame work of quantum annealing (QA). The idea is inverse operation of a quantum-mechanically reversible multiplier implemented with QA-based Boolean logic circuits. We designed the QA machine on an application-specific-annealing-computing architecture which efficiently increases available hardware budgets at the cost of restricted functionality. The circuits are to be implemented and fabricated by using superconducting integrated circuit technology. We propose a three-dimensional packaging scheme of a qubit-chip / interposer / package-substra"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1712.05561","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-12-15T07:06:33Z","cross_cats_sorted":["cond-mat.mes-hall","cond-mat.supr-con","cs.ET"],"title_canon_sha256":"31bf1ceb120d9888cb5b699c5d1799ae104f0ff2a5ceb66fe45d788e47a43516","abstract_canon_sha256":"1d332821c880c468026f2db45bbb4e4a08eb40c807d51c33d813beff996944d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:51.858073Z","signature_b64":"owdP4T3fmraHivQSWMM2mMQlAxc0Xps2uDkU0gsZ+5ovTATsOJuAhD8ksRhcRq+pdFpJhbNPw+q/6rK0ig2YBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ffe5cc99000cc1ae028dd2e97c4db075e22f258687bc2a3c0771d13416a9fb5","last_reissued_at":"2026-05-18T00:27:51.857535Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:51.857535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Design of Quantum Annealing Machine for Prime Factoring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.mes-hall","cond-mat.supr-con","cs.ET"],"primary_cat":"quant-ph","authors_text":"H. Koike, K. Imafuku, M. Hidaka, M. Maezawa, S. Kawabata","submitted_at":"2017-12-15T07:06:33Z","abstract_excerpt":"We propose a prime factoring machine operated in a frame work of quantum annealing (QA). The idea is inverse operation of a quantum-mechanically reversible multiplier implemented with QA-based Boolean logic circuits. We designed the QA machine on an application-specific-annealing-computing architecture which efficiently increases available hardware budgets at the cost of restricted functionality. The circuits are to be implemented and fabricated by using superconducting integrated circuit technology. We propose a three-dimensional packaging scheme of a qubit-chip / interposer / package-substra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05561","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1712.05561","created_at":"2026-05-18T00:27:51.857642+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.05561v1","created_at":"2026-05-18T00:27:51.857642+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05561","created_at":"2026-05-18T00:27:51.857642+00:00"},{"alias_kind":"pith_short_12","alias_value":"L77FZSMQADGB","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"L77FZSMQADGBVYBI","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"L77FZSMQ","created_at":"2026-05-18T12:31:28.150371+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L77FZSMQADGBVYBI3UXJPRG3A5","json":"https://pith.science/pith/L77FZSMQADGBVYBI3UXJPRG3A5.json","graph_json":"https://pith.science/api/pith-number/L77FZSMQADGBVYBI3UXJPRG3A5/graph.json","events_json":"https://pith.science/api/pith-number/L77FZSMQADGBVYBI3UXJPRG3A5/events.json","paper":"https://pith.science/paper/L77FZSMQ"},"agent_actions":{"view_html":"https://pith.science/pith/L77FZSMQADGBVYBI3UXJPRG3A5","download_json":"https://pith.science/pith/L77FZSMQADGBVYBI3UXJPRG3A5.json","view_paper":"https://pith.science/paper/L77FZSMQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.05561&json=true","fetch_graph":"https://pith.science/api/pith-number/L77FZSMQADGBVYBI3UXJPRG3A5/graph.json","fetch_events":"https://pith.science/api/pith-number/L77FZSMQADGBVYBI3UXJPRG3A5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L77FZSMQADGBVYBI3UXJPRG3A5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L77FZSMQADGBVYBI3UXJPRG3A5/action/storage_attestation","attest_author":"https://pith.science/pith/L77FZSMQADGBVYBI3UXJPRG3A5/action/author_attestation","sign_citation":"https://pith.science/pith/L77FZSMQADGBVYBI3UXJPRG3A5/action/citation_signature","submit_replication":"https://pith.science/pith/L77FZSMQADGBVYBI3UXJPRG3A5/action/replication_record"}},"created_at":"2026-05-18T00:27:51.857642+00:00","updated_at":"2026-05-18T00:27:51.857642+00:00"}