{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:R5CKMN53BP3UC7ERWVEWAM4I7I","short_pith_number":"pith:R5CKMN53","schema_version":"1.0","canonical_sha256":"8f44a637bb0bf7417c91b549603388fa0eebd4a7bd98c4511d5b2f5396becf7a","source":{"kind":"arxiv","id":"2001.00658","version":1},"attestation_state":"computed","paper":{"title":"Compressed Quadratization of Higher Order Binary Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"quant-ph","authors_text":"Arnab Roy, Avradip Mandal, Hayato Ushijima-Mwesigwa, Sarvagya Upadhyay","submitted_at":"2020-01-02T22:48:50Z","abstract_excerpt":"Recent hardware advances in quantum and quantum-inspired annealers promise substantial speedup for solving NP-hard combinatorial optimization problems compared to general-purpose computers. These special-purpose hardware are built for solving hard instances of Quadratic Unconstrained Binary Optimization (QUBO) problems. In terms of number of variables and precision of these hardware are usually resource-constrained and they work either in Ising space {-1,1} or in Boolean space {0,1}. Many naturally occurring problem instances are higher-order in nature. The known method to reduce the degree of"},"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":"2001.00658","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-01-02T22:48:50Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"26d6559b9eebc0d1357b460fe549f03afc54709880ef6f5bda30aca40230ea4a","abstract_canon_sha256":"0521d8ad0d14f37cca136de3cda2202dfcbdf42bc7040b304306855368f59233"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:29:31.132665Z","signature_b64":"fgSvi0YXGUUtyEX+C0CbbiZTvu55JCwaIE4vA0Ou4Y6xLB7urRw30vaQ37iwuQa25dEjWmQGgqWmZvgAc6lRCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f44a637bb0bf7417c91b549603388fa0eebd4a7bd98c4511d5b2f5396becf7a","last_reissued_at":"2026-07-05T00:29:31.132192Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:29:31.132192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compressed Quadratization of Higher Order Binary Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"quant-ph","authors_text":"Arnab Roy, Avradip Mandal, Hayato Ushijima-Mwesigwa, Sarvagya Upadhyay","submitted_at":"2020-01-02T22:48:50Z","abstract_excerpt":"Recent hardware advances in quantum and quantum-inspired annealers promise substantial speedup for solving NP-hard combinatorial optimization problems compared to general-purpose computers. These special-purpose hardware are built for solving hard instances of Quadratic Unconstrained Binary Optimization (QUBO) problems. In terms of number of variables and precision of these hardware are usually resource-constrained and they work either in Ising space {-1,1} or in Boolean space {0,1}. Many naturally occurring problem instances are higher-order in nature. The known method to reduce the degree of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.00658","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/2001.00658/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":"2001.00658","created_at":"2026-07-05T00:29:31.132250+00:00"},{"alias_kind":"arxiv_version","alias_value":"2001.00658v1","created_at":"2026-07-05T00:29:31.132250+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.00658","created_at":"2026-07-05T00:29:31.132250+00:00"},{"alias_kind":"pith_short_12","alias_value":"R5CKMN53BP3U","created_at":"2026-07-05T00:29:31.132250+00:00"},{"alias_kind":"pith_short_16","alias_value":"R5CKMN53BP3UC7ER","created_at":"2026-07-05T00:29:31.132250+00:00"},{"alias_kind":"pith_short_8","alias_value":"R5CKMN53","created_at":"2026-07-05T00:29:31.132250+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2409.07501","citing_title":"A compact QUBO encoding of computational logic formulae demonstrated on cryptography constructions","ref_index":66,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R5CKMN53BP3UC7ERWVEWAM4I7I","json":"https://pith.science/pith/R5CKMN53BP3UC7ERWVEWAM4I7I.json","graph_json":"https://pith.science/api/pith-number/R5CKMN53BP3UC7ERWVEWAM4I7I/graph.json","events_json":"https://pith.science/api/pith-number/R5CKMN53BP3UC7ERWVEWAM4I7I/events.json","paper":"https://pith.science/paper/R5CKMN53"},"agent_actions":{"view_html":"https://pith.science/pith/R5CKMN53BP3UC7ERWVEWAM4I7I","download_json":"https://pith.science/pith/R5CKMN53BP3UC7ERWVEWAM4I7I.json","view_paper":"https://pith.science/paper/R5CKMN53","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2001.00658&json=true","fetch_graph":"https://pith.science/api/pith-number/R5CKMN53BP3UC7ERWVEWAM4I7I/graph.json","fetch_events":"https://pith.science/api/pith-number/R5CKMN53BP3UC7ERWVEWAM4I7I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R5CKMN53BP3UC7ERWVEWAM4I7I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R5CKMN53BP3UC7ERWVEWAM4I7I/action/storage_attestation","attest_author":"https://pith.science/pith/R5CKMN53BP3UC7ERWVEWAM4I7I/action/author_attestation","sign_citation":"https://pith.science/pith/R5CKMN53BP3UC7ERWVEWAM4I7I/action/citation_signature","submit_replication":"https://pith.science/pith/R5CKMN53BP3UC7ERWVEWAM4I7I/action/replication_record"}},"created_at":"2026-07-05T00:29:31.132250+00:00","updated_at":"2026-07-05T00:29:31.132250+00:00"}