{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DRDQJHDRRB6QJBTJR4JX5YNZ43","short_pith_number":"pith:DRDQJHDR","schema_version":"1.0","canonical_sha256":"1c47049c71887d0486698f137ee1b9e6d7601aaa1ccc7df85ee0c67989c25819","source":{"kind":"arxiv","id":"1604.00651","version":3},"attestation_state":"computed","paper":{"title":"A Direct Mapping of Max k-SAT and High Order Parity Checks to a Chimera Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Nicholas Chancellor, Paul A. Warburton, Simon C. Benjamin, Stefan Zohren, Stephen Roberts","submitted_at":"2016-04-03T16:28:14Z","abstract_excerpt":"We demonstrate a direct mapping of max k-SAT problems (and weighted max k-SAT) to a Chimera graph, which is the non-planar hardware graph of the devices built by D-Wave Systems Inc. We further show that this mapping can be used to map a similar class of maximum satisfiability problems where the clauses are replaced by parity checks over potentially large numbers of bits. The latter is of specific interest for applications in decoding for communication. We discuss an example in which the decoding of a turbo code, which has been demonstrated to perform near the Shannon limit, can be mapped to a "},"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":"1604.00651","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-04-03T16:28:14Z","cross_cats_sorted":[],"title_canon_sha256":"8566b4feda8bf5790839c78987a3e523e84b780e46a46b7461dd40d31a976db9","abstract_canon_sha256":"8ffe0d808819cf39f6c4a7e7acc8219d646005ad35ef7aae8a6ca79c3fd75dbe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:44.074917Z","signature_b64":"7+i9BQDav5our0+T6advWQnU02M+TCAffi7+ON3qjm6QT6L2qMkk6+HCHQGl8R6Prz0vuvzHcqHZzEAaUqoICA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c47049c71887d0486698f137ee1b9e6d7601aaa1ccc7df85ee0c67989c25819","last_reissued_at":"2026-05-18T00:57:44.074380Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:44.074380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Direct Mapping of Max k-SAT and High Order Parity Checks to a Chimera Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Nicholas Chancellor, Paul A. Warburton, Simon C. Benjamin, Stefan Zohren, Stephen Roberts","submitted_at":"2016-04-03T16:28:14Z","abstract_excerpt":"We demonstrate a direct mapping of max k-SAT problems (and weighted max k-SAT) to a Chimera graph, which is the non-planar hardware graph of the devices built by D-Wave Systems Inc. We further show that this mapping can be used to map a similar class of maximum satisfiability problems where the clauses are replaced by parity checks over potentially large numbers of bits. The latter is of specific interest for applications in decoding for communication. We discuss an example in which the decoding of a turbo code, which has been demonstrated to perform near the Shannon limit, can be mapped to a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00651","kind":"arxiv","version":3},"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":"1604.00651","created_at":"2026-05-18T00:57:44.074471+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.00651v3","created_at":"2026-05-18T00:57:44.074471+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00651","created_at":"2026-05-18T00:57:44.074471+00:00"},{"alias_kind":"pith_short_12","alias_value":"DRDQJHDRRB6Q","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DRDQJHDRRB6QJBTJ","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DRDQJHDR","created_at":"2026-05-18T12:30:12.583610+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/DRDQJHDRRB6QJBTJR4JX5YNZ43","json":"https://pith.science/pith/DRDQJHDRRB6QJBTJR4JX5YNZ43.json","graph_json":"https://pith.science/api/pith-number/DRDQJHDRRB6QJBTJR4JX5YNZ43/graph.json","events_json":"https://pith.science/api/pith-number/DRDQJHDRRB6QJBTJR4JX5YNZ43/events.json","paper":"https://pith.science/paper/DRDQJHDR"},"agent_actions":{"view_html":"https://pith.science/pith/DRDQJHDRRB6QJBTJR4JX5YNZ43","download_json":"https://pith.science/pith/DRDQJHDRRB6QJBTJR4JX5YNZ43.json","view_paper":"https://pith.science/paper/DRDQJHDR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.00651&json=true","fetch_graph":"https://pith.science/api/pith-number/DRDQJHDRRB6QJBTJR4JX5YNZ43/graph.json","fetch_events":"https://pith.science/api/pith-number/DRDQJHDRRB6QJBTJR4JX5YNZ43/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DRDQJHDRRB6QJBTJR4JX5YNZ43/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DRDQJHDRRB6QJBTJR4JX5YNZ43/action/storage_attestation","attest_author":"https://pith.science/pith/DRDQJHDRRB6QJBTJR4JX5YNZ43/action/author_attestation","sign_citation":"https://pith.science/pith/DRDQJHDRRB6QJBTJR4JX5YNZ43/action/citation_signature","submit_replication":"https://pith.science/pith/DRDQJHDRRB6QJBTJR4JX5YNZ43/action/replication_record"}},"created_at":"2026-05-18T00:57:44.074471+00:00","updated_at":"2026-05-18T00:57:44.074471+00:00"}