{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZFHN7LX6UHD665ZRGD5VZQNWVG","short_pith_number":"pith:ZFHN7LX6","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"},"canonical_sha256":"c94edfaefea1c7ef773130fb5cc1b6a9848b9f27e733a2e858c8972eb5936284","source":{"kind":"arxiv","id":"1602.04274","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04274","created_at":"2026-05-18T01:11:17Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04274v2","created_at":"2026-05-18T01:11:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04274","created_at":"2026-05-18T01:11:17Z"},{"alias_kind":"pith_short_12","alias_value":"ZFHN7LX6UHD6","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZFHN7LX6UHD665ZR","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZFHN7LX6","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZFHN7LX6UHD665ZRGD5VZQNWVG","target":"record","payload":{"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"},"canonical_sha256":"c94edfaefea1c7ef773130fb5cc1b6a9848b9f27e733a2e858c8972eb5936284","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"},"source_kind":"arxiv","source_id":"1602.04274","source_version":2,"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-18T01:11:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O1yNcV8T8Qi6/o/miBVOZd1MCH0IUlcTvbq4y6RQ5nFotio/11GsUEHLjN3lx7bBA+VmzWjAWHBDKCLEETe9BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:33:23.271636Z"},"content_sha256":"9c4b9229008ae1fe433a36ceaa47f2f7486242313d8c112894ae119cfdd46f4e","schema_version":"1.0","event_id":"sha256:9c4b9229008ae1fe433a36ceaa47f2f7486242313d8c112894ae119cfdd46f4e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZFHN7LX6UHD665ZRGD5VZQNWVG","target":"graph","payload":{"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"},"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-18T01:11:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u4WBfgS0KV/WB+1Y7XOSBoOoaRm4j+vTuOu/2WaaAZwXYnrByg2QX6HJR1TsnK9Zm/cZ/LZrSGLysC/zxbwsAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:33:23.272346Z"},"content_sha256":"9960219eaffd0e79f99e58f1c3a6a0058f7b797580cfc12a9620b8fe04b712d1","schema_version":"1.0","event_id":"sha256:9960219eaffd0e79f99e58f1c3a6a0058f7b797580cfc12a9620b8fe04b712d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZFHN7LX6UHD665ZRGD5VZQNWVG/bundle.json","state_url":"https://pith.science/pith/ZFHN7LX6UHD665ZRGD5VZQNWVG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZFHN7LX6UHD665ZRGD5VZQNWVG/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-26T16:33:23Z","links":{"resolver":"https://pith.science/pith/ZFHN7LX6UHD665ZRGD5VZQNWVG","bundle":"https://pith.science/pith/ZFHN7LX6UHD665ZRGD5VZQNWVG/bundle.json","state":"https://pith.science/pith/ZFHN7LX6UHD665ZRGD5VZQNWVG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZFHN7LX6UHD665ZRGD5VZQNWVG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZFHN7LX6UHD665ZRGD5VZQNWVG","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":"47159357d017dcd5537672816846a900127d9392c9c8ee566932c99ad0379cdc","cross_cats_sorted":["cs.DS","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-02-13T03:05:01Z","title_canon_sha256":"73599b1f03597cef6ff80bd6a5975b2154a60c7e14416d6731586878e8558b32"},"schema_version":"1.0","source":{"id":"1602.04274","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04274","created_at":"2026-05-18T01:11:17Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04274v2","created_at":"2026-05-18T01:11:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04274","created_at":"2026-05-18T01:11:17Z"},{"alias_kind":"pith_short_12","alias_value":"ZFHN7LX6UHD6","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZFHN7LX6UHD665ZR","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZFHN7LX6","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:9960219eaffd0e79f99e58f1c3a6a0058f7b797580cfc12a9620b8fe04b712d1","target":"graph","created_at":"2026-05-18T01:11:17Z","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":"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","authors_text":"Arman Zaribafiyan, Dominic J.J. Marchand, Seyed Saeed Changiz Rezaei","cross_cats":["cs.DS","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-02-13T03:05:01Z","title":"Systematic and Deterministic Graph-Minor Embedding for Cartesian Products of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04274","kind":"arxiv","version":2},"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:9c4b9229008ae1fe433a36ceaa47f2f7486242313d8c112894ae119cfdd46f4e","target":"record","created_at":"2026-05-18T01:11:17Z","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":"47159357d017dcd5537672816846a900127d9392c9c8ee566932c99ad0379cdc","cross_cats_sorted":["cs.DS","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-02-13T03:05:01Z","title_canon_sha256":"73599b1f03597cef6ff80bd6a5975b2154a60c7e14416d6731586878e8558b32"},"schema_version":"1.0","source":{"id":"1602.04274","kind":"arxiv","version":2}},"canonical_sha256":"c94edfaefea1c7ef773130fb5cc1b6a9848b9f27e733a2e858c8972eb5936284","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c94edfaefea1c7ef773130fb5cc1b6a9848b9f27e733a2e858c8972eb5936284","first_computed_at":"2026-05-18T01:11:17.681355Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:17.681355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6lZIjV+00LxpXPqVHEbLEMgTHMUL9a0Nfaw6mdWRcNFMTLC2f8OkHunVF6s+gQgkSNkZ9cSJG1+JT0XxU/4PAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:17.682119Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.04274","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c4b9229008ae1fe433a36ceaa47f2f7486242313d8c112894ae119cfdd46f4e","sha256:9960219eaffd0e79f99e58f1c3a6a0058f7b797580cfc12a9620b8fe04b712d1"],"state_sha256":"52bc3dcb60ad521b1cebc6f5872a2717756a7b8baf611a0296c45fbd7643437d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pg6IdM96hUJdi1HRFDEraM/jBbduZtdlph6bA2+KQCh3e3scaEKztjQVtbyvZP1yegUkDl1H5tBkmbOKue5/Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:33:23.275640Z","bundle_sha256":"fe9b14e4fbd77d08c1053903ef71953a3d3caddeb59aa55c04bb4db8240a8e21"}}