{"as_of":"2026-08-09T16:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:68691fa6645195ddd5671f55b9719384895d55af46137efbae1f6d7191aceecc","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-09T06:31:02.800959+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-07T14:27:44.027526Z","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-07T14:27:44.306496Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2206.11832","last_updated":"2025-01-09T16:00:02Z","snapshot_observed_at":"2026-07-06T13:24:02.173160Z","submitted_at":"2022-06-23T16:59:40Z","title":"On the parameterized complexity of computing tree-partitions","version":6},"cited_work":{"arxiv_id":"2206.11832","doi":null,"metadata_source":"pith","pith_arxiv_id":"2206.11832","snapshot_observed_at":"2026-08-07T14:27:44.306496Z","title":"On the parameterized complexity of computing tree-partitions","venue":"cs.DM","work_id":"fee0f5f9-519f-464c-b366-3be39edf2502","year":2022},"citing_paper":{"arxiv_id":"2505.18923","last_updated":"2025-05-25T01:06:32Z","snapshot_observed_at":"2026-08-07T14:21:09.931527Z","submitted_at":"2025-05-25T01:06:32Z","title":"Graph-Based Operator Learning from Limited Data on Irregular Domains","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T14:27:44.027526Z"},"links":{"cited_paper":"/paper/2206.11832","citing_paper":"/paper/2505.18923"},"observation_digest":"sha256:222fa0617e300f734bd3d0ef8ac82a18183ea88773efd55aaf1d6f84dfa44134","observation_id":"2828eaaa-109b-4538-bca9-50eb4db0487e","resolution":{"observed_at":"2026-08-07T14:27:44.311483Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2206.11832/citation-record","integrity":"/paper/2206.11832/integrity","json":"/paper/2206.11832/citation-record.json","paper":"/paper/2206.11832"},"outbound":[],"paper":{"arxiv_id":"2206.11832","last_updated":"2025-01-09T16:00:02Z","latest_version":6,"primary_category":"cs.DM","snapshot_observed_at":"2026-07-06T13:24:02.173160Z","submitted_at":"2022-06-23T16:59:40Z","title":"On the parameterized complexity of computing tree-partitions"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2206.11832."}