{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:UDEA7WI2A3KRKWB2XTKBQL3JVB","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":"2118de5188965c806a4fb3a432b2b3fc98267e0170ba5e2017f60527c2d9db20","cross_cats_sorted":["cond-mat.dis-nn","cs.ET","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-01-20T21:26:17Z","title_canon_sha256":"df4a57f151b8053d78cb9ec4c830939e6bfa880dbf762e165733a58de5171362"},"schema_version":"1.0","source":{"id":"2301.08807","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.08807","created_at":"2026-07-05T07:56:46Z"},{"alias_kind":"arxiv_version","alias_value":"2301.08807v4","created_at":"2026-07-05T07:56:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.08807","created_at":"2026-07-05T07:56:46Z"},{"alias_kind":"pith_short_12","alias_value":"UDEA7WI2A3KR","created_at":"2026-07-05T07:56:46Z"},{"alias_kind":"pith_short_16","alias_value":"UDEA7WI2A3KRKWB2","created_at":"2026-07-05T07:56:46Z"},{"alias_kind":"pith_short_8","alias_value":"UDEA7WI2","created_at":"2026-07-05T07:56:46Z"}],"graph_snapshots":[{"event_id":"sha256:49f9dd4fbdd99a9eb1b8cc9b0d7a7884a9770a7aa112fc9cee21201ff30c1687","target":"graph","created_at":"2026-07-05T07:56:46Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2301.08807/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Quantum annealing is a quantum algorithm for computing solutions to combinatorial optimization problems. This study proposes a method for minor embedding optimization problems onto sparse quantum annealing hardware graphs called 4-clique network minor embedding. This method is in contrast to the standard minor embedding technique of using a path of linearly connected qubits in order to represent a logical variable state. The 4-clique minor embedding is possible on Pegasus graph connectivity, which is the native hardware graph for some of the current D-Wave quantum annealers. The Pegasus hardwa","authors_text":"Elijah Pelofske","cross_cats":["cond-mat.dis-nn","cs.ET","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-01-20T21:26:17Z","title":"4-clique Network Minor Embedding for Quantum Annealers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.08807","kind":"arxiv","version":4},"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:fcf9b1ea1b6f53bfdbd6dc399773c5258c22056387600aadcb87c0be87b00cd4","target":"record","created_at":"2026-07-05T07:56:46Z","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":"2118de5188965c806a4fb3a432b2b3fc98267e0170ba5e2017f60527c2d9db20","cross_cats_sorted":["cond-mat.dis-nn","cs.ET","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-01-20T21:26:17Z","title_canon_sha256":"df4a57f151b8053d78cb9ec4c830939e6bfa880dbf762e165733a58de5171362"},"schema_version":"1.0","source":{"id":"2301.08807","kind":"arxiv","version":4}},"canonical_sha256":"a0c80fd91a06d515583abcd4182f69a87b10b8a90d90d3076424380a59f128f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a0c80fd91a06d515583abcd4182f69a87b10b8a90d90d3076424380a59f128f7","first_computed_at":"2026-07-05T07:56:46.352949Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:56:46.352949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EAM8J0+5usSAhS95E6VipxhAgm1U1Fy0jkVDs3IWiWidzqKiybsex9OyeLB3ioeoPxpDOcjPEu5dux8PR5UQCA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:56:46.353444Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.08807","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fcf9b1ea1b6f53bfdbd6dc399773c5258c22056387600aadcb87c0be87b00cd4","sha256:49f9dd4fbdd99a9eb1b8cc9b0d7a7884a9770a7aa112fc9cee21201ff30c1687"],"state_sha256":"64842e8f6505a73db4202cb02b05d17cc1d3d1c0a8fd370e01a8f0fe7c45d73a"}