{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TPB2ACKNCLKAZ4KHIOZGEYYFBD","short_pith_number":"pith:TPB2ACKN","schema_version":"1.0","canonical_sha256":"9bc3a0094d12d40cf14743b262630508defa14a9c300df79b19792d229310bdd","source":{"kind":"arxiv","id":"2511.17545","version":2},"attestation_state":"computed","paper":{"title":"Resource-Efficient Quantum Optimization via Higher-Order Encoding","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dieter Jaksch, Frederik Koch, Joseph Doetsch, Rick Mukherjee, Shahram Panahiyan","submitted_at":"2025-11-10T10:17:55Z","abstract_excerpt":"Quantum approaches to combinatorial optimization problems (COPs) are often limited by the resource demands of Quadratic Unconstrained Binary Optimization (QUBO) encodings, which enlarge circuits through penalty terms and increase qubit and gate counts. We show that Higher-Order Unconstrained Binary Optimization (HUBO) enables a more resource-efficient formulation. Our method systematically constructs HUBO Hamiltonians and, compared to a QUBO formulation in benchmarks on Gate Assignment (GAP), Maximum k-Colorable Subgraph (MkCS), and Integer Programming (IP) problems, significantly reduces qubi"},"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":"2511.17545","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-11-10T10:17:55Z","cross_cats_sorted":[],"title_canon_sha256":"ce727c137fef6cfd94a6e631cfd2caec4e666143cdcd4349d45db85e87e66c20","abstract_canon_sha256":"ba67bdbc7942d2b407ee2f12211c80562e9a1782b8331cbc35eaa826cbd5dcb4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-08T01:03:51.567736Z","signature_b64":"IvxGiSvXe+Icxowtg/e78/clakNmNhn7m4BZuIhSKUPG/qPomnf7xLLK2rg/GYoF/NteHHPf5cj/5/vCNR4eAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9bc3a0094d12d40cf14743b262630508defa14a9c300df79b19792d229310bdd","last_reissued_at":"2026-06-08T01:03:51.566673Z","signature_status":"signed_v1","first_computed_at":"2026-06-08T01:03:51.566673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Resource-Efficient Quantum Optimization via Higher-Order Encoding","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dieter Jaksch, Frederik Koch, Joseph Doetsch, Rick Mukherjee, Shahram Panahiyan","submitted_at":"2025-11-10T10:17:55Z","abstract_excerpt":"Quantum approaches to combinatorial optimization problems (COPs) are often limited by the resource demands of Quadratic Unconstrained Binary Optimization (QUBO) encodings, which enlarge circuits through penalty terms and increase qubit and gate counts. We show that Higher-Order Unconstrained Binary Optimization (HUBO) enables a more resource-efficient formulation. Our method systematically constructs HUBO Hamiltonians and, compared to a QUBO formulation in benchmarks on Gate Assignment (GAP), Maximum k-Colorable Subgraph (MkCS), and Integer Programming (IP) problems, significantly reduces qubi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.17545","kind":"arxiv","version":2},"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/2511.17545/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":"2511.17545","created_at":"2026-06-08T01:03:51.566817+00:00"},{"alias_kind":"arxiv_version","alias_value":"2511.17545v2","created_at":"2026-06-08T01:03:51.566817+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.17545","created_at":"2026-06-08T01:03:51.566817+00:00"},{"alias_kind":"pith_short_12","alias_value":"TPB2ACKNCLKA","created_at":"2026-06-08T01:03:51.566817+00:00"},{"alias_kind":"pith_short_16","alias_value":"TPB2ACKNCLKAZ4KH","created_at":"2026-06-08T01:03:51.566817+00:00"},{"alias_kind":"pith_short_8","alias_value":"TPB2ACKN","created_at":"2026-06-08T01:03:51.566817+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.27030","citing_title":"Efficient mapping of multi-constraint satisfaction problems to Rydberg platforms","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TPB2ACKNCLKAZ4KHIOZGEYYFBD","json":"https://pith.science/pith/TPB2ACKNCLKAZ4KHIOZGEYYFBD.json","graph_json":"https://pith.science/api/pith-number/TPB2ACKNCLKAZ4KHIOZGEYYFBD/graph.json","events_json":"https://pith.science/api/pith-number/TPB2ACKNCLKAZ4KHIOZGEYYFBD/events.json","paper":"https://pith.science/paper/TPB2ACKN"},"agent_actions":{"view_html":"https://pith.science/pith/TPB2ACKNCLKAZ4KHIOZGEYYFBD","download_json":"https://pith.science/pith/TPB2ACKNCLKAZ4KHIOZGEYYFBD.json","view_paper":"https://pith.science/paper/TPB2ACKN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2511.17545&json=true","fetch_graph":"https://pith.science/api/pith-number/TPB2ACKNCLKAZ4KHIOZGEYYFBD/graph.json","fetch_events":"https://pith.science/api/pith-number/TPB2ACKNCLKAZ4KHIOZGEYYFBD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TPB2ACKNCLKAZ4KHIOZGEYYFBD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TPB2ACKNCLKAZ4KHIOZGEYYFBD/action/storage_attestation","attest_author":"https://pith.science/pith/TPB2ACKNCLKAZ4KHIOZGEYYFBD/action/author_attestation","sign_citation":"https://pith.science/pith/TPB2ACKNCLKAZ4KHIOZGEYYFBD/action/citation_signature","submit_replication":"https://pith.science/pith/TPB2ACKNCLKAZ4KHIOZGEYYFBD/action/replication_record"}},"created_at":"2026-06-08T01:03:51.566817+00:00","updated_at":"2026-06-08T01:03:51.566817+00:00"}