{"as_of":"2026-08-19T18:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b7696c96a1eef96dfe101121bad56daa2446833086194d6fb6e30b7119c7fd56","coverage":[{"denominator":13,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T00:57:01.117077Z","state":"measured"},{"denominator":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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/2608.12723/citation-record","integrity":"/paper/2608.12723/integrity","json":"/paper/2608.12723/citation-record.json","paper":"/paper/2608.12723"},"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-16T00:57:01.386859Z","title":null,"venue":null,"work_id":"d4e1b725-9513-444b-8132-86e18350e678","year":2003},"citing_paper":{"arxiv_id":"2608.12723","last_updated":"2026-08-13T02:09:50Z","snapshot_observed_at":"2026-08-19T06:34:34.512595Z","submitted_at":"2026-08-13T02:09:50Z","title":"Tree-partitions of graphs with bounded tree-depth","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T00:57:01.049685Z"},"links":{"citing_paper":"/paper/2608.12723"},"observation_digest":"sha256:acd250f9012b90eeb262620eedfad393fb454a2edc214c57ed84e08952dd640a","observation_id":"ce67411a-a4f6-43f3-b64b-5ef8c9c779f9","resolution":{"observed_at":"2026-08-16T00:57:01.391765Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T00:57:01.370279Z","title":"Barát and D","venue":null,"work_id":"202b8b37-6724-4450-9be7-2eb3e779b48d","year":2008},"citing_paper":{"arxiv_id":"2608.12723","last_updated":"2026-08-13T02:09:50Z","snapshot_observed_at":"2026-08-19T06:34:34.512595Z","submitted_at":"2026-08-13T02:09:50Z","title":"Tree-partitions of graphs with bounded tree-depth","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T00:57:01.055119Z"},"links":{"citing_paper":"/paper/2608.12723"},"observation_digest":"sha256:0a6bee9da593b1bf0f1d62e9546cc69c5b32820a16eb2adf462a29a7ba602d9b","observation_id":"24f7da8c-c058-49b7-a31a-a5c2fab487a5","resolution":{"observed_at":"2026-08-16T00:57:01.375071Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T00:57:01.354557Z","title":"Chatzidimitriou, J.-F","venue":null,"work_id":"3d59da02-1fd4-402e-b20f-354f2fdfc522","year":2018},"citing_paper":{"arxiv_id":"2608.12723","last_updated":"2026-08-13T02:09:50Z","snapshot_observed_at":"2026-08-19T06:34:34.512595Z","submitted_at":"2026-08-13T02:09:50Z","title":"Tree-partitions of graphs with bounded tree-depth","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T00:57:01.060391Z"},"links":{"citing_paper":"/paper/2608.12723"},"observation_digest":"sha256:89d230b1cb341b5976de085aa48b99cb83a419709e01d77929c3bb7346a46ef8","observation_id":"3d8b7e8a-f007-43fa-8aab-14026416ac1c","resolution":{"observed_at":"2026-08-16T00:57:01.359332Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T00:57:01.336645Z","title":"Ding and B","venue":null,"work_id":"8d1d2584-9a5a-4800-b6ed-5074c9632de1","year":1995},"citing_paper":{"arxiv_id":"2608.12723","last_updated":"2026-08-13T02:09:50Z","snapshot_observed_at":"2026-08-19T06:34:34.512595Z","submitted_at":"2026-08-13T02:09:50Z","title":"Tree-partitions of graphs with bounded tree-depth","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T00:57:01.065586Z"},"links":{"citing_paper":"/paper/2608.12723"},"observation_digest":"sha256:9e270b83e8ef5104f6324346e9839d869a921f588422dae1735793978a8d8c7b","observation_id":"392c3885-32c4-41d5-b5ab-9a269b7c9e73","resolution":{"observed_at":"2026-08-16T00:57:01.342078Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2604.05690","last_updated":"2026-04-07T10:40:54Z","snapshot_observed_at":"2026-08-14T01:26:58.947167Z","submitted_at":"2026-04-07T10:40:54Z","title":"Tree-partitions and small-spread tree-decompositions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.05690","snapshot_observed_at":"2026-08-16T00:57:01.070711Z","title":"Distel, N","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.12723","last_updated":"2026-08-13T02:09:50Z","snapshot_observed_at":"2026-08-19T06:34:34.512595Z","submitted_at":"2026-08-13T02:09:50Z","title":"Tree-partitions of graphs with bounded tree-depth","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T00:57:01.070711Z"},"links":{"cited_paper":"/paper/2604.05690","citing_paper":"/paper/2608.12723"},"observation_digest":"sha256:2e9d3c620449368558614ec0b6ce8a4834f04176bc4f7adaeb7345811f052682","observation_id":"044e7124-1c23-402f-b908-0aa629bba620","resolution":{"observed_at":"2026-08-16T00:57:01.070711Z","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-16T00:57:01.320339Z","title":"Draganić, M","venue":null,"work_id":"dff8f8a8-66a5-446e-b042-827effd315a8","year":2026},"citing_paper":{"arxiv_id":"2608.12723","last_updated":"2026-08-13T02:09:50Z","snapshot_observed_at":"2026-08-19T06:34:34.512595Z","submitted_at":"2026-08-13T02:09:50Z","title":"Tree-partitions of graphs with bounded tree-depth","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T00:57:01.076788Z"},"links":{"citing_paper":"/paper/2608.12723"},"observation_digest":"sha256:267c803aafa698571cf43ce1699750db769b471a3b3b0182ff183fb061fc4659","observation_id":"ce252a2b-7f7e-4321-a7f9-f4adb5bb6572","resolution":{"observed_at":"2026-08-16T00:57:01.325295Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T00:57:01.301357Z","title":"Halin, Tree-partitions of infinite graphs, Discrete Math","venue":null,"work_id":"941ee14d-070a-4241-8142-9d310d2f8e7d","year":1991},"citing_paper":{"arxiv_id":"2608.12723","last_updated":"2026-08-13T02:09:50Z","snapshot_observed_at":"2026-08-19T06:34:34.512595Z","submitted_at":"2026-08-13T02:09:50Z","title":"Tree-partitions of graphs with bounded tree-depth","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T00:57:01.083515Z"},"links":{"citing_paper":"/paper/2608.12723"},"observation_digest":"sha256:bd6c1b4580e90401d76561fe08d52abdae1d909a4a0cc46ace38637facc89b66","observation_id":"bea37aed-c2c5-46f0-aa43-5acae052b6a7","resolution":{"observed_at":"2026-08-16T00:57:01.307109Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T00:57:01.279158Z","title":"Kamčev, A","venue":null,"work_id":"855e3e7b-5d94-4ee1-a6a3-2b832e4562ec","year":2021},"citing_paper":{"arxiv_id":"2608.12723","last_updated":"2026-08-13T02:09:50Z","snapshot_observed_at":"2026-08-19T06:34:34.512595Z","submitted_at":"2026-08-13T02:09:50Z","title":"Tree-partitions of graphs with bounded tree-depth","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T00:57:01.090797Z"},"links":{"citing_paper":"/paper/2608.12723"},"observation_digest":"sha256:6bcf44d45b60b8045778456c08859308e324910a2550f684c3ceeb246a6c6a0a","observation_id":"dce7aeb3-9651-4821-8b08-3b9ed2bdef7d","resolution":{"observed_at":"2026-08-16T00:57:01.284343Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T00:57:01.259904Z","title":"Liu and S.-i","venue":null,"work_id":"aa40883a-e838-4c60-8e61-8537b5d4f282","year":2018},"citing_paper":{"arxiv_id":"2608.12723","last_updated":"2026-08-13T02:09:50Z","snapshot_observed_at":"2026-08-19T06:34:34.512595Z","submitted_at":"2026-08-13T02:09:50Z","title":"Tree-partitions of graphs with bounded tree-depth","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T00:57:01.096565Z"},"links":{"citing_paper":"/paper/2608.12723"},"observation_digest":"sha256:abe9de82e6aeea125f1290512e17b5d5654d9434cdef70916b4477470b5e66d4","observation_id":"4a0132a9-8c56-4ddb-adaf-6a7625ffbcdb","resolution":{"observed_at":"2026-08-16T00:57:01.266287Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T00:57:01.237565Z","title":"Raymond and D","venue":null,"work_id":"a33caf74-5012-4feb-a49a-87e369263546","year":2017},"citing_paper":{"arxiv_id":"2608.12723","last_updated":"2026-08-13T02:09:50Z","snapshot_observed_at":"2026-08-19T06:34:34.512595Z","submitted_at":"2026-08-13T02:09:50Z","title":"Tree-partitions of graphs with bounded tree-depth","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T00:57:01.102607Z"},"links":{"citing_paper":"/paper/2608.12723"},"observation_digest":"sha256:21aadd1792ca8377b990ab93a7ec4a1227fd5b0e5041a1adb70ae0ee879b6e62","observation_id":"d199adf8-9fac-4cc2-8a10-909d8e9b82e2","resolution":{"observed_at":"2026-08-16T00:57:01.243455Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T00:57:01.219468Z","title":"Seese, Tree-partite graphs and the complexity of algorithms, in Fundamentals of Com- putation Theory , LNCS 199, Springer, (1985), 412–421","venue":null,"work_id":"5486cfe0-fa74-4345-a8bd-d48ab5c9d6b5","year":1985},"citing_paper":{"arxiv_id":"2608.12723","last_updated":"2026-08-13T02:09:50Z","snapshot_observed_at":"2026-08-19T06:34:34.512595Z","submitted_at":"2026-08-13T02:09:50Z","title":"Tree-partitions of graphs with bounded tree-depth","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T00:57:01.107383Z"},"links":{"citing_paper":"/paper/2608.12723"},"observation_digest":"sha256:51f63f41d21c46d66896385abe69507810f7472452488031592b8f42385e9f9f","observation_id":"39d809d8-3426-4c8b-958d-516e32118f20","resolution":{"observed_at":"2026-08-16T00:57:01.224619Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-16T00:57:01.202043Z","title":null,"venue":null,"work_id":"961677e0-b380-4f38-8a2d-f18460728316","year":2009},"citing_paper":{"arxiv_id":"2608.12723","last_updated":"2026-08-13T02:09:50Z","snapshot_observed_at":"2026-08-19T06:34:34.512595Z","submitted_at":"2026-08-13T02:09:50Z","title":"Tree-partitions of graphs with bounded tree-depth","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T00:57:01.112521Z"},"links":{"citing_paper":"/paper/2608.12723"},"observation_digest":"sha256:e694d69de74dc379a4e747f090aebdddc63d061b58dfce76b97290a5338e89c0","observation_id":"f3babd0e-d2c4-4ce7-8d38-bd730bac4b72","resolution":{"observed_at":"2026-08-16T00:57:01.207641Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2605.27780","last_updated":"2026-05-27T00:00:21Z","snapshot_observed_at":"2026-08-16T17:52:41.735211Z","submitted_at":"2026-05-27T00:00:21Z","title":"Tree-partitions of graphs with given pathwidth","version":1},"cited_work":{"arxiv_id":"2605.27780","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.27780","snapshot_observed_at":"2026-08-16T00:57:01.162123Z","title":"Tree-partitions of graphs with given pathwidth","venue":"math.CO","work_id":"5219743a-32dc-4f21-a504-d3e7c17bf5bf","year":2026},"citing_paper":{"arxiv_id":"2608.12723","last_updated":"2026-08-13T02:09:50Z","snapshot_observed_at":"2026-08-19T06:34:34.512595Z","submitted_at":"2026-08-13T02:09:50Z","title":"Tree-partitions of graphs with bounded tree-depth","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T00:57:01.117077Z"},"links":{"cited_paper":"/paper/2605.27780","citing_paper":"/paper/2608.12723"},"observation_digest":"sha256:da813eca7286c4e98d1c723855cd11b6a7413b07131b114cff23e92b4e431630","observation_id":"8a9d501c-bb22-4c80-be65-e8b1ec9ed485","resolution":{"observed_at":"2026-08-16T00:57:01.171081Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.12723","last_updated":"2026-08-13T02:09:50Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-19T06:34:34.512595Z","submitted_at":"2026-08-13T02:09:50Z","title":"Tree-partitions of graphs with bounded tree-depth"},"reference_resolution":{"displayed":13,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":1,"verified_fuzzy":9},"total_outbound_references":13},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 13 of 13 outbound references and 0 inbound Pith citation observations for arXiv:2608.12723."}