{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MYPUOEB6MNMMXTMXHJ3YCQP6RX","short_pith_number":"pith:MYPUOEB6","schema_version":"1.0","canonical_sha256":"661f47103e6358cbcd973a778141fe8df4502f84aead25a68482f8524cf6268c","source":{"kind":"arxiv","id":"1507.04774","version":2},"attestation_state":"computed","paper":{"title":"Fast clique minor generation in Chimera qubit connectivity graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","quant-ph"],"primary_cat":"cs.DM","authors_text":"Aidan Roy, Andrew D. King, Kelly Boothby","submitted_at":"2015-07-16T21:18:44Z","abstract_excerpt":"The current generation of D-Wave quantum annealing processor is designed to minimize the energy of an Ising spin configuration whose pairwise interactions lie on the edges of a {\\em Chimera} graph $\\mathcal C_{M,N,L}$. In order to solve an Ising spin problem with arbitrary pairwise interaction structure, the corresponding graph must be minor-embedded into a Chimera graph. We define a combinatorial class of {\\em native clique minors} in Chimera graphs with vertex images of uniform, near minimal size, and provide a polynomial-time algorithm that finds a maximum native clique minor in a given ind"},"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":"1507.04774","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-07-16T21:18:44Z","cross_cats_sorted":["cs.DS","quant-ph"],"title_canon_sha256":"443aaeb3afc3ac0f013eea1712465b7fcda259cd1f9f3b51fde5ae46cc0915fe","abstract_canon_sha256":"f051de1b47df2e3267f16596a3e7502ca64dbe2877e5ddfd5294919f1a82d4fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:52:04.834908Z","signature_b64":"iDZ+tU/xGG6k5Bf+MEZPkBtWdkYe5ObQmR5PABKhwdKyKyiYYGWk5Y4VX6sUeRxkf2j7a/iQkIi5NNPRnhfhDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"661f47103e6358cbcd973a778141fe8df4502f84aead25a68482f8524cf6268c","last_reissued_at":"2026-07-05T00:52:04.834542Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:52:04.834542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast clique minor generation in Chimera qubit connectivity graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","quant-ph"],"primary_cat":"cs.DM","authors_text":"Aidan Roy, Andrew D. King, Kelly Boothby","submitted_at":"2015-07-16T21:18:44Z","abstract_excerpt":"The current generation of D-Wave quantum annealing processor is designed to minimize the energy of an Ising spin configuration whose pairwise interactions lie on the edges of a {\\em Chimera} graph $\\mathcal C_{M,N,L}$. In order to solve an Ising spin problem with arbitrary pairwise interaction structure, the corresponding graph must be minor-embedded into a Chimera graph. We define a combinatorial class of {\\em native clique minors} in Chimera graphs with vertex images of uniform, near minimal size, and provide a polynomial-time algorithm that finds a maximum native clique minor in a given ind"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04774","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1507.04774/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1507.04774","created_at":"2026-07-05T00:52:04.834602+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.04774v2","created_at":"2026-07-05T00:52:04.834602+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04774","created_at":"2026-07-05T00:52:04.834602+00:00"},{"alias_kind":"pith_short_12","alias_value":"MYPUOEB6MNMM","created_at":"2026-07-05T00:52:04.834602+00:00"},{"alias_kind":"pith_short_16","alias_value":"MYPUOEB6MNMMXTMX","created_at":"2026-07-05T00:52:04.834602+00:00"},{"alias_kind":"pith_short_8","alias_value":"MYPUOEB6","created_at":"2026-07-05T00:52:04.834602+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.26534","citing_title":"Neural and Tensor Networks in the Study of Quantum Annealing Processors","ref_index":79,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MYPUOEB6MNMMXTMXHJ3YCQP6RX","json":"https://pith.science/pith/MYPUOEB6MNMMXTMXHJ3YCQP6RX.json","graph_json":"https://pith.science/api/pith-number/MYPUOEB6MNMMXTMXHJ3YCQP6RX/graph.json","events_json":"https://pith.science/api/pith-number/MYPUOEB6MNMMXTMXHJ3YCQP6RX/events.json","paper":"https://pith.science/paper/MYPUOEB6"},"agent_actions":{"view_html":"https://pith.science/pith/MYPUOEB6MNMMXTMXHJ3YCQP6RX","download_json":"https://pith.science/pith/MYPUOEB6MNMMXTMXHJ3YCQP6RX.json","view_paper":"https://pith.science/paper/MYPUOEB6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.04774&json=true","fetch_graph":"https://pith.science/api/pith-number/MYPUOEB6MNMMXTMXHJ3YCQP6RX/graph.json","fetch_events":"https://pith.science/api/pith-number/MYPUOEB6MNMMXTMXHJ3YCQP6RX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MYPUOEB6MNMMXTMXHJ3YCQP6RX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MYPUOEB6MNMMXTMXHJ3YCQP6RX/action/storage_attestation","attest_author":"https://pith.science/pith/MYPUOEB6MNMMXTMXHJ3YCQP6RX/action/author_attestation","sign_citation":"https://pith.science/pith/MYPUOEB6MNMMXTMXHJ3YCQP6RX/action/citation_signature","submit_replication":"https://pith.science/pith/MYPUOEB6MNMMXTMXHJ3YCQP6RX/action/replication_record"}},"created_at":"2026-07-05T00:52:04.834602+00:00","updated_at":"2026-07-05T00:52:04.834602+00:00"}