Paper Citation Record · LEDGER

Exponential-time quantum algorithms for graph coloring problems

As of 10 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 0 inbound Pith citation observations for arXiv:1907.00529.

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

pith.paper-citation-record.v1
1907.00529 v1

Coverage vector

measured 17 of 17 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-05-25T11:58:40.897885Z

measured 17 of 17 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-10T06:31:04.303077+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

17 of 17 outbound references displayed

verified exact1
verified fuzzy13
unresolved3
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation d017305a-0618-475e-ab71-7433f2bef1a8 · outbound

This paper cites Quantum speedups for exponential-time dynamic program ming algorithms.

Exponential-time quantum algorithms for graph coloring problems Quantum speedups for exponential-time dynamic program ming algorithms

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-05-25T12:00:46.187339Z

Source-reported events for the cited work

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

Observation 24246123-03f9-4136-af8d-f031e1839c87 · outbound

This paper cites 3-coloring in time O(1.

Exponential-time quantum algorithms for graph coloring problems 3-coloring in time O(1

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-05-25T12:00:46.166489Z

Source-reported events for the cited work

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

Observation c4964d5a-59b9-43e5-b7fa-e7888d9568c3 · outbound

This paper cites Inclusion–exclusion alg orithms for counting set partitions.

Exponential-time quantum algorithms for graph coloring problems Inclusion–exclusion alg orithms for counting set partitions

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-05-25T12:00:46.174132Z

Source-reported events for the cited work

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

Observation 14697e37-ab65-47ec-8764-2eed0940f627 · outbound

This paper cites Exact algorithms for e xact satisﬁability and number of perfect matchings.

Exponential-time quantum algorithms for graph coloring problems Exact algorithms for e xact satisﬁability and number of perfect matchings

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-05-25T12:00:46.140486Z

Source-reported events for the cited work

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

Observation 11679610-ef7a-4810-be3f-3165882097d5 · outbound

This paper cites Set pa rtitioning via inclusion-exclusion.

Exponential-time quantum algorithms for graph coloring problems Set pa rtitioning via inclusion-exclusion

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-05-25T12:00:46.144517Z

Source-reported events for the cited work

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

Observation 5fa597ac-c8fb-4956-aeee-34230daa4fe6 · outbound

This paper cites Tight bounds on quantum searching.

Exponential-time quantum algorithms for graph coloring problems Tight bounds on quantum searching

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-05-25T12:00:46.160443Z

Source-reported events for the cited work

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

Observation 8c9c8a9c-9c26-4a49-819e-790074a81c1c · outbound

This paper cites an unresolved cited work.

Exponential-time quantum algorithms for graph coloring problems Unresolved cited work

Reference 7

Resolution: unresolved; raw_fallback, observed 2026-05-25T12:00:46.154057Z

Source-reported events for the cited work

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

Observation 09d80a49-faae-44ca-894b-db1c6f8c42e0 · outbound

This paper cites On prob lems as hard as CNF-SAT.

Exponential-time quantum algorithms for graph coloring problems On prob lems as hard as CNF-SAT

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-05-25T12:00:46.147829Z

Source-reported events for the cited work

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

Observation 28e38fae-bdda-4175-a1ca-6fa3f4df1301 · outbound

This paper cites A Quantum Algorithm for Finding the Minimum.

Exponential-time quantum algorithms for graph coloring problems A Quantum Algorithm for Finding the Minimum

Reference 9

Resolution: verified exact; local_arxiv, observed 2026-05-25T12:00:45.824687Z

Source-reported events for the cited work

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

Observation f4cc856d-d4da-4724-a251-0315b2626d87 · outbound

This paper cites Fomin, Serge Gaspers, and Saket Saurabh.

Exponential-time quantum algorithms for graph coloring problems Fomin, Serge Gaspers, and Saket Saurabh

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-05-25T12:00:46.170777Z

Source-reported events for the cited work

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

Observation 5a6aa320-d2bb-449c-bd2e-dca692360e41 · outbound

This paper cites Fomin and Dieter Kratsch.

Exponential-time quantum algorithms for graph coloring problems Fomin and Dieter Kratsch

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-05-25T12:00:46.150662Z

Source-reported events for the cited work

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

Observation e93e6c82-d4de-4d92-be62-6fd4a5bea419 · outbound

This paper cites Solving NP-complete problems with quantum sear ch.

Exponential-time quantum algorithms for graph coloring problems Solving NP-complete problems with quantum sear ch

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-05-25T12:00:46.157265Z

Source-reported events for the cited work

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

Observation 748fa19b-35b3-46ef-ac12-8c49d6b33492 · outbound

This paper cites Faster graph coloring in polyn omial space.

Exponential-time quantum algorithms for graph coloring problems Faster graph coloring in polyn omial space

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-05-25T12:00:46.163543Z

Source-reported events for the cited work

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

Observation ed317cfb-1887-4bb3-b008-bb374955ff87 · outbound

This paper cites Quant um random access memory.

Exponential-time quantum algorithms for graph coloring problems Quant um random access memory

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-05-25T12:00:46.190492Z

Source-reported events for the cited work

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

Observation 33593b5d-6907-4c52-9693-9fcd59a70fc8 · outbound

This paper cites an unresolved cited work.

Exponential-time quantum algorithms for graph coloring problems Unresolved cited work

Reference 15

Resolution: unresolved; raw_fallback, observed 2026-05-25T12:00:46.177736Z

Source-reported events for the cited work

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

Observation ce6e8b08-b7b6-4895-bea8-02f1a4283c6e · outbound

This paper cites An O∗ (2n) algorithm for graph coloring and other partitioning problems via inclu sion– exclusion.

Exponential-time quantum algorithms for graph coloring problems An O∗ (2n) algorithm for graph coloring and other partitioning problems via inclu sion– exclusion

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-05-25T12:00:46.180922Z

Source-reported events for the cited work

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

Observation a9713ddd-fc70-47c6-a65d-028b62a03ac2 · outbound

This paper cites an unresolved cited work.

Exponential-time quantum algorithms for graph coloring problems Unresolved cited work

Reference 17

Resolution: unresolved; raw_fallback, observed 2026-05-25T12:00:46.184041Z

Source-reported events for the cited work

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

Pith citing papers

No inbound Pith citation observations are available.