{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:NLDFSM75BM3U4WFY65UIF7NYEW","short_pith_number":"pith:NLDFSM75","schema_version":"1.0","canonical_sha256":"6ac65933fd0b374e58b8f76882fdb825ab4da9e9c7c2fb883e88f311959489d7","source":{"kind":"arxiv","id":"2306.13373","version":1},"attestation_state":"computed","paper":{"title":"Exploring the impact of graph locality for the resolution of MIS with neutral atom devices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.atom-ph"],"primary_cat":"quant-ph","authors_text":"Constantin Dalyac, Jaewook Ahn, Lo\\\"ic Henriet, Louis-Paul Henry, Minhyuk Kim","submitted_at":"2023-06-23T08:53:16Z","abstract_excerpt":"In the past years, many quantum algorithms have been proposed to tackle hard combinatorial problems. 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 ``vertex-to-atom\" on standard devices with 2D capabilities are currently limited to Unit-Disk graphs. In this setting, the inherent spatial locality of the g"},"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":"2306.13373","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-06-23T08:53:16Z","cross_cats_sorted":["physics.atom-ph"],"title_canon_sha256":"6070f590228bf62be47f32ba0c53e5d4aad178fdca4c5a78e4b60d7268bf6ef4","abstract_canon_sha256":"ea650a7cb2813165d421e18242fdadb4d175189a3bcd368adf7d3443594fd155"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:24:04.706001Z","signature_b64":"c9l83ZXvr4D+ScVAYZxHL2/nOr2mVukfctgp38fzYzMCcen8tVHr77q8i1CUA4RAot3MiJqFWZxj9Om1/sftAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ac65933fd0b374e58b8f76882fdb825ab4da9e9c7c2fb883e88f311959489d7","last_reissued_at":"2026-07-05T06:24:04.705576Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:24:04.705576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploring the impact of graph locality for the resolution of MIS with neutral atom devices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.atom-ph"],"primary_cat":"quant-ph","authors_text":"Constantin Dalyac, Jaewook Ahn, Lo\\\"ic Henriet, Louis-Paul Henry, Minhyuk Kim","submitted_at":"2023-06-23T08:53:16Z","abstract_excerpt":"In the past years, many quantum algorithms have been proposed to tackle hard combinatorial problems. 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 ``vertex-to-atom\" on standard devices with 2D capabilities are currently limited to Unit-Disk graphs. In this setting, the inherent spatial locality of the g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.13373","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/2306.13373/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":"2306.13373","created_at":"2026-07-05T06:24:04.705637+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.13373v1","created_at":"2026-07-05T06:24:04.705637+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.13373","created_at":"2026-07-05T06:24:04.705637+00:00"},{"alias_kind":"pith_short_12","alias_value":"NLDFSM75BM3U","created_at":"2026-07-05T06:24:04.705637+00:00"},{"alias_kind":"pith_short_16","alias_value":"NLDFSM75BM3U4WFY","created_at":"2026-07-05T06:24:04.705637+00:00"},{"alias_kind":"pith_short_8","alias_value":"NLDFSM75","created_at":"2026-07-05T06:24:04.705637+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2503.17115","citing_title":"A quantum wire approach to weighted combinatorial graph optimisation problems","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2605.16944","citing_title":"Efficient Hamiltonian Engineering for Adiabatic MIS Algorithms","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2605.16944","citing_title":"Efficient Hamiltonian Engineering for Adiabatic MIS Algorithms","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07952","citing_title":"Reducibility of native weighted graphs on Rydberg Arrays","ref_index":62,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NLDFSM75BM3U4WFY65UIF7NYEW","json":"https://pith.science/pith/NLDFSM75BM3U4WFY65UIF7NYEW.json","graph_json":"https://pith.science/api/pith-number/NLDFSM75BM3U4WFY65UIF7NYEW/graph.json","events_json":"https://pith.science/api/pith-number/NLDFSM75BM3U4WFY65UIF7NYEW/events.json","paper":"https://pith.science/paper/NLDFSM75"},"agent_actions":{"view_html":"https://pith.science/pith/NLDFSM75BM3U4WFY65UIF7NYEW","download_json":"https://pith.science/pith/NLDFSM75BM3U4WFY65UIF7NYEW.json","view_paper":"https://pith.science/paper/NLDFSM75","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.13373&json=true","fetch_graph":"https://pith.science/api/pith-number/NLDFSM75BM3U4WFY65UIF7NYEW/graph.json","fetch_events":"https://pith.science/api/pith-number/NLDFSM75BM3U4WFY65UIF7NYEW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NLDFSM75BM3U4WFY65UIF7NYEW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NLDFSM75BM3U4WFY65UIF7NYEW/action/storage_attestation","attest_author":"https://pith.science/pith/NLDFSM75BM3U4WFY65UIF7NYEW/action/author_attestation","sign_citation":"https://pith.science/pith/NLDFSM75BM3U4WFY65UIF7NYEW/action/citation_signature","submit_replication":"https://pith.science/pith/NLDFSM75BM3U4WFY65UIF7NYEW/action/replication_record"}},"created_at":"2026-07-05T06:24:04.705637+00:00","updated_at":"2026-07-05T06:24:04.705637+00:00"}