{"as_of":"2026-08-16T13:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:35004e8594b416f7f96c265841dd0bb4f082e9e8bbb3f56827f83bfcac68eb65","coverage":[{"denominator":4,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T16:34:02.473859Z","state":"measured"},{"denominator":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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.09495/citation-record","integrity":"/paper/2608.09495/integrity","json":"/paper/2608.09495/citation-record.json","paper":"/paper/2608.09495"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2105.01230","last_updated":"2022-05-05T13:40:16Z","snapshot_observed_at":"2026-08-11T13:41:59.248848Z","submitted_at":"2021-05-04T00:41:46Z","title":"Separating layered treewidth and row treewidth","version":3},"cited_work":{"arxiv_id":"2105.01230","doi":null,"metadata_source":"pith","pith_arxiv_id":"2105.01230","snapshot_observed_at":"2026-08-11T16:34:02.594445Z","title":"Separating layered treewidth and row treewidth","venue":"math.CO","work_id":"dc4fec9a-b418-4df7-a6bf-f41750f4f072","year":2021},"citing_paper":{"arxiv_id":"2608.09495","last_updated":"2026-08-10T12:02:50Z","snapshot_observed_at":"2026-08-13T23:44:24.122245Z","submitted_at":"2026-08-10T12:02:50Z","title":"Row pathwidth of complete binary trees","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T16:34:02.338543Z"},"links":{"cited_paper":"/paper/2105.01230","citing_paper":"/paper/2608.09495"},"observation_digest":"sha256:05c42e02479ab964c8ebc066ec5ab39c0435da196b4ac07960418d24903ddea3","observation_id":"574da85e-76bc-4817-b74e-3f28f7da27b6","resolution":{"observed_at":"2026-08-11T16:34:02.600911Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.04791","last_updated":"2020-04-30T01:39:59Z","snapshot_observed_at":"2026-08-16T07:07:47.897219Z","submitted_at":"2019-04-09T17:11:16Z","title":"Planar graphs have bounded queue-number","version":5},"cited_work":{"arxiv_id":"1904.04791","doi":null,"metadata_source":"pith","pith_arxiv_id":"1904.04791","snapshot_observed_at":"2026-08-11T16:34:02.555916Z","title":"Planar graphs have bounded queue-number","venue":"cs.DM","work_id":"efd819fb-997d-4a43-bb99-f60e5f4f3ed8","year":2019},"citing_paper":{"arxiv_id":"2608.09495","last_updated":"2026-08-10T12:02:50Z","snapshot_observed_at":"2026-08-13T23:44:24.122245Z","submitted_at":"2026-08-10T12:02:50Z","title":"Row pathwidth of complete binary trees","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T16:34:02.382930Z"},"links":{"cited_paper":"/paper/1904.04791","citing_paper":"/paper/2608.09495"},"observation_digest":"sha256:3b450d90ae986fda20fa5bb7772168fdfc0fb35a44181519e9403d74d695db66","observation_id":"42f1ec5d-0728-41fd-a383-52f836c1b9b4","resolution":{"observed_at":"2026-08-11T16:34:02.567363Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2001.08860","last_updated":"2020-07-02T21:40:08Z","snapshot_observed_at":"2026-07-06T08:52:29.410955Z","submitted_at":"2020-01-24T01:45:42Z","title":"Notes on Graph Product Structure Theory","version":2},"cited_work":{"arxiv_id":"2001.08860","doi":null,"metadata_source":"pith","pith_arxiv_id":"2001.08860","snapshot_observed_at":"2026-08-11T16:34:02.513225Z","title":"Notes on Graph Product Structure Theory","venue":"math.CO","work_id":"3337217c-4235-4d8c-99a5-d9dd3c9be21e","year":2020},"citing_paper":{"arxiv_id":"2608.09495","last_updated":"2026-08-10T12:02:50Z","snapshot_observed_at":"2026-08-13T23:44:24.122245Z","submitted_at":"2026-08-10T12:02:50Z","title":"Row pathwidth of complete binary trees","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T16:34:02.424334Z"},"links":{"cited_paper":"/paper/2001.08860","citing_paper":"/paper/2608.09495"},"observation_digest":"sha256:ca6bf61875068d7a9805836e2331900618c0a7aa36a00aa7ee453db64d177998","observation_id":"b0cd4e4d-b061-48db-a847-4a9c3781e61e","resolution":{"observed_at":"2026-08-11T16:34:02.531998Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-11T16:34:02.611190Z","title":"Robertson and P","venue":null,"work_id":"efca0fef-ffb3-4e6a-a431-eb37b6beefed","year":1983},"citing_paper":{"arxiv_id":"2608.09495","last_updated":"2026-08-10T12:02:50Z","snapshot_observed_at":"2026-08-13T23:44:24.122245Z","submitted_at":"2026-08-10T12:02:50Z","title":"Row pathwidth of complete binary trees","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T16:34:02.473859Z"},"links":{"citing_paper":"/paper/2608.09495"},"observation_digest":"sha256:272b5634622b8b7de6dcbd9f5985907b3fabaa87454a0b895cdfb64934eccf74","observation_id":"7b0136e7-01b8-40f2-82d6-c2ff75718cc1","resolution":{"observed_at":"2026-08-11T16:34:02.615391Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.09495","last_updated":"2026-08-10T12:02:50Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-13T23:44:24.122245Z","submitted_at":"2026-08-10T12:02:50Z","title":"Row pathwidth of complete binary trees"},"reference_resolution":{"displayed":4,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":3,"verified_fuzzy":1},"total_outbound_references":4},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 4 of 4 outbound references and 0 inbound Pith citation observations for arXiv:2608.09495."}