{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:NJM4JD2XTW4YMQBGRYC7KCBDKQ","short_pith_number":"pith:NJM4JD2X","schema_version":"1.0","canonical_sha256":"6a59c48f579db98640268e05f50823543f3d1f1c5ad4da12bea91c830d6102f4","source":{"kind":"arxiv","id":"2502.04291","version":1},"attestation_state":"computed","paper":{"title":"Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aymeric Fran\\c{c}ois, Constantin Dalyac, Florian Sikora, Lo\\\"ic Henriet, Lucas Leclerc, Malory Marin, Monique Witt Garzillo, Pierre Cazals, R\\'emi Watrigant, Vittorio Vitale, Wesley da Silva Coelho, Yassine Naghmouchi","submitted_at":"2025-02-06T18:34:59Z","abstract_excerpt":"The Maximum Independent Set (MIS) problem is a fundamental combinatorial optimization task that can be naturally mapped onto the Ising Hamiltonian of neutral atom quantum processors. Given its connection to NP-hard problems and real-world applications, there has been significant experimental interest in exploring quantum advantage for MIS. Pioneering experiments on King's Lattice graphs suggested a quadratic speed-up over simulated annealing, but recent benchmarks using state-of-the-art methods found no clear advantage, likely due to the structured nature of the tested instances. In this work,"},"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":"2502.04291","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-02-06T18:34:59Z","cross_cats_sorted":[],"title_canon_sha256":"e69cc1872d9e112aa01a266d52b5bdb4a89b68776491946bcb2f96498c5c557f","abstract_canon_sha256":"f100b23f1bdca46a3470536d3d0bf9a9e9426ccb9a4826ec83d2ffd48000bcd8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:10:36.282119Z","signature_b64":"snmj7JVnFciT9L8tqQHz9tha7urOShRUFBq53vFU4Za5Np5EMqfR0dfhWv6F273I2HG+PhvgcmpYR4BlRcvzAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a59c48f579db98640268e05f50823543f3d1f1c5ad4da12bea91c830d6102f4","last_reissued_at":"2026-07-05T10:10:36.281671Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:10:36.281671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aymeric Fran\\c{c}ois, Constantin Dalyac, Florian Sikora, Lo\\\"ic Henriet, Lucas Leclerc, Malory Marin, Monique Witt Garzillo, Pierre Cazals, R\\'emi Watrigant, Vittorio Vitale, Wesley da Silva Coelho, Yassine Naghmouchi","submitted_at":"2025-02-06T18:34:59Z","abstract_excerpt":"The Maximum Independent Set (MIS) problem is a fundamental combinatorial optimization task that can be naturally mapped onto the Ising Hamiltonian of neutral atom quantum processors. Given its connection to NP-hard problems and real-world applications, there has been significant experimental interest in exploring quantum advantage for MIS. Pioneering experiments on King's Lattice graphs suggested a quadratic speed-up over simulated annealing, but recent benchmarks using state-of-the-art methods found no clear advantage, likely due to the structured nature of the tested instances. In this work,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.04291","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/2502.04291/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":"2502.04291","created_at":"2026-07-05T10:10:36.281723+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.04291v1","created_at":"2026-07-05T10:10:36.281723+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.04291","created_at":"2026-07-05T10:10:36.281723+00:00"},{"alias_kind":"pith_short_12","alias_value":"NJM4JD2XTW4Y","created_at":"2026-07-05T10:10:36.281723+00:00"},{"alias_kind":"pith_short_16","alias_value":"NJM4JD2XTW4YMQBG","created_at":"2026-07-05T10:10:36.281723+00:00"},{"alias_kind":"pith_short_8","alias_value":"NJM4JD2X","created_at":"2026-07-05T10:10:36.281723+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.19589","citing_title":"Emergency hub placement with a neutral-atom quantum computer","ref_index":47,"is_internal_anchor":false},{"citing_arxiv_id":"2607.01037","citing_title":"Quantum-Informed Portfolio Selection: An End-to-End Pipeline Validated on Trapped-Ion Hardware with Real Market Data","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2606.30415","citing_title":"Quantum-enhanced Monte Carlo Tree Search framework for combinatorial optimization problems","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2508.18147","citing_title":"A Scalable Heuristic for Molecular Docking on Neutral-Atom Quantum Processors","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NJM4JD2XTW4YMQBGRYC7KCBDKQ","json":"https://pith.science/pith/NJM4JD2XTW4YMQBGRYC7KCBDKQ.json","graph_json":"https://pith.science/api/pith-number/NJM4JD2XTW4YMQBGRYC7KCBDKQ/graph.json","events_json":"https://pith.science/api/pith-number/NJM4JD2XTW4YMQBGRYC7KCBDKQ/events.json","paper":"https://pith.science/paper/NJM4JD2X"},"agent_actions":{"view_html":"https://pith.science/pith/NJM4JD2XTW4YMQBGRYC7KCBDKQ","download_json":"https://pith.science/pith/NJM4JD2XTW4YMQBGRYC7KCBDKQ.json","view_paper":"https://pith.science/paper/NJM4JD2X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.04291&json=true","fetch_graph":"https://pith.science/api/pith-number/NJM4JD2XTW4YMQBGRYC7KCBDKQ/graph.json","fetch_events":"https://pith.science/api/pith-number/NJM4JD2XTW4YMQBGRYC7KCBDKQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NJM4JD2XTW4YMQBGRYC7KCBDKQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NJM4JD2XTW4YMQBGRYC7KCBDKQ/action/storage_attestation","attest_author":"https://pith.science/pith/NJM4JD2XTW4YMQBGRYC7KCBDKQ/action/author_attestation","sign_citation":"https://pith.science/pith/NJM4JD2XTW4YMQBGRYC7KCBDKQ/action/citation_signature","submit_replication":"https://pith.science/pith/NJM4JD2XTW4YMQBGRYC7KCBDKQ/action/replication_record"}},"created_at":"2026-07-05T10:10:36.281723+00:00","updated_at":"2026-07-05T10:10:36.281723+00:00"}