{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:7FVMRGTRDCHUQVZC4UJ7AN3BFO","short_pith_number":"pith:7FVMRGTR","schema_version":"1.0","canonical_sha256":"f96ac89a71188f485722e513f037612b94559c66e3f6df6ee926d8c7e7def058","source":{"kind":"arxiv","id":"2309.14847","version":1},"attestation_state":"computed","paper":{"title":"Rydberg-atom graphs for quadratic unconstrained binary optimization problems","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew Byun, Heejeong Jeong, Jaewook Ahn, Junwoo Jung, Kangheun Kim, Minhyuk Kim, Seokho Jeong","submitted_at":"2023-09-26T11:22:38Z","abstract_excerpt":"There is a growing interest in harnessing the potential of the Rydberg-atom system to address complex combinatorial optimization challenges. Here we present an experimental demonstration of how the quadratic unconstrained binary optimization (QUBO) problem can be effectively addressed using Rydberg-atom graphs. The Rydberg-atom graphs are configurations of neutral atoms organized into mathematical graphs, facilitated by programmable optical tweezers, and designed to exhibit many-body ground states that correspond to the maximum independent set (MIS) of their respective graphs. We have develope"},"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":"2309.14847","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2023-09-26T11:22:38Z","cross_cats_sorted":[],"title_canon_sha256":"91a977f8eb5c67374db564469b6d404131ac07a8b93a7c8f0ac7c085b05b92c9","abstract_canon_sha256":"d4dd894b5d677a0e8ba01e911c90bd60716f0a902d86718a344d97341a7aa6e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:38:53.796927Z","signature_b64":"WUMyFjIc9IEoN0YlpjK8SZVeiRNdmdSPKp3eMsY7Z170GIYt8K/0UkTfiEH+MDVWM6WKhOl7PYIgG3Rsnwg4BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f96ac89a71188f485722e513f037612b94559c66e3f6df6ee926d8c7e7def058","last_reissued_at":"2026-07-05T08:38:53.796465Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:38:53.796465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rydberg-atom graphs for quadratic unconstrained binary optimization problems","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew Byun, Heejeong Jeong, Jaewook Ahn, Junwoo Jung, Kangheun Kim, Minhyuk Kim, Seokho Jeong","submitted_at":"2023-09-26T11:22:38Z","abstract_excerpt":"There is a growing interest in harnessing the potential of the Rydberg-atom system to address complex combinatorial optimization challenges. Here we present an experimental demonstration of how the quadratic unconstrained binary optimization (QUBO) problem can be effectively addressed using Rydberg-atom graphs. The Rydberg-atom graphs are configurations of neutral atoms organized into mathematical graphs, facilitated by programmable optical tweezers, and designed to exhibit many-body ground states that correspond to the maximum independent set (MIS) of their respective graphs. We have develope"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.14847","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/2309.14847/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":"2309.14847","created_at":"2026-07-05T08:38:53.796521+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.14847v1","created_at":"2026-07-05T08:38:53.796521+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.14847","created_at":"2026-07-05T08:38:53.796521+00:00"},{"alias_kind":"pith_short_12","alias_value":"7FVMRGTRDCHU","created_at":"2026-07-05T08:38:53.796521+00:00"},{"alias_kind":"pith_short_16","alias_value":"7FVMRGTRDCHUQVZC","created_at":"2026-07-05T08:38:53.796521+00:00"},{"alias_kind":"pith_short_8","alias_value":"7FVMRGTR","created_at":"2026-07-05T08:38:53.796521+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.14976","citing_title":"Quantum Compilation Toolkit for Rydberg Atom Arrays with Implications for Problem Hardness and Quantum Speedups","ref_index":45,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7FVMRGTRDCHUQVZC4UJ7AN3BFO","json":"https://pith.science/pith/7FVMRGTRDCHUQVZC4UJ7AN3BFO.json","graph_json":"https://pith.science/api/pith-number/7FVMRGTRDCHUQVZC4UJ7AN3BFO/graph.json","events_json":"https://pith.science/api/pith-number/7FVMRGTRDCHUQVZC4UJ7AN3BFO/events.json","paper":"https://pith.science/paper/7FVMRGTR"},"agent_actions":{"view_html":"https://pith.science/pith/7FVMRGTRDCHUQVZC4UJ7AN3BFO","download_json":"https://pith.science/pith/7FVMRGTRDCHUQVZC4UJ7AN3BFO.json","view_paper":"https://pith.science/paper/7FVMRGTR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.14847&json=true","fetch_graph":"https://pith.science/api/pith-number/7FVMRGTRDCHUQVZC4UJ7AN3BFO/graph.json","fetch_events":"https://pith.science/api/pith-number/7FVMRGTRDCHUQVZC4UJ7AN3BFO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7FVMRGTRDCHUQVZC4UJ7AN3BFO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7FVMRGTRDCHUQVZC4UJ7AN3BFO/action/storage_attestation","attest_author":"https://pith.science/pith/7FVMRGTRDCHUQVZC4UJ7AN3BFO/action/author_attestation","sign_citation":"https://pith.science/pith/7FVMRGTRDCHUQVZC4UJ7AN3BFO/action/citation_signature","submit_replication":"https://pith.science/pith/7FVMRGTRDCHUQVZC4UJ7AN3BFO/action/replication_record"}},"created_at":"2026-07-05T08:38:53.796521+00:00","updated_at":"2026-07-05T08:38:53.796521+00:00"}