{"as_of":"2026-08-11T18:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8267fe0760264c7dcd92ca1d6a60a4a2969ce70c42ab0348bf395402b61ccf0c","coverage":[{"denominator":28,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":28,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T15:45:26.721080Z","state":"measured"},{"denominator":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T15:06:19.098832Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-10T15:06:19.390722Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.13907","last_updated":"2025-01-23T18:37:03Z","snapshot_observed_at":"2026-08-10T20:38:44.509329Z","submitted_at":"2025-01-23T18:37:03Z","title":"Graphs with no long claws: An improved bound for the analog of the Gy\\'{a}rf\\'{a}s' path argument","version":1},"cited_work":{"arxiv_id":"2501.13907","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.13907","snapshot_observed_at":"2026-08-10T15:06:19.390722Z","title":"Graphs with no long claws: An improved bound for the analog of the Gy\\'{a}rf\\'{a}s' path argument","venue":"math.CO","work_id":"4f11d193-61ca-4edb-8ef9-3a80cecf0dce","year":2025},"citing_paper":{"arxiv_id":"2501.14658","last_updated":"2025-02-07T08:55:12Z","snapshot_observed_at":"2026-08-10T20:38:30.426958Z","submitted_at":"2025-01-24T17:27:37Z","title":"Tree independence number V. Walls and claws","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T15:06:19.098832Z"},"links":{"cited_paper":"/paper/2501.13907","citing_paper":"/paper/2501.14658"},"observation_digest":"sha256:bc8e0c78b1c49c9b0a17e16b18b039a93e2417fbb974c24a7ba548dd608c7fce","observation_id":"e4c63799-3ed2-4720-87f2-8097f9d241f4","resolution":{"observed_at":"2026-08-10T15:06:19.395744Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2501.13907/citation-record","integrity":"/paper/2501.13907/integrity","json":"/paper/2501.13907/citation-record.json","paper":"/paper/2501.13907"},"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-10T15:45:27.399250Z","title":"Polynomial-time algorithm for maximum independent set in bounded-degree graphs with no long induced claws","venue":null,"work_id":"6b80f407-8de7-4581-be7d-d68ea7e7760d","year":2022},"citing_paper":{"arxiv_id":"2501.13907","last_updated":"2025-01-23T18:37:03Z","snapshot_observed_at":"2026-08-10T20:38:44.509329Z","submitted_at":"2025-01-23T18:37:03Z","title":"Graphs with no long claws: An improved bound for the analog of the Gy\\'{a}rf\\'{a}s' path argument","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T15:45:26.598630Z"},"links":{"citing_paper":"/paper/2501.13907"},"observation_digest":"sha256:82cfa5d7071c2403ba552f825b9565cbf4ecc99788cb274561b14d00c4f21676","observation_id":"c92c84be-f9e5-4ccc-b0ad-f3a32f7a67d5","resolution":{"observed_at":"2026-08-10T15:45:27.405005Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jctb.2021.10.003","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:45:26.928396Z","title":"Graphs with polynomially many minimal separators.J","venue":null,"work_id":"7e7c99fc-2756-4bf4-a5c9-5433e16f157d","year":2022},"citing_paper":{"arxiv_id":"2501.13907","last_updated":"2025-01-23T18:37:03Z","snapshot_observed_at":"2026-08-10T20:38:44.509329Z","submitted_at":"2025-01-23T18:37:03Z","title":"Graphs with no long claws: An improved bound for the analog of the Gy\\'{a}rf\\'{a}s' path argument","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T15:45:26.608402Z"},"links":{"citing_paper":"/paper/2501.13907"},"observation_digest":"sha256:88f4b37a7e460483b4961271e83b0d8a9edcc30fd833bf3d4aedc3c636ef4058","observation_id":"1459b387-d48d-40e3-8740-1915fb6a5d19","resolution":{"observed_at":"2026-08-10T15:45:26.932991Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.stacs.2","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:45:26.914818Z","title":"Max weight in- dependent set in sparse graphs with no long claws","venue":null,"work_id":"bf38b9ed-f829-44a5-8086-3cd095d49dfa","year":2024},"citing_paper":{"arxiv_id":"2501.13907","last_updated":"2025-01-23T18:37:03Z","snapshot_observed_at":"2026-08-10T20:38:44.509329Z","submitted_at":"2025-01-23T18:37:03Z","title":"Graphs with no long claws: An improved bound for the analog of the Gy\\'{a}rf\\'{a}s' path argument","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T15:45:26.613111Z"},"links":{"citing_paper":"/paper/2501.13907"},"observation_digest":"sha256:668bc69e1baeaa8111f3c04a9f7c163bf3186601ce1c361b73a1b3ceaf6b6c14","observation_id":"31d7669f-b7d5-420d-8b47-45f0d98eb021","resolution":{"observed_at":"2026-08-10T15:45:26.919334Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611976465.116","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:45:26.900527Z","title":"Sey- mour","venue":null,"work_id":"3a29eb28-8aeb-45e6-a151-c93ac69e3baf","year":2021},"citing_paper":{"arxiv_id":"2501.13907","last_updated":"2025-01-23T18:37:03Z","snapshot_observed_at":"2026-08-10T20:38:44.509329Z","submitted_at":"2025-01-23T18:37:03Z","title":"Graphs with no long claws: An improved bound for the analog of the Gy\\'{a}rf\\'{a}s' path argument","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T15:45:26.617758Z"},"links":{"citing_paper":"/paper/2501.13907"},"observation_digest":"sha256:a29daa758ae43fb03da119b7db7e436e5b60d0adf39cb373d4b444e970dd2e16","observation_id":"2d73f80a-1247-4da0-bb5d-f2c12bb1f99c","resolution":{"observed_at":"2026-08-10T15:45:26.905188Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:45:27.383656Z","title":"Alekseev","venue":null,"work_id":"111296ca-8ee2-41d8-880b-ca0a1238211d","year":1982},"citing_paper":{"arxiv_id":"2501.13907","last_updated":"2025-01-23T18:37:03Z","snapshot_observed_at":"2026-08-10T20:38:44.509329Z","submitted_at":"2025-01-23T18:37:03Z","title":"Graphs with no long claws: An improved bound for the analog of the Gy\\'{a}rf\\'{a}s' path argument","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T15:45:26.622318Z"},"links":{"citing_paper":"/paper/2501.13907"},"observation_digest":"sha256:71b170a2c654a0e3782da7d0fa24694af35972763cee345cbf42592f02590bd0","observation_id":"efc86cac-e431-4f15-a4fd-76ab31f71438","resolution":{"observed_at":"2026-08-10T15:45:27.388410Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:45:27.368309Z","title":"Alekseev","venue":null,"work_id":"97a58960-fabc-4285-83c5-f3b8b1867556","year":2003},"citing_paper":{"arxiv_id":"2501.13907","last_updated":"2025-01-23T18:37:03Z","snapshot_observed_at":"2026-08-10T20:38:44.509329Z","submitted_at":"2025-01-23T18:37:03Z","title":"Graphs with no long claws: An improved bound for the analog of the Gy\\'{a}rf\\'{a}s' path argument","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T15:45:26.627208Z"},"links":{"citing_paper":"/paper/2501.13907"},"observation_digest":"sha256:438fcdf6ae83d85d0e609bb18446ef132635aef30819a28c852afff7210592a5","observation_id":"8a96ae87-5ecf-4103-9903-be3ed300dcff","resolution":{"observed_at":"2026-08-10T15:45:27.372949Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:45:27.353251Z","title":"Alekseev","venue":null,"work_id":"0557f1b1-63fb-4756-aba5-976f870cc76e","year":2004},"citing_paper":{"arxiv_id":"2501.13907","last_updated":"2025-01-23T18:37:03Z","snapshot_observed_at":"2026-08-10T20:38:44.509329Z","submitted_at":"2025-01-23T18:37:03Z","title":"Graphs with no long claws: An improved bound for the analog of the Gy\\'{a}rf\\'{a}s' path argument","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T15:45:26.631613Z"},"links":{"citing_paper":"/paper/2501.13907"},"observation_digest":"sha256:b9a30a8d94b32976104db2b6b7ee14b910168eb7dbce8770d96ead3121525608","observation_id":"2b53149f-7979-483c-8ec4-72be614c79d8","resolution":{"observed_at":"2026-08-10T15:45:27.357537Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:45:26.635966Z","title":"Subexponential-time algorithms for Maximum Independent Set inPt-free and broom-free graphs","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.13907","last_updated":"2025-01-23T18:37:03Z","snapshot_observed_at":"2026-08-10T20:38:44.509329Z","submitted_at":"2025-01-23T18:37:03Z","title":"Graphs with no long claws: An improved bound for the analog of the Gy\\'{a}rf\\'{a}s' path argument","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T15:45:26.635966Z"},"links":{"citing_paper":"/paper/2501.13907"},"observation_digest":"sha256:4ddd60cfe97f1bacf906425b24e8f47746a606de659feb10fc5977582abb7239","observation_id":"c741155d-b1f0-4450-a0b8-bd500cc7ce19","resolution":{"observed_at":"2026-08-10T15:45:26.635966Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:45:27.339358Z","title":"Tree independence number V","venue":null,"work_id":"303c98ce-0424-420d-bc8c-00e031218405","year":2025},"citing_paper":{"arxiv_id":"2501.13907","last_updated":"2025-01-23T18:37:03Z","snapshot_observed_at":"2026-08-10T20:38:44.509329Z","submitted_at":"2025-01-23T18:37:03Z","title":"Graphs with no long claws: An improved bound for the analog of the Gy\\'{a}rf\\'{a}s' path argument","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T15:45:26.640363Z"},"links":{"citing_paper":"/paper/2501.13907"},"observation_digest":"sha256:f2f0d8b8ddd6e245fe68a447e9f1bcc49f2e48679024a9d7ab097b0a505cb777","observation_id":"e0cb4f33-cf83-41d7-85fd-112a4d19836e","resolution":{"observed_at":"2026-08-10T15:45:27.343734Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/20m1333778i","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:45:26.877745Z","title":"Quasi- polynomial time approximation schemes for the Maximum Weight Independent Set Prob- lem in H-free graphs","venue":null,"work_id":"c77a0b57-3908-4b15-ac46-f3c1e7fffbeb","year":2024},"citing_paper":{"arxiv_id":"2501.13907","last_updated":"2025-01-23T18:37:03Z","snapshot_observed_at":"2026-08-10T20:38:44.509329Z","submitted_at":"2025-01-23T18:37:03Z","title":"Graphs with no long claws: An improved bound for the analog of the Gy\\'{a}rf\\'{a}s' path argument","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T15:45:26.644954Z"},"links":{"citing_paper":"/paper/2501.13907"},"observation_digest":"sha256:77512cefa49ad87637a21be23d27ef44334e8004991e9d4a7367296518ef948d","observation_id":"6ebec9a6-c02a-4122-85e5-9c6b4f4b5486","resolution":{"observed_at":"2026-08-10T15:45:26.882428Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":"10.1017/cbo9780511734885.008","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:45:26.863145Z","title":null,"venue":null,"work_id":"e766ecf5-2333-417f-8d7a-70b70e72eee6","year":2005},"citing_paper":{"arxiv_id":"2501.13907","last_updated":"2025-01-23T18:37:03Z","snapshot_observed_at":"2026-08-10T20:38:44.509329Z","submitted_at":"2025-01-23T18:37:03Z","title":"Graphs with no long claws: An improved bound for the analog of the Gy\\'{a}rf\\'{a}s' path argument","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T15:45:26.649674Z"},"links":{"citing_paper":"/paper/2501.13907"},"observation_digest":"sha256:33211b910a70c70523fea8dd0975d86cf2298f6f4a59790dbe2931b0d22cd60a","observation_id":"b3177e89-b021-47bc-833f-d5d79626696f","resolution":{"observed_at":"2026-08-10T15:45:26.867603Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:45:27.325314Z","title":null,"venue":null,"work_id":"c978937c-7e03-48cc-9e37-f02b3bf1987f","year":null},"citing_paper":{"arxiv_id":"2501.13907","last_updated":"2025-01-23T18:37:03Z","snapshot_observed_at":"2026-08-10T20:38:44.509329Z","submitted_at":"2025-01-23T18:37:03Z","title":"Graphs with no long claws: An improved bound for the analog of the Gy\\'{a}rf\\'{a}s' path argument","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T15:45:26.654070Z"},"links":{"citing_paper":"/paper/2501.13907"},"observation_digest":"sha256:9d3a0a7cf4abf6b18ec175df3e0a5ad02a91d3a237f0dc409b343566ffeec940","observation_id":"e2236f8d-c542-446e-9b15-aef7751eab0c","resolution":{"observed_at":"2026-08-10T15:45:27.329713Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:45:26.663366Z","title":"Independent set onPk-free graphs in quasi-polynomial time","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.13907","last_updated":"2025-01-23T18:37:03Z","snapshot_observed_at":"2026-08-10T20:38:44.509329Z","submitted_at":"2025-01-23T18:37:03Z","title":"Graphs with no long claws: An improved bound for the analog of the Gy\\'{a}rf\\'{a}s' path argument","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T15:45:26.663366Z"},"links":{"citing_paper":"/paper/2501.13907"},"observation_digest":"sha256:c4e359ba962d3166c45e7929267b65171c6feccfb79e18cd5d399963bbf690bb","observation_id":"bb720b94-6b1f-4745-9f3f-f9f0a65f0de3","resolution":{"observed_at":"2026-08-10T15:45:26.663366Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:45:26.667421Z","title":"Maximum weight independent set in graphs with no long claws in quasi- polynomial time","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.13907","last_updated":"2025-01-23T18:37:03Z","snapshot_observed_at":"2026-08-10T20:38:44.509329Z","submitted_at":"2025-01-23T18:37:03Z","title":"Graphs with no long claws: An improved bound for the analog of the Gy\\'{a}rf\\'{a}s' path argument","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T15:45:26.667421Z"},"links":{"citing_paper":"/paper/2501.13907"},"observation_digest":"sha256:f203e11a1dec6864228715eccd2193e3a3047afe272b1567c62206671ad2ea9a","observation_id":"d1304be7-8b5c-4868-ba32-3b5d232b1b6a","resolution":{"observed_at":"2026-08-10T15:45:26.667421Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:45:26.671846Z","title":"Finding large induced sparse subgraphs inC>t-free graphs in quasipolynomial time","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.13907","last_updated":"2025-01-23T18:37:03Z","snapshot_observed_at":"2026-08-10T20:38:44.509329Z","submitted_at":"2025-01-23T18:37:03Z","title":"Graphs with no long claws: An improved bound for the analog of the Gy\\'{a}rf\\'{a}s' path argument","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T15:45:26.671846Z"},"links":{"citing_paper":"/paper/2501.13907"},"observation_digest":"sha256:9630b79f80e8523d2a316b7a499c904d8f8e95cafdd28422a25e23ef9e087825","observation_id":"c91e9345-1a22-46ce-8fd2-a9b7e46127b7","resolution":{"observed_at":"2026-08-10T15:45:26.671846Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611975482.77","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:45:26.839188Z","title":"Polynomial-time algorithm for Maximum Weight Independent Set onP6-free graphs","venue":null,"work_id":"819dbf91-bc7c-43b7-b707-39322ed4e4f0","year":2019},"citing_paper":{"arxiv_id":"2501.13907","last_updated":"2025-01-23T18:37:03Z","snapshot_observed_at":"2026-08-10T20:38:44.509329Z","submitted_at":"2025-01-23T18:37:03Z","title":"Graphs with no long claws: An improved bound for the analog of the Gy\\'{a}rf\\'{a}s' path argument","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T15:45:26.675913Z"},"links":{"citing_paper":"/paper/2501.13907"},"observation_digest":"sha256:8a3aafa698854c2065571a1cdeb9af04a1b0bfb108b735811bbe3f3a2db28c31","observation_id":"65312344-365e-4fbb-8968-1f54f9097207","resolution":{"observed_at":"2026-08-10T15:45:26.844542Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:45:27.311271Z","title":"On Ramsey covering-numbers","venue":null,"work_id":"8aa529b4-f738-4322-a7a8-211e45e21a2b","year":1973},"citing_paper":{"arxiv_id":"2501.13907","last_updated":"2025-01-23T18:37:03Z","snapshot_observed_at":"2026-08-10T20:38:44.509329Z","submitted_at":"2025-01-23T18:37:03Z","title":"Graphs with no long claws: An improved bound for the analog of the Gy\\'{a}rf\\'{a}s' path argument","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T15:45:26.680589Z"},"links":{"citing_paper":"/paper/2501.13907"},"observation_digest":"sha256:060027bd25a409bb25198d4311ab1bd93f22f3e0d754ce3fbe6d79b16009c62b","observation_id":"2eadb257-8c57-4034-9e7c-83933763cc7c","resolution":{"observed_at":"2026-08-10T15:45:27.315742Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:45:26.685080Z","title":"Problems from the world surrounding perfect graphs","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2501.13907","last_updated":"2025-01-23T18:37:03Z","snapshot_observed_at":"2026-08-10T20:38:44.509329Z","submitted_at":"2025-01-23T18:37:03Z","title":"Graphs with no long claws: An improved bound for the analog of the Gy\\'{a}rf\\'{a}s' path argument","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T15:45:26.685080Z"},"links":{"citing_paper":"/paper/2501.13907"},"observation_digest":"sha256:674ee266174e1115217b35bcbd47a193ad9d2575ff78913f69e102d97b1fd6d5","observation_id":"2c7bff06-04c1-434a-89f8-8b525394437e","resolution":{"observed_at":"2026-08-10T15:45:26.685080Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:45:26.689431Z","title":"Clique is hard to approximate withinn1−ε","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2501.13907","last_updated":"2025-01-23T18:37:03Z","snapshot_observed_at":"2026-08-10T20:38:44.509329Z","submitted_at":"2025-01-23T18:37:03Z","title":"Graphs with no long claws: An improved bound for the analog of the Gy\\'{a}rf\\'{a}s' path argument","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T15:45:26.689431Z"},"links":{"citing_paper":"/paper/2501.13907"},"observation_digest":"sha256:a11f4fe067fd0e6b11bb186af0ba57483ee2bbff6e6bf474c7f3f256bab93ddf","observation_id":"4cd50170-7400-4100-a9f5-3930bc890dd9","resolution":{"observed_at":"2026-08-10T15:45:26.689431Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:45:26.694627Z","title":"Three-in-a-tree in near linear time","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.13907","last_updated":"2025-01-23T18:37:03Z","snapshot_observed_at":"2026-08-10T20:38:44.509329Z","submitted_at":"2025-01-23T18:37:03Z","title":"Graphs with no long claws: An improved bound for the analog of the Gy\\'{a}rf\\'{a}s' path argument","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T15:45:26.694627Z"},"links":{"citing_paper":"/paper/2501.13907"},"observation_digest":"sha256:3b7d776de9eff335e279d43ab9d3d7509f6b5736b928a1901c6a1976f02d117a","observation_id":"4a066f7e-e55d-44cd-a3f8-534a3dd1a12a","resolution":{"observed_at":"2026-08-10T15:45:26.694627Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:45:26.698858Z","title":"Independent set inP5-free graphs in polynomial time","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2501.13907","last_updated":"2025-01-23T18:37:03Z","snapshot_observed_at":"2026-08-10T20:38:44.509329Z","submitted_at":"2025-01-23T18:37:03Z","title":"Graphs with no long claws: An improved bound for the analog of the Gy\\'{a}rf\\'{a}s' path argument","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T15:45:26.698858Z"},"links":{"citing_paper":"/paper/2501.13907"},"observation_digest":"sha256:f78b7335821ad6ae5267809d898189c6bd4f5da5eac55e8fddc2807e2629c6f0","observation_id":"5aef2744-47e0-46aa-8966-693a011afa21","resolution":{"observed_at":"2026-08-10T15:45:26.698858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3636422","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:45:26.796333Z","title":"Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás’ Path Argument.The ACM Transactions on Compu- tation Theory, 16(2), mar 2024.doi:10.1145/3636422","venue":null,"work_id":"c6a6f87f-83ee-4e20-a801-954f3f35b802","year":2024},"citing_paper":{"arxiv_id":"2501.13907","last_updated":"2025-01-23T18:37:03Z","snapshot_observed_at":"2026-08-10T20:38:44.509329Z","submitted_at":"2025-01-23T18:37:03Z","title":"Graphs with no long claws: An improved bound for the analog of the Gy\\'{a}rf\\'{a}s' path argument","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T15:45:26.703269Z"},"links":{"citing_paper":"/paper/2501.13907"},"observation_digest":"sha256:1d5db9a860c85b8eaf3347702d1202dc54e36b5d96d0ba7f0ff57b44aef40442","observation_id":"73f5142e-4f48-4dce-8dee-cda0222f2793","resolution":{"observed_at":"2026-08-10T15:45:26.801234Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:45:26.707444Z","title":null,"venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2501.13907","last_updated":"2025-01-23T18:37:03Z","snapshot_observed_at":"2026-08-10T20:38:44.509329Z","submitted_at":"2025-01-23T18:37:03Z","title":"Graphs with no long claws: An improved bound for the analog of the Gy\\'{a}rf\\'{a}s' path argument","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T15:45:26.707444Z"},"links":{"citing_paper":"/paper/2501.13907"},"observation_digest":"sha256:ba53038d920b2465f708fc2ce58f3c72446d725d73bc71639c653fdf9587b894","observation_id":"26081db5-623e-49ee-9b0b-d1ad3ace3b2a","resolution":{"observed_at":"2026-08-10T15:45:26.707444Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:45:26.711840Z","title":"Quasi-polynomial-time algo- rithm for independent set in Pt-free graphs via shrinking the space of induced paths","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.13907","last_updated":"2025-01-23T18:37:03Z","snapshot_observed_at":"2026-08-10T20:38:44.509329Z","submitted_at":"2025-01-23T18:37:03Z","title":"Graphs with no long claws: An improved bound for the analog of the Gy\\'{a}rf\\'{a}s' path argument","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T15:45:26.711840Z"},"links":{"citing_paper":"/paper/2501.13907"},"observation_digest":"sha256:3c7e977f036386142a86497f8bf096ed40807eb7038bf71c11b190a96b3f2ef5","observation_id":"e6c40522-279e-44c7-b881-86310bebadeb","resolution":{"observed_at":"2026-08-10T15:45:26.711840Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0012-365x(90)90287-r","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:45:26.761137Z","title":"Algorithme de recherche d’un stable de cardinalite maximum dans un graphe sans etoile","venue":null,"work_id":"f03df11d-ec91-4420-9032-5ab1cac663b8","year":1980},"citing_paper":{"arxiv_id":"2501.13907","last_updated":"2025-01-23T18:37:03Z","snapshot_observed_at":"2026-08-10T20:38:44.509329Z","submitted_at":"2025-01-23T18:37:03Z","title":"Graphs with no long claws: An improved bound for the analog of the Gy\\'{a}rf\\'{a}s' path argument","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T15:45:26.716359Z"},"links":{"citing_paper":"/paper/2501.13907"},"observation_digest":"sha256:f319cd514c1d7ea8b5248872be08d4af3748b5d6295bce4a5a731cb1d76d053a","observation_id":"15afdbf1-02fd-453e-bd3c-242da5e988aa","resolution":{"observed_at":"2026-08-10T15:45:26.767582Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:45:26.721080Z","title":"Linear degree extractors and the inapproximability of Max Clique and Chro- matic Number.Theory of Computing, 3(1):103–128, 2007.doi:10.4086/toc.2007.v003a006","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2501.13907","last_updated":"2025-01-23T18:37:03Z","snapshot_observed_at":"2026-08-10T20:38:44.509329Z","submitted_at":"2025-01-23T18:37:03Z","title":"Graphs with no long claws: An improved bound for the analog of the Gy\\'{a}rf\\'{a}s' path argument","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T15:45:26.721080Z"},"links":{"citing_paper":"/paper/2501.13907"},"observation_digest":"sha256:b93265682d7bbb7a12b3e0bfb7d2cec9f6f7bb40e08b737d3bed7b4ff7814d29","observation_id":"ab4990e2-a2ea-4ea8-8253-52b6363953fe","resolution":{"observed_at":"2026-08-10T15:45:26.721080Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611977073.61","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:45:26.942813Z","title":"doi:10.1137/1.9781611977073.61","venue":null,"work_id":"01ea2a62-c98a-4a8d-95d9-9c91250ebf64","year":2022},"citing_paper":{"arxiv_id":"2501.13907","last_updated":"2025-01-23T18:37:03Z","snapshot_observed_at":"2026-08-10T20:38:44.509329Z","submitted_at":"2025-01-23T18:37:03Z","title":"Graphs with no long claws: An improved bound for the analog of the Gy\\'{a}rf\\'{a}s' path argument","version":1},"reference_index":1470,"source":"pdf_text","source_observed_at":"2026-08-10T15:45:26.603850Z"},"links":{"citing_paper":"/paper/2501.13907"},"observation_digest":"sha256:5c41ee09ef8fe04d12230481e620c3f8a0388ae920eff16af1d6905813725f98","observation_id":"83c6c730-050e-4d35-b741-63f89e71cd24","resolution":{"observed_at":"2026-08-10T15:45:26.947142Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T15:45:26.658666Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.13907","last_updated":"2025-01-23T18:37:03Z","snapshot_observed_at":"2026-08-10T20:38:44.509329Z","submitted_at":"2025-01-23T18:37:03Z","title":"Graphs with no long claws: An improved bound for the analog of the Gy\\'{a}rf\\'{a}s' path argument","version":1},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-10T15:45:26.658666Z"},"links":{"citing_paper":"/paper/2501.13907"},"observation_digest":"sha256:57c7c470bac03a2b4551590b0d7434738980381d6378b4c303a8d732cdb3d1eb","observation_id":"cb71fd1d-80ec-4b12-97ff-7774590140d3","resolution":{"observed_at":"2026-08-10T15:45:26.658666Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2501.13907","last_updated":"2025-01-23T18:37:03Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-10T20:38:44.509329Z","submitted_at":"2025-01-23T18:37:03Z","title":"Graphs with no long claws: An improved bound for the analog of the Gy\\'{a}rf\\'{a}s' path argument"},"reference_resolution":{"displayed":28,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":9,"verified_fuzzy":5},"total_outbound_references":28},"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 28 of 28 outbound references and 1 inbound Pith citation observation for arXiv:2501.13907."}