{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:3SXXF4EDL7PHWZBSX4JZXASKAS","short_pith_number":"pith:3SXXF4ED","schema_version":"1.0","canonical_sha256":"dcaf72f0835fde7b6432bf139b824a049a7b6c3c93fc50430fcadfd2cbfe07f4","source":{"kind":"arxiv","id":"1210.8395","version":2},"attestation_state":"computed","paper":{"title":"Adiabatic Quantum Programming: Minor Embedding With Hard Faults","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"quant-ph","authors_text":"Blair D. Sullivan, Christine Klymko, Travis S. Humble","submitted_at":"2012-10-31T17:05:50Z","abstract_excerpt":"Adiabatic quantum programming defines the time-dependent mapping of a quantum algorithm into an underlying hardware or logical fabric. An essential step is embedding problem-specific information into the quantum logical fabric. We present algorithms for embedding arbitrary instances of the adiabatic quantum optimization algorithm into a square lattice of specialized unit cells. These methods extend with fabric growth while scaling linearly in time and quadratically in footprint. We also provide methods for handling hard faults in the logical fabric without invoking approximations to the origin"},"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":"1210.8395","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-10-31T17:05:50Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a380a495308f24f46fdbc33becb372c502b8161d71e33ccabe165c8c03f1d23c","abstract_canon_sha256":"2c99d32a914c0b456a24efd9b298deba52944c75840978a2d5158748cd8dcefb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:21.086509Z","signature_b64":"UiXzogfTdwf2YUQxxnro7zbX7PeFYYaux2+F1IXJVs2NOQXrXU1cN4QnrIaBts55SFBJ+dlvACbpoov6upQYCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dcaf72f0835fde7b6432bf139b824a049a7b6c3c93fc50430fcadfd2cbfe07f4","last_reissued_at":"2026-05-18T03:41:21.086031Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:21.086031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adiabatic Quantum Programming: Minor Embedding With Hard Faults","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"quant-ph","authors_text":"Blair D. Sullivan, Christine Klymko, Travis S. Humble","submitted_at":"2012-10-31T17:05:50Z","abstract_excerpt":"Adiabatic quantum programming defines the time-dependent mapping of a quantum algorithm into an underlying hardware or logical fabric. An essential step is embedding problem-specific information into the quantum logical fabric. We present algorithms for embedding arbitrary instances of the adiabatic quantum optimization algorithm into a square lattice of specialized unit cells. These methods extend with fabric growth while scaling linearly in time and quadratically in footprint. We also provide methods for handling hard faults in the logical fabric without invoking approximations to the origin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.8395","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":""},"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":"1210.8395","created_at":"2026-05-18T03:41:21.086098+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.8395v2","created_at":"2026-05-18T03:41:21.086098+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.8395","created_at":"2026-05-18T03:41:21.086098+00:00"},{"alias_kind":"pith_short_12","alias_value":"3SXXF4EDL7PH","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"3SXXF4EDL7PHWZBS","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"3SXXF4ED","created_at":"2026-05-18T12:26:53.410803+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/3SXXF4EDL7PHWZBSX4JZXASKAS","json":"https://pith.science/pith/3SXXF4EDL7PHWZBSX4JZXASKAS.json","graph_json":"https://pith.science/api/pith-number/3SXXF4EDL7PHWZBSX4JZXASKAS/graph.json","events_json":"https://pith.science/api/pith-number/3SXXF4EDL7PHWZBSX4JZXASKAS/events.json","paper":"https://pith.science/paper/3SXXF4ED"},"agent_actions":{"view_html":"https://pith.science/pith/3SXXF4EDL7PHWZBSX4JZXASKAS","download_json":"https://pith.science/pith/3SXXF4EDL7PHWZBSX4JZXASKAS.json","view_paper":"https://pith.science/paper/3SXXF4ED","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.8395&json=true","fetch_graph":"https://pith.science/api/pith-number/3SXXF4EDL7PHWZBSX4JZXASKAS/graph.json","fetch_events":"https://pith.science/api/pith-number/3SXXF4EDL7PHWZBSX4JZXASKAS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3SXXF4EDL7PHWZBSX4JZXASKAS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3SXXF4EDL7PHWZBSX4JZXASKAS/action/storage_attestation","attest_author":"https://pith.science/pith/3SXXF4EDL7PHWZBSX4JZXASKAS/action/author_attestation","sign_citation":"https://pith.science/pith/3SXXF4EDL7PHWZBSX4JZXASKAS/action/citation_signature","submit_replication":"https://pith.science/pith/3SXXF4EDL7PHWZBSX4JZXASKAS/action/replication_record"}},"created_at":"2026-05-18T03:41:21.086098+00:00","updated_at":"2026-05-18T03:41:21.086098+00:00"}