Paper Citation Record · LEDGER

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors

As of 10 August 2026, this Paper Citation Record lists 100 of 125 outbound references and 8 inbound Pith citation observations for arXiv:2502.04291.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2502.04291 v1

Coverage vector

measured 100 of 125 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-08T23:01:43.647525Z

measured 108 of 108 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-09T06:31:02.800959+00:00

measured 8 of 8 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-08T00:10:34.705610Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: arxiv_reference, observed 2026-07-04T01:29:22.915954Z

Reference resolution

100 of 125 outbound references displayed

verified exact29
verified fuzzy0
unresolved61
parse uncertain0
malformed identifier10
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 027af051-9031-48de-95b2-9ada7aa9cd2e · outbound

This paper cites Applications of combinatorial optimization.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Applications of combinatorial optimization

Reference 1

Resolution: verified exact; doi, observed 2026-08-08T23:01:44.244525Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 87a0c98b-1202-4c1b-a5f8-7bf7e7687b9f · outbound

This paper cites Combinatorial optimization in telecommunications.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Combinatorial optimization in telecommunications

Reference 2

Resolution: malformed identifier; no resolver link, observed 2026-08-08T23:01:43.296911Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b6e8b975-3e3a-4191-8390-ae678911de8c · outbound

This paper cites Real- time scheduling optimization considering the unex- pected events in home health care.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Real- time scheduling optimization considering the unex- pected events in home health care

Reference 3

Resolution: verified exact; doi, observed 2026-08-08T23:01:44.229362Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation cce7e8f0-93ae-4bf4-b0d9-d9f989f4501d · outbound

This paper cites Mathematical mod- eling and optimization of industrial problems.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Mathematical mod- eling and optimization of industrial problems

Reference 4

Resolution: verified exact; doi, observed 2026-08-08T23:01:44.218756Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 9ccadea6-d46d-482c-ae59-84625c6d7812 · outbound

This paper cites an unresolved cited work.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Unresolved cited work

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.307944Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a634a7d0-4ac1-4b95-aae9-91e768da05b9 · outbound

This paper cites A Quantum Approximate Optimization Algorithm.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors A Quantum Approximate Optimization Algorithm

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.311448Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1dd2fad2-1051-4b1a-b618-efa980a95fbe · outbound

This paper cites Challenges and Opportunities in Quantum Optimization.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Challenges and Opportunities in Quantum Optimization

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.316141Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 67018618-7494-4304-8a97-126b66afdb12 · outbound

This paper cites On the emerging potential of quantum anneal- ing hardware for combinatorial optimization.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors On the emerging potential of quantum anneal- ing hardware for combinatorial optimization

Reference 8

Resolution: malformed identifier; no resolver link, observed 2026-08-08T23:01:43.319586Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4cc61bb0-a242-48f3-8685-4d5a9209a1b7 · outbound

This paper cites Quantum phases of matter on a 256-atom programmable quantum simulator.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Quantum phases of matter on a 256-atom programmable quantum simulator

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.322976Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0e489ae5-2d2d-4c94-a931-c68b662e33de · outbound

This paper cites Graph Algorithms with Neutral Atom Quantum Processors.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Graph Algorithms with Neutral Atom Quantum Processors

Reference 10

Resolution: malformed identifier; no resolver link, observed 2026-08-08T23:01:43.326808Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 71aa220a-0cee-4fd1-9081-b1e07849b804 · outbound

This paper cites Qualifying quantum ap- proaches for hard industrial optimization problems.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Qualifying quantum ap- proaches for hard industrial optimization problems

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.330282Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b33c4b9b-5425-410b-9f02-13da054f472c · outbound

This paper cites Find- ing the maximum independent sets of platonic graphs using rydberg atoms.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Find- ing the maximum independent sets of platonic graphs using rydberg atoms

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.333405Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6c5c7e52-0ced-42f1-bea6-34832e06b4fc · outbound

This paper cites Im- plementing transferable annealing protocols for combi- natorial optimisation on neutral atom quantum proces- sors: a case study on smart-charging of electric vehicles,.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Im- plementing transferable annealing protocols for combi- natorial optimisation on neutral atom quantum proces- sors: a case study on smart-charging of electric vehicles,

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.338546Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 58c351ee-cc41-4343-b5f4-30fe53b99af2 · outbound

This paper cites Ising formulations of many np problems.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Ising formulations of many np problems

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.343861Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4175017a-f951-4f9f-8f29-1272bff6ec3c · outbound

This paper cites Quantum Optimization for Maximum Independent Set Using Rydberg Atom Arrays.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Quantum Optimization for Maximum Independent Set Using Rydberg Atom Arrays

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.346488Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1a28cbd6-6db2-437a-bde0-4664e5eb4b86 · outbound

This paper cites Dipole blockade and quantum infor- mation processing in mesoscopic atomic ensembles.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Dipole blockade and quantum infor- mation processing in mesoscopic atomic ensembles

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.349210Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 569d9695-6f8c-4d83-906f-2975d2b32b51 · outbound

This paper cites Many- body physics with individually controlled rydberg atoms.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Many- body physics with individually controlled rydberg atoms

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.352703Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6b84a15e-646b-40b7-b062-28e7d9ce4531 · outbound

This paper cites Quantum information with rydberg atoms.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Quantum information with rydberg atoms

Reference 18

Resolution: verified exact; doi, observed 2026-08-08T23:01:44.177384Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation c36e37df-1550-4641-b4ff-747d5d277102 · outbound

This paper cites Observation of rydberg blockade between two atoms.Nature Physics, 5(2):110–114, 2009.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Observation of rydberg blockade between two atoms.Nature Physics, 5(2):110–114, 2009

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.359469Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cd492cf0-37b7-43cd-bf7d-06c0d99738bc · outbound

This paper cites Tunable two-dimensional ar- rays of single rydberg atoms for realizing quantum ising models.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Tunable two-dimensional ar- rays of single rydberg atoms for realizing quantum ising models

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.362981Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5ae59746-df66-4caf-a44c-7665fe519ff6 · outbound

This paper cites A unit-disk graph is defined by the positions of nodes, where an edge exists between two nodes if the distance between them is less than a constant r, typically set tor = 1.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors A unit-disk graph is defined by the positions of nodes, where an edge exists between two nodes if the distance between them is less than a constant r, typically set tor = 1

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.366584Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 472a0127-897a-4d7d-990d-e68cc8e3bf77 · outbound

This paper cites Rydberg quantum wires for maximum independent set problems.Nature Physics, 18(7):755–759, 2022.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Rydberg quantum wires for maximum independent set problems.Nature Physics, 18(7):755–759, 2022

Reference 22

Resolution: malformed identifier; no resolver link, observed 2026-08-08T23:01:43.369637Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bfd7f344-013d-4aeb-ac32-51801d3a3d7c · outbound

This paper cites Quantum simulation of Ising spins on Platonic graphs.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Quantum simulation of Ising spins on Platonic graphs

Reference 23

Resolution: malformed identifier; no resolver link, observed 2026-08-08T23:01:43.372981Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 147c1d6a-22a7-4c44-980c-dd53d6927b12 · outbound

This paper cites Exploring the impact of graph locality for the resolution of the maximum-independent-set problem with neutral atom devices.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Exploring the impact of graph locality for the resolution of the maximum-independent-set problem with neutral atom devices

Reference 24

Resolution: verified exact; doi, observed 2026-08-08T23:01:44.152972Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 7a956e1b-511d-44d8-9c29-7fbf791fa4ad · outbound

This paper cites Quantum optimization with arbitrary connectivity us- ing rydberg atom arrays.PRX Quantum, 4(1):010316,.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Quantum optimization with arbitrary connectivity us- ing rydberg atom arrays.PRX Quantum, 4(1):010316,

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.379928Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 86915b00-06ce-4ea3-9802-80d9dfd340f7 · outbound

This paper cites Rydberg-blockade-based parity quantum optimization.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Rydberg-blockade-based parity quantum optimization

Reference 26

Resolution: verified exact; doi, observed 2026-08-08T23:01:44.138063Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation d2f17239-bc6b-48e6-a9e4-424acd1b6e5e · outbound

This paper cites Rydberg-atom graphs for quadratic un- constrained binary optimization problems.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Rydberg-atom graphs for quadratic un- constrained binary optimization problems

Reference 27

Resolution: verified exact; doi, observed 2026-08-08T23:01:44.127473Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation f3062ba9-b67e-4726-98b6-4a5ebd5d299c · outbound

This paper cites Quantum programming of the satisfiability problem with rydberg atom graphs.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Quantum programming of the satisfiability problem with rydberg atom graphs

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.394441Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f14a7785-f9b9-4d20-877d-a1e44573c941 · outbound

This paper cites Quantum annealing: A new method for minimizing multidimensional functions.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Quantum annealing: A new method for minimizing multidimensional functions

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.397626Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 66bc320e-0ebc-4e09-8a0e-e405a924d37d · outbound

This paper cites Quantum annealinginthetransverseisingmodel.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Quantum annealinginthetransverseisingmodel

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.400820Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 813d86d6-2e63-4da9-92ef-2ca8208a6e60 · outbound

This paper cites Quantum Computation by Adiabatic Evolution.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Quantum Computation by Adiabatic Evolution

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.404568Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a37ff580-6dfa-4960-89c5-8b76df44b155 · outbound

This paper cites Theory of quantum annealing of an ising spin glass.Science, 295(5564):2427–2430, 2002.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Theory of quantum annealing of an ising spin glass.Science, 295(5564):2427–2430, 2002

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.408594Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 03ae9df3-2343-4cd2-867c-20447898eb00 · outbound

This paper cites A Quantum Approximate Optimization Algorithm.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors A Quantum Approximate Optimization Algorithm

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.411721Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1da57f6a-eb6d-4d86-bc02-d0568e50e83a · outbound

This paper cites A review on quantum approximate optimization algorithm and its variants.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors A review on quantum approximate optimization algorithm and its variants

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.415572Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f559f658-8132-4e65-a7ef-288feb3e5f26 · outbound

This paper cites an unresolved cited work.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Unresolved cited work

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.419079Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0efca7a8-8a64-475a-a56e-09284a5c90ee · outbound

This paper cites Quantum optimization of maximum independent set using rydberg atom arrays.Science, 376(6598):1209– 1215, 2022.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Quantum optimization of maximum independent set using rydberg atom arrays.Science, 376(6598):1209– 1215, 2022

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.422510Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e83da61f-5033-4055-b913-579bad74eb02 · outbound

This paper cites Circumventing superexponential runtimes for hard instances of quantum adiabatic optimization.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Circumventing superexponential runtimes for hard instances of quantum adiabatic optimization

Reference 37

Resolution: verified exact; doi, observed 2026-08-08T23:01:44.089096Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 9e15c7bc-c628-44c6-92e3-f81c7eeed835 · outbound

This paper cites Hardness of the maximum-independent- set problem on unit-disk graphs and prospects for quan- tum speedups.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Hardness of the maximum-independent- set problem on unit-disk graphs and prospects for quan- tum speedups

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.428594Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9de78be9-b572-4343-b383-5cef5b017e6f · outbound

This paper cites Efficient subgraph-based sampling of Ising-type models with frustration.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Efficient subgraph-based sampling of Ising-type models with frustration

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.434303Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 07c21fd5-1834-4f03-bd6b-314416d5715f · outbound

This paper cites an unresolved cited work.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Unresolved cited work

Reference 40

Resolution: verified exact; doi, observed 2026-08-08T23:01:44.073760Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 5bb61d8b-658e-4f40-a4ed-df33604b5992 · outbound

This paper cites Demonstration of a scaling advantage for a quantum annealer over simu- lated annealing.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Demonstration of a scaling advantage for a quantum annealer over simu- lated annealing

Reference 41

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.439443Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4e4e4c2a-0f67-4249-9d3b-b0ad2f6c73cd · outbound

This paper cites an unresolved cited work.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Unresolved cited work

Reference 42

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.430908Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 437407ca-2949-4b00-abdb-f5f1b4afba65 · outbound

This paper cites How many qubits are needed for quantum computational supremacy? Quantum, 4:264, 2020.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors How many qubits are needed for quantum computational supremacy? Quantum, 4:264, 2020

Reference 43

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.446152Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 49734dfb-52ec-46e8-93ce-fd8678404883 · outbound

This paper cites Seeking quantum speedup through spin glasses: The good, the bad, and the ugly.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Seeking quantum speedup through spin glasses: The good, the bad, and the ugly

Reference 44

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.449508Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 847fa028-563c-4ff0-9737-b2dfb851acc5 · outbound

This paper cites Probing for quantum speedup in spin-glass problems with planted solutions.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Probing for quantum speedup in spin-glass problems with planted solutions

Reference 45

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.456604Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b91ad6ea-e735-4d70-a792-46f32877830b · outbound

This paper cites Defining and detecting quantum speedup.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Defining and detecting quantum speedup

Reference 46

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.443150Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 457e2b76-01de-44b8-b3eb-b9ad3bcea26c · outbound

This paper cites V24.1: User’s Manual for CPLEX.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors V24.1: User’s Manual for CPLEX

Reference 47

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.463006Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bc5ee0fe-1014-4d4b-96ad-451c22cfb5f3 · outbound

This paper cites Maximumindependentsetforinterval graphs and trees in space efficient models.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Maximumindependentsetforinterval graphs and trees in space efficient models

Reference 48

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.466364Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8413b3b8-83a4-4051-abcd-d6f9fcec6a19 · outbound

This paper cites freeman San Francisco, 1979.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors freeman San Francisco, 1979

Reference 49

Resolution: verified exact; doi, observed 2026-08-08T23:01:44.012769Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation f3254961-6c28-4ede-9b9b-8168d9ac9300 · outbound

This paper cites A replica analysis of the travelling salesman problem.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors A replica analysis of the travelling salesman problem

Reference 50

Resolution: verified exact; doi, observed 2026-08-08T23:01:44.002478Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation e7db015f-a576-4492-922d-520580d097ea · outbound

This paper cites Best-case per- formance of quantum annealers on native spin-glass benchmarks: How chaos can affect success probabil- ities.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Best-case per- formance of quantum annealers on native spin-glass benchmarks: How chaos can affect success probabil- ities

Reference 51

Resolution: verified exact; doi, observed 2026-08-08T23:01:44.034722Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 5e580d56-7a1d-4e73-9b01-8b8ed0b48306 · outbound

This paper cites Determining computational complexity from characteristic ‘phase transitions’.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Determining computational complexity from characteristic ‘phase transitions’

Reference 52

Resolution: malformed identifier; doi_truncated, observed 2026-08-08T23:01:43.980019Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 585a6040-19c9-40f6-a8cb-1f4f87e4bde2 · outbound

This paper cites Gibbs states and the set of solutions of random con- straint satisfaction problems.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Gibbs states and the set of solutions of random con- straint satisfaction problems

Reference 53

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.486362Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 009e7fa4-ebd2-41e4-8b2f-1c7390cd1acb · outbound

This paper cites Algo- rithmic barriers from phase transitions.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Algo- rithmic barriers from phase transitions

Reference 54

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.493050Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 925bd955-9bd3-486c-9f3e-4cd016f8cf7e · outbound

This paper cites On in- dependent sets in random graphs.Random Structures & Algorithms, 47(3):436–486, 2015.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors On in- dependent sets in random graphs.Random Structures & Algorithms, 47(3):436–486, 2015

Reference 55

Resolution: malformed identifier; no resolver link, observed 2026-08-08T23:01:43.496716Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f4440c7e-6431-45fa-aa11-3c7eca2b563d · outbound

This paper cites Phase transitions in combinatorial optimization problems: basics, algorithms and statistical mechanics.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Phase transitions in combinatorial optimization problems: basics, algorithms and statistical mechanics

Reference 56

Resolution: verified exact; doi, observed 2026-08-08T23:01:43.952381Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 820f875c-7953-411a-89d9-bc474c1d4e31 · outbound

This paper cites Application of statistical mechanics to np-complete problems in combinatorial optimisation.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Application of statistical mechanics to np-complete problems in combinatorial optimisation

Reference 57

Resolution: verified exact; doi, observed 2026-08-08T23:01:43.990300Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 6f1599a7-aa23-4be1-8dd9-e637bc313867 · outbound

This paper cites Frozen development in graph coloring.Theoretical computer science, 265(1-2): 227–264, 2001.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Frozen development in graph coloring.Theoretical computer science, 265(1-2): 227–264, 2001

Reference 58

Resolution: verified exact; doi, observed 2026-08-08T23:01:43.933213Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 42a9b197-4e54-460f-9b9b-1f76e3a83d65 · outbound

This paper cites A new look at the easy-hard-easy pattern of combinatorial search dif- ficulty.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors A new look at the easy-hard-easy pattern of combinatorial search dif- ficulty

Reference 59

Resolution: verified exact; doi, observed 2026-08-08T23:01:43.922310Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 0070858f-9666-4afa-81f5-db1d7f330d6e · outbound

This paper cites Systematic generation of very hard cases for graph 3-colorability.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Systematic generation of very hard cases for graph 3-colorability

Reference 60

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.513550Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 16ab020e-7411-47ce-bc4d-672851aa6e57 · outbound

This paper cites The very particular structure of the very hard instances.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors The very particular structure of the very hard instances

Reference 61

Resolution: verified exact; doi, observed 2026-08-08T23:01:43.911850Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 356f562b-ba1a-4e53-bf90-28ba3e86f12a · outbound

This paper cites Haj\'os and Ore constructions for digraphs.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Haj\'os and Ore constructions for digraphs

Reference 62

Resolution: malformed identifier; no resolver link, observed 2026-08-08T23:01:43.520276Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b646e2e3-c54c-4be2-8992-b8f291a9185d · outbound

This paper cites La Sapienza.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors La Sapienza

Reference 63

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.524148Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 57a443b0-4f37-4498-9e64-c43677352ec6 · outbound

This paper cites The sat phase transition.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors The sat phase transition

Reference 64

Resolution: verified exact; doi, observed 2026-08-08T23:01:43.942718Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation da974dcf-398e-4219-bb09-068e38a3b532 · outbound

This paper cites Clique benchmark instances (web site), 1992.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Clique benchmark instances (web site), 1992

Reference 65

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.529969Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 32ea1bdc-b2b6-401a-ac26-0d8eb432c198 · outbound

This paper cites Practical engineering of hard spin-glass in- stances.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Practical engineering of hard spin-glass in- stances

Reference 66

Resolution: verified exact; doi, observed 2026-08-08T23:01:43.901603Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 1f3b4be3-5b39-462d-86d9-fa2cf147971e · outbound

This paper cites Quantum speedup by quantum annealing.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Quantum speedup by quantum annealing

Reference 67

Resolution: verified exact; doi, observed 2026-08-08T23:01:43.891303Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 1c332072-f02b-4eac-8751-686afd4cfd5d · outbound

This paper cites The potential of quantum annealing for rapid solution structure identification.Constraints, 26 (1):1–25, 2021.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors The potential of quantum annealing for rapid solution structure identification.Constraints, 26 (1):1–25, 2021

Reference 68

Resolution: verified exact; doi, observed 2026-08-08T23:01:43.880652Z

Source-reported events for the cited work

correction dated 2021-04-12. Source: crossref record 10.1007/s10601-021-09320-x->10.1007/s10601-020-09315-0:correction, observed 2026-07-11T02:59:41.493843+00:00. This notice travels one citation hop only.

Observation 03be1c10-2cbd-4954-9374-0282d312b3a3 · outbound

This paper cites A scalable readout system for a su- perconducting adiabatic quantum optimization system.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors A scalable readout system for a su- perconducting adiabatic quantum optimization system

Reference 69

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.541541Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0c13504b-4a2d-4e87-b636-14f970670fd6 · outbound

This paper cites Approximation algorithms for unit disk graphs.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Approximation algorithms for unit disk graphs

Reference 70

Resolution: verified exact; doi, observed 2026-08-08T23:01:43.864659Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 239d846a-6816-4185-b0af-d7ec4af5d64f · outbound

This paper cites an unresolved cited work.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Unresolved cited work

Reference 71

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.527468Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6dba13d4-2a0b-410d-b01c-844ce3ce3ea9 · outbound

This paper cites Ap- plications of a planar separator theorem.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Ap- plications of a planar separator theorem

Reference 72

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.554204Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 29086077-fb93-4318-ab05-a7ec914b08df · outbound

This paper cites A framework for eth-tight algorithms and lower bounds in geometric intersection graphs.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors A framework for eth-tight algorithms and lower bounds in geometric intersection graphs

Reference 73

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.557884Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bf8cb950-abc1-4bee-a533-2ca52dcbd057 · outbound

This paper cites An object is said to be α-fat if the ratio be- tween its circumscribed radius and inscribed radius is at most α.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors An object is said to be α-fat if the ratio be- tween its circumscribed radius and inscribed radius is at most α

Reference 74

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.560745Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation af3f65b8-9577-4ca2-a9fe-b37a9aa33761 · outbound

This paper cites Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh

Reference 75

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.564721Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a4d22ea2-32fa-43c4-9374-d7552ebd1bb1 · outbound

This paper cites van Leeuwen.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors van Leeuwen

Reference 76

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.568427Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 425c6a23-d748-4238-b4dd-60b7de759998 · outbound

This paper cites Clique is hard to approximate within n 1- varepsilon.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Clique is hard to approximate within n 1- varepsilon

Reference 77

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.571611Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6f9f3f24-6dfc-4764-9cc0-34287f02943a · outbound

This paper cites Approxima- tionschemesforcoveringandpackingproblemsinimage processing and vlsi.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Approxima- tionschemesforcoveringandpackingproblemsinimage processing and vlsi

Reference 78

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.575474Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 757f6ced-55ce-4144-8b77-c613494e730a · outbound

This paper cites Linear time algorithms for np-hard problems restricted to partial k- trees.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Linear time algorithms for np-hard problems restricted to partial k- trees

Reference 79

Resolution: verified exact; doi, observed 2026-08-08T23:01:43.854155Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation b761bd3d-5297-4fbe-a840-50708cff3906 · outbound

This paper cites Optimization and approximation on systems of geometric objects.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Optimization and approximation on systems of geometric objects

Reference 80

Resolution: malformed identifier; no resolver link, observed 2026-08-08T23:01:43.582327Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 141f278c-e0f8-4346-bdff-09fedde307c6 · outbound

This paper cites to appear.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors to appear

Reference 81

Resolution: verified exact; doi, observed 2026-08-08T23:01:43.815082Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation bdda2117-5828-4d69-97d2-d5702d283517 · outbound

This paper cites Antiferromagnetism.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Antiferromagnetism

Reference 82

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.588816Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b7fa6bc5-06b5-4da4-89a2-6abd5d039e83 · outbound

This paper cites Impact-parameter selective Rydberg atom collision by optical tweezers.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Impact-parameter selective Rydberg atom collision by optical tweezers

Reference 83

Resolution: verified exact; local_arxiv, observed 2026-08-08T23:02:23.114242Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation cf68d17c-44c8-46b4-b3f3-8ac92b135d5b · outbound

This paper cites Ex- ploring network structure, dynamics, and function using networkx.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Ex- ploring network structure, dynamics, and function using networkx

Reference 84

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.595281Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 840aeb4c-5963-4b9b-a1b4-778e37764479 · outbound

This paper cites Branch-and- bound methods: A survey.Operations research, 14(4): 699–719, 1966.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Branch-and- bound methods: A survey.Operations research, 14(4): 699–719, 1966

Reference 85

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.598414Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1e48a571-9c87-43bf-a751-f9efb55e696f · outbound

This paper cites Syn- thetic three-dimensional atomic structures assembled atom by atom.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Syn- thetic three-dimensional atomic structures assembled atom by atom

Reference 86

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.602264Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a1d34785-1dbe-4016-85ee-80af23a0dc9e · outbound

This paper cites Eptas and subexponential algorithm for maximum clique on disk and unit ball graphs.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Eptas and subexponential algorithm for maximum clique on disk and unit ball graphs

Reference 87

Resolution: verified exact; doi, observed 2026-08-08T23:01:43.829059Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation c72a54d9-272f-41cd-b3ed-70cd898ef98d · outbound

This paper cites Quantum computing with neu- tral atoms.Quantum, 4:327, 2020.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Quantum computing with neu- tral atoms.Quantum, 4:327, 2020

Reference 88

Resolution: malformed identifier; no resolver link, observed 2026-08-08T23:01:43.611704Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 06b740ac-8a3a-42f7-887c-9222387cb230 · outbound

This paper cites Morgado and S.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Morgado and S

Reference 89

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.615457Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a397c915-a95d-49cd-b69f-c3f52c919d61 · outbound

This paper cites Bé guin, A.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Bé guin, A

Reference 90

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.619179Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 359270a3-030e-487a-81e1-72231cde00da · outbound

This paper cites Šibalić, J.D.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Šibalić, J.D

Reference 91

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.622571Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3f908000-35f5-4fe9-9279-217e2bb22efa · outbound

This paper cites pasqal- io/emulators: v1.2.4, 2024.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors pasqal- io/emulators: v1.2.4, 2024

Reference 92

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.625703Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cddd31c2-5d0f-4ec3-b058-3e9f99222043 · outbound

This paper cites Half-minute- scale atomic coherence and high relative stability in a tweezer clock.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Half-minute- scale atomic coherence and high relative stability in a tweezer clock

Reference 93

Resolution: verified exact; doi, observed 2026-08-08T23:01:43.760502Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 5bdc0d7f-40bd-4bf8-ac89-6691f7253f1f · outbound

This paper cites Continuous operation of large- scale atom arrays in optical lattices, 2024.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Continuous operation of large- scale atom arrays in optical lattices, 2024

Reference 94

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.630485Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8118c161-9966-4023-93d8-0e92db6609c8 · outbound

This paper cites Nogrette, H.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Nogrette, H

Reference 95

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.605371Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b9a3fe49-24f0-4c83-822f-d6ddcc62e57c · outbound

This paper cites an unresolved cited work.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Unresolved cited work

Reference 96

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.608538Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 912e19be-3255-400f-afac-34cdd4bc1b7f · outbound

This paper cites Advances in cryogenic avalanche detectors.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Advances in cryogenic avalanche detectors

Reference 97

Resolution: verified exact; doi, observed 2026-08-08T23:01:43.736162Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 23e4e669-ab97-4ffb-be33-f65a438e6ee1 · outbound

This paper cites A tweezer array with 6100 highly coherent atomic qubits.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors A tweezer array with 6100 highly coherent atomic qubits

Reference 98

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.640744Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 68fd2867-e50b-462c-826d-536c7f572184 · outbound

This paper cites Scaling Advantage in Approximate Optimization with Quantum Annealing.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Scaling Advantage in Approximate Optimization with Quantum Annealing

Reference 99

Resolution: unresolved; no resolver link, observed 2026-08-08T23:01:43.644334Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ba58f6ab-e6b4-4489-8b61-85263ca9a6e8 · outbound

This paper cites Microwave engineering of programmable xxz hamiltoni- ans in arrays of rydberg atoms.PRX Quantum, 3(2): 020303, 2022.

Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors Microwave engineering of programmable xxz hamiltoni- ans in arrays of rydberg atoms.PRX Quantum, 3(2): 020303, 2022

Reference 100

Resolution: verified exact; arxiv_id_nonexistent, observed 2026-08-08T23:02:23.081731Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Pith citing papers

Observation 145629cd-e5e2-4787-b9a3-fe4078f4b6ad · inbound

A Framework for Quantum Advantage cites this paper.

A Framework for Quantum Advantage Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-06T22:48:45.289847Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cc6e729e-231b-4ccb-8fbb-e83f2050d403 · inbound

A Scalable Heuristic for Molecular Docking on Neutral-Atom Quantum Processors cites this paper.

A Scalable Heuristic for Molecular Docking on Neutral-Atom Quantum Processors Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors

Reference 14

Resolution: verified exact; arxiv_id, observed 2026-05-18T21:26:51.932224Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation cb45cee2-c0de-4a22-9d8a-fbbf7a1030d3 · inbound

Emergency hub placement with a neutral-atom quantum computer cites this paper.

Emergency hub placement with a neutral-atom quantum computer Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors

Reference 47

Resolution: metadata mismatch; arxiv_id, observed 2026-07-04T01:29:22.917562Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation d8313a22-c2ad-401c-8aec-d640479ef316 · inbound

Quantum-enhanced Monte Carlo Tree Search framework for combinatorial optimization problems cites this paper.

Quantum-enhanced Monte Carlo Tree Search framework for combinatorial optimization problems Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors

Reference 21

Resolution: metadata mismatch; arxiv_id, observed 2026-06-30T06:24:19.214652Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 5559da6c-25bb-47b1-81a8-9c991cbbbdbe · inbound

Quantum-Informed Portfolio Selection: An End-to-End Pipeline Validated on Trapped-Ion Hardware with Real Market Data cites this paper.

Quantum-Informed Portfolio Selection: An End-to-End Pipeline Validated on Trapped-Ion Hardware with Real Market Data Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors

Reference 13

Resolution: verified exact; arxiv_id, observed 2026-07-02T11:56:54.853995Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 0d4a4dc9-0ea4-4da6-abe6-8f5edc89a888 · inbound

Quantum-Informed Portfolio Selection: An End-to-End Pipeline Validated on Trapped-Ion Hardware with Real Market Data cites this paper.

Reference 13

Resolution: unresolved; no resolver link, observed 2026-07-14T16:49:25.319923Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 21ec8d0c-13c6-44a3-ba66-c7a4c91d6dd1 · inbound

Strategic Plan for Neutral Atom Quantum Computation cites this paper.

Strategic Plan for Neutral Atom Quantum Computation Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors

Reference 190

Resolution: unresolved; no resolver link, observed 2026-08-01T07:11:12.928911Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 063bd296-2840-4ba4-b5e8-a2a6f392a10c · inbound

Dynamical Lie Algebras Cannot Describe Shallow QAOA: Cragged Terrains, Barren Plateaus, and Empirical Hardness Models cites this paper.

Dynamical Lie Algebras Cannot Describe Shallow QAOA: Cragged Terrains, Barren Plateaus, and Empirical Hardness Models Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors

Reference 41

Resolution: unresolved; no resolver link, observed 2026-08-08T00:10:34.705610Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.