Paper Citation Record · LEDGER

Effectiveness and strong graph indivisibility

As of 13 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2411.16950.

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

pith.paper-citation-record.v1
2411.16950 v1

Coverage vector

measured 21 of 21 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-12T13:03:16.026386Z

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

21 of 21 outbound references displayed

verified exact2
verified fuzzy19
unresolved0
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 042c91d6-ae9c-4c71-8cfa-13ae24a6e891 · outbound

This paper cites Tourna ments and orders with the pi- geonhole property,.

Effectiveness and strong graph indivisibility Tourna ments and orders with the pi- geonhole property,

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:03:16.372415Z

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.

Observation 8b4b877f-c70f-4cc6-9b62-1d15ac67c4f1 · outbound

This paper cites A pigeonhole property for relational structures,.

Effectiveness and strong graph indivisibility A pigeonhole property for relational structures,

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:03:16.355642Z

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.

Observation f8000bf5-2268-4152-a7cf-e0a0cf1c6482 · outbound

This paper cites On the uniform c omputational content of Ramsey’s Theorem,.

Effectiveness and strong graph indivisibility On the uniform c omputational content of Ramsey’s Theorem,

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:03:16.339918Z

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.

Observation 3fd4d773-5cb1-4f8d-b55f-d78d2c7372f6 · outbound

This paper cites The random graph,.

Effectiveness and strong graph indivisibility The random graph,

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:03:16.325286Z

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.

Observation cba9551d-d85e-4883-ab8d-227a656c98ef · outbound

This paper cites On the strengt h of Ramsey’s theorem for trees,.

Effectiveness and strong graph indivisibility On the strengt h of Ramsey’s theorem for trees,

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:03:16.309232Z

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.

Observation bc6abdc5-b547-4e9a-8210-fdf845780a8a · outbound

This paper cites Reverse mathematics, com- putability, and partitions of trees,.

Effectiveness and strong graph indivisibility Reverse mathematics, com- putability, and partitions of trees,

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:03:16.287577Z

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.

Observation 0070f648-533b-4300-9cdf-824499c372d7 · outbound

This paper cites R everse mathematics and Ramsey’s property for trees,.

Effectiveness and strong graph indivisibility R everse mathematics and Ramsey’s property for trees,

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:03:16.273631Z

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.

Observation 8e84200d-9619-4004-9560-75f97ca71ead · outbound

This paper cites On uniform relationships between combinatorial problems ,.

Effectiveness and strong graph indivisibility On uniform relationships between combinatorial problems ,

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:03:16.259552Z

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.

Observation 7ab85d52-c462-482d-b477-73712ab89a93 · outbound

This paper cites Dzhafarov and Carl Mummert, Reverse mathematics – problems, reductions, and proofs, Springer Nature, 2022.

Effectiveness and strong graph indivisibility Dzhafarov and Carl Mummert, Reverse mathematics – problems, reductions, and proofs, Springer Nature, 2022

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:03:16.244035Z

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.

Observation b272d851-e4a5-43e7-8f5f-4cb33a2ff6fc · outbound

This paper cites Ramsey’s theorem for singletons and strong computable reducibility ,.

Effectiveness and strong graph indivisibility Ramsey’s theorem for singletons and strong computable reducibility ,

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:03:16.228503Z

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.

Observation 4b8bad97-cd86-4698-a94c-20826f7bf0fe · outbound

This paper cites The tree pigeonhole principle in the Weihrauch degrees.

Effectiveness and strong graph indivisibility The tree pigeonhole principle in the Weihrauch degrees

Reference 11

Resolution: verified exact; local_arxiv, observed 2026-08-12T13:03:16.084489Z

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.

Observation 5e3effea-4448-47dc-a50a-6edbf7a4acf4 · outbound

This paper cites Indivisibility and uniform computational strength.

Effectiveness and strong graph indivisibility Indivisibility and uniform computational strength

Reference 12

Resolution: verified exact; local_arxiv, observed 2026-08-12T13:03:16.067167Z

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.

Observation ca5cbe22-46a4-4613-9f94-5ada8be2ff35 · outbound

This paper cites A family of countable homogeneous grap hs,.

Effectiveness and strong graph indivisibility A family of countable homogeneous grap hs,

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:03:16.214747Z

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.

Observation 69be6b7c-cf36-4397-b10e-7787f06e7718 · outbound

This paper cites Hirschfeldt, Slicing the Truth: On the Computational and Reverse Mathema tics of Combinatorial Principles , W orld Scientiﬁc, 2014.

Effectiveness and strong graph indivisibility Hirschfeldt, Slicing the Truth: On the Computational and Reverse Mathema tics of Combinatorial Principles , W orld Scientiﬁc, 2014

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:03:16.197911Z

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.

Observation 766b2350-9b2a-4a2f-9fd7-91cce9587570 · outbound

This paper cites On noti ons of computable reduction between Π 1 2 principles,.

Effectiveness and strong graph indivisibility On noti ons of computable reduction between Π 1 2 principles,

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:03:16.182634Z

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.

Observation 37dc8c62-cba8-4503-a62e-62b0caf06a9d · outbound

This paper cites Combinator ial principles weaker than Ramey’s Theorem for Pairs,.

Effectiveness and strong graph indivisibility Combinator ial principles weaker than Ramey’s Theorem for Pairs,

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:03:16.169884Z

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.

Observation 2aeb9302-52a6-4588-98e4-73c3ad8a2966 · outbound

This paper cites Hirst, Combinatorics in Subsystems of Second Order Arithmetic , PhD thesis, Penn- sylvania State University, 1987.

Effectiveness and strong graph indivisibility Hirst, Combinatorics in Subsystems of Second Order Arithmetic , PhD thesis, Penn- sylvania State University, 1987

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:03:16.156338Z

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.

Observation 8df6e3ba-479a-4d92-9936-c8e12c03208f · outbound

This paper cites Partition genericity and pigeonhole basis theorems,.

Effectiveness and strong graph indivisibility Partition genericity and pigeonhole basis theorems,

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:03:16.141651Z

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.

Observation bc79ad4f-a22a-4a7b-ad31-5afffa3d41ae · outbound

This paper cites The weakness of being cohesive, thin or free in reverse mathematics,.

Effectiveness and strong graph indivisibility The weakness of being cohesive, thin or free in reverse mathematics,

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:03:16.128313Z

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.

Observation f65bf2bb-6389-4d4d-bc7c-eec6ff2aa04e · outbound

This paper cites Simpson, Subsystems of second order arithmetic , Springer–Verlag, Heidelberg, 1999.

Effectiveness and strong graph indivisibility Simpson, Subsystems of second order arithmetic , Springer–Verlag, Heidelberg, 1999

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:03:16.110830Z

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.

Observation decb4116-ef78-4ff4-80bf-982087015c15 · outbound

This paper cites Soare, Recursively enumerable sets and degrees , Springer–Verlag, Heidelberg, 1987.

Effectiveness and strong graph indivisibility Soare, Recursively enumerable sets and degrees , Springer–Verlag, Heidelberg, 1987

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T13:03:16.098019Z

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.

Pith citing papers

No inbound Pith citation observations are available.