Pith. sign in

Paper Citation Record · LEDGER

Sharp bounds for the fractional chromatic number of high-girth $d$-degenerate graphs

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

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

pith.paper-citation-record.v1
2607.26271 v1

Coverage vector

measured 31 of 31 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-01T00:30:29.377408Z

measured 31 of 31 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

31 of 31 outbound references displayed

  • verified exact11
  • verified fuzzy0
  • unresolved14
  • parse uncertain0
  • malformed identifier6
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation d1fbee73-a909-44d6-9393-87f98d4f1158 · outbound

This paper cites On connectivity, conductance and bootstrap percolation for a random k-out, age-biased graph.

Sharp bounds for the fractional chromatic number of high-girth $d$-degenerate graphs On connectivity, conductance and bootstrap percolation for a random k-out, age-biased graph

Reference 1

Resolution
verified exact
doi, observed 2026-08-01T00:30:57.214491Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-01T00:30:26.315473Z digest=sha256:0da4b59b952136bebc2fbacc1a7b745fd945f9026f3213562058653a7a7e717c

Observation e85bc71f-41df-4e93-be65-3fc4e6a7871e · outbound

This paper cites Coloring graphs with sparse neighborhoods.

Sharp bounds for the fractional chromatic number of high-girth $d$-degenerate graphs Coloring graphs with sparse neighborhoods

Reference 2

Resolution
malformed identifier
no resolver link, observed 2026-08-01T00:30:26.403199Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-01T00:30:26.403199Z digest=sha256:e86a350291b437406776206094f2b332601c3ae468b52b09276642bf28760cff

Observation 03162214-5faa-48cd-8547-0719d2e2320b · outbound

This paper cites Coloring graphs with forbidden bipartite sub- graphs.

Sharp bounds for the fractional chromatic number of high-girth $d$-degenerate graphs Coloring graphs with forbidden bipartite sub- graphs

Reference 3

Resolution
verified exact
doi, observed 2026-08-01T00:30:57.129291Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-01T00:30:26.489045Z digest=sha256:79f49e9f87bc21d06aed9862a99b04e657705893075fc31460a321f16ea976f8

Observation 7e419f0d-15e2-404a-bdd6-99c8fad4df6c · outbound

This paper cites The Johansson-Molloy theorem for DP-coloring.

Sharp bounds for the fractional chromatic number of high-girth $d$-degenerate graphs The Johansson-Molloy theorem for DP-coloring

Reference 4

Resolution
verified exact
doi, observed 2026-08-01T00:30:56.965652Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-01T00:30:26.575790Z digest=sha256:8f6ae0965282bbf1e85f082cd375fe701b64d80fdd373c97352f2fe135256a7d

Observation 038a32af-9eba-489d-a9ad-81230b5efa47 · outbound

This paper cites Counting colorings of triangle-free graphs.

Sharp bounds for the fractional chromatic number of high-girth $d$-degenerate graphs Counting colorings of triangle-free graphs

Reference 5

Resolution
malformed identifier
no resolver link, observed 2026-08-01T00:30:26.659572Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-01T00:30:26.659572Z digest=sha256:d01661f01e75e9beb996ef23758f13bda2cfce06f15f8e862099cbc52b5dc7e2

Observation 59551f3d-24b4-4b26-950b-74813d3b13b0 · outbound

This paper cites Dynamic concentration of the triangle-free process.

Sharp bounds for the fractional chromatic number of high-girth $d$-degenerate graphs Dynamic concentration of the triangle-free process

Reference 6

Resolution
verified exact
doi, observed 2026-08-01T00:30:56.864429Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-01T00:30:26.722230Z digest=sha256:30880da508aed4af19690476842d99aaba466d8e9ced98d23bcb1114c31573c7

Observation 1d20cf2d-caf1-46dd-b038-a85e5c8155ce · outbound

This paper cites Bradaˇ c, J.

Sharp bounds for the fractional chromatic number of high-girth $d$-degenerate graphs Bradaˇ c, J

Reference 7

Resolution
unresolved
no resolver link, observed 2026-08-01T00:30:26.796889Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-01T00:30:26.796889Z digest=sha256:6f77a5b314eea8ca95a80b931e873366be2d55722698ba8f6b03b70a3be2ca1f

Observation 78da1a6b-c977-4034-9d3e-d24c9fa6f4d5 · outbound

This paper cites Toward Vu's conjecture.

Sharp bounds for the fractional chromatic number of high-girth $d$-degenerate graphs Toward Vu's conjecture

Reference 8

Resolution
unresolved
no resolver link, observed 2026-08-01T00:30:26.866426Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-01T00:30:26.866426Z digest=sha256:cc3eaf79fa8b18bab07469dd05ba24994b73b8121cc266071ec17ab0bb731ec6

Observation 98523e40-2a18-40fa-9964-1a7c121371c4 · outbound

This paper cites Campos, M.

Sharp bounds for the fractional chromatic number of high-girth $d$-degenerate graphs Campos, M

Reference 9

Resolution
unresolved
no resolver link, observed 2026-08-01T00:30:26.903683Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-01T00:30:26.903683Z digest=sha256:7272eeb40e4fc77498080b4323aed11816ed4b00ced42b153ef848792c258f55

Observation 3ba8d04e-623f-43e0-8c20-2402a03930aa · outbound

This paper cites Graph structure via local occupancy.

Sharp bounds for the fractional chromatic number of high-girth $d$-degenerate graphs Graph structure via local occupancy

Reference 10

Resolution
unresolved
no resolver link, observed 2026-08-01T00:30:27.051185Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-01T00:30:27.051185Z digest=sha256:920e8dea7072adae415cd74c4843d89373d1ea389c518249065b232e951cf807

Observation 821ecb09-fae1-4668-b147-3725af3bf93e · outbound

This paper cites Fractional coloring via entropy.

Sharp bounds for the fractional chromatic number of high-girth $d$-degenerate graphs Fractional coloring via entropy

Reference 11

Resolution
unresolved
no resolver link, observed 2026-08-01T00:30:27.111303Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-01T00:30:27.111303Z digest=sha256:d94f2a861c63a9ce0c99203da90185e117acdd883da1ad720aedc9b655735ce6

Observation ae46fc08-d555-404f-aa9c-743914d61dcc · outbound

This paper cites Dhawan, O.

Sharp bounds for the fractional chromatic number of high-girth $d$-degenerate graphs Dhawan, O

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-01T00:30:27.195735Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-01T00:30:27.195735Z digest=sha256:0b0de1eb130b7150c60c9fe31e8f1a98436a6d6813783086b26c0b07a1fbeb3a

Observation aa7101d0-8e13-4cd3-830c-2bc6026bf1f3 · outbound

This paper cites Separation choosability and dense bipartite induced subgraphs.

Sharp bounds for the fractional chromatic number of high-girth $d$-degenerate graphs Separation choosability and dense bipartite induced subgraphs

Reference 13

Resolution
verified exact
doi, observed 2026-08-01T00:30:56.720512Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-01T00:30:27.256675Z digest=sha256:49a0e2f47fc0c9b39c4ac2dc6be94f33bcfbfbd58d04b1944c3a33c89af04f44

Observation 662e5f0c-37c0-4bbe-b552-72bb26b941f8 · outbound

This paper cites The triangle-free process and the Ramsey number R(3, k).

Sharp bounds for the fractional chromatic number of high-girth $d$-degenerate graphs The triangle-free process and the Ramsey number R(3, k)

Reference 14

Resolution
verified exact
doi, observed 2026-08-01T00:30:56.569120Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-01T00:30:27.336187Z digest=sha256:12c2288eed794fe7427242139f87461c10002eb06469706ae8c2526e06d2ae7c

Observation 2e32554c-1b6d-4c21-ba97-8319facc772d · outbound

This paper cites Perfect matchings and Hamiltonian cycles in the preferential attachment model.

Sharp bounds for the fractional chromatic number of high-girth $d$-degenerate graphs Perfect matchings and Hamiltonian cycles in the preferential attachment model

Reference 15

Resolution
verified exact
doi, observed 2026-08-01T00:30:56.490514Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-01T00:30:27.423107Z digest=sha256:f31fc4ebac3f4b6ca4f6a6031b52f3e303cf5ba77ae8f2f14880aab052ab1840

Observation 735435c4-874f-4080-a408-3ec509063f11 · outbound

This paper cites On the independence and chromatic numbers of random regular graphs.

Sharp bounds for the fractional chromatic number of high-girth $d$-degenerate graphs On the independence and chromatic numbers of random regular graphs

Reference 16

Resolution
malformed identifier
no resolver link, observed 2026-08-01T00:30:27.580287Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-01T00:30:27.580287Z digest=sha256:254e2a98ed65f475385f5ffe6849c56f0058ae70525b0500ead832dc018e3044

Observation 778ce0b7-a79c-4af6-a169-73c22bd87b19 · outbound

This paper cites Some results on chromatic number as a function of triangle count.

Sharp bounds for the fractional chromatic number of high-girth $d$-degenerate graphs Some results on chromatic number as a function of triangle count

Reference 17

Resolution
verified exact
doi, observed 2026-08-01T00:30:56.312888Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-01T00:30:27.693633Z digest=sha256:d763b182abdcd6b3ab79ea9b34b70331e2395a49a81b45cf05be19b76d47efb4

Observation 08285408-3729-4f48-a400-447115a9513e · outbound

This paper cites Hefty, P.

Sharp bounds for the fractional chromatic number of high-girth $d$-degenerate graphs Hefty, P

Reference 18

Resolution
unresolved
no resolver link, observed 2026-08-01T00:30:27.758044Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-01T00:30:27.758044Z digest=sha256:82ededad2383a0f018507f322e64b5495bf744a6d595f153e550833dc80f1e81

Observation 62b0942d-0580-4279-a746-b491d1cd6dd5 · outbound

This paper cites Uniformly random colourings of sparse graphs.

Sharp bounds for the fractional chromatic number of high-girth $d$-degenerate graphs Uniformly random colourings of sparse graphs

Reference 19

Resolution
unresolved
no resolver link, observed 2026-08-01T00:30:27.851536Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-01T00:30:27.851536Z digest=sha256:676d7491185d3cb56ef1d62e3dd71204be2e2d4771494faadfd6fc2c95aec07a

Observation 54718058-09f8-4ada-ada1-4423734e14c0 · outbound

This paper cites Johansson.Asymptotic choice number for triangle free graphs.

Sharp bounds for the fractional chromatic number of high-girth $d$-degenerate graphs Johansson.Asymptotic choice number for triangle free graphs

Reference 20

Resolution
unresolved
no resolver link, observed 2026-08-01T00:30:27.945309Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-01T00:30:27.945309Z digest=sha256:fabd238992ae7dd52d9cabaa4432882b90d711e9e834b0a03e35ac8046834210

Observation 80a5477c-e980-4c96-9b1d-cb0d3a17fe49 · outbound

This paper cites an unresolved cited work.

Sharp bounds for the fractional chromatic number of high-girth $d$-degenerate graphs Unresolved cited work

Reference 21

Resolution
unresolved
no resolver link, observed 2026-08-01T00:30:28.060156Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-01T00:30:28.060156Z digest=sha256:7713c3cee04d99ba98b64146b4b0a766b446fbbf2c76c9b73f95d6b30887a6aa

Observation 3b9f1fc8-3154-440a-806d-73461adb2c36 · outbound

This paper cites On Brooks’ theorem for sparse graphs.

Sharp bounds for the fractional chromatic number of high-girth $d$-degenerate graphs On Brooks’ theorem for sparse graphs

Reference 22

Resolution
verified exact
doi, observed 2026-08-01T00:30:56.160550Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-01T00:30:28.205814Z digest=sha256:7055962038c3d698496dc32f4caa29bc1f2613cce781b0bb199db17cf68cc963

Observation afe76488-99d7-4b87-ad0f-9c8fde063fd9 · outbound

This paper cites γ-variable first-order logic of uniform attachment random graphs.

Sharp bounds for the fractional chromatic number of high-girth $d$-degenerate graphs γ-variable first-order logic of uniform attachment random graphs

Reference 23

Resolution
unresolved
no resolver link, observed 2026-08-01T00:30:28.389253Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-01T00:30:28.389253Z digest=sha256:07da72372f8383dafe4ae8c1b1a00a2a286450a74a512bfa4f0376934f2dde1f

Observation 74005da2-0b6b-4367-808d-f7726d983d47 · outbound

This paper cites Random independent sets in triangle-free graphs.

Sharp bounds for the fractional chromatic number of high-girth $d$-degenerate graphs Random independent sets in triangle-free graphs

Reference 24

Resolution
malformed identifier
no resolver link, observed 2026-08-01T00:30:28.497804Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-01T00:30:28.497804Z digest=sha256:d96319fddf5ade2e1cbb2d952eaa39ed6cec20bf09e28d4e8f64076f70c9f27e

Observation 8df59f38-2d25-493b-b68e-d527adc44eb1 · outbound

This paper cites Mitzenmacher and E.

Sharp bounds for the fractional chromatic number of high-girth $d$-degenerate graphs Mitzenmacher and E

Reference 25

Resolution
unresolved
no resolver link, observed 2026-08-01T00:30:28.610295Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-01T00:30:28.610295Z digest=sha256:185bec6666b7c24dab128614b670a2339953c2467714777d363d6df28538a95c

Observation 95e7ea50-3b51-44aa-8c03-0bda743f0b5a · outbound

This paper cites The list chromatic number of graphs with small clique number.

Sharp bounds for the fractional chromatic number of high-girth $d$-degenerate graphs The list chromatic number of graphs with small clique number

Reference 26

Resolution
verified exact
doi, observed 2026-08-01T00:30:56.080314Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-01T00:30:28.733974Z digest=sha256:d42087679f9a1526963029831a789637b0c16325cbd1cb583fe92d754dbf7ffd

Observation 25a518b5-669f-4642-b527-b2bc0a49469d · outbound

This paper cites Molloy and B.

Sharp bounds for the fractional chromatic number of high-girth $d$-degenerate graphs Molloy and B

Reference 27

Resolution
malformed identifier
no resolver link, observed 2026-08-01T00:30:28.906736Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-01T00:30:28.906736Z digest=sha256:eba199617b5d781f827f8dd3da3950236c22e7656ca83e49b20649349795d786

Observation ca1804f4-26f2-47ad-95bf-113bb87b1a6a · outbound

This paper cites The spectral density of Hardy kernel matrices.

Sharp bounds for the fractional chromatic number of high-girth $d$-degenerate graphs The spectral density of Hardy kernel matrices

Reference 28

Resolution
unresolved
no resolver link, observed 2026-08-01T00:30:29.083573Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-01T00:30:29.083573Z digest=sha256:f29f7f54a593b7fa3a82f899957718cf1cc8cda4fae9b23cedaf8e3afb580add

Observation ea667817-d85c-4ca3-a5a6-e5387477c3d4 · outbound

This paper cites A note on the independence number of triangle-free graphs.

Sharp bounds for the fractional chromatic number of high-girth $d$-degenerate graphs A note on the independence number of triangle-free graphs

Reference 29

Resolution
malformed identifier
doi_truncated, observed 2026-08-01T00:30:55.843549Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-01T00:30:29.200727Z digest=sha256:2eece0d35f1660e8506e81d7594e9d7aecbd7590790133d4b126660cfd9ae381

Observation cdabec45-5a7a-44df-9266-998b348a7e11 · outbound

This paper cites an unresolved cited work.

Sharp bounds for the fractional chromatic number of high-girth $d$-degenerate graphs Unresolved cited work

Reference 30

Resolution
verified exact
doi, observed 2026-08-01T00:30:55.673305Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=pdf_text observed=2026-08-01T00:30:29.377408Z digest=sha256:11fb815fe2ba8d0bdfdf721823b271d6847fb1f03e266ebe589d03359f38e486

Observation bfc1164f-c9ee-43de-849d-405453be8264 · outbound

This paper cites A new lower bound for sphere packing.

Sharp bounds for the fractional chromatic number of high-girth $d$-degenerate graphs A new lower bound for sphere packing

Reference 2023

Resolution
unresolved
no resolver link, observed 2026-08-01T00:30:26.989506Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-01T00:30:26.989506Z digest=sha256:e1231ebdba1a9e294b809ffdc4f28747d0b0416aa7767dc0ab2f2f05265e4047

Pith citing papers

No inbound Pith citation observations are available.