{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:B5RQ22ZVQFGFA6KWNWLTL477MI","short_pith_number":"pith:B5RQ22ZV","schema_version":"1.0","canonical_sha256":"0f630d6b35814c5079566d9735f3ff623a7e5e58df3587e5de87cb29723bbb3a","source":{"kind":"arxiv","id":"2507.15544","version":1},"attestation_state":"computed","paper":{"title":"Effectiveness of Hybrid Optimization Method for Quantum Annealing Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cond-mat.stat-mech","authors_text":"Nozomu Togawa, Shuta Kikuchi, Shu Tanaka","submitted_at":"2025-07-21T12:17:51Z","abstract_excerpt":"To enhance the performance of quantum annealing machines, several methods have been proposed to reduce the number of spins by fixing spin values through preprocessing. We proposed a hybrid optimization method that combines a simulated annealing (SA)-based non-quantum-type Ising machine with a quantum annealing machine. However, its applicability remains unclear. Therefore, we evaluated the performance of the hybrid method on large-size Ising models and analyzed its characteristics. The results indicate that the hybrid method improves upon solutions obtained by the preprocessing SA, even if the"},"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":"2507.15544","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2025-07-21T12:17:51Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"d880ae918cbc0c4fdb6da8fe0318b0a708086e528db91d748da33b1689b0fbaf","abstract_canon_sha256":"d1b5add85431fbb6fed0bd8a7fb22714e0874c67e2fd063624cf4fd8096e69df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:40:38.936126Z","signature_b64":"RUE9jG5Qcrs5VVVefYpLp7xcwbPuoXPnoo8VQgfXR7WnoSv+8NA8R8BfirfY4Kl/tR22M37dN/2jzLmr9KL9Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f630d6b35814c5079566d9735f3ff623a7e5e58df3587e5de87cb29723bbb3a","last_reissued_at":"2026-07-05T11:40:38.935668Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:40:38.935668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Effectiveness of Hybrid Optimization Method for Quantum Annealing Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cond-mat.stat-mech","authors_text":"Nozomu Togawa, Shuta Kikuchi, Shu Tanaka","submitted_at":"2025-07-21T12:17:51Z","abstract_excerpt":"To enhance the performance of quantum annealing machines, several methods have been proposed to reduce the number of spins by fixing spin values through preprocessing. We proposed a hybrid optimization method that combines a simulated annealing (SA)-based non-quantum-type Ising machine with a quantum annealing machine. However, its applicability remains unclear. Therefore, we evaluated the performance of the hybrid method on large-size Ising models and analyzed its characteristics. The results indicate that the hybrid method improves upon solutions obtained by the preprocessing SA, even if the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.15544","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/2507.15544/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2507.15544","created_at":"2026-07-05T11:40:38.935719+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.15544v1","created_at":"2026-07-05T11:40:38.935719+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.15544","created_at":"2026-07-05T11:40:38.935719+00:00"},{"alias_kind":"pith_short_12","alias_value":"B5RQ22ZVQFGF","created_at":"2026-07-05T11:40:38.935719+00:00"},{"alias_kind":"pith_short_16","alias_value":"B5RQ22ZVQFGFA6KW","created_at":"2026-07-05T11:40:38.935719+00:00"},{"alias_kind":"pith_short_8","alias_value":"B5RQ22ZV","created_at":"2026-07-05T11:40:38.935719+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.23188","citing_title":"Stage-dependent integer-binary encoding in factorization-machine black-box optimization","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2601.01860","citing_title":"High-Order Epistasis Detection Using Factorization Machine with Quadratic Optimization Annealing and MDR-Based Evaluation","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/B5RQ22ZVQFGFA6KWNWLTL477MI","json":"https://pith.science/pith/B5RQ22ZVQFGFA6KWNWLTL477MI.json","graph_json":"https://pith.science/api/pith-number/B5RQ22ZVQFGFA6KWNWLTL477MI/graph.json","events_json":"https://pith.science/api/pith-number/B5RQ22ZVQFGFA6KWNWLTL477MI/events.json","paper":"https://pith.science/paper/B5RQ22ZV"},"agent_actions":{"view_html":"https://pith.science/pith/B5RQ22ZVQFGFA6KWNWLTL477MI","download_json":"https://pith.science/pith/B5RQ22ZVQFGFA6KWNWLTL477MI.json","view_paper":"https://pith.science/paper/B5RQ22ZV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.15544&json=true","fetch_graph":"https://pith.science/api/pith-number/B5RQ22ZVQFGFA6KWNWLTL477MI/graph.json","fetch_events":"https://pith.science/api/pith-number/B5RQ22ZVQFGFA6KWNWLTL477MI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B5RQ22ZVQFGFA6KWNWLTL477MI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B5RQ22ZVQFGFA6KWNWLTL477MI/action/storage_attestation","attest_author":"https://pith.science/pith/B5RQ22ZVQFGFA6KWNWLTL477MI/action/author_attestation","sign_citation":"https://pith.science/pith/B5RQ22ZVQFGFA6KWNWLTL477MI/action/citation_signature","submit_replication":"https://pith.science/pith/B5RQ22ZVQFGFA6KWNWLTL477MI/action/replication_record"}},"created_at":"2026-07-05T11:40:38.935719+00:00","updated_at":"2026-07-05T11:40:38.935719+00:00"}