{"as_of":"2026-08-10T14:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fa1f8500e3acb8c32edbf050159972b078cc3ce4108ed592b982a620874a41fe","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":10,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":10,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":10,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":10,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:36:12.893167Z","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-07-10T18:17:33.919818Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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-07T15:36:12.893167Z","title":"Dallard, M","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.15149","last_updated":"2025-05-21T06:07:36Z","snapshot_observed_at":"2026-08-07T15:20:52.052331Z","submitted_at":"2025-05-21T06:07:36Z","title":"Induced subgraphs of graphs with large deficiency","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T15:36:12.893167Z"},"links":{"cited_paper":"/paper/2402.11222","citing_paper":"/paper/2505.15149"},"observation_digest":"sha256:32356edc22ca73b1b895038ebd11782c1bdd6a0eda9586455436dfa372a4f0fc","observation_id":"31916242-9ccf-498d-8531-714d99e80934","resolution":{"observed_at":"2026-08-07T15:36:12.893167Z","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-07T05:24:18.152949Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.08829","last_updated":"2025-06-10T14:17:51Z","snapshot_observed_at":"2026-08-07T16:07:40.735952Z","submitted_at":"2025-06-10T14:17:51Z","title":"Excluding an induced wheel minor in graphs without large induced stars","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T05:24:18.152949Z"},"links":{"cited_paper":"/paper/2402.11222","citing_paper":"/paper/2506.08829"},"observation_digest":"sha256:1e119f49e7c301d82f15236eea240cb988eaf607edd150c1d9d0ac55627061d8","observation_id":"5756bebc-b2fc-4b09-a386-5c94879908ba","resolution":{"observed_at":"2026-08-07T05:24:18.152949Z","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":"2402.11222","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.11222","snapshot_observed_at":"2026-07-10T18:17:33.919818Z","title":"Treewidth versus clique number","venue":"math.CO","work_id":"6fe43ad7-f055-4fef-aff5-b49b09b2c32a","year":2024},"citing_paper":{"arxiv_id":"2509.01140","last_updated":"2026-05-06T20:48:29Z","snapshot_observed_at":"2026-08-03T05:54:16.286571Z","submitted_at":"2025-09-01T05:20:27Z","title":"Tree decompositions with small width, spread, order and degree","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-18T20:24:44.042200Z"},"links":{"cited_paper":"/paper/2402.11222","citing_paper":"/paper/2509.01140"},"observation_digest":"sha256:6ed6ea97900f0e07469af8b305b46846ce79cd245660ab69772bcdd3aa8be3c3","observation_id":"04dc5ed5-654f-4ea9-8a08-0970fa7de44f","resolution":{"observed_at":"2026-05-18T20:26:51.375365Z","resolver_source":"arxiv_id","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":"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-05T10:39:25.538924Z","title":"[DMv21] Cl´ ement Dallard, Martin Milaniˇ c, and Kenny ˇStorgel","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.04026","last_updated":"2025-09-04T09:00:07Z","snapshot_observed_at":"2026-08-10T11:06:06.805992Z","submitted_at":"2025-09-04T09:00:07Z","title":"Excluding a Ladder as an Induced Minor in Graphs Without Induced Stars","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T10:39:25.538924Z"},"links":{"cited_paper":"/paper/2402.11222","citing_paper":"/paper/2509.04026"},"observation_digest":"sha256:bdc4e24fa48d498ceaf779686f4a3f3485fb7355f4108c3bdf8cd2cb5887f70d","observation_id":"05bff3bf-0a08-4b13-ad33-6ee93e0afa0d","resolution":{"observed_at":"2026-08-05T10:39:25.538924Z","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":"2402.11222","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.11222","snapshot_observed_at":"2026-07-10T18:17:33.919818Z","title":"Treewidth versus clique number","venue":"math.CO","work_id":"6fe43ad7-f055-4fef-aff5-b49b09b2c32a","year":2024},"citing_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},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-09T15:13:19.532481Z"},"links":{"cited_paper":"/paper/2402.11222","citing_paper":"/paper/2605.01223"},"observation_digest":"sha256:e5c96aec4dd0152050bd6aeca805b30b0cc2cc00c93fe8957053a071425fde48","observation_id":"6071574c-da76-459b-977f-7f4087bd3b72","resolution":{"observed_at":"2026-05-11T16:46:05.100015Z","resolver_source":"arxiv_id","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":"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":"2402.11222","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.11222","snapshot_observed_at":"2026-07-10T18:17:33.919818Z","title":"Treewidth versus clique number","venue":"math.CO","work_id":"6fe43ad7-f055-4fef-aff5-b49b09b2c32a","year":2024},"citing_paper":{"arxiv_id":"2606.20256","last_updated":"2026-06-18T14:05:30Z","snapshot_observed_at":"2026-07-06T23:55:25.144457Z","submitted_at":"2026-06-18T14:05:30Z","title":"Tree-independence number of $K_{1,d}$-free graph classes","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-06-26T16:59:19.946050Z"},"links":{"cited_paper":"/paper/2402.11222","citing_paper":"/paper/2606.20256"},"observation_digest":"sha256:39b99d2400d86420dab3edd185c24dae21324ae1ca0955daf1f52b98e838b516","observation_id":"2377ee8f-dfeb-4eaa-9ef9-59912df2c8a0","resolution":{"observed_at":"2026-07-04T04:29:34.964016Z","resolver_source":"arxiv_id","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":"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":"2402.11222","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.11222","snapshot_observed_at":"2026-07-10T18:17:33.919818Z","title":"Treewidth versus clique number","venue":"math.CO","work_id":"6fe43ad7-f055-4fef-aff5-b49b09b2c32a","year":2024},"citing_paper":{"arxiv_id":"2606.24695","last_updated":"2026-07-15T22:48:38Z","snapshot_observed_at":"2026-08-02T10:31:30.463008Z","submitted_at":"2026-06-23T15:23:37Z","title":"Forcing monochromatic induced subgraphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-25T23:07:04.244078Z"},"links":{"cited_paper":"/paper/2402.11222","citing_paper":"/paper/2606.24695"},"observation_digest":"sha256:5168035dc0a6993df1a4ead44e271d9a03a599078ef5e02f0d07b7460b6c5654","observation_id":"ae53580f-c383-4a6c-8879-068f873a1e9e","resolution":{"observed_at":"2026-07-04T18:00:01.476781Z","resolver_source":"arxiv_id","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":"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-02T10:31:31.656503Z","title":"Dallard, M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.24695","last_updated":"2026-07-15T22:48:38Z","snapshot_observed_at":"2026-08-02T10:31:30.463008Z","submitted_at":"2026-06-23T15:23:37Z","title":"Forcing monochromatic induced subgraphs","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-02T10:31:31.656503Z"},"links":{"cited_paper":"/paper/2402.11222","citing_paper":"/paper/2606.24695"},"observation_digest":"sha256:a941b7083602126cd6a2772c9ce9b75afa36e4a74a0abba6e8530afad3ebbd3c","observation_id":"3a6885f0-1b50-431d-b86e-accd03ac852a","resolution":{"observed_at":"2026-08-02T10:31:31.656503Z","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":"2402.11222","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.11222","snapshot_observed_at":"2026-07-10T18:17:33.919818Z","title":"Treewidth versus clique number","venue":"math.CO","work_id":"6fe43ad7-f055-4fef-aff5-b49b09b2c32a","year":2024},"citing_paper":{"arxiv_id":"2607.07697","last_updated":"2026-07-08T17:55:18Z","snapshot_observed_at":"2026-08-01T14:29:50.319940Z","submitted_at":"2026-07-08T17:55:18Z","title":"Induced Erd\\H{o}s--P\\'osa property for long holes, long thetas, and beyond","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-07-10T18:15:14.678055Z"},"links":{"cited_paper":"/paper/2402.11222","citing_paper":"/paper/2607.07697"},"observation_digest":"sha256:91793e73696648ff9025cb38618008fb90e274201cd76a93cac88cd179027516","observation_id":"5f189145-a720-4297-87aa-b682eb6d3d4e","resolution":{"observed_at":"2026-07-10T18:17:33.921057Z","resolver_source":"local_arxiv","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":"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-02T03:16:31.833624Z","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:966bc16fc110cc743d0a0acd61b04d0fe796d497856efac8b90591f36598be27","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"}}],"links":{"evidence":"/evidence","html":"/paper/2402.11222/citation-record","integrity":"/paper/2402.11222/integrity","json":"/paper/2402.11222/citation-record.json","paper":"/paper/2402.11222"},"outbound":[],"paper":{"arxiv_id":"2402.11222","last_updated":"2024-02-20T14:55:58Z","latest_version":2,"primary_category":"math.CO","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"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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 0 of 0 outbound references and 10 inbound Pith citation observations for arXiv:2402.11222."}