{"as_of":"2026-08-11T15:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:14b5ebdd799f7c048f183d0ce8cbf3d65248c62fb7968526b79bcd10a65da3ca","coverage":[{"denominator":13,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T18:14:07.871810Z","state":"measured"},{"denominator":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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/2501.11617/citation-record","integrity":"/paper/2501.11617/integrity","json":"/paper/2501.11617/citation-record.json","paper":"/paper/2501.11617"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2206.04387","last_updated":"2022-06-09T09:57:45Z","snapshot_observed_at":"2026-08-04T13:29:54.800796Z","submitted_at":"2022-06-09T09:57:45Z","title":"Kernelization for Feedback Vertex Set via Elimination Distance to a Forest","version":1},"cited_work":{"arxiv_id":"2206.04387","doi":null,"metadata_source":"pith","pith_arxiv_id":"2206.04387","snapshot_observed_at":"2026-08-10T18:14:08.043120Z","title":"Kernelization for Feedback Vertex Set via Elimination Distance to a Forest","venue":"cs.DS","work_id":"29af6bb3-5f7b-45d5-93b7-7adfbcbb19b2","year":2022},"citing_paper":{"arxiv_id":"2501.11617","last_updated":"2026-07-31T07:56:21Z","snapshot_observed_at":"2026-08-10T18:00:18.384178Z","submitted_at":"2025-01-20T17:29:53Z","title":"Excluding a rectangular grid","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T18:14:07.836678Z"},"links":{"cited_paper":"/paper/2206.04387","citing_paper":"/paper/2501.11617"},"observation_digest":"sha256:8ee3d56d47e155c174f29b17318226c07782a4087b59a628b9dc357eab87045b","observation_id":"73207a41-2b13-40e3-8dea-134abddeff8d","resolution":{"observed_at":"2026-08-10T18:14:08.048123Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.09098","last_updated":"2016-09-28T20:07:19Z","snapshot_observed_at":"2026-08-04T16:41:11.700469Z","submitted_at":"2016-09-28T20:07:19Z","title":"A generalization of the Grid Theorem","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.09098","snapshot_observed_at":"2026-08-10T18:14:07.845682Z","title":"[Hig52] Graham Higman","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.11617","last_updated":"2026-07-31T07:56:21Z","snapshot_observed_at":"2026-08-10T18:00:18.384178Z","submitted_at":"2025-01-20T17:29:53Z","title":"Excluding a rectangular grid","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T18:14:07.845682Z"},"links":{"cited_paper":"/paper/1609.09098","citing_paper":"/paper/2501.11617"},"observation_digest":"sha256:290af56b720bd92036fe261d6af4eef5c7866028ed7a1f0bf4a84718cbf1ea7a","observation_id":"7eaf83bf-f804-4d65-bdbe-a01dbbee75b2","resolution":{"observed_at":"2026-08-10T18:14:07.845682Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.00496","last_updated":"2021-04-06T10:22:46Z","snapshot_observed_at":"2026-07-31T18:23:31.997025Z","submitted_at":"2020-02-02T21:32:28Z","title":"Excluding a ladder","version":3},"cited_work":{"arxiv_id":"2002.00496","doi":null,"metadata_source":"pith","pith_arxiv_id":"2002.00496","snapshot_observed_at":"2026-08-10T18:14:07.979684Z","title":"Excluding a ladder","venue":"math.CO","work_id":"562d8a49-f403-4911-abdd-f83bf2dcb313","year":2020},"citing_paper":{"arxiv_id":"2501.11617","last_updated":"2026-07-31T07:56:21Z","snapshot_observed_at":"2026-08-10T18:00:18.384178Z","submitted_at":"2025-01-20T17:29:53Z","title":"Excluding a rectangular grid","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T18:14:07.850976Z"},"links":{"cited_paper":"/paper/2002.00496","citing_paper":"/paper/2501.11617"},"observation_digest":"sha256:0525a8988e17b518c6a1eff5ec909a9d41c022556b3d611e356b1123c12c6907","observation_id":"e4b97bf4-10e9-48ce-8c39-33f8c6798ac9","resolution":{"observed_at":"2026-08-10T18:14:07.985309Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.17306","last_updated":"2025-04-04T13:55:12Z","snapshot_observed_at":"2026-08-08T04:12:01.465198Z","submitted_at":"2024-04-26T10:32:24Z","title":"Quickly excluding an apex-forest","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.17306","snapshot_observed_at":"2026-08-10T18:14:07.855948Z","title":"[HLMR24b] Jędrzej Hodor, Hoang La, Piotr Micek, and Clément Rambaud","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.11617","last_updated":"2026-07-31T07:56:21Z","snapshot_observed_at":"2026-08-10T18:00:18.384178Z","submitted_at":"2025-01-20T17:29:53Z","title":"Excluding a rectangular grid","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T18:14:07.855948Z"},"links":{"cited_paper":"/paper/2404.17306","citing_paper":"/paper/2501.11617"},"observation_digest":"sha256:8ab5608eb3d80e5403164b3bdff841cbe6b305d87e07476c4206e70a8d4711c3","observation_id":"36d686ab-7ad5-4b11-b1a8-68fe6b4059e7","resolution":{"observed_at":"2026-08-10T18:14:07.855948Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.04588","last_updated":"2025-04-04T15:18:32Z","snapshot_observed_at":"2026-07-06T18:42:01.518014Z","submitted_at":"2024-07-05T15:35:37Z","title":"Weak coloring numbers of minor-closed graph classes","version":2},"cited_work":{"arxiv_id":"2407.04588","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.04588","snapshot_observed_at":"2026-08-10T18:14:07.940282Z","title":"Weak coloring numbers of minor-closed graph classes","venue":"math.CO","work_id":"8f648f64-806b-471c-a3f3-bbc80298a882","year":2024},"citing_paper":{"arxiv_id":"2501.11617","last_updated":"2026-07-31T07:56:21Z","snapshot_observed_at":"2026-08-10T18:00:18.384178Z","submitted_at":"2025-01-20T17:29:53Z","title":"Excluding a rectangular grid","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T18:14:07.860865Z"},"links":{"cited_paper":"/paper/2407.04588","citing_paper":"/paper/2501.11617"},"observation_digest":"sha256:b29ce4911b493ee44211a80195407936dffad17ebb0d9adf05edc583f3d48414","observation_id":"4e634170-9937-446f-b733-86f960129600","resolution":{"observed_at":"2026-08-10T18:14:07.947250Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.14121","last_updated":"2026-04-30T18:42:46Z","snapshot_observed_at":"2026-07-06T15:20:41.322682Z","submitted_at":"2023-04-27T12:13:46Z","title":"An Overview of Universal Obstructions for Graph Parameters","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.14121","snapshot_observed_at":"2026-08-10T18:14:07.871810Z","title":"[Ram97] Siddharthan Ramachandramurthi","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.11617","last_updated":"2026-07-31T07:56:21Z","snapshot_observed_at":"2026-08-10T18:00:18.384178Z","submitted_at":"2025-01-20T17:29:53Z","title":"Excluding a rectangular grid","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T18:14:07.871810Z"},"links":{"cited_paper":"/paper/2304.14121","citing_paper":"/paper/2501.11617"},"observation_digest":"sha256:e1e791141c8556f0e7fb2489aaf2ad98fe35d79d1104307290c27a4e39830159","observation_id":"27b675e2-1da4-483b-8664-aa1f1a03d75e","resolution":{"observed_at":"2026-08-10T18:14:07.871810Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1305.6577","last_updated":"2016-08-09T21:33:21Z","snapshot_observed_at":"2026-07-06T03:14:32.290625Z","submitted_at":"2013-05-28T18:27:20Z","title":"Polynomial Bounds for the Grid-Minor Theorem","version":5},"cited_work":{"arxiv_id":"1305.6577","doi":null,"metadata_source":"pith","pith_arxiv_id":"1305.6577","snapshot_observed_at":"2026-08-10T18:14:08.124607Z","title":"Polynomial Bounds for the Grid-Minor Theorem","venue":"cs.DS","work_id":"a953e10c-9bdc-41d5-8472-7ec850bfb7ea","year":2013},"citing_paper":{"arxiv_id":"2501.11617","last_updated":"2026-07-31T07:56:21Z","snapshot_observed_at":"2026-08-10T18:00:18.384178Z","submitted_at":"2025-01-20T17:29:53Z","title":"Excluding a rectangular grid","version":2},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-10T18:14:07.816405Z"},"links":{"cited_paper":"/paper/1305.6577","citing_paper":"/paper/2501.11617"},"observation_digest":"sha256:5512980422ebb504432aab6124617abdc62b0631eda97bb432d3536ef2fbc330","observation_id":"89fb05f8-041c-4d1d-a385-5f935b422cba","resolution":{"observed_at":"2026-08-10T18:14:08.129638Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1703.03756","last_updated":"2017-03-10T16:41:22Z","snapshot_observed_at":"2026-07-06T05:33:15.258956Z","submitted_at":"2017-03-10T16:41:22Z","title":"A unified treatment of linked and lean tree-decompositions","version":1},"cited_work":{"arxiv_id":"1703.03756","doi":null,"metadata_source":"pith","pith_arxiv_id":"1703.03756","snapshot_observed_at":"2026-08-10T18:14:08.019025Z","title":"A unified treatment of linked and lean tree-decompositions","venue":"math.CO","work_id":"577dd5fb-e2c0-45f4-98be-a1ee930268c1","year":2017},"citing_paper":{"arxiv_id":"2501.11617","last_updated":"2026-07-31T07:56:21Z","snapshot_observed_at":"2026-08-10T18:00:18.384178Z","submitted_at":"2025-01-20T17:29:53Z","title":"Excluding a rectangular grid","version":2},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-10T18:14:07.841052Z"},"links":{"cited_paper":"/paper/1703.03756","citing_paper":"/paper/2501.11617"},"observation_digest":"sha256:4f3a8c39c98da55082cabca088d8ce40367127c3b7f6ceb96a8147228374253a","observation_id":"e60af814-97b5-49b3-86ce-aad2a665cea4","resolution":{"observed_at":"2026-08-10T18:14:08.024280Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1908.05706","last_updated":"2019-08-26T23:32:36Z","snapshot_observed_at":"2026-08-07T15:24:27.276281Z","submitted_at":"2019-08-15T18:48:31Z","title":"Homotopy height, grid-major height and graph-drawing height","version":2},"cited_work":{"arxiv_id":"1908.05706","doi":null,"metadata_source":"pith","pith_arxiv_id":"1908.05706","snapshot_observed_at":"2026-08-10T18:14:08.145430Z","title":"Homotopy height, grid-major height and graph-drawing height","venue":"cs.CG","work_id":"8d17c642-4ea0-44ca-8214-cc98e631eaf0","year":2019},"citing_paper":{"arxiv_id":"2501.11617","last_updated":"2026-07-31T07:56:21Z","snapshot_observed_at":"2026-08-10T18:00:18.384178Z","submitted_at":"2025-01-20T17:29:53Z","title":"Excluding a rectangular grid","version":2},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-10T18:14:07.810491Z"},"links":{"cited_paper":"/paper/1908.05706","citing_paper":"/paper/2501.11617"},"observation_digest":"sha256:a36f9ea0f1f905d81694f1feb2e7a2e3661a065182ddc1e25eb9c909836bc3f7","observation_id":"9bd42835-08ad-44f1-bfb6-a320a429ab30","resolution":{"observed_at":"2026-08-10T18:14:08.150564Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.06864","last_updated":"2020-09-26T06:43:17Z","snapshot_observed_at":"2026-08-11T08:52:04.196908Z","submitted_at":"2018-10-16T08:02:45Z","title":"Randomized contractions meet lean decompositions","version":3},"cited_work":{"arxiv_id":"1810.06864","doi":null,"metadata_source":"pith","pith_arxiv_id":"1810.06864","snapshot_observed_at":"2026-08-10T18:14:08.102565Z","title":"Randomized contractions meet lean decompositions","venue":"cs.DS","work_id":"f6bc90ee-b085-4398-b5c9-d8a06b9b372f","year":2018},"citing_paper":{"arxiv_id":"2501.11617","last_updated":"2026-07-31T07:56:21Z","snapshot_observed_at":"2026-08-10T18:00:18.384178Z","submitted_at":"2025-01-20T17:29:53Z","title":"Excluding a rectangular grid","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-10T18:14:07.821911Z"},"links":{"cited_paper":"/paper/1810.06864","citing_paper":"/paper/2501.11617"},"observation_digest":"sha256:a792daae1cdc30292d64151e72e6484b629bbde7b734f124b7e8437e8a9465d8","observation_id":"d82439d9-6df7-4fd0-94b0-fdc7a0d1048f","resolution":{"observed_at":"2026-08-10T18:14:08.107700Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1901.07944","last_updated":"2019-01-23T15:22:32Z","snapshot_observed_at":"2026-07-06T07:28:31.261067Z","submitted_at":"2019-01-23T15:22:32Z","title":"Towards Tight(er) Bounds for the Excluded Grid Theorem","version":1},"cited_work":{"arxiv_id":"1901.07944","doi":null,"metadata_source":"pith","pith_arxiv_id":"1901.07944","snapshot_observed_at":"2026-08-10T18:14:08.080604Z","title":"Towards Tight(er) Bounds for the Excluded Grid Theorem","venue":"cs.DM","work_id":"fc959a13-52fb-419e-995a-9dd1117e941b","year":2019},"citing_paper":{"arxiv_id":"2501.11617","last_updated":"2026-07-31T07:56:21Z","snapshot_observed_at":"2026-08-10T18:00:18.384178Z","submitted_at":"2025-01-20T17:29:53Z","title":"Excluding a rectangular grid","version":2},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-10T18:14:07.827204Z"},"links":{"cited_paper":"/paper/1901.07944","citing_paper":"/paper/2501.11617"},"observation_digest":"sha256:ce2a2244b7376c58e36c63c2aa4261fc99fe3ede5e20ac64fe80fad7f3176505","observation_id":"6f49ecb6-ead2-4db0-8018-8c64484a4b8a","resolution":{"observed_at":"2026-08-10T18:14:08.085829Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.03688","last_updated":"2024-11-23T14:34:33Z","snapshot_observed_at":"2026-08-07T17:30:56.752510Z","submitted_at":"2023-04-07T15:14:22Z","title":"Graph Parameters, Universal Obstructions, and WQO","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.03688","snapshot_observed_at":"2026-08-10T18:14:07.866206Z","title":"[PPT23b] Christophe Paul, Evangelos Protopapas, and Dimitrios M","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.11617","last_updated":"2026-07-31T07:56:21Z","snapshot_observed_at":"2026-08-10T18:00:18.384178Z","submitted_at":"2025-01-20T17:29:53Z","title":"Excluding a rectangular grid","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-10T18:14:07.866206Z"},"links":{"cited_paper":"/paper/2304.03688","citing_paper":"/paper/2501.11617"},"observation_digest":"sha256:a3a4583532cb779dbf4dafd2bfb6b561eedce4f2924cf060f1e289896862b25b","observation_id":"d551805e-321f-4c4d-95e4-af9940bbf3d4","resolution":{"observed_at":"2026-08-10T18:14:07.866206Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.02816","last_updated":"2026-06-01T10:50:53Z","snapshot_observed_at":"2026-07-06T15:50:57.218090Z","submitted_at":"2023-07-06T07:20:44Z","title":"The grid-minor theorem revisited","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.02816","snapshot_observed_at":"2026-08-10T18:14:07.831859Z","title":"[Die17] Reinhard Diestel","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.11617","last_updated":"2026-07-31T07:56:21Z","snapshot_observed_at":"2026-08-10T18:00:18.384178Z","submitted_at":"2025-01-20T17:29:53Z","title":"Excluding a rectangular grid","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-10T18:14:07.831859Z"},"links":{"cited_paper":"/paper/2307.02816","citing_paper":"/paper/2501.11617"},"observation_digest":"sha256:9aaef89c9efb6b0dc697e36b7681a395eabc44269584d55b3ff08bd0348183c7","observation_id":"4dca8bbc-6f81-466c-b9e2-b3af0e6a0402","resolution":{"observed_at":"2026-08-10T18:14:07.831859Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2501.11617","last_updated":"2026-07-31T07:56:21Z","latest_version":2,"primary_category":"math.CO","snapshot_observed_at":"2026-08-10T18:00:18.384178Z","submitted_at":"2025-01-20T17:29:53Z","title":"Excluding a rectangular grid"},"reference_resolution":{"displayed":13,"state_counts":{"malformed_identifier":0,"metadata_mismatch":7,"parse_uncertain":0,"unresolved":5,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":13},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 13 of 13 outbound references and 0 inbound Pith citation observations for arXiv:2501.11617."}