{"as_of":"2026-08-13T00:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fa738fb0308b2dede690d64548927bc46b048e0e6ff8d7d49c741c92a9da4097","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-12T06:34:41.77262+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-12T12:01:39.547372Z","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-11T22:01:57.730838Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2306.15339","last_updated":"2023-06-27T09:49:31Z","snapshot_observed_at":"2026-07-06T15:47:11.292762Z","submitted_at":"2023-06-27T09:49:31Z","title":"A Note on the Complexity of One-Sided Crossing Minimization of Trees","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.15339","snapshot_observed_at":"2026-08-12T12:01:39.547372Z","title":"A note on the complexity of one-sided c ross- ing minimization of trees","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.17596","last_updated":"2024-11-27T12:45:55Z","snapshot_observed_at":"2026-08-12T23:18:27.207307Z","submitted_at":"2024-11-26T17:05:56Z","title":"Arcee: An OCM-Solver","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T12:01:39.547372Z"},"links":{"cited_paper":"/paper/2306.15339","citing_paper":"/paper/2411.17596"},"observation_digest":"sha256:cb7309eeb73306c93bde7e0711e984bbc390caa48876253a1924cf198d5d3494","observation_id":"618d674d-5d77-40ac-9dba-4d841750ce12","resolution":{"observed_at":"2026-08-12T12:01:39.547372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.15339","last_updated":"2023-06-27T09:49:31Z","snapshot_observed_at":"2026-07-06T15:47:11.292762Z","submitted_at":"2023-06-27T09:49:31Z","title":"A Note on the Complexity of One-Sided Crossing Minimization of Trees","version":1},"cited_work":{"arxiv_id":"2306.15339","doi":null,"metadata_source":"pith","pith_arxiv_id":"2306.15339","snapshot_observed_at":"2026-08-11T22:01:57.730838Z","title":"A Note on the Complexity of One-Sided Crossing Minimization of Trees","venue":"cs.CC","work_id":"8817de77-c2df-4f8f-9047-3a9ddd4beff7","year":2023},"citing_paper":{"arxiv_id":"2412.04042","last_updated":"2025-04-11T06:47:11Z","snapshot_observed_at":"2026-08-12T22:41:16.032570Z","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","version":3},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-11T22:01:56.469025Z"},"links":{"cited_paper":"/paper/2306.15339","citing_paper":"/paper/2412.04042"},"observation_digest":"sha256:690c73a5bfc1e572cead61c9065c79feb236382f47647240540ee6e6add3ff7a","observation_id":"bd9126f4-eb26-4490-a2bd-96534b264225","resolution":{"observed_at":"2026-08-11T22:01:57.736237Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2306.15339/citation-record","integrity":"/paper/2306.15339/integrity","json":"/paper/2306.15339/citation-record.json","paper":"/paper/2306.15339"},"outbound":[],"paper":{"arxiv_id":"2306.15339","last_updated":"2023-06-27T09:49:31Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-07-06T15:47:11.292762Z","submitted_at":"2023-06-27T09:49:31Z","title":"A Note on the Complexity of One-Sided Crossing Minimization of Trees"},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2306.15339."}