{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:2BKWEJK2C33XWQ3OR5CHA5RKUA","short_pith_number":"pith:2BKWEJK2","schema_version":"1.0","canonical_sha256":"d05562255a16f77b436e8f4470762aa029ae07dfb3fc9d3474f9ba5257f20e80","source":{"kind":"arxiv","id":"2412.14976","version":2},"attestation_state":"computed","paper":{"title":"Quantum Compilation Toolkit for Rydberg Atom Arrays with Implications for Problem Hardness and Quantum Speedups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.quant-gas","physics.atom-ph"],"primary_cat":"quant-ph","authors_text":"Atithi Acharya, Grant Salton, Helmut G. Katzgraber, Marco Pistoia, Martin J. A. Schuetz, Romina Yalovetzky, Ruben S. Andrist, Rudy Raymond, Shouvanik Chakrabarti, Yue Sun","submitted_at":"2024-12-19T15:51:33Z","abstract_excerpt":"We propose and implement a comprehensive quantum compilation toolkit for solving the maximum independent set (MIS) problem on quantum hardware based on Rydberg atom arrays. Our end-to-end pipeline involves three core components to efficiently map generic MIS instances onto Rydberg arrays with unit-disk connectivity, with modules for graph reduction, hardware compatibility checks, and graph embedding. The first module (reducer) provides hardware-agnostic and deterministic reduction logic that iteratively reduces the problem size via lazy clique removals. We find that real-world networks can typ"},"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":"2412.14976","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-12-19T15:51:33Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.quant-gas","physics.atom-ph"],"title_canon_sha256":"38fa4cbc00fc5c113764ed1e4992afdf66c62e6acc6414d03f1c5d4724743fd5","abstract_canon_sha256":"6e60226afb18849593646e395230c711ece22aaaacc5d1d5f5f175e7e7207543"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:00:45.196338Z","signature_b64":"/I8YD+TXEO+xmrTvFUx6kCReb/KGqwZUV4jDNwCIReV0h3bubgBlAJUSbhzPqwiWKX2y+0ox9Qw6oD5eVWWpDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d05562255a16f77b436e8f4470762aa029ae07dfb3fc9d3474f9ba5257f20e80","last_reissued_at":"2026-07-05T10:00:45.195854Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:00:45.195854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Compilation Toolkit for Rydberg Atom Arrays with Implications for Problem Hardness and Quantum Speedups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.quant-gas","physics.atom-ph"],"primary_cat":"quant-ph","authors_text":"Atithi Acharya, Grant Salton, Helmut G. Katzgraber, Marco Pistoia, Martin J. A. Schuetz, Romina Yalovetzky, Ruben S. Andrist, Rudy Raymond, Shouvanik Chakrabarti, Yue Sun","submitted_at":"2024-12-19T15:51:33Z","abstract_excerpt":"We propose and implement a comprehensive quantum compilation toolkit for solving the maximum independent set (MIS) problem on quantum hardware based on Rydberg atom arrays. Our end-to-end pipeline involves three core components to efficiently map generic MIS instances onto Rydberg arrays with unit-disk connectivity, with modules for graph reduction, hardware compatibility checks, and graph embedding. The first module (reducer) provides hardware-agnostic and deterministic reduction logic that iteratively reduces the problem size via lazy clique removals. We find that real-world networks can typ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.14976","kind":"arxiv","version":2},"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/2412.14976/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":"2412.14976","created_at":"2026-07-05T10:00:45.195914+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.14976v2","created_at":"2026-07-05T10:00:45.195914+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.14976","created_at":"2026-07-05T10:00:45.195914+00:00"},{"alias_kind":"pith_short_12","alias_value":"2BKWEJK2C33X","created_at":"2026-07-05T10:00:45.195914+00:00"},{"alias_kind":"pith_short_16","alias_value":"2BKWEJK2C33XWQ3O","created_at":"2026-07-05T10:00:45.195914+00:00"},{"alias_kind":"pith_short_8","alias_value":"2BKWEJK2","created_at":"2026-07-05T10:00:45.195914+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2503.17115","citing_title":"A quantum wire approach to weighted combinatorial graph optimisation problems","ref_index":39,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07952","citing_title":"Reducibility of native weighted graphs on Rydberg Arrays","ref_index":73,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2BKWEJK2C33XWQ3OR5CHA5RKUA","json":"https://pith.science/pith/2BKWEJK2C33XWQ3OR5CHA5RKUA.json","graph_json":"https://pith.science/api/pith-number/2BKWEJK2C33XWQ3OR5CHA5RKUA/graph.json","events_json":"https://pith.science/api/pith-number/2BKWEJK2C33XWQ3OR5CHA5RKUA/events.json","paper":"https://pith.science/paper/2BKWEJK2"},"agent_actions":{"view_html":"https://pith.science/pith/2BKWEJK2C33XWQ3OR5CHA5RKUA","download_json":"https://pith.science/pith/2BKWEJK2C33XWQ3OR5CHA5RKUA.json","view_paper":"https://pith.science/paper/2BKWEJK2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.14976&json=true","fetch_graph":"https://pith.science/api/pith-number/2BKWEJK2C33XWQ3OR5CHA5RKUA/graph.json","fetch_events":"https://pith.science/api/pith-number/2BKWEJK2C33XWQ3OR5CHA5RKUA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2BKWEJK2C33XWQ3OR5CHA5RKUA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2BKWEJK2C33XWQ3OR5CHA5RKUA/action/storage_attestation","attest_author":"https://pith.science/pith/2BKWEJK2C33XWQ3OR5CHA5RKUA/action/author_attestation","sign_citation":"https://pith.science/pith/2BKWEJK2C33XWQ3OR5CHA5RKUA/action/citation_signature","submit_replication":"https://pith.science/pith/2BKWEJK2C33XWQ3OR5CHA5RKUA/action/replication_record"}},"created_at":"2026-07-05T10:00:45.195914+00:00","updated_at":"2026-07-05T10:00:45.195914+00:00"}