{"as_of":"2026-08-10T23:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:414324ffba358fbd9724e6215e4068bc057aea3203cfa020ba5a80e9308d31a7","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T03:16:32.421510Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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/2607.13995/citation-record","integrity":"/paper/2607.13995/integrity","json":"/paper/2607.13995/citation-record.json","paper":"/paper/2607.13995"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T03:16:32.334148Z","title":"Lozin, and Igor Razgon","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.13995","last_updated":"2026-07-15T16:25:33Z","snapshot_observed_at":"2026-08-10T20:38:51.700820Z","submitted_at":"2026-07-15T16:25:33Z","title":"Excluding paths and bicliques","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T03:16:32.334148Z"},"links":{"citing_paper":"/paper/2607.13995"},"observation_digest":"sha256:d3eafc956e8f12a0fbe72ae09be7be6b3c7f51460bab51f2728fff320a0df377","observation_id":"ea2d2612-5cc7-44ea-a024-3d89b10cfd8b","resolution":{"observed_at":"2026-08-02T03:16:32.334148Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T03:16:32.338350Z","title":"Awesomegraphparameters","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.13995","last_updated":"2026-07-15T16:25:33Z","snapshot_observed_at":"2026-08-10T20:38:51.700820Z","submitted_at":"2026-07-15T16:25:33Z","title":"Excluding paths and bicliques","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-02T03:16:32.338350Z"},"links":{"citing_paper":"/paper/2607.13995"},"observation_digest":"sha256:50600afcbbfc15649f97b40455f06472bf52f0e93e64578094c9fd470995c3a2","observation_id":"8e77e30d-f77c-45ce-8439-862500920c97","resolution":{"observed_at":"2026-08-02T03:16:32.338350Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.03965","last_updated":"2026-05-05T16:49:33Z","snapshot_observed_at":"2026-07-06T23:16:49.553583Z","submitted_at":"2026-05-05T16:49:33Z","title":"Tree-independence number of $P_5$-free graphs with no large bicliques","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.03965","snapshot_observed_at":"2026-08-02T03:16:32.341360Z","title":"Pascal Gollin, Tomáš Hons, Tomáš Masařík, Martin Milanič, Paweł Rzążewski, Ondřej Suchý, and Alexandra Wesolek","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.13995","last_updated":"2026-07-15T16:25:33Z","snapshot_observed_at":"2026-08-10T20:38:51.700820Z","submitted_at":"2026-07-15T16:25:33Z","title":"Excluding paths and bicliques","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-02T03:16:32.341360Z"},"links":{"cited_paper":"/paper/2605.03965","citing_paper":"/paper/2607.13995"},"observation_digest":"sha256:aa2fd2ed3ff348efbe61744a20f4c7bedb1da913c46e625cda4344a05d733122","observation_id":"41c66e4d-67e5-4f74-ac6d-f3ae665d2bf8","resolution":{"observed_at":"2026-08-02T03:16:32.341360Z","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-02T03:16:32.345172Z","title":"Bodlaender","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.13995","last_updated":"2026-07-15T16:25:33Z","snapshot_observed_at":"2026-08-10T20:38:51.700820Z","submitted_at":"2026-07-15T16:25:33Z","title":"Excluding paths and bicliques","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-02T03:16:32.345172Z"},"links":{"citing_paper":"/paper/2607.13995"},"observation_digest":"sha256:8a79010af7e193aac4f8088e448c4cce3d0c4eee2cc415b3bc0fc9be9aba7c38","observation_id":"6bc63b0a-60ea-43ba-a9e7-e760a97268a8","resolution":{"observed_at":"2026-08-02T03:16:32.345172Z","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.19086/aic.2024.5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On poly- nomial degree-boundedness.Adv","venue":"Advances in Combinatorics","work_id":"d9c65f8d-7824-4646-85bb-77754c778f79","year":2024},"citing_paper":{"arxiv_id":"2607.13995","last_updated":"2026-07-15T16:25:33Z","snapshot_observed_at":"2026-08-10T20:38:51.700820Z","submitted_at":"2026-07-15T16:25:33Z","title":"Excluding paths and bicliques","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-02T03:16:32.348390Z"},"links":{"citing_paper":"/paper/2607.13995"},"observation_digest":"sha256:c044fe227a1e8b2a3b43858f2e644617cd7ed6944aa860340cd8eae9761963b2","observation_id":"1c5af4f4-5b55-47b9-81a1-59dbfd23d937","resolution":{"observed_at":"2026-08-02T03:19:06.602410Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00493-023-00054-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Separating polyno- mialχ-boundedness fromχ-boundedness.Combinatorica, 44(1):1–8, 2024","venue":"COMBINATORICA","work_id":"b892fe15-4144-4dd8-a8ab-349bb215dc53","year":2024},"citing_paper":{"arxiv_id":"2607.13995","last_updated":"2026-07-15T16:25:33Z","snapshot_observed_at":"2026-08-10T20:38:51.700820Z","submitted_at":"2026-07-15T16:25:33Z","title":"Excluding paths and bicliques","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-02T03:16:32.351752Z"},"links":{"citing_paper":"/paper/2607.13995"},"observation_digest":"sha256:76ba1e3c24af465195e4dd3849815f85bfff1bbc230e4b6e016640731c1ad325","observation_id":"801e9b33-57ab-4469-b4d7-58bf8d671f95","resolution":{"observed_at":"2026-08-02T03:19:06.476088Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-02T03:16:32.355631Z","title":"Pascal Gollin, Martin Milanič, and Varun Sivashankar","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.13995","last_updated":"2026-07-15T16:25:33Z","snapshot_observed_at":"2026-08-10T20:38:51.700820Z","submitted_at":"2026-07-15T16:25:33Z","title":"Excluding paths and bicliques","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T03:16:32.355631Z"},"links":{"citing_paper":"/paper/2607.13995"},"observation_digest":"sha256:ba836a146ff39b3cd8cc1c34fd4cd28bb4e8381e1b5edd64d92fcea682aa89da","observation_id":"169e968d-3331-4462-9546-8a131833b3de","resolution":{"observed_at":"2026-08-02T03:16:32.355631Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.14658","snapshot_observed_at":"2026-08-02T03:16:32.358571Z","title":"Tree independence number V","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.13995","last_updated":"2026-07-15T16:25:33Z","snapshot_observed_at":"2026-08-10T20:38:51.700820Z","submitted_at":"2026-07-15T16:25:33Z","title":"Excluding paths and bicliques","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T03:16:32.358571Z"},"links":{"cited_paper":"/paper/2501.14658","citing_paper":"/paper/2607.13995"},"observation_digest":"sha256:f9d29b642ce826dc4b24614ec2c3107e939d031547c203d30bf18ac2993dba05","observation_id":"a543a177-8054-4918-8544-d317e086fe2a","resolution":{"observed_at":"2026-08-02T03:16:32.358571Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.17756","last_updated":"2024-12-27T16:25:20Z","snapshot_observed_at":"2026-07-06T20:12:18.144353Z","submitted_at":"2024-12-23T18:08:25Z","title":"Induced subgraphs and tree decompositions XVIII. Obstructions to bounded pathwidth","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.17756","snapshot_observed_at":"2026-08-02T03:16:32.361550Z","title":"Induced sub- graphs and tree decompositions XVIII","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.13995","last_updated":"2026-07-15T16:25:33Z","snapshot_observed_at":"2026-08-10T20:38:51.700820Z","submitted_at":"2026-07-15T16:25:33Z","title":"Excluding paths and bicliques","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T03:16:32.361550Z"},"links":{"cited_paper":"/paper/2412.17756","citing_paper":"/paper/2607.13995"},"observation_digest":"sha256:822200898bddf0ff6f1b0dc05f47e2a40d2760bbed482a02175edc7e4e2c56b7","observation_id":"dd3474be-5806-4bc6-be8c-a6f1d8a14b61","resolution":{"observed_at":"2026-08-02T03:16:32.361550Z","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-02T03:16:32.364616Z","title":"On treewidth and maximum cliques.Innov","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.13995","last_updated":"2026-07-15T16:25:33Z","snapshot_observed_at":"2026-08-10T20:38:51.700820Z","submitted_at":"2026-07-15T16:25:33Z","title":"Excluding paths and bicliques","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-02T03:16:32.364616Z"},"links":{"citing_paper":"/paper/2607.13995"},"observation_digest":"sha256:5cd0e8894ca1ca2343ede8dab4d448a6c0e536d8f1bee7ff9dc40119359c5dcd","observation_id":"7fd6006b-f08a-4292-9109-b2f4bfbbbba3","resolution":{"observed_at":"2026-08-02T03:16:32.364616Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.11222","last_updated":"2024-02-20T14:55:58Z","snapshot_observed_at":"2026-07-06T17:31:33.340510Z","submitted_at":"2024-02-17T08:38:58Z","title":"Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.11222","snapshot_observed_at":"2026-08-02T03:16:32.367422Z","title":"Treewidth versus clique number","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.13995","last_updated":"2026-07-15T16:25:33Z","snapshot_observed_at":"2026-08-10T20:38:51.700820Z","submitted_at":"2026-07-15T16:25:33Z","title":"Excluding paths and bicliques","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-02T03:16:32.367422Z"},"links":{"cited_paper":"/paper/2402.11222","citing_paper":"/paper/2607.13995"},"observation_digest":"sha256:c8e7d3aa7e895abe054d138d2bd38bebbb8aab1fb4b33ec051e6752e7062caa7","observation_id":"eb73a501-88ef-4fad-bf5f-a4842222db92","resolution":{"observed_at":"2026-08-02T03:16:32.367422Z","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.1016/j.jctb.2023.10.006","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Treewidth versus clique number","venue":"Journal of Combinatorial Theory Series B","work_id":"ec09beaf-b3f2-4a6e-bb79-2e2cef6701d5","year":2024},"citing_paper":{"arxiv_id":"2607.13995","last_updated":"2026-07-15T16:25:33Z","snapshot_observed_at":"2026-08-10T20:38:51.700820Z","submitted_at":"2026-07-15T16:25:33Z","title":"Excluding paths and bicliques","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-02T03:16:32.371041Z"},"links":{"citing_paper":"/paper/2607.13995"},"observation_digest":"sha256:3d590388f064c40ebb9968722d6e8613f6abb2155b0f1c5086310519df04396e","observation_id":"55bb1801-2503-44b3-8acd-00cc1ed086c7","resolution":{"observed_at":"2026-08-02T03:19:06.367412Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.08685","last_updated":"2024-11-13T15:21:38Z","snapshot_observed_at":"2026-07-06T19:49:48.427067Z","submitted_at":"2024-11-13T15:21:38Z","title":"Long induced paths in sparse graphs and graphs with forbidden patterns","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.08685","snapshot_observed_at":"2026-08-02T03:16:32.374070Z","title":"Long induced paths in sparse graphs and graphs with forbidden patterns","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.13995","last_updated":"2026-07-15T16:25:33Z","snapshot_observed_at":"2026-08-10T20:38:51.700820Z","submitted_at":"2026-07-15T16:25:33Z","title":"Excluding paths and bicliques","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T03:16:32.374070Z"},"links":{"cited_paper":"/paper/2411.08685","citing_paper":"/paper/2607.13995"},"observation_digest":"sha256:f868daddfc989fd84870147c92c544de4dd0535811b668f128d1326aefffd73b","observation_id":"e6433736-836c-4269-a8fc-b6788b600d5e","resolution":{"observed_at":"2026-08-02T03:16:32.374070Z","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-02T03:16:32.377150Z","title":"Erdös and G","venue":null,"work_id":null,"year":1935},"citing_paper":{"arxiv_id":"2607.13995","last_updated":"2026-07-15T16:25:33Z","snapshot_observed_at":"2026-08-10T20:38:51.700820Z","submitted_at":"2026-07-15T16:25:33Z","title":"Excluding paths and bicliques","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-02T03:16:32.377150Z"},"links":{"citing_paper":"/paper/2607.13995"},"observation_digest":"sha256:8a730e575f365c1f56268e38f98e545cc14fe74f6d6ffadabe72e853ab43baa1","observation_id":"5da1c5b5-dec1-453a-ad1d-03169fc9bd13","resolution":{"observed_at":"2026-08-02T03:16:32.377150Z","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-02T03:16:32.380286Z","title":"Galvin, I","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2607.13995","last_updated":"2026-07-15T16:25:33Z","snapshot_observed_at":"2026-08-10T20:38:51.700820Z","submitted_at":"2026-07-15T16:25:33Z","title":"Excluding paths and bicliques","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-02T03:16:32.380286Z"},"links":{"citing_paper":"/paper/2607.13995"},"observation_digest":"sha256:afd9d45e7e2d06c488a6a77bb44af1648fd292e43c8c704150307f809465ecb9","observation_id":"5d1c5ae3-1773-445a-85b5-cf74cad92c0c","resolution":{"observed_at":"2026-08-02T03:16:32.380286Z","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.1093/imrn/rnaf025","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Induced subdivisions inKs,s-free graphs with polynomial average degree.International Mathematics Research No- tices, 2025(4):rnaf025, 02 2025.doi:10.1093/imrn/rnaf025","venue":"International Mathematics Research Notices","work_id":"3a858f17-853d-4eca-9aa8-33521973c911","year":2025},"citing_paper":{"arxiv_id":"2607.13995","last_updated":"2026-07-15T16:25:33Z","snapshot_observed_at":"2026-08-10T20:38:51.700820Z","submitted_at":"2026-07-15T16:25:33Z","title":"Excluding paths and bicliques","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-02T03:16:32.382908Z"},"links":{"citing_paper":"/paper/2607.13995"},"observation_digest":"sha256:2621a848fb4bd983de63063bf2d47a562d1c43d8643cf53cab5ba5944866fca5","observation_id":"38050437-5b96-41ac-9785-7d57f51c94ee","resolution":{"observed_at":"2026-08-02T03:19:06.260338Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-02T03:16:32.385454Z","title":"Polynomial bounds for pathwidth","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.13995","last_updated":"2026-07-15T16:25:33Z","snapshot_observed_at":"2026-08-10T20:38:51.700820Z","submitted_at":"2026-07-15T16:25:33Z","title":"Excluding paths and bicliques","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-02T03:16:32.385454Z"},"links":{"citing_paper":"/paper/2607.13995"},"observation_digest":"sha256:ad5df9075c7a5a234aa734b59dacc24cf42a5288a53c85609a7308610bdb387f","observation_id":"aa60e4e1-1f72-4063-a4d6-39d360c0293b","resolution":{"observed_at":"2026-08-02T03:16:32.385454Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.01223","last_updated":"2026-05-02T03:37:20Z","snapshot_observed_at":"2026-07-06T23:14:29.125042Z","submitted_at":"2026-05-02T03:37:20Z","title":"Tree-alpha and excluding finitely many graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.01223","snapshot_observed_at":"2026-08-02T03:16:32.388019Z","title":"Tree-alpha and excluding finitely many graphs","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.13995","last_updated":"2026-07-15T16:25:33Z","snapshot_observed_at":"2026-08-10T20:38:51.700820Z","submitted_at":"2026-07-15T16:25:33Z","title":"Excluding paths and bicliques","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-02T03:16:32.388019Z"},"links":{"cited_paper":"/paper/2605.01223","citing_paper":"/paper/2607.13995"},"observation_digest":"sha256:4c936fa4191b6ad8425b39a714dee966e1c0521367f5eb6f281aebf6d7f4c988","observation_id":"1e09880d-039f-4403-b2e2-15e15fbcac91","resolution":{"observed_at":"2026-08-02T03:16:32.388019Z","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-02T03:16:32.390679Z","title":"Complexity of coloring graphs without paths and cycles.Discrete Appl","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.13995","last_updated":"2026-07-15T16:25:33Z","snapshot_observed_at":"2026-08-10T20:38:51.700820Z","submitted_at":"2026-07-15T16:25:33Z","title":"Excluding paths and bicliques","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-02T03:16:32.390679Z"},"links":{"citing_paper":"/paper/2607.13995"},"observation_digest":"sha256:f3016d5237438d84431c885ff03b7d4b8a685250c17a4620908bbc3f680731b9","observation_id":"7683f577-91b3-4c02-b515-2daaeb6761a7","resolution":{"observed_at":"2026-08-02T03:16:32.390679Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T03:16:32.393266Z","title":"Treewidth versus clique number","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.13995","last_updated":"2026-07-15T16:25:33Z","snapshot_observed_at":"2026-08-10T20:38:51.700820Z","submitted_at":"2026-07-15T16:25:33Z","title":"Excluding paths and bicliques","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-02T03:16:32.393266Z"},"links":{"citing_paper":"/paper/2607.13995"},"observation_digest":"sha256:e036f944b9c8f4cc8a08762e8ff4eadd0dabc89231319829e204eff5f51fabfc","observation_id":"c30d4581-b8bd-47d1-85b1-b03ca5d826a1","resolution":{"observed_at":"2026-08-02T03:16:32.393266Z","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.37236/11029","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Long induced paths in minor- closed graph classes and beyond.Electron","venue":"The Electronic Journal of Combinatorics","work_id":"91779f21-54bc-43f4-9941-3ad023c12004","year":2023},"citing_paper":{"arxiv_id":"2607.13995","last_updated":"2026-07-15T16:25:33Z","snapshot_observed_at":"2026-08-10T20:38:51.700820Z","submitted_at":"2026-07-15T16:25:33Z","title":"Excluding paths and bicliques","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-02T03:16:32.396693Z"},"links":{"citing_paper":"/paper/2607.13995"},"observation_digest":"sha256:64dce75d97e25e0a88a8c388d6a49805fbb86d6d9ac842240bcb8548a3a75921","observation_id":"b0c9097e-cccc-42a9-92c7-f64509ec34db","resolution":{"observed_at":"2026-08-02T03:19:06.187244Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1002/jgt.70040","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Long induced paths inK s,s-free graphs.Journal of Graph Theory, 2026","venue":"Journal of Graph Theory","work_id":"6ee03c7c-c991-48fb-bac4-7925aabc534c","year":2026},"citing_paper":{"arxiv_id":"2607.13995","last_updated":"2026-07-15T16:25:33Z","snapshot_observed_at":"2026-08-10T20:38:51.700820Z","submitted_at":"2026-07-15T16:25:33Z","title":"Excluding paths and bicliques","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-02T03:16:32.399448Z"},"links":{"citing_paper":"/paper/2607.13995"},"observation_digest":"sha256:2ddd90395f378a40aefa10077a32d107912dd227eda63d684aa587961c30c5f8","observation_id":"6b189061-5cf3-47aa-8ac3-278c407162a0","resolution":{"observed_at":"2026-08-02T03:19:06.109474Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-02T03:16:32.402353Z","title":"A polynomial-time algorithm for the in- dependent set problem in{P 10, C4, C6}-free graphs","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.13995","last_updated":"2026-07-15T16:25:33Z","snapshot_observed_at":"2026-08-10T20:38:51.700820Z","submitted_at":"2026-07-15T16:25:33Z","title":"Excluding paths and bicliques","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-02T03:16:32.402353Z"},"links":{"citing_paper":"/paper/2607.13995"},"observation_digest":"sha256:9b1a2ca6b2287c94a5ebb4b9a0ea8370d5cf663bf3fdd7ed9fc808ee10b62fa1","observation_id":"f41a5cfe-8144-4f93-a48d-9ebe2858519d","resolution":{"observed_at":"2026-08-02T03:16:32.402353Z","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-02T03:16:32.404942Z","title":"Certifying coloring algorithms for graphs without long induced paths.Discrete Appl","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.13995","last_updated":"2026-07-15T16:25:33Z","snapshot_observed_at":"2026-08-10T20:38:51.700820Z","submitted_at":"2026-07-15T16:25:33Z","title":"Excluding paths and bicliques","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-02T03:16:32.404942Z"},"links":{"citing_paper":"/paper/2607.13995"},"observation_digest":"sha256:7556f5905237ea82f3fd9b351ac0140ebec56e3c76f7fe82d9d36a5991e6aaad","observation_id":"0caf77a7-f5ee-4170-b37e-b2ceb7e10784","resolution":{"observed_at":"2026-08-02T03:16:32.404942Z","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-02T03:16:32.407966Z","title":"Lima, Martin Milanič, Peter Muršič, Karolina Okrasa, Paweł Rzążewski, and Kenny Štorgel","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.13995","last_updated":"2026-07-15T16:25:33Z","snapshot_observed_at":"2026-08-10T20:38:51.700820Z","submitted_at":"2026-07-15T16:25:33Z","title":"Excluding paths and bicliques","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-02T03:16:32.407966Z"},"links":{"citing_paper":"/paper/2607.13995"},"observation_digest":"sha256:0987e225b6383b9026f1699efaaa2942acbf6911bb1a010956b47389fc1a9a41","observation_id":"00d2b1ea-45a9-4a04-a027-58e2dfaafe79","resolution":{"observed_at":"2026-08-02T03:16:32.407966Z","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.1016/j.ipl.2003.07.004","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Some results on graphs without long induced paths.Inform","venue":"Information Processing Letters","work_id":"2ea0661d-cdcf-40dc-86fd-539e5e0ecf74","year":2003},"citing_paper":{"arxiv_id":"2607.13995","last_updated":"2026-07-15T16:25:33Z","snapshot_observed_at":"2026-08-10T20:38:51.700820Z","submitted_at":"2026-07-15T16:25:33Z","title":"Excluding paths and bicliques","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-02T03:16:32.410411Z"},"links":{"citing_paper":"/paper/2607.13995"},"observation_digest":"sha256:39809ded1934896cbb00618c94568086dea909477df64e8f743750ba98a2e45c","observation_id":"97b932d1-68eb-43e7-844d-5be6c44d6cbb","resolution":{"observed_at":"2026-08-02T03:19:05.995014Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-02T03:16:32.413260Z","title":"Springer, Heidelberg, 2012.doi:10.1007/ 978-3-642-27875-4","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.13995","last_updated":"2026-07-15T16:25:33Z","snapshot_observed_at":"2026-08-10T20:38:51.700820Z","submitted_at":"2026-07-15T16:25:33Z","title":"Excluding paths and bicliques","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-02T03:16:32.413260Z"},"links":{"citing_paper":"/paper/2607.13995"},"observation_digest":"sha256:274873e30ed850f3d243d0bb9f64f18800a2a371c279b0f8330534928dbbb032","observation_id":"7c29e55f-55d5-4688-ad99-8fad80e858f1","resolution":{"observed_at":"2026-08-02T03:16:32.413260Z","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":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T03:16:32.415916Z","title":null,"venue":null,"work_id":null,"year":1929},"citing_paper":{"arxiv_id":"2607.13995","last_updated":"2026-07-15T16:25:33Z","snapshot_observed_at":"2026-08-10T20:38:51.700820Z","submitted_at":"2026-07-15T16:25:33Z","title":"Excluding paths and bicliques","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-02T03:16:32.415916Z"},"links":{"citing_paper":"/paper/2607.13995"},"observation_digest":"sha256:d489d15bbf306fa87dc322a6fd730c10e4f1c71fb86b533b9acec4b2d61c466d","observation_id":"c4c0f58e-fa92-4f32-8267-857dd3259201","resolution":{"observed_at":"2026-08-02T03:16:32.415916Z","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.1016/0095-8956(83","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T03:19:05.680221Z","title":null,"venue":null,"work_id":"4ae7ae2a-8d22-46fd-bd7b-6bd1ef32466b","year":1983},"citing_paper":{"arxiv_id":"2607.13995","last_updated":"2026-07-15T16:25:33Z","snapshot_observed_at":"2026-08-10T20:38:51.700820Z","submitted_at":"2026-07-15T16:25:33Z","title":"Excluding paths and bicliques","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-02T03:16:32.418765Z"},"links":{"citing_paper":"/paper/2607.13995"},"observation_digest":"sha256:9c895f45aae51d4a433aec5a3b604b435d418158598191b31ca53ef9dc1167cb","observation_id":"3fb3d870-a33f-464c-a649-e5b5dfa49d18","resolution":{"observed_at":"2026-08-02T03:19:05.821698Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611975031.16","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Minor-matching hypertree width","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"d28b3d1e-98ab-4298-b8ec-90ea0c3f71a7","year":2018},"citing_paper":{"arxiv_id":"2607.13995","last_updated":"2026-07-15T16:25:33Z","snapshot_observed_at":"2026-08-10T20:38:51.700820Z","submitted_at":"2026-07-15T16:25:33Z","title":"Excluding paths and bicliques","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-02T03:16:32.421510Z"},"links":{"citing_paper":"/paper/2607.13995"},"observation_digest":"sha256:607dbdea33e92ba1d13f22068a8251cf0b539552c592d647e5ec53052b1b5d52","observation_id":"07ffc0b8-c782-4813-b204-fab6612bd0ce","resolution":{"observed_at":"2026-08-02T03:19:05.658088Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.13995","last_updated":"2026-07-15T16:25:33Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-10T20:38:51.700820Z","submitted_at":"2026-07-15T16:25:33Z","title":"Excluding paths and bicliques"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":6,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":16,"verified_exact":8,"verified_fuzzy":0},"total_outbound_references":30},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:2607.13995."}