{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:EQ5Z3J33FN6BM5PVXPOQCTZ3WA","short_pith_number":"pith:EQ5Z3J33","schema_version":"1.0","canonical_sha256":"243b9da77b2b7c1675f5bbdd014f3bb01422267c3038fa64ee81ba520b514327","source":{"kind":"arxiv","id":"2209.05164","version":1},"attestation_state":"computed","paper":{"title":"Embedding the MIS problem for non-local graphs with bounded degree using 3D arrays of atoms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Constantin Dalyac, Loic Henriet","submitted_at":"2022-09-12T11:46:10Z","abstract_excerpt":"In the past years, many quantum algorithms have been proposed to tackle hard combinatorial problems. These algorithms, which have been studied in depth in complexity theory, are at the heart of many industrial applications. In particular, the Maximum Independent Set (MIS) is a known NP-hard problem that can be naturally encoded in Rydberg atom arrays. By representing a graph with an ensemble of neutral atoms one can leverage Rydberg dynamics to naturally encode the constraints and the solution to MIS. However, the classes of graphs that can be directly mapped node-to-atom on such devices are l"},"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":"2209.05164","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-09-12T11:46:10Z","cross_cats_sorted":[],"title_canon_sha256":"7a03a4e612b14d927154984256c826d2fa69567d3fb8365bd8f7b66b1f0b9562","abstract_canon_sha256":"6edaac3cc26ab10c1dc83fd600b4729fe904ef7d717f479d1bca6e4f0491c1c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:56:27.583352Z","signature_b64":"T80rSoAd44A3V7OxCWEAaukOfawQOSwtsPaMn6OTKhuCsUfT0VhTxWQa0eKuNK0ea6aXW28KlNT5dciyaJINBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"243b9da77b2b7c1675f5bbdd014f3bb01422267c3038fa64ee81ba520b514327","last_reissued_at":"2026-07-05T04:56:27.582864Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:56:27.582864Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Embedding the MIS problem for non-local graphs with bounded degree using 3D arrays of atoms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Constantin Dalyac, Loic Henriet","submitted_at":"2022-09-12T11:46:10Z","abstract_excerpt":"In the past years, many quantum algorithms have been proposed to tackle hard combinatorial problems. These algorithms, which have been studied in depth in complexity theory, are at the heart of many industrial applications. In particular, the Maximum Independent Set (MIS) is a known NP-hard problem that can be naturally encoded in Rydberg atom arrays. By representing a graph with an ensemble of neutral atoms one can leverage Rydberg dynamics to naturally encode the constraints and the solution to MIS. However, the classes of graphs that can be directly mapped node-to-atom on such devices are l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.05164","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2209.05164/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2209.05164","created_at":"2026-07-05T04:56:27.582915+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.05164v1","created_at":"2026-07-05T04:56:27.582915+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.05164","created_at":"2026-07-05T04:56:27.582915+00:00"},{"alias_kind":"pith_short_12","alias_value":"EQ5Z3J33FN6B","created_at":"2026-07-05T04:56:27.582915+00:00"},{"alias_kind":"pith_short_16","alias_value":"EQ5Z3J33FN6BM5PV","created_at":"2026-07-05T04:56:27.582915+00:00"},{"alias_kind":"pith_short_8","alias_value":"EQ5Z3J33","created_at":"2026-07-05T04:56:27.582915+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.16944","citing_title":"Efficient Hamiltonian Engineering for Adiabatic MIS Algorithms","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2605.16944","citing_title":"Efficient Hamiltonian Engineering for Adiabatic MIS Algorithms","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2605.14188","citing_title":"QOuLiPo: What a quantum computer sees when it reads a book","ref_index":63,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EQ5Z3J33FN6BM5PVXPOQCTZ3WA","json":"https://pith.science/pith/EQ5Z3J33FN6BM5PVXPOQCTZ3WA.json","graph_json":"https://pith.science/api/pith-number/EQ5Z3J33FN6BM5PVXPOQCTZ3WA/graph.json","events_json":"https://pith.science/api/pith-number/EQ5Z3J33FN6BM5PVXPOQCTZ3WA/events.json","paper":"https://pith.science/paper/EQ5Z3J33"},"agent_actions":{"view_html":"https://pith.science/pith/EQ5Z3J33FN6BM5PVXPOQCTZ3WA","download_json":"https://pith.science/pith/EQ5Z3J33FN6BM5PVXPOQCTZ3WA.json","view_paper":"https://pith.science/paper/EQ5Z3J33","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.05164&json=true","fetch_graph":"https://pith.science/api/pith-number/EQ5Z3J33FN6BM5PVXPOQCTZ3WA/graph.json","fetch_events":"https://pith.science/api/pith-number/EQ5Z3J33FN6BM5PVXPOQCTZ3WA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EQ5Z3J33FN6BM5PVXPOQCTZ3WA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EQ5Z3J33FN6BM5PVXPOQCTZ3WA/action/storage_attestation","attest_author":"https://pith.science/pith/EQ5Z3J33FN6BM5PVXPOQCTZ3WA/action/author_attestation","sign_citation":"https://pith.science/pith/EQ5Z3J33FN6BM5PVXPOQCTZ3WA/action/citation_signature","submit_replication":"https://pith.science/pith/EQ5Z3J33FN6BM5PVXPOQCTZ3WA/action/replication_record"}},"created_at":"2026-07-05T04:56:27.582915+00:00","updated_at":"2026-07-05T04:56:27.582915+00:00"}