{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ZFHN7LX6UHD665ZRGD5VZQNWVG","short_pith_number":"pith:ZFHN7LX6","schema_version":"1.0","canonical_sha256":"c94edfaefea1c7ef773130fb5cc1b6a9848b9f27e733a2e858c8972eb5936284","source":{"kind":"arxiv","id":"1602.04274","version":2},"attestation_state":"computed","paper":{"title":"Systematic and Deterministic Graph-Minor Embedding for Cartesian Products of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","quant-ph"],"primary_cat":"cs.DM","authors_text":"Arman Zaribafiyan, Dominic J.J. Marchand, Seyed Saeed Changiz Rezaei","submitted_at":"2016-02-13T03:05:01Z","abstract_excerpt":"The limited connectivity of current and next-generation quantum annealers motivates the need for efficient graph-minor embedding methods. These methods allow non-native problems to be adapted to the target annealer's architecture. The overhead of the widely used heuristic techniques is quickly proving to be a significant bottleneck for solving real-world applications. To alleviate this difficulty, we propose a systematic and deterministic embedding method, exploiting the structures of both the input graph of the specific problem and the quantum annealer. We focus on the specific case of the Ca"},"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":"1602.04274","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-02-13T03:05:01Z","cross_cats_sorted":["cs.DS","quant-ph"],"title_canon_sha256":"73599b1f03597cef6ff80bd6a5975b2154a60c7e14416d6731586878e8558b32","abstract_canon_sha256":"47159357d017dcd5537672816846a900127d9392c9c8ee566932c99ad0379cdc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:17.682119Z","signature_b64":"6lZIjV+00LxpXPqVHEbLEMgTHMUL9a0Nfaw6mdWRcNFMTLC2f8OkHunVF6s+gQgkSNkZ9cSJG1+JT0XxU/4PAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c94edfaefea1c7ef773130fb5cc1b6a9848b9f27e733a2e858c8972eb5936284","last_reissued_at":"2026-05-18T01:11:17.681355Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:17.681355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Systematic and Deterministic Graph-Minor Embedding for Cartesian Products of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","quant-ph"],"primary_cat":"cs.DM","authors_text":"Arman Zaribafiyan, Dominic J.J. Marchand, Seyed Saeed Changiz Rezaei","submitted_at":"2016-02-13T03:05:01Z","abstract_excerpt":"The limited connectivity of current and next-generation quantum annealers motivates the need for efficient graph-minor embedding methods. These methods allow non-native problems to be adapted to the target annealer's architecture. The overhead of the widely used heuristic techniques is quickly proving to be a significant bottleneck for solving real-world applications. To alleviate this difficulty, we propose a systematic and deterministic embedding method, exploiting the structures of both the input graph of the specific problem and the quantum annealer. We focus on the specific case of the Ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04274","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":"1602.04274","created_at":"2026-05-18T01:11:17.681495+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.04274v2","created_at":"2026-05-18T01:11:17.681495+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04274","created_at":"2026-05-18T01:11:17.681495+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZFHN7LX6UHD6","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZFHN7LX6UHD665ZR","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZFHN7LX6","created_at":"2026-05-18T12:30:53.716459+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/ZFHN7LX6UHD665ZRGD5VZQNWVG","json":"https://pith.science/pith/ZFHN7LX6UHD665ZRGD5VZQNWVG.json","graph_json":"https://pith.science/api/pith-number/ZFHN7LX6UHD665ZRGD5VZQNWVG/graph.json","events_json":"https://pith.science/api/pith-number/ZFHN7LX6UHD665ZRGD5VZQNWVG/events.json","paper":"https://pith.science/paper/ZFHN7LX6"},"agent_actions":{"view_html":"https://pith.science/pith/ZFHN7LX6UHD665ZRGD5VZQNWVG","download_json":"https://pith.science/pith/ZFHN7LX6UHD665ZRGD5VZQNWVG.json","view_paper":"https://pith.science/paper/ZFHN7LX6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.04274&json=true","fetch_graph":"https://pith.science/api/pith-number/ZFHN7LX6UHD665ZRGD5VZQNWVG/graph.json","fetch_events":"https://pith.science/api/pith-number/ZFHN7LX6UHD665ZRGD5VZQNWVG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZFHN7LX6UHD665ZRGD5VZQNWVG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZFHN7LX6UHD665ZRGD5VZQNWVG/action/storage_attestation","attest_author":"https://pith.science/pith/ZFHN7LX6UHD665ZRGD5VZQNWVG/action/author_attestation","sign_citation":"https://pith.science/pith/ZFHN7LX6UHD665ZRGD5VZQNWVG/action/citation_signature","submit_replication":"https://pith.science/pith/ZFHN7LX6UHD665ZRGD5VZQNWVG/action/replication_record"}},"created_at":"2026-05-18T01:11:17.681495+00:00","updated_at":"2026-05-18T01:11:17.681495+00:00"}