{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:JXZEES23LTNR476GKMMM2ERHLH","short_pith_number":"pith:JXZEES23","schema_version":"1.0","canonical_sha256":"4df2424b5b5cdb1e7fc65318cd122759e6ac39edf44faddbda3a704e678c022a","source":{"kind":"arxiv","id":"1608.08547","version":1},"attestation_state":"computed","paper":{"title":"Solving Set Cover with Pairs Problem Using Quantum Annealing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Debbie Perouli, Sabre Kais, Shuxian Jiang, Yudong Cao","submitted_at":"2016-08-30T16:30:59Z","abstract_excerpt":"Here we consider using quantum annealing to solve Set Cover with Pairs (SCP), an NP-hard combinatorial optimization problem that play an important role in networking, computational biology, and biochemistry. We show an explicit construction of Ising Hamiltonians whose ground states encode the solution of SCP instances. We numerically simulate the time-dependent Schr\\\"{o}dinger equation in order to test the performance of quantum annealing for random instances and compare with that of simulated annealing. We also discuss explicit embedding strategies for realizing our Hamiltonian construction o"},"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":"1608.08547","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-08-30T16:30:59Z","cross_cats_sorted":[],"title_canon_sha256":"7c90929dae8f23c42bfea32bb60771371fd372e931cf54b5eede3aa66dc08971","abstract_canon_sha256":"1debde5b525aa5d8c430ccfc60dcaefb9ca1459a14a89d3f22b741a545cfbd22"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:17.855302Z","signature_b64":"rZNWA5YqS/RoMGGdCizNbU0HJckoRDkWJFKsPxD0ypGBpJd97iLcHBaqCISzdhNm8J7YhkWT8pA4ccMSjLZrAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4df2424b5b5cdb1e7fc65318cd122759e6ac39edf44faddbda3a704e678c022a","last_reissued_at":"2026-05-18T01:07:17.854827Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:17.854827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Set Cover with Pairs Problem Using Quantum Annealing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Debbie Perouli, Sabre Kais, Shuxian Jiang, Yudong Cao","submitted_at":"2016-08-30T16:30:59Z","abstract_excerpt":"Here we consider using quantum annealing to solve Set Cover with Pairs (SCP), an NP-hard combinatorial optimization problem that play an important role in networking, computational biology, and biochemistry. We show an explicit construction of Ising Hamiltonians whose ground states encode the solution of SCP instances. We numerically simulate the time-dependent Schr\\\"{o}dinger equation in order to test the performance of quantum annealing for random instances and compare with that of simulated annealing. We also discuss explicit embedding strategies for realizing our Hamiltonian construction o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08547","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":""},"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":"1608.08547","created_at":"2026-05-18T01:07:17.854900+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.08547v1","created_at":"2026-05-18T01:07:17.854900+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08547","created_at":"2026-05-18T01:07:17.854900+00:00"},{"alias_kind":"pith_short_12","alias_value":"JXZEES23LTNR","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"JXZEES23LTNR476G","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"JXZEES23","created_at":"2026-05-18T12:30:25.849896+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/JXZEES23LTNR476GKMMM2ERHLH","json":"https://pith.science/pith/JXZEES23LTNR476GKMMM2ERHLH.json","graph_json":"https://pith.science/api/pith-number/JXZEES23LTNR476GKMMM2ERHLH/graph.json","events_json":"https://pith.science/api/pith-number/JXZEES23LTNR476GKMMM2ERHLH/events.json","paper":"https://pith.science/paper/JXZEES23"},"agent_actions":{"view_html":"https://pith.science/pith/JXZEES23LTNR476GKMMM2ERHLH","download_json":"https://pith.science/pith/JXZEES23LTNR476GKMMM2ERHLH.json","view_paper":"https://pith.science/paper/JXZEES23","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.08547&json=true","fetch_graph":"https://pith.science/api/pith-number/JXZEES23LTNR476GKMMM2ERHLH/graph.json","fetch_events":"https://pith.science/api/pith-number/JXZEES23LTNR476GKMMM2ERHLH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JXZEES23LTNR476GKMMM2ERHLH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JXZEES23LTNR476GKMMM2ERHLH/action/storage_attestation","attest_author":"https://pith.science/pith/JXZEES23LTNR476GKMMM2ERHLH/action/author_attestation","sign_citation":"https://pith.science/pith/JXZEES23LTNR476GKMMM2ERHLH/action/citation_signature","submit_replication":"https://pith.science/pith/JXZEES23LTNR476GKMMM2ERHLH/action/replication_record"}},"created_at":"2026-05-18T01:07:17.854900+00:00","updated_at":"2026-05-18T01:07:17.854900+00:00"}