{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HGHFQTC6LUSPIVVRGQEFGIVLCH","short_pith_number":"pith:HGHFQTC6","schema_version":"1.0","canonical_sha256":"398e584c5e5d24f456b134085322ab11fc906c9bed14d92177b54448b3672889","source":{"kind":"arxiv","id":"2411.03626","version":1},"attestation_state":"computed","paper":{"title":"Increasing the Hardness of Posiform Planting Using Random QUBOs for Programmable Quantum Annealer Benchmarking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech","math.OC"],"primary_cat":"quant-ph","authors_text":"Elijah Pelofske, Georg Hahn, Hristo Djidjev","submitted_at":"2024-11-06T02:46:33Z","abstract_excerpt":"Posiform planting is a method for constructing QUBO problems with a single unique planted solution that can be tailored to arbitrary connectivity graphs. In this study we investigate making posiform planted QUBOs computationally harder by fusing many smaller random discrete coefficient spin-glass Ising models, whose global minimum energy is computed classically using classical binary integer programming optimization software, with posiform-planted QUBOs. The single unique ground-state solution of the resulting QUBO problem is the concatenation of (exactly one of) the ground-states of each of t"},"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":"2411.03626","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-11-06T02:46:33Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech","math.OC"],"title_canon_sha256":"eaf71231e3f66f5a6e12bce4ba3a124b3513ed9412e0d1c4a7f5425bbbf34f97","abstract_canon_sha256":"64fc6cb91d1a6ae17fbc42e7efcbb137dbc3bb1c7d476fe62ff863f35d0056c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:11:14.185874Z","signature_b64":"ntksDzcPdJwld4INZg9GXeibWC+gWpz2qWJhIGUzeIK8UxKrzid8/JaGQ6n3tRTDB4WlZecQIqfP04U2QrFhAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"398e584c5e5d24f456b134085322ab11fc906c9bed14d92177b54448b3672889","last_reissued_at":"2026-07-05T12:11:14.185311Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:11:14.185311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Increasing the Hardness of Posiform Planting Using Random QUBOs for Programmable Quantum Annealer Benchmarking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech","math.OC"],"primary_cat":"quant-ph","authors_text":"Elijah Pelofske, Georg Hahn, Hristo Djidjev","submitted_at":"2024-11-06T02:46:33Z","abstract_excerpt":"Posiform planting is a method for constructing QUBO problems with a single unique planted solution that can be tailored to arbitrary connectivity graphs. In this study we investigate making posiform planted QUBOs computationally harder by fusing many smaller random discrete coefficient spin-glass Ising models, whose global minimum energy is computed classically using classical binary integer programming optimization software, with posiform-planted QUBOs. The single unique ground-state solution of the resulting QUBO problem is the concatenation of (exactly one of) the ground-states of each of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.03626","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/2411.03626/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":"2411.03626","created_at":"2026-07-05T12:11:14.185388+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.03626v1","created_at":"2026-07-05T12:11:14.185388+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.03626","created_at":"2026-07-05T12:11:14.185388+00:00"},{"alias_kind":"pith_short_12","alias_value":"HGHFQTC6LUSP","created_at":"2026-07-05T12:11:14.185388+00:00"},{"alias_kind":"pith_short_16","alias_value":"HGHFQTC6LUSPIVVR","created_at":"2026-07-05T12:11:14.185388+00:00"},{"alias_kind":"pith_short_8","alias_value":"HGHFQTC6","created_at":"2026-07-05T12:11:14.185388+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.07460","citing_title":"Accuracy and Performance Evaluation of Quantum, Classical and Hybrid Solvers for the Max-Cut Problem","ref_index":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HGHFQTC6LUSPIVVRGQEFGIVLCH","json":"https://pith.science/pith/HGHFQTC6LUSPIVVRGQEFGIVLCH.json","graph_json":"https://pith.science/api/pith-number/HGHFQTC6LUSPIVVRGQEFGIVLCH/graph.json","events_json":"https://pith.science/api/pith-number/HGHFQTC6LUSPIVVRGQEFGIVLCH/events.json","paper":"https://pith.science/paper/HGHFQTC6"},"agent_actions":{"view_html":"https://pith.science/pith/HGHFQTC6LUSPIVVRGQEFGIVLCH","download_json":"https://pith.science/pith/HGHFQTC6LUSPIVVRGQEFGIVLCH.json","view_paper":"https://pith.science/paper/HGHFQTC6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.03626&json=true","fetch_graph":"https://pith.science/api/pith-number/HGHFQTC6LUSPIVVRGQEFGIVLCH/graph.json","fetch_events":"https://pith.science/api/pith-number/HGHFQTC6LUSPIVVRGQEFGIVLCH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HGHFQTC6LUSPIVVRGQEFGIVLCH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HGHFQTC6LUSPIVVRGQEFGIVLCH/action/storage_attestation","attest_author":"https://pith.science/pith/HGHFQTC6LUSPIVVRGQEFGIVLCH/action/author_attestation","sign_citation":"https://pith.science/pith/HGHFQTC6LUSPIVVRGQEFGIVLCH/action/citation_signature","submit_replication":"https://pith.science/pith/HGHFQTC6LUSPIVVRGQEFGIVLCH/action/replication_record"}},"created_at":"2026-07-05T12:11:14.185388+00:00","updated_at":"2026-07-05T12:11:14.185388+00:00"}