{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:BEPO7BX3K266AELXQZFGUCD4PA","short_pith_number":"pith:BEPO7BX3","schema_version":"1.0","canonical_sha256":"091eef86fb56bde01177864a6a087c7810b7905693dbdd629aa66fab8176014e","source":{"kind":"arxiv","id":"2510.24237","version":1},"attestation_state":"computed","paper":{"title":"Evaluating the Performance of Direct Higher-Order Formulations in Combinatorial Optimization Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.stat-mech","authors_text":"Kazuki Ikeuchi, Shu Tanaka, Yoshiki Matsuda","submitted_at":"2025-10-28T09:44:48Z","abstract_excerpt":"Ising machines, including quantum annealing machines, are promising next-generation computers for combinatorial optimization problems. However, due to hardware limitations, most Ising-type hardware can only solve objective functions expressed in linear or quadratic terms of binary variables. Therefore, problems with higher-order terms require an order-reduction process, which increases the number of variables and constraints and may degrade solution quality. In this study, we evaluate the effectiveness of directly solving such problems without order reduction by using a high-performance simula"},"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":"2510.24237","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2025-10-28T09:44:48Z","cross_cats_sorted":[],"title_canon_sha256":"35ead1d06715b21968b8db4bf0f5e1e294de850b83aa92bf81ac05a989bbd8d0","abstract_canon_sha256":"e05ad8c7bb03bc4b8cd78e523cd2535ef190fe2254e96ffcc21ee05ce866ce28"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T01:16:25.759698Z","signature_b64":"o9ndSVon/P3y6O27EUjJXIyPU7jRQcYDDpw/Jsjk6seAZoyUPyUIR96pxI/dgEKm9/ZSsr9T8nfu0K1WKKMXDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"091eef86fb56bde01177864a6a087c7810b7905693dbdd629aa66fab8176014e","last_reissued_at":"2026-06-30T01:16:25.758847Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T01:16:25.758847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Evaluating the Performance of Direct Higher-Order Formulations in Combinatorial Optimization Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.stat-mech","authors_text":"Kazuki Ikeuchi, Shu Tanaka, Yoshiki Matsuda","submitted_at":"2025-10-28T09:44:48Z","abstract_excerpt":"Ising machines, including quantum annealing machines, are promising next-generation computers for combinatorial optimization problems. However, due to hardware limitations, most Ising-type hardware can only solve objective functions expressed in linear or quadratic terms of binary variables. Therefore, problems with higher-order terms require an order-reduction process, which increases the number of variables and constraints and may degrade solution quality. In this study, we evaluate the effectiveness of directly solving such problems without order reduction by using a high-performance simula"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.24237","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/2510.24237/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":"2510.24237","created_at":"2026-06-30T01:16:25.758947+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.24237v1","created_at":"2026-06-30T01:16:25.758947+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.24237","created_at":"2026-06-30T01:16:25.758947+00:00"},{"alias_kind":"pith_short_12","alias_value":"BEPO7BX3K266","created_at":"2026-06-30T01:16:25.758947+00:00"},{"alias_kind":"pith_short_16","alias_value":"BEPO7BX3K266AELX","created_at":"2026-06-30T01:16:25.758947+00:00"},{"alias_kind":"pith_short_8","alias_value":"BEPO7BX3","created_at":"2026-06-30T01:16:25.758947+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2511.17245","citing_title":"Simulated Annealing for Quadratic and Higher-Order Unconstrained Integer Optimization","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BEPO7BX3K266AELXQZFGUCD4PA","json":"https://pith.science/pith/BEPO7BX3K266AELXQZFGUCD4PA.json","graph_json":"https://pith.science/api/pith-number/BEPO7BX3K266AELXQZFGUCD4PA/graph.json","events_json":"https://pith.science/api/pith-number/BEPO7BX3K266AELXQZFGUCD4PA/events.json","paper":"https://pith.science/paper/BEPO7BX3"},"agent_actions":{"view_html":"https://pith.science/pith/BEPO7BX3K266AELXQZFGUCD4PA","download_json":"https://pith.science/pith/BEPO7BX3K266AELXQZFGUCD4PA.json","view_paper":"https://pith.science/paper/BEPO7BX3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.24237&json=true","fetch_graph":"https://pith.science/api/pith-number/BEPO7BX3K266AELXQZFGUCD4PA/graph.json","fetch_events":"https://pith.science/api/pith-number/BEPO7BX3K266AELXQZFGUCD4PA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BEPO7BX3K266AELXQZFGUCD4PA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BEPO7BX3K266AELXQZFGUCD4PA/action/storage_attestation","attest_author":"https://pith.science/pith/BEPO7BX3K266AELXQZFGUCD4PA/action/author_attestation","sign_citation":"https://pith.science/pith/BEPO7BX3K266AELXQZFGUCD4PA/action/citation_signature","submit_replication":"https://pith.science/pith/BEPO7BX3K266AELXQZFGUCD4PA/action/replication_record"}},"created_at":"2026-06-30T01:16:25.758947+00:00","updated_at":"2026-06-30T01:16:25.758947+00:00"}