Paper Citation Record · LEDGER

Breaking the $2^n$ barrier for graph $k$-coloring

As of 12 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 0 inbound Pith citation observations for arXiv:2607.27159.

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

pith.paper-citation-record.v1
2607.27159 v1

Coverage vector

measured 18 of 18 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-07-30T10:42:28.587548Z

measured 18 of 18 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-12T06:34:41.77262+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

18 of 18 outbound references displayed

verified exact0
verified fuzzy0
unresolved18
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 877597bd-354d-4815-9e46-7aec8c8cdb34 · outbound

This paper cites 444--452.

Breaking the $2^n$ barrier for graph $k$-coloring 444--452

Reference 1

Resolution: unresolved; no resolver link, observed 2026-07-30T10:42:27.294116Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 35918084-7655-4425-821f-f26c4c00e7b8 · outbound

This paper cites 2, 168--204.

Breaking the $2^n$ barrier for graph $k$-coloring 2, 168--204

Reference 2

Resolution: unresolved; no resolver link, observed 2026-07-30T10:42:27.341256Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0d261cde-26fe-4e6f-8863-4eec0bd58dd7 · outbound

This paper cites 2, 546--563.

Breaking the $2^n$ barrier for graph $k$-coloring 2, 546--563

Reference 3

Resolution: unresolved; no resolver link, observed 2026-07-30T10:42:27.438099Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2190a172-ec1e-4d1f-a056-156ba1aed998 · outbound

This paper cites an unresolved cited work.

Breaking the $2^n$ barrier for graph $k$-coloring Unresolved cited work

Reference 4

Resolution: unresolved; no resolver link, observed 2026-07-30T10:42:27.554745Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a27c743f-23f2-4ec6-90a0-222a90862de0 · outbound

This paper cites 6, 547--556.

Breaking the $2^n$ barrier for graph $k$-coloring 6, 547--556

Reference 5

Resolution: unresolved; no resolver link, observed 2026-07-30T10:42:27.619985Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 67134832-d2f9-408a-a612-34a75dabb867 · outbound

This paper cites 2, 131--140.

Breaking the $2^n$ barrier for graph $k$-coloring 2, 131--140

Reference 6

Resolution: unresolved; no resolver link, observed 2026-07-30T10:42:27.702753Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f48147cd-b7cc-476f-97ca-1757256afd6e · outbound

This paper cites an unresolved cited work.

Breaking the $2^n$ barrier for graph $k$-coloring Unresolved cited work

Reference 7

Resolution: unresolved; no resolver link, observed 2026-07-30T10:42:27.763812Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a8f3a2db-0977-48cf-b564-bcf2c3070398 · outbound

This paper cites 29, wh freeman New York, 2002.

Breaking the $2^n$ barrier for graph $k$-coloring 29, wh freeman New York, 2002

Reference 8

Resolution: unresolved; no resolver link, observed 2026-07-30T10:42:27.846208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 02ef92e1-81b8-4c79-8c90-5cab19939607 · outbound

This paper cites 3, 1--17.

Breaking the $2^n$ barrier for graph $k$-coloring 3, 1--17

Reference 9

Resolution: unresolved; no resolver link, observed 2026-07-30T10:42:27.981900Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7f5c25f0-04a9-4b7f-9d0b-dca3d0a43a5b · outbound

This paper cites 219--241.

Breaking the $2^n$ barrier for graph $k$-coloring 219--241

Reference 10

Resolution: unresolved; no resolver link, observed 2026-07-30T10:42:28.096671Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d70ab50a-015b-436f-b2c9-5feb56378b65 · outbound

This paper cites 3, 66--67.

Breaking the $2^n$ barrier for graph $k$-coloring 3, 66--67

Reference 11

Resolution: unresolved; no resolver link, observed 2026-07-30T10:42:28.182222Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6b27ead9-590b-447d-a2a2-36329d878750 · outbound

This paper cites 3, 337--364.

Breaking the $2^n$ barrier for graph $k$-coloring 3, 337--364

Reference 12

Resolution: unresolved; no resolver link, observed 2026-07-30T10:42:28.279125Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 41733b33-6b7d-4839-810d-ce2e08e8db59 · outbound

This paper cites 177--188.

Breaking the $2^n$ barrier for graph $k$-coloring 177--188

Reference 13

Resolution: unresolved; no resolver link, observed 2026-07-30T10:42:28.315190Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b0dca4d6-a179-461f-b728-89a9776b41c1 · outbound

This paper cites an unresolved cited work.

Breaking the $2^n$ barrier for graph $k$-coloring Unresolved cited work

Reference 14

Resolution: unresolved; no resolver link, observed 2026-07-30T10:42:28.361535Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4154b326-075a-4950-a464-bfee8d073c16 · outbound

This paper cites an unresolved cited work.

Breaking the $2^n$ barrier for graph $k$-coloring Unresolved cited work

Reference 15

Resolution: unresolved; no resolver link, observed 2026-07-30T10:42:28.401704Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a24f1d94-0ce1-49f1-8adc-aafeddac9d00 · outbound

This paper cites an unresolved cited work.

Breaking the $2^n$ barrier for graph $k$-coloring Unresolved cited work

Reference 16

Resolution: unresolved; no resolver link, observed 2026-07-30T10:42:28.461829Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 29889195-6cd4-4c6c-a041-b5f3de4de23f · outbound

This paper cites 985--998.

Breaking the $2^n$ barrier for graph $k$-coloring 985--998

Reference 17

Resolution: unresolved; no resolver link, observed 2026-07-30T10:42:28.526376Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 227f72be-9f2a-47f2-95f1-74c0b3bfd3ff · outbound

This paper cites k-Coloring is Faster than Computing the Chromatic Number.

Breaking the $2^n$ barrier for graph $k$-coloring k-Coloring is Faster than Computing the Chromatic Number

Reference 18

Resolution: unresolved; no resolver link, observed 2026-07-30T10:42:28.587548Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.