{"as_of":"2026-08-19T22:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:23b8bed6a0a6635d46523f43b95ab74c792edc810d3a8bd9cbd78083f52075af","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T14:11:39.409350Z","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-11T14:11:28.875699Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2011.05365","last_updated":"2023-09-13T17:54:27Z","snapshot_observed_at":"2026-08-18T19:54:50.770975Z","submitted_at":"2020-11-10T19:35:02Z","title":"A Nearly-Linear Time Algorithm for Linear Programs with Small Treewidth: A Multiscale Representation of Robust Central Path","version":3},"cited_work":{"arxiv_id":"2011.05365","doi":null,"metadata_source":"pith","pith_arxiv_id":"2011.05365","snapshot_observed_at":"2026-08-11T14:11:28.875699Z","title":"A Nearly-Linear Time Algorithm for Linear Programs with Small Treewidth: A Multiscale Representation of Robust Central Path","venue":"cs.DS","work_id":"e2532557-5147-4ff7-a405-df40e3f6e8bf","year":2020},"citing_paper":{"arxiv_id":"2412.12441","last_updated":"2024-12-17T01:09:23Z","snapshot_observed_at":"2026-08-16T13:20:46.681231Z","submitted_at":"2024-12-17T01:09:23Z","title":"Numerical Pruning for Efficient Autoregressive Models","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:26.946955Z"},"links":{"cited_paper":"/paper/2011.05365","citing_paper":"/paper/2412.12441"},"observation_digest":"sha256:44df6c212aea7f80d00e0a26b3b3145d7d53c63deb8287b44f253030d8d4c206","observation_id":"c8477f99-cdc1-4e37-bb4e-cafb3f1deb9e","resolution":{"observed_at":"2026-08-11T14:11:28.879217Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2011.05365","last_updated":"2023-09-13T17:54:27Z","snapshot_observed_at":"2026-08-18T19:54:50.770975Z","submitted_at":"2020-11-10T19:35:02Z","title":"A Nearly-Linear Time Algorithm for Linear Programs with Small Treewidth: A Multiscale Representation of Robust Central Path","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.05365","snapshot_observed_at":"2026-08-11T14:11:39.409350Z","title":"T.; and Ye, G","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.12444","last_updated":"2025-03-21T15:52:39Z","snapshot_observed_at":"2026-08-16T12:25:35.685966Z","submitted_at":"2024-12-17T01:12:35Z","title":"LazyDiT: Lazy Learning for the Acceleration of Diffusion Transformers","version":3},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-11T14:11:39.409350Z"},"links":{"cited_paper":"/paper/2011.05365","citing_paper":"/paper/2412.12444"},"observation_digest":"sha256:deedb646efa5a2243fd29b9c8d1b99e99ce7c16669a81a1f49754ffb672ef0a9","observation_id":"f7ca9a3d-8665-4911-ab12-2ab2d7a394ad","resolution":{"observed_at":"2026-08-11T14:11:39.409350Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2011.05365/citation-record","integrity":"/paper/2011.05365/integrity","json":"/paper/2011.05365/citation-record.json","paper":"/paper/2011.05365"},"outbound":[],"paper":{"arxiv_id":"2011.05365","last_updated":"2023-09-13T17:54:27Z","latest_version":3,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-18T19:54:50.770975Z","submitted_at":"2020-11-10T19:35:02Z","title":"A Nearly-Linear Time Algorithm for Linear Programs with Small Treewidth: A Multiscale Representation of Robust Central Path"},"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-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 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2011.05365."}