{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4UQV6H52FCRNMMVCDD5UZBKYPW","short_pith_number":"pith:4UQV6H52","schema_version":"1.0","canonical_sha256":"e5215f1fba28a2d632a218fb4c85587db2ac2e588e208193363b8f00909b4707","source":{"kind":"arxiv","id":"1406.2741","version":1},"attestation_state":"computed","paper":{"title":"A practical heuristic for finding graph minors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"quant-ph","authors_text":"Aidan Roy, Jun Cai, William G. Macready","submitted_at":"2014-06-10T23:07:30Z","abstract_excerpt":"We present a heuristic algorithm for finding a graph $H$ as a minor of a graph $G$ that is practical for sparse $G$ and $H$ with hundreds of vertices. We also explain the practical importance of finding graph minors in mapping quadratic pseudo-boolean optimization problems onto an adiabatic quantum annealer."},"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":"1406.2741","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-06-10T23:07:30Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"14a8b0bc17dfa2cb8ef177d4f43f2de90a1adb9e81b82e6ede8c7a72d76c4c08","abstract_canon_sha256":"e182ba6c4fa09bfd403aa5f8a6cac426883bb30d1cf1f89d76c760f7d119f567"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:55.262471Z","signature_b64":"GyfoVi2gDrI/tC2ONGRKyuQTAiE07q6xUe+vZCl7mcrMypet7Vmp8V0XOf0+6z6YeekcJnRs0dSK8Dj581SpBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5215f1fba28a2d632a218fb4c85587db2ac2e588e208193363b8f00909b4707","last_reissued_at":"2026-05-18T02:49:55.261863Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:55.261863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A practical heuristic for finding graph minors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"quant-ph","authors_text":"Aidan Roy, Jun Cai, William G. Macready","submitted_at":"2014-06-10T23:07:30Z","abstract_excerpt":"We present a heuristic algorithm for finding a graph $H$ as a minor of a graph $G$ that is practical for sparse $G$ and $H$ with hundreds of vertices. We also explain the practical importance of finding graph minors in mapping quadratic pseudo-boolean optimization problems onto an adiabatic quantum annealer."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2741","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":"1406.2741","created_at":"2026-05-18T02:49:55.261946+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.2741v1","created_at":"2026-05-18T02:49:55.261946+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2741","created_at":"2026-05-18T02:49:55.261946+00:00"},{"alias_kind":"pith_short_12","alias_value":"4UQV6H52FCRN","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4UQV6H52FCRNMMVC","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4UQV6H52","created_at":"2026-05-18T12:28:14.216126+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":13,"internal_anchor_count":6,"sample":[{"citing_arxiv_id":"2603.09468","citing_title":"Multi-tasking through quantum annealing","ref_index":31,"is_internal_anchor":true},{"citing_arxiv_id":"2605.17604","citing_title":"Schedule-dependent basin occupation in a programmable quantum annealer","ref_index":25,"is_internal_anchor":true},{"citing_arxiv_id":"2605.17604","citing_title":"Schedule-dependent basin occupation in a programmable quantum annealer","ref_index":25,"is_internal_anchor":true},{"citing_arxiv_id":"2605.19381","citing_title":"Subsystem relaxation and a calibrated sampling diagnostic for programmable quantum annealers","ref_index":34,"is_internal_anchor":true},{"citing_arxiv_id":"2605.15899","citing_title":"Solving Classical and Quantum Spin Glasses with Deep Boltzmann Quantum States","ref_index":56,"is_internal_anchor":true},{"citing_arxiv_id":"2508.10660","citing_title":"Exploring Quantum Annealing for Coarse-Grained Protein Folding","ref_index":48,"is_internal_anchor":true},{"citing_arxiv_id":"2604.03433","citing_title":"New minor minimal non-apex graphs","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26534","citing_title":"Neural and Tensor Networks in the Study of Quantum Annealing Processors","ref_index":87,"is_internal_anchor":false},{"citing_arxiv_id":"2604.25433","citing_title":"Ember: An Extensible Benchmark Suite for Quantum Annealing Embedding Algorithms","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2604.25433","citing_title":"Ember: An Extensible Benchmark Suite for Quantum Annealing Embedding Algorithms","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2604.23819","citing_title":"Playing Dice with the Universe: Programming Quantum Computers to Play Traditional Games","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04736","citing_title":"Neural-powered unit disk graph embedding: qubits connectivity for some QUBO problems","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2604.10497","citing_title":"Entangled happily ever after: Wedding reception seating mapped to classical and quantum optimizers","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4UQV6H52FCRNMMVCDD5UZBKYPW","json":"https://pith.science/pith/4UQV6H52FCRNMMVCDD5UZBKYPW.json","graph_json":"https://pith.science/api/pith-number/4UQV6H52FCRNMMVCDD5UZBKYPW/graph.json","events_json":"https://pith.science/api/pith-number/4UQV6H52FCRNMMVCDD5UZBKYPW/events.json","paper":"https://pith.science/paper/4UQV6H52"},"agent_actions":{"view_html":"https://pith.science/pith/4UQV6H52FCRNMMVCDD5UZBKYPW","download_json":"https://pith.science/pith/4UQV6H52FCRNMMVCDD5UZBKYPW.json","view_paper":"https://pith.science/paper/4UQV6H52","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.2741&json=true","fetch_graph":"https://pith.science/api/pith-number/4UQV6H52FCRNMMVCDD5UZBKYPW/graph.json","fetch_events":"https://pith.science/api/pith-number/4UQV6H52FCRNMMVCDD5UZBKYPW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4UQV6H52FCRNMMVCDD5UZBKYPW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4UQV6H52FCRNMMVCDD5UZBKYPW/action/storage_attestation","attest_author":"https://pith.science/pith/4UQV6H52FCRNMMVCDD5UZBKYPW/action/author_attestation","sign_citation":"https://pith.science/pith/4UQV6H52FCRNMMVCDD5UZBKYPW/action/citation_signature","submit_replication":"https://pith.science/pith/4UQV6H52FCRNMMVCDD5UZBKYPW/action/replication_record"}},"created_at":"2026-05-18T02:49:55.261946+00:00","updated_at":"2026-05-18T02:49:55.261946+00:00"}