{"as_of":"2026-08-13T06:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e03564831e185e9cddd45f87e9cfb99e151c4edc7e5a9c89f5d2cf909c132ba2","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T13:03:16.026386Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2411.16950/citation-record","integrity":"/paper/2411.16950/integrity","json":"/paper/2411.16950/citation-record.json","paper":"/paper/2411.16950"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T13:03:16.366624Z","title":"Tourna ments and orders with the pi- geonhole property,","venue":null,"work_id":"c5cd3496-1a47-477a-8cbf-9a755739097c","year":2000},"citing_paper":{"arxiv_id":"2411.16950","last_updated":"2024-11-25T21:42:26Z","snapshot_observed_at":"2026-08-12T12:40:18.960350Z","submitted_at":"2024-11-25T21:42:26Z","title":"Effectiveness and strong graph indivisibility","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T13:03:15.940432Z"},"links":{"citing_paper":"/paper/2411.16950"},"observation_digest":"sha256:0f0473507ab797e1b30b009008f73bca4895681d77b82f9071440d27de4e0e76","observation_id":"042c91d6-ae9c-4c71-8cfa-13ae24a6e891","resolution":{"observed_at":"2026-08-12T13:03:16.372415Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T13:03:16.351270Z","title":"A pigeonhole property for relational structures,","venue":null,"work_id":"274d90b6-09e7-4383-99e2-72a57e2be7b4","year":1999},"citing_paper":{"arxiv_id":"2411.16950","last_updated":"2024-11-25T21:42:26Z","snapshot_observed_at":"2026-08-12T12:40:18.960350Z","submitted_at":"2024-11-25T21:42:26Z","title":"Effectiveness and strong graph indivisibility","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T13:03:15.945258Z"},"links":{"citing_paper":"/paper/2411.16950"},"observation_digest":"sha256:06b4dd590790ebdebcad63d9881b203a571509ad574662f0b0f5ceb8462a6938","observation_id":"8b4b877f-c70f-4cc6-9b62-1d15ac67c4f1","resolution":{"observed_at":"2026-08-12T13:03:16.355642Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T13:03:16.334784Z","title":"On the uniform c omputational content of Ramsey’s Theorem,","venue":null,"work_id":"55b0e5aa-2756-4a45-a2b8-bd7cd0dcbf61","year":2017},"citing_paper":{"arxiv_id":"2411.16950","last_updated":"2024-11-25T21:42:26Z","snapshot_observed_at":"2026-08-12T12:40:18.960350Z","submitted_at":"2024-11-25T21:42:26Z","title":"Effectiveness and strong graph indivisibility","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T13:03:15.949332Z"},"links":{"citing_paper":"/paper/2411.16950"},"observation_digest":"sha256:6c7a5387bc592123df7197f315557669defd66b2b11ed15ed5bdeb6be129f43f","observation_id":"f8000bf5-2268-4152-a7cf-e0a0cf1c6482","resolution":{"observed_at":"2026-08-12T13:03:16.339918Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T13:03:16.321174Z","title":"The random graph,","venue":null,"work_id":"1d501f49-f3ca-4cd5-87c9-c7d22bde1e97","year":1997},"citing_paper":{"arxiv_id":"2411.16950","last_updated":"2024-11-25T21:42:26Z","snapshot_observed_at":"2026-08-12T12:40:18.960350Z","submitted_at":"2024-11-25T21:42:26Z","title":"Effectiveness and strong graph indivisibility","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T13:03:15.953495Z"},"links":{"citing_paper":"/paper/2411.16950"},"observation_digest":"sha256:ecd46317d97c699ff066d5d9aa9be6d6b4a12ab80f426da7eac8f64289e5ad38","observation_id":"3fd4d773-5cb1-4f8d-b55f-d78d2c7372f6","resolution":{"observed_at":"2026-08-12T13:03:16.325286Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T13:03:16.300333Z","title":"On the strengt h of Ramsey’s theorem for trees,","venue":null,"work_id":"fd4f1ca2-29ec-414e-884c-1bde9f70bdb0","year":2020},"citing_paper":{"arxiv_id":"2411.16950","last_updated":"2024-11-25T21:42:26Z","snapshot_observed_at":"2026-08-12T12:40:18.960350Z","submitted_at":"2024-11-25T21:42:26Z","title":"Effectiveness and strong graph indivisibility","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T13:03:15.957629Z"},"links":{"citing_paper":"/paper/2411.16950"},"observation_digest":"sha256:02f681e694e55a4a4320b331ffd5127f868f862b9d6e0cbf1fa7a237f852ff26","observation_id":"cba9551d-d85e-4883-ab8d-227a656c98ef","resolution":{"observed_at":"2026-08-12T13:03:16.309232Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T13:03:16.282786Z","title":"Reverse mathematics, com- putability, and partitions of trees,","venue":null,"work_id":"8a467113-87d8-4440-84d5-90be7ae87354","year":2009},"citing_paper":{"arxiv_id":"2411.16950","last_updated":"2024-11-25T21:42:26Z","snapshot_observed_at":"2026-08-12T12:40:18.960350Z","submitted_at":"2024-11-25T21:42:26Z","title":"Effectiveness and strong graph indivisibility","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T13:03:15.961766Z"},"links":{"citing_paper":"/paper/2411.16950"},"observation_digest":"sha256:de3712849090606225246f871121a1b6587a206a1bda00e69a59327a1655245a","observation_id":"bc6abdc5-b547-4e9a-8210-fdf845780a8a","resolution":{"observed_at":"2026-08-12T13:03:16.287577Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T13:03:16.269571Z","title":"R everse mathematics and Ramsey’s property for trees,","venue":null,"work_id":"dd4208eb-03c1-4e59-971d-a93a570c4b49","year":2010},"citing_paper":{"arxiv_id":"2411.16950","last_updated":"2024-11-25T21:42:26Z","snapshot_observed_at":"2026-08-12T12:40:18.960350Z","submitted_at":"2024-11-25T21:42:26Z","title":"Effectiveness and strong graph indivisibility","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T13:03:15.966561Z"},"links":{"citing_paper":"/paper/2411.16950"},"observation_digest":"sha256:e013d7a8979f251084d3dd3b377a69139396200b91084dd24eb69d2db27b503c","observation_id":"0070f648-533b-4300-9cdf-824499c372d7","resolution":{"observed_at":"2026-08-12T13:03:16.273631Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T13:03:16.254943Z","title":"On uniform relationships between combinatorial problems ,","venue":null,"work_id":"7e7bd977-cff5-43ea-aca7-7391f0d1cd9b","year":2016},"citing_paper":{"arxiv_id":"2411.16950","last_updated":"2024-11-25T21:42:26Z","snapshot_observed_at":"2026-08-12T12:40:18.960350Z","submitted_at":"2024-11-25T21:42:26Z","title":"Effectiveness and strong graph indivisibility","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T13:03:15.970443Z"},"links":{"citing_paper":"/paper/2411.16950"},"observation_digest":"sha256:e0dd6a7f4913d7cd8788e7017d405f1405121618fa84c9d0099aaeab15989000","observation_id":"8e84200d-9619-4004-9560-75f97ca71ead","resolution":{"observed_at":"2026-08-12T13:03:16.259552Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T13:03:16.239470Z","title":"Dzhafarov and Carl Mummert, Reverse mathematics – problems, reductions, and proofs, Springer Nature, 2022","venue":null,"work_id":"159ce936-6864-4721-819b-7b5501e4dad8","year":2022},"citing_paper":{"arxiv_id":"2411.16950","last_updated":"2024-11-25T21:42:26Z","snapshot_observed_at":"2026-08-12T12:40:18.960350Z","submitted_at":"2024-11-25T21:42:26Z","title":"Effectiveness and strong graph indivisibility","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T13:03:15.974901Z"},"links":{"citing_paper":"/paper/2411.16950"},"observation_digest":"sha256:b100433c690886b3071f6bd3b3756f02ac8eb53479f4898304663b760e16b671","observation_id":"7ab85d52-c462-482d-b477-73712ab89a93","resolution":{"observed_at":"2026-08-12T13:03:16.244035Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T13:03:16.223641Z","title":"Ramsey’s theorem for singletons and strong computable reducibility ,","venue":null,"work_id":"fa2e51f3-3b6b-4479-9604-e1b75cc43052","year":2017},"citing_paper":{"arxiv_id":"2411.16950","last_updated":"2024-11-25T21:42:26Z","snapshot_observed_at":"2026-08-12T12:40:18.960350Z","submitted_at":"2024-11-25T21:42:26Z","title":"Effectiveness and strong graph indivisibility","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T13:03:15.978837Z"},"links":{"citing_paper":"/paper/2411.16950"},"observation_digest":"sha256:336530090ef1d49fae3170f4331be915c72187c354991b69f38f84f9492a4c31","observation_id":"b272d851-e4a5-43e7-8f5f-4cb33a2ff6fc","resolution":{"observed_at":"2026-08-12T13:03:16.228503Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.10535","last_updated":"2025-02-09T18:35:53Z","snapshot_observed_at":"2026-08-13T05:00:16.936053Z","submitted_at":"2023-12-16T20:21:32Z","title":"The tree pigeonhole principle in the Weihrauch degrees","version":2},"cited_work":{"arxiv_id":"2312.10535","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.10535","snapshot_observed_at":"2026-08-12T13:03:16.080098Z","title":"The tree pigeonhole principle in the Weihrauch degrees","venue":"math.LO","work_id":"9fa3a64e-e1b2-4cef-a919-444692b9fd9a","year":2023},"citing_paper":{"arxiv_id":"2411.16950","last_updated":"2024-11-25T21:42:26Z","snapshot_observed_at":"2026-08-12T12:40:18.960350Z","submitted_at":"2024-11-25T21:42:26Z","title":"Effectiveness and strong graph indivisibility","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T13:03:15.983868Z"},"links":{"cited_paper":"/paper/2312.10535","citing_paper":"/paper/2411.16950"},"observation_digest":"sha256:01eeefcf765f8d0fca062a11137835535be2181add8d3636919821c1988de8de","observation_id":"4b8bad97-cd86-4698-a94c-20826f7bf0fe","resolution":{"observed_at":"2026-08-12T13:03:16.084489Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.03919","last_updated":"2025-06-07T08:14:39Z","snapshot_observed_at":"2026-08-13T05:08:22.525705Z","submitted_at":"2023-12-06T21:34:37Z","title":"Indivisibility and uniform computational strength","version":8},"cited_work":{"arxiv_id":"2312.03919","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.03919","snapshot_observed_at":"2026-08-12T13:03:16.060836Z","title":"Indivisibility and uniform computational strength","venue":"math.LO","work_id":"ce431e94-ef42-40ae-8aef-0de9f7922b98","year":2023},"citing_paper":{"arxiv_id":"2411.16950","last_updated":"2024-11-25T21:42:26Z","snapshot_observed_at":"2026-08-12T12:40:18.960350Z","submitted_at":"2024-11-25T21:42:26Z","title":"Effectiveness and strong graph indivisibility","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T13:03:15.988167Z"},"links":{"cited_paper":"/paper/2312.03919","citing_paper":"/paper/2411.16950"},"observation_digest":"sha256:b88264c1024f7dccf33b9835eb671ad9e2488f724f5951b3fe260d21051e95dd","observation_id":"5e3effea-4448-47dc-a50a-6edbf7a4acf4","resolution":{"observed_at":"2026-08-12T13:03:16.067167Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T13:03:16.209507Z","title":"A family of countable homogeneous grap hs,","venue":null,"work_id":"d889dfbd-e0a2-47ec-8b90-a6a2ae3be7e5","year":1971},"citing_paper":{"arxiv_id":"2411.16950","last_updated":"2024-11-25T21:42:26Z","snapshot_observed_at":"2026-08-12T12:40:18.960350Z","submitted_at":"2024-11-25T21:42:26Z","title":"Effectiveness and strong graph indivisibility","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T13:03:15.992587Z"},"links":{"citing_paper":"/paper/2411.16950"},"observation_digest":"sha256:e52808dd6c6f91d56c08722a30001fa699b295ea23e8ef4170c6b6459d3fa6f2","observation_id":"ca5cbe22-46a4-4613-9f94-5ada8be2ff35","resolution":{"observed_at":"2026-08-12T13:03:16.214747Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T13:03:16.192387Z","title":"Hirschfeldt, Slicing the Truth: On the Computational and Reverse Mathema tics of Combinatorial Principles , W orld Scientific, 2014","venue":null,"work_id":"90546019-22ed-4610-a29f-d1eea2cc0871","year":2014},"citing_paper":{"arxiv_id":"2411.16950","last_updated":"2024-11-25T21:42:26Z","snapshot_observed_at":"2026-08-12T12:40:18.960350Z","submitted_at":"2024-11-25T21:42:26Z","title":"Effectiveness and strong graph indivisibility","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T13:03:15.997152Z"},"links":{"citing_paper":"/paper/2411.16950"},"observation_digest":"sha256:ba561bebe5ce866e73a97e8500b7022c09a9ac2a8ae7b0b4b3e387a28ac70337","observation_id":"69be6b7c-cf36-4397-b10e-7787f06e7718","resolution":{"observed_at":"2026-08-12T13:03:16.197911Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T13:03:16.178392Z","title":"On noti ons of computable reduction between Π 1 2 principles,","venue":null,"work_id":"057ceae5-c947-4a1a-bd5c-ac49193d65fc","year":2016},"citing_paper":{"arxiv_id":"2411.16950","last_updated":"2024-11-25T21:42:26Z","snapshot_observed_at":"2026-08-12T12:40:18.960350Z","submitted_at":"2024-11-25T21:42:26Z","title":"Effectiveness and strong graph indivisibility","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T13:03:16.001156Z"},"links":{"citing_paper":"/paper/2411.16950"},"observation_digest":"sha256:9ab557d9d9903fc8a0b87e2fb46578ffce91d5de5247080d22123e4de3bc8543","observation_id":"766b2350-9b2a-4a2f-9fd7-91cce9587570","resolution":{"observed_at":"2026-08-12T13:03:16.182634Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T13:03:16.165229Z","title":"Combinator ial principles weaker than Ramey’s Theorem for Pairs,","venue":null,"work_id":"a7c77366-1d3a-4e20-9cf9-c9f8d6a1800f","year":2007},"citing_paper":{"arxiv_id":"2411.16950","last_updated":"2024-11-25T21:42:26Z","snapshot_observed_at":"2026-08-12T12:40:18.960350Z","submitted_at":"2024-11-25T21:42:26Z","title":"Effectiveness and strong graph indivisibility","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T13:03:16.005595Z"},"links":{"citing_paper":"/paper/2411.16950"},"observation_digest":"sha256:2cfd9840149bb30ab7d356da3768571ae8924342ff74aa9c153af4159802b028","observation_id":"37dc8c62-cba8-4503-a62e-62b0caf06a9d","resolution":{"observed_at":"2026-08-12T13:03:16.169884Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T13:03:16.151733Z","title":"Hirst, Combinatorics in Subsystems of Second Order Arithmetic , PhD thesis, Penn- sylvania State University, 1987","venue":null,"work_id":"1656c96a-2f49-4d86-90b4-fa9956c5a64e","year":1987},"citing_paper":{"arxiv_id":"2411.16950","last_updated":"2024-11-25T21:42:26Z","snapshot_observed_at":"2026-08-12T12:40:18.960350Z","submitted_at":"2024-11-25T21:42:26Z","title":"Effectiveness and strong graph indivisibility","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T13:03:16.009495Z"},"links":{"citing_paper":"/paper/2411.16950"},"observation_digest":"sha256:66610c0f9772f854e0a200d322b0724ff84292fbe592b09c87b0960f70e29e06","observation_id":"2aeb9302-52a6-4588-98e4-73c3ad8a2966","resolution":{"observed_at":"2026-08-12T13:03:16.156338Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T13:03:16.136819Z","title":"Partition genericity and pigeonhole basis theorems,","venue":null,"work_id":"fad6183c-050e-477e-912c-8194d0f34a5e","year":2024},"citing_paper":{"arxiv_id":"2411.16950","last_updated":"2024-11-25T21:42:26Z","snapshot_observed_at":"2026-08-12T12:40:18.960350Z","submitted_at":"2024-11-25T21:42:26Z","title":"Effectiveness and strong graph indivisibility","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T13:03:16.013339Z"},"links":{"citing_paper":"/paper/2411.16950"},"observation_digest":"sha256:537e62efb9b0ba613b70a22c8153bc17eebeef66b49fddd245978fb3b1ce316a","observation_id":"8df6e3ba-479a-4d92-9936-c8e12c03208f","resolution":{"observed_at":"2026-08-12T13:03:16.141651Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T13:03:16.121559Z","title":"The weakness of being cohesive, thin or free in reverse mathematics,","venue":null,"work_id":"0f06c681-0d03-4d15-b071-05e45221835b","year":2016},"citing_paper":{"arxiv_id":"2411.16950","last_updated":"2024-11-25T21:42:26Z","snapshot_observed_at":"2026-08-12T12:40:18.960350Z","submitted_at":"2024-11-25T21:42:26Z","title":"Effectiveness and strong graph indivisibility","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T13:03:16.017434Z"},"links":{"citing_paper":"/paper/2411.16950"},"observation_digest":"sha256:8309b0c8b2d3adb7ed225dbc1c1504cdcd2b9417ca24dcd445de31e8844ec396","observation_id":"bc79ad4f-a22a-4a7b-ad31-5afffa3d41ae","resolution":{"observed_at":"2026-08-12T13:03:16.128313Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T13:03:16.106794Z","title":"Simpson, Subsystems of second order arithmetic , Springer–Verlag, Heidelberg, 1999","venue":null,"work_id":"05a6e169-351a-4723-b494-ec2555ac8fce","year":1999},"citing_paper":{"arxiv_id":"2411.16950","last_updated":"2024-11-25T21:42:26Z","snapshot_observed_at":"2026-08-12T12:40:18.960350Z","submitted_at":"2024-11-25T21:42:26Z","title":"Effectiveness and strong graph indivisibility","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T13:03:16.021782Z"},"links":{"citing_paper":"/paper/2411.16950"},"observation_digest":"sha256:3e65484ed884353e5b086a84431e011e80dbdda0a4d9cdbc18f805c7acd2183a","observation_id":"f65bf2bb-6389-4d4d-bc7c-eec6ff2aa04e","resolution":{"observed_at":"2026-08-12T13:03:16.110830Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T13:03:16.093101Z","title":"Soare, Recursively enumerable sets and degrees , Springer–Verlag, Heidelberg, 1987","venue":null,"work_id":"df6f9b7e-7ac9-4fa6-ba9d-fa78d5c072f7","year":1987},"citing_paper":{"arxiv_id":"2411.16950","last_updated":"2024-11-25T21:42:26Z","snapshot_observed_at":"2026-08-12T12:40:18.960350Z","submitted_at":"2024-11-25T21:42:26Z","title":"Effectiveness and strong graph indivisibility","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T13:03:16.026386Z"},"links":{"citing_paper":"/paper/2411.16950"},"observation_digest":"sha256:610891ab2b97ea9cd8190c77b08a948f84f0df8ee7a6fd907fb0ea5dcf1609b9","observation_id":"decb4116-ef78-4ff4-80bf-982087015c15","resolution":{"observed_at":"2026-08-12T13:03:16.098019Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.16950","last_updated":"2024-11-25T21:42:26Z","latest_version":1,"primary_category":"math.LO","snapshot_observed_at":"2026-08-12T12:40:18.960350Z","submitted_at":"2024-11-25T21:42:26Z","title":"Effectiveness and strong graph indivisibility"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":2,"verified_fuzzy":19},"total_outbound_references":21},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"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."}