{"as_of":"2026-08-15T18:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cb6519281bf5c22f1a19d81471cee8f2eb6e07c9294ea4268539cce4b4429978","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T04:18:59.127969Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2404.13446","last_updated":"2024-05-15T15:19:42Z","snapshot_observed_at":"2026-08-15T14:55:16.266607Z","submitted_at":"2024-04-20T19:08:00Z","title":"New Structures and Algorithms for Length-Constrained Expander Decompositions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.13446","snapshot_observed_at":"2026-08-14T04:18:59.127969Z","title":"Bernhard Haeupler, D Ellis Hershkowitz, Zihan Tan.https://arxiv.org/abs/2404.13446","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09538","last_updated":"2026-08-13T16:11:12Z","snapshot_observed_at":"2026-08-15T17:22:40.314299Z","submitted_at":"2026-08-10T12:36:16Z","title":"TCS-BENCH: Benchmarking State-of-the-Art Generative AI Theoretical Computer Science Research Ability","version":2},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-14T04:18:59.127969Z"},"links":{"cited_paper":"/paper/2404.13446","citing_paper":"/paper/2608.09538"},"observation_digest":"sha256:ad04f13887c19f08e66cfd02f1b0b4086130b85d1731281d73b97b2af2da56c4","observation_id":"841a8837-27a8-409e-936d-29517bc07db9","resolution":{"observed_at":"2026-08-14T04:18:59.127969Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2404.13446/citation-record","integrity":"/paper/2404.13446/integrity","json":"/paper/2404.13446/citation-record.json","paper":"/paper/2404.13446"},"outbound":[],"paper":{"arxiv_id":"2404.13446","last_updated":"2024-05-15T15:19:42Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-15T14:55:16.266607Z","submitted_at":"2024-04-20T19:08:00Z","title":"New Structures and Algorithms for Length-Constrained Expander Decompositions"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2404.13446."}