{"as_of":"2026-08-21T11:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:99c08b8bfa6542d8a1b2b73cf9f0549b1bf90b07e0cdfc3ecc74252229163adb","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T17:40:19.072261Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-03T16:58:42.788325Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.18382","last_updated":"2025-03-13T13:07:38Z","snapshot_observed_at":"2026-08-21T08:51:33.090435Z","submitted_at":"2025-02-25T17:25:16Z","title":"Property Testing in Bounded Degree Hypergraphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.18382","snapshot_observed_at":"2026-08-06T17:40:19.072261Z","title":"Property testing in bounded degree hypergraphs","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.10691","last_updated":"2025-07-14T18:05:02Z","snapshot_observed_at":"2026-08-21T08:51:48.013284Z","submitted_at":"2025-07-14T18:05:02Z","title":"A Fast Coloring Oracle for Average Case Hypergraphs","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T17:40:19.072261Z"},"links":{"cited_paper":"/paper/2502.18382","citing_paper":"/paper/2507.10691"},"observation_digest":"sha256:fc0211c79859244f682fe9a54e7c33cc23728e51b3fe52a61569308b173d3ce9","observation_id":"956cc564-1af3-4c49-b408-bbe4e3d1da7b","resolution":{"observed_at":"2026-08-06T17:40:19.072261Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18382","last_updated":"2025-03-13T13:07:38Z","snapshot_observed_at":"2026-08-21T08:51:33.090435Z","submitted_at":"2025-02-25T17:25:16Z","title":"Property Testing in Bounded Degree Hypergraphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.18382","snapshot_observed_at":"2026-08-04T07:22:15.514211Z","title":"Property testing in bounded degree hypergraphs","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.27012","last_updated":"2026-06-25T17:06:00Z","snapshot_observed_at":"2026-08-17T11:26:00.394367Z","submitted_at":"2025-10-30T21:24:51Z","title":"Unbounded-width CSPs are Untestable in a Sublinear Number of Queries","version":3},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-04T07:22:15.514211Z"},"links":{"cited_paper":"/paper/2502.18382","citing_paper":"/paper/2510.27012"},"observation_digest":"sha256:954adbb7f139d9a278ed168ef9a3765e04d07a4d0237b16a0649c7ef04d56ef1","observation_id":"976bb744-755d-43bc-9fc1-ba255d1eb7b8","resolution":{"observed_at":"2026-08-04T07:22:15.514211Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18382","last_updated":"2025-03-13T13:07:38Z","snapshot_observed_at":"2026-08-21T08:51:33.090435Z","submitted_at":"2025-02-25T17:25:16Z","title":"Property Testing in Bounded Degree Hypergraphs","version":2},"cited_work":{"arxiv_id":"2502.18382","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.18382","snapshot_observed_at":"2026-07-03T16:58:42.788325Z","title":"arXiv preprint arXiv:2502.18382 , year=","venue":null,"work_id":"b470bef6-cb95-4ee1-8a22-312cd1c6e81b","year":null},"citing_paper":{"arxiv_id":"2606.13583","last_updated":"2026-06-11T17:07:00Z","snapshot_observed_at":"2026-08-17T20:27:24.095587Z","submitted_at":"2026-06-11T17:07:00Z","title":"Testing Bipartiteness in Logarithmic Rounds","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-06-27T04:52:09.324445Z"},"links":{"cited_paper":"/paper/2502.18382","citing_paper":"/paper/2606.13583"},"observation_digest":"sha256:a2fd8c83b1863b677e28427f95ee2ed5d8d609d3ce43200cbfdcb51177ccd834","observation_id":"faee855d-7d15-4dcf-b1b0-c03b9635c753","resolution":{"observed_at":"2026-07-03T16:58:42.790180Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.18382/citation-record","integrity":"/paper/2502.18382/integrity","json":"/paper/2502.18382/citation-record.json","paper":"/paper/2502.18382"},"outbound":[],"paper":{"arxiv_id":"2502.18382","last_updated":"2025-03-13T13:07:38Z","latest_version":2,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-21T08:51:33.090435Z","submitted_at":"2025-02-25T17:25:16Z","title":"Property Testing in Bounded Degree Hypergraphs"},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2502.18382."}