Pith. sign in

Paper Citation Record · LEDGER

The Parametrised Complexity of Counting Small Sub-Hypergraphs

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2506.14081 v3

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-12T06:34:41.77262+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-03T23:51:23.539847Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation bc9bd803-6e37-4019-85df-7e4ba1df45d7 · inbound

Counting Patterns in Degenerate Graphs in Constant Space cites this paper.

Counting Patterns in Degenerate Graphs in Constant Space The Parametrised Complexity of Counting Small Sub-Hypergraphs

Reference 18

Resolution
unresolved
no resolver link, observed 2026-08-03T23:51:23.539847Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T23:51:23.539847Z digest=sha256:58188d9bccb135abff0774b159667bbfe79717c87d5f2b053303139d15b100ad

Observation fac1be79-4342-4d26-9181-9adc8e75a61c · inbound

The Fine-Grained Complexity of Counting Hypergraph Motifs cites this paper.

The Fine-Grained Complexity of Counting Hypergraph Motifs The Parametrised Complexity of Counting Small Sub-Hypergraphs

Reference 12

Resolution
unresolved
no resolver link, observed 2026-07-11T09:42:28.508680Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-11T09:42:28.508680Z digest=sha256:88e9f7ffa63524f24d9f03116f02ccf87e56658619164b304ba39ec4434cf487