{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:I47TWU6WKBE72BPY3PLYIKQAVX","short_pith_number":"pith:I47TWU6W","schema_version":"1.0","canonical_sha256":"473f3b53d65049fd05f8dbd7842a00adfd579809f866b7a0560a7437c08ab397","source":{"kind":"arxiv","id":"1612.07366","version":1},"attestation_state":"computed","paper":{"title":"Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MP","quant-ph"],"primary_cat":"math-ph","authors_text":"Kathleen E. Hamilton, Travis S. Humble","submitted_at":"2016-12-21T22:09:34Z","abstract_excerpt":"Using quantum annealing to solve an optimization problem requires minor embeddings of a logic graph into a known hardware graph. In an effort to reduce the complexity of the minor embedding problem, we introduce the minor set cover (MSC) of a known graph G: a subset of graph minors which contain any remaining minor of the graph as a subgraph. Any graph that can be embedded into G will be embeddable into a member of the MSC. Focusing on embedding into the hardware graph of commercially available quantum annealers, we establish the MSC for a particular known virtual hardware, which is a complete"},"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":"1612.07366","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2016-12-21T22:09:34Z","cross_cats_sorted":["math.MP","quant-ph"],"title_canon_sha256":"f30e950ebf07f9e3a9e2c3ccf89f0c6b5385352edaaef34f2d3e12e16967886a","abstract_canon_sha256":"070d9a2331289601c13877067f500f070e0f6c2605079002bdc31ecdc7f98d5b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:10.195363Z","signature_b64":"AkLrfVrJwaHw5L+2BDVXO3dWP/b8mMyZfMkJA6vpv9GN1PKF08kpQOwakLL5KOtjwl9nX8yRDWb8n26K82yMDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"473f3b53d65049fd05f8dbd7842a00adfd579809f866b7a0560a7437c08ab397","last_reissued_at":"2026-05-18T00:54:10.195002Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:10.195002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MP","quant-ph"],"primary_cat":"math-ph","authors_text":"Kathleen E. Hamilton, Travis S. Humble","submitted_at":"2016-12-21T22:09:34Z","abstract_excerpt":"Using quantum annealing to solve an optimization problem requires minor embeddings of a logic graph into a known hardware graph. In an effort to reduce the complexity of the minor embedding problem, we introduce the minor set cover (MSC) of a known graph G: a subset of graph minors which contain any remaining minor of the graph as a subgraph. Any graph that can be embedded into G will be embeddable into a member of the MSC. Focusing on embedding into the hardware graph of commercially available quantum annealers, we establish the MSC for a particular known virtual hardware, which is a complete"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.07366","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":"1612.07366","created_at":"2026-05-18T00:54:10.195055+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.07366v1","created_at":"2026-05-18T00:54:10.195055+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07366","created_at":"2026-05-18T00:54:10.195055+00:00"},{"alias_kind":"pith_short_12","alias_value":"I47TWU6WKBE7","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"I47TWU6WKBE72BPY","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"I47TWU6W","created_at":"2026-05-18T12:30:22.444734+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/I47TWU6WKBE72BPY3PLYIKQAVX","json":"https://pith.science/pith/I47TWU6WKBE72BPY3PLYIKQAVX.json","graph_json":"https://pith.science/api/pith-number/I47TWU6WKBE72BPY3PLYIKQAVX/graph.json","events_json":"https://pith.science/api/pith-number/I47TWU6WKBE72BPY3PLYIKQAVX/events.json","paper":"https://pith.science/paper/I47TWU6W"},"agent_actions":{"view_html":"https://pith.science/pith/I47TWU6WKBE72BPY3PLYIKQAVX","download_json":"https://pith.science/pith/I47TWU6WKBE72BPY3PLYIKQAVX.json","view_paper":"https://pith.science/paper/I47TWU6W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.07366&json=true","fetch_graph":"https://pith.science/api/pith-number/I47TWU6WKBE72BPY3PLYIKQAVX/graph.json","fetch_events":"https://pith.science/api/pith-number/I47TWU6WKBE72BPY3PLYIKQAVX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I47TWU6WKBE72BPY3PLYIKQAVX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I47TWU6WKBE72BPY3PLYIKQAVX/action/storage_attestation","attest_author":"https://pith.science/pith/I47TWU6WKBE72BPY3PLYIKQAVX/action/author_attestation","sign_citation":"https://pith.science/pith/I47TWU6WKBE72BPY3PLYIKQAVX/action/citation_signature","submit_replication":"https://pith.science/pith/I47TWU6WKBE72BPY3PLYIKQAVX/action/replication_record"}},"created_at":"2026-05-18T00:54:10.195055+00:00","updated_at":"2026-05-18T00:54:10.195055+00:00"}