{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:SLV7I4FLSGU6PHKZ4XE2ZOFWT5","short_pith_number":"pith:SLV7I4FL","schema_version":"1.0","canonical_sha256":"92ebf470ab91a9e79d59e5c9acb8b69f4a75db5097c8aaf96912958050a41ad5","source":{"kind":"arxiv","id":"1602.07942","version":2},"attestation_state":"computed","paper":{"title":"Driver Hamiltonians for constrained optimization in quantum annealing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Itay Hen, Marcelo S. Sarandy","submitted_at":"2016-02-25T14:21:38Z","abstract_excerpt":"One of the current major challenges surrounding the use of quantum annealers for solving practical optimization problems is their inability to encode even moderately sized problems---the main reason for this being the rigid layout of their quantum bits as well as their sparse connectivity. In particular, the implementation of constraints has become a major bottleneck in the embedding of practical problems, because the latter is typically achieved by adding harmful penalty terms to the problem Hamiltonian --- a technique that often requires an `all-to-all' connectivity between the qubits. Recen"},"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":"1602.07942","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-02-25T14:21:38Z","cross_cats_sorted":[],"title_canon_sha256":"e5412afafc032f967253d5c9165317e402dcc9c514f17fc6abe771d24ffcd2b9","abstract_canon_sha256":"8aded4d218e261dcd418e77b2818d5a9cfd4732070ce90aa2a30d8ff2662bfc5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:36.601226Z","signature_b64":"2rAkqXAynwwwWz8FIcdZoewP2L2pOF7piD7g3ndgT8zdBRP6kxhFXxqIpzf7Ef9GiXjzhG4dNLGfSOvwk9S8Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92ebf470ab91a9e79d59e5c9acb8b69f4a75db5097c8aaf96912958050a41ad5","last_reissued_at":"2026-05-18T01:03:36.600672Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:36.600672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Driver Hamiltonians for constrained optimization in quantum annealing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Itay Hen, Marcelo S. Sarandy","submitted_at":"2016-02-25T14:21:38Z","abstract_excerpt":"One of the current major challenges surrounding the use of quantum annealers for solving practical optimization problems is their inability to encode even moderately sized problems---the main reason for this being the rigid layout of their quantum bits as well as their sparse connectivity. In particular, the implementation of constraints has become a major bottleneck in the embedding of practical problems, because the latter is typically achieved by adding harmful penalty terms to the problem Hamiltonian --- a technique that often requires an `all-to-all' connectivity between the qubits. Recen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07942","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":""},"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":"1602.07942","created_at":"2026-05-18T01:03:36.600750+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.07942v2","created_at":"2026-05-18T01:03:36.600750+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07942","created_at":"2026-05-18T01:03:36.600750+00:00"},{"alias_kind":"pith_short_12","alias_value":"SLV7I4FLSGU6","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"SLV7I4FLSGU6PHKZ","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"SLV7I4FL","created_at":"2026-05-18T12:30:44.179134+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SLV7I4FLSGU6PHKZ4XE2ZOFWT5","json":"https://pith.science/pith/SLV7I4FLSGU6PHKZ4XE2ZOFWT5.json","graph_json":"https://pith.science/api/pith-number/SLV7I4FLSGU6PHKZ4XE2ZOFWT5/graph.json","events_json":"https://pith.science/api/pith-number/SLV7I4FLSGU6PHKZ4XE2ZOFWT5/events.json","paper":"https://pith.science/paper/SLV7I4FL"},"agent_actions":{"view_html":"https://pith.science/pith/SLV7I4FLSGU6PHKZ4XE2ZOFWT5","download_json":"https://pith.science/pith/SLV7I4FLSGU6PHKZ4XE2ZOFWT5.json","view_paper":"https://pith.science/paper/SLV7I4FL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.07942&json=true","fetch_graph":"https://pith.science/api/pith-number/SLV7I4FLSGU6PHKZ4XE2ZOFWT5/graph.json","fetch_events":"https://pith.science/api/pith-number/SLV7I4FLSGU6PHKZ4XE2ZOFWT5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SLV7I4FLSGU6PHKZ4XE2ZOFWT5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SLV7I4FLSGU6PHKZ4XE2ZOFWT5/action/storage_attestation","attest_author":"https://pith.science/pith/SLV7I4FLSGU6PHKZ4XE2ZOFWT5/action/author_attestation","sign_citation":"https://pith.science/pith/SLV7I4FLSGU6PHKZ4XE2ZOFWT5/action/citation_signature","submit_replication":"https://pith.science/pith/SLV7I4FLSGU6PHKZ4XE2ZOFWT5/action/replication_record"}},"created_at":"2026-05-18T01:03:36.600750+00:00","updated_at":"2026-05-18T01:03:36.600750+00:00"}