{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:I47TWU6WKBE72BPY3PLYIKQAVX","short_pith_number":"pith:I47TWU6W","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"},"canonical_sha256":"473f3b53d65049fd05f8dbd7842a00adfd579809f866b7a0560a7437c08ab397","source":{"kind":"arxiv","id":"1612.07366","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.07366","created_at":"2026-05-18T00:54:10Z"},{"alias_kind":"arxiv_version","alias_value":"1612.07366v1","created_at":"2026-05-18T00:54:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07366","created_at":"2026-05-18T00:54:10Z"},{"alias_kind":"pith_short_12","alias_value":"I47TWU6WKBE7","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"I47TWU6WKBE72BPY","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"I47TWU6W","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:I47TWU6WKBE72BPY3PLYIKQAVX","target":"record","payload":{"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"},"canonical_sha256":"473f3b53d65049fd05f8dbd7842a00adfd579809f866b7a0560a7437c08ab397","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"},"source_kind":"arxiv","source_id":"1612.07366","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:54:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xKCIrNu59YJkYwsnk7VoDvo1w+bmAjk/8tBaxJVCQIHAzBc7RE3FborF46YTnec2El2Y15YG4mzk7Lq0Bv7ZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:27:50.238929Z"},"content_sha256":"5586494e75f3021e6e1405845366c3ac87f4e53b43dd4883f74cdc9d8b4a4bb0","schema_version":"1.0","event_id":"sha256:5586494e75f3021e6e1405845366c3ac87f4e53b43dd4883f74cdc9d8b4a4bb0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:I47TWU6WKBE72BPY3PLYIKQAVX","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:54:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VLN0TYykxzn2Mtm3dxjppZhhp9IirTLh2vgZvsxubi+P437nRM7949DPE3J4Wo6ZgiA5dqSrpCdKwzz/OYaHCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:27:50.239590Z"},"content_sha256":"c2f262d01a2f0fd90963f2846768a6635e34ae158755b936e7acbce3ea725a27","schema_version":"1.0","event_id":"sha256:c2f262d01a2f0fd90963f2846768a6635e34ae158755b936e7acbce3ea725a27"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I47TWU6WKBE72BPY3PLYIKQAVX/bundle.json","state_url":"https://pith.science/pith/I47TWU6WKBE72BPY3PLYIKQAVX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I47TWU6WKBE72BPY3PLYIKQAVX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T15:27:50Z","links":{"resolver":"https://pith.science/pith/I47TWU6WKBE72BPY3PLYIKQAVX","bundle":"https://pith.science/pith/I47TWU6WKBE72BPY3PLYIKQAVX/bundle.json","state":"https://pith.science/pith/I47TWU6WKBE72BPY3PLYIKQAVX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I47TWU6WKBE72BPY3PLYIKQAVX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:I47TWU6WKBE72BPY3PLYIKQAVX","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"070d9a2331289601c13877067f500f070e0f6c2605079002bdc31ecdc7f98d5b","cross_cats_sorted":["math.MP","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2016-12-21T22:09:34Z","title_canon_sha256":"f30e950ebf07f9e3a9e2c3ccf89f0c6b5385352edaaef34f2d3e12e16967886a"},"schema_version":"1.0","source":{"id":"1612.07366","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.07366","created_at":"2026-05-18T00:54:10Z"},{"alias_kind":"arxiv_version","alias_value":"1612.07366v1","created_at":"2026-05-18T00:54:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07366","created_at":"2026-05-18T00:54:10Z"},{"alias_kind":"pith_short_12","alias_value":"I47TWU6WKBE7","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"I47TWU6WKBE72BPY","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"I47TWU6W","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:c2f262d01a2f0fd90963f2846768a6635e34ae158755b936e7acbce3ea725a27","target":"graph","created_at":"2026-05-18T00:54:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Kathleen E. Hamilton, Travis S. Humble","cross_cats":["math.MP","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2016-12-21T22:09:34Z","title":"Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.07366","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5586494e75f3021e6e1405845366c3ac87f4e53b43dd4883f74cdc9d8b4a4bb0","target":"record","created_at":"2026-05-18T00:54:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"070d9a2331289601c13877067f500f070e0f6c2605079002bdc31ecdc7f98d5b","cross_cats_sorted":["math.MP","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2016-12-21T22:09:34Z","title_canon_sha256":"f30e950ebf07f9e3a9e2c3ccf89f0c6b5385352edaaef34f2d3e12e16967886a"},"schema_version":"1.0","source":{"id":"1612.07366","kind":"arxiv","version":1}},"canonical_sha256":"473f3b53d65049fd05f8dbd7842a00adfd579809f866b7a0560a7437c08ab397","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"473f3b53d65049fd05f8dbd7842a00adfd579809f866b7a0560a7437c08ab397","first_computed_at":"2026-05-18T00:54:10.195002Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:10.195002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AkLrfVrJwaHw5L+2BDVXO3dWP/b8mMyZfMkJA6vpv9GN1PKF08kpQOwakLL5KOtjwl9nX8yRDWb8n26K82yMDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:10.195363Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.07366","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5586494e75f3021e6e1405845366c3ac87f4e53b43dd4883f74cdc9d8b4a4bb0","sha256:c2f262d01a2f0fd90963f2846768a6635e34ae158755b936e7acbce3ea725a27"],"state_sha256":"55872d52b1d64818ea09388b2b12a121fef21cd06252c0bab369ee350935c495"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AFErd6b8Uv4sZ8ztntQS8hMNc+AlpSZAqUFyMlIGHoMiP7ZTTYkby6B1+PEQFrPW/y8gbSP3D17ay3vaBM/mDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T15:27:50.242932Z","bundle_sha256":"0411bc61fbfeaf6ddd9160afff1bdae80951cab7d1f1d5339582035f20fa56c4"}}