{"as_of":"2026-08-12T17:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:71270eb9bf04549de8a422b34faea2a6b33e47b7b3a5384e346927a22e528d2f","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-03T23:51:23.539847Z","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":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-07T00:15:59.295896Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.14081","snapshot_observed_at":"2026-08-03T23:51:23.539847Z","title":"The Complexity of Counting Small Sub-Hypergraphs.arXiv preprint arXiv:2506.14081,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.04258","last_updated":"2026-06-30T13:57:37Z","snapshot_observed_at":"2026-08-08T05:21:34.220353Z","submitted_at":"2025-11-06T10:49:07Z","title":"Counting Patterns in Degenerate Graphs in Constant Space","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T23:51:23.539847Z"},"links":{"cited_paper":"/paper/2506.14081","citing_paper":"/paper/2511.04258"},"observation_digest":"sha256:58188d9bccb135abff0774b159667bbfe79717c87d5f2b053303139d15b100ad","observation_id":"bc9bd803-6e37-4019-85df-7e4ba1df45d7","resolution":{"observed_at":"2026-08-03T23:51:23.539847Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-07T00:15:59.295896Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.14081","snapshot_observed_at":"2026-07-11T09:42:28.508680Z","title":"The complexity of counting small sub-hypergraphs.CoRR, abs/2506.14081, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"cited_paper":"/paper/2506.14081","citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:88e9f7ffa63524f24d9f03116f02ccf87e56658619164b304ba39ec4434cf487","observation_id":"fac1be79-4342-4d26-9181-9adc8e75a61c","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2506.14081/citation-record","integrity":"/paper/2506.14081/integrity","json":"/paper/2506.14081/citation-record.json","paper":"/paper/2506.14081"},"outbound":[],"paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","latest_version":3,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-07T00:15:59.295896Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2506.14081."}