Paper Citation Record · LEDGER

The Parametrised Complexity of Counting Small Sub-Hypergraphs

As of 21 August 2026, this Paper Citation Record lists 47 of 47 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 47 of 47 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-15T20:13:36.475158Z

measured 49 of 49 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-21T06:32:19.484+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

47 of 47 outbound references displayed

verified exact9
verified fuzzy4
unresolved34
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation da659ace-9507-4206-8bcd-cb0d7d814738 · outbound

This paper cites Agarwal, Jongwoo Lim , L.

The Parametrised Complexity of Counting Small Sub-Hypergraphs Agarwal, Jongwoo Lim , L

Reference 1

Resolution: verified exact; doi, observed 2026-08-15T20:13:37.892093Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 88ff5ac5-ccce-4404-a07e-cf99c8115132 · outbound

This paper cites Clustering in graphs and hypergraphs with categorical edge labels.

The Parametrised Complexity of Counting Small Sub-Hypergraphs Clustering in graphs and hypergraphs with categorical edge labels

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-15T20:13:35.101048Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 01043759-b25e-4a6b-8b9b-5906dc352b76 · outbound

This paper cites Benson, Rediet Abebe, Michael T.

The Parametrised Complexity of Counting Small Sub-Hypergraphs Benson, Rediet Abebe, Michael T

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-15T20:13:35.106212Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4cc0299f-4c00-4890-90ca-894a90605679 · outbound

This paper cites Bera, Lior Gishboliner, Yevgeny Levanzov, C.

The Parametrised Complexity of Counting Small Sub-Hypergraphs Bera, Lior Gishboliner, Yevgeny Levanzov, C

Reference 4

Resolution: verified exact; doi, observed 2026-08-15T20:13:37.712523Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation c28a494c-74ba-4345-ad51-1f997bcff346 · outbound

This paper cites Counting Subgraphs in Somewhere Dense Graphs.

The Parametrised Complexity of Counting Small Sub-Hypergraphs Counting Subgraphs in Somewhere Dense Graphs

Reference 5

Resolution: verified exact; doi, observed 2026-08-15T20:13:37.522375Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 77ddb64d-a0d3-4a87-a2f7-cbe6d33b1dcb · outbound

This paper cites The complexity of pattern counting in directed graphs, parameterised by the outdegree.

The Parametrised Complexity of Counting Small Sub-Hypergraphs The complexity of pattern counting in directed graphs, parameterised by the outdegree

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-15T20:13:35.122469Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 89ffb45f-7978-4e5f-8fb9-e8ad3d5f7609 · outbound

This paper cites Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies.

The Parametrised Complexity of Counting Small Sub-Hypergraphs Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies

Reference 7

Resolution: verified exact; local_arxiv, observed 2026-08-15T20:13:37.503528Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 5a7366a7-bebc-4920-b055-aafde5323c58 · outbound

This paper cites Homomorphisms are a good basis for counting small subgraphs.

The Parametrised Complexity of Counting Small Sub-Hypergraphs Homomorphisms are a good basis for counting small subgraphs

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-15T20:13:35.152758Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cf9c39c1-ac7d-4d57-9d49-a4fce755cda6 · outbound

This paper cites Fomin, Lukasz Kowalik, Daniel Lokshtanov, D \' a niel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh.

The Parametrised Complexity of Counting Small Sub-Hypergraphs Fomin, Lukasz Kowalik, Daniel Lokshtanov, D \' a niel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-15T20:13:35.248950Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a3189541-b565-4a17-a39e-c751bafd193d · outbound

This paper cites The C omplexity of S atisfiability of S mall D epth C ircuits.

The Parametrised Complexity of Counting Small Sub-Hypergraphs The C omplexity of S atisfiability of S mall D epth C ircuits

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-15T20:13:35.276561Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3fb517d3-6a03-43ee-bfd6-881659d61007 · outbound

This paper cites Complexity of C ounting S ubgraphs: O nly the B oundedness of the V ertex- C over N umber C ounts.

The Parametrised Complexity of Counting Small Sub-Hypergraphs Complexity of C ounting S ubgraphs: O nly the B oundedness of the V ertex- C over N umber C ounts

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-15T20:13:35.281027Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f2a424fb-6d3b-406d-ae97-f99952bb3b0c · outbound

This paper cites A T richotomy in the C omplexity of C ounting A nswers to C onjunctive Q ueries.

The Parametrised Complexity of Counting Small Sub-Hypergraphs A T richotomy in the C omplexity of C ounting A nswers to C onjunctive Q ueries

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-15T20:13:35.287020Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a26f57c5-c465-41a0-b0d0-cf2d65efea21 · outbound

This paper cites Counting A nswers to E xistential P ositive Q ueries: A C omplexity C lassification.

The Parametrised Complexity of Counting Small Sub-Hypergraphs Counting A nswers to E xistential P ositive Q ueries: A C omplexity C lassification

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-15T20:13:35.291515Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2beb6694-bb40-41aa-83cf-d9eae050eb53 · outbound

This paper cites Counting small induced subgraphs: Hardness via fourier analysis.

The Parametrised Complexity of Counting Small Sub-Hypergraphs Counting small induced subgraphs: Hardness via fourier analysis

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-15T20:13:35.296198Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8f104d44-41c5-41b2-802c-2c7a0e2f2544 · outbound

This paper cites Understanding the C omplexity of I nduced S ubgraph I somorphisms.

The Parametrised Complexity of Counting Small Sub-Hypergraphs Understanding the C omplexity of I nduced S ubgraph I somorphisms

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-15T20:13:35.354127Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bc8c727d-7e62-4e77-9326-839645214e1b · outbound

This paper cites Downey and Michael R.

The Parametrised Complexity of Counting Small Sub-Hypergraphs Downey and Michael R

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-15T20:13:35.407502Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6a93c187-ad15-4057-8993-4aa4d365e1a4 · outbound

This paper cites The complexity of counting homomorphisms seen from the other side.

The Parametrised Complexity of Counting Small Sub-Hypergraphs The complexity of counting homomorphisms seen from the other side

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-15T20:13:35.413186Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e38b6295-de6c-492d-9ce8-6dee678ca8c0 · outbound

This paper cites Structural T ractability of C ounting of S olutions to C onjunctive Q ueries.

The Parametrised Complexity of Counting Small Sub-Hypergraphs Structural T ractability of C ounting of S olutions to C onjunctive Q ueries

Reference 18

Resolution: verified exact; doi, observed 2026-08-15T20:13:37.273082Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 2be33084-4539-4c6a-bdc5-2dc30861c7ca · outbound

This paper cites Counting Small Induced Subgraphs with Edge - Monotone Properties.

The Parametrised Complexity of Counting Small Sub-Hypergraphs Counting Small Induced Subgraphs with Edge - Monotone Properties

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-15T20:13:35.424342Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9cc3ea13-d179-4e92-ada8-009e3ee2358f · outbound

This paper cites From graph properties to graph parameters: Tight bounds for counting on small subgraphs.

The Parametrised Complexity of Counting Small Sub-Hypergraphs From graph properties to graph parameters: Tight bounds for counting on small subgraphs

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-15T20:13:35.428954Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 56e47361-6992-464c-883e-2b7f0fea4c9f · outbound

This paper cites Counting Answers to Existential Questions.

The Parametrised Complexity of Counting Small Sub-Hypergraphs Counting Answers to Existential Questions

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-15T20:13:35.432992Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 14e00c06-d171-4d00-82a1-56ee0b1eb4e1 · outbound

This paper cites Fixed- P arameter T ractability, D efinability, and M odel- C hecking.

The Parametrised Complexity of Counting Small Sub-Hypergraphs Fixed- P arameter T ractability, D efinability, and M odel- C hecking

Reference 22

Resolution: verified exact; doi, observed 2026-08-15T20:13:37.093381Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 93d71a38-13cf-40bf-b17d-8b2712b9d4ac · outbound

This paper cites Parameterized Complexity Theory.

The Parametrised Complexity of Counting Small Sub-Hypergraphs Parameterized Complexity Theory

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-15T20:13:35.441565Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 20bf3314-3263-4ea1-b712-42cf917f4107 · outbound

This paper cites Counting small induced subgraphs with hereditary properties.

The Parametrised Complexity of Counting Small Sub-Hypergraphs Counting small induced subgraphs with hereditary properties

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-15T20:13:35.527325Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 65c0af5d-f3e5-46a3-9173-37f48043e4c1 · outbound

This paper cites Hypertree decompositions and tractable queries.

The Parametrised Complexity of Counting Small Sub-Hypergraphs Hypertree decompositions and tractable queries

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-15T20:13:35.595978Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1ce5216d-70f0-4baf-a359-c92ffaa047c2 · outbound

This paper cites On tree width, bramble size, and expansion.

The Parametrised Complexity of Counting Small Sub-Hypergraphs On tree width, bramble size, and expansion

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-15T20:13:35.601295Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 788093fb-560f-494d-9cf6-504e3a478def · outbound

This paper cites Constraint solving via fractional edge covers.

The Parametrised Complexity of Counting Small Sub-Hypergraphs Constraint solving via fractional edge covers

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-15T20:13:35.634683Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bb0aa834-2f4e-4260-82f2-bcf91a88aa5a · outbound

This paper cites AHP: Learning to Negative Sample for Hyperedge Prediction.

The Parametrised Complexity of Counting Small Sub-Hypergraphs AHP: Learning to Negative Sample for Hyperedge Prediction

Reference 28

Resolution: verified exact; local_arxiv, observed 2026-08-15T20:13:36.886770Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 1d10c055-961e-49b4-8dbd-de8f6f9b1323 · outbound

This paper cites an unresolved cited work.

The Parametrised Complexity of Counting Small Sub-Hypergraphs Unresolved cited work

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-15T20:13:35.708570Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d59ac604-812c-41d9-a0ea-e9d2b7ebe1ca · outbound

This paper cites Learning on Weighted Hypergraphs to Integrate Protein Interactions and Gene Expressions for Cancer Outcome Prediction.

The Parametrised Complexity of Counting Small Sub-Hypergraphs Learning on Weighted Hypergraphs to Integrate Protein Interactions and Gene Expressions for Cancer Outcome Prediction

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-15T20:13:35.756392Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 35696075-a294-4340-9f6e-4ba1e75b2914 · outbound

This paper cites On the C omplexity of k- S A T.

The Parametrised Complexity of Counting Small Sub-Hypergraphs On the C omplexity of k- S A T

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-15T20:13:35.809196Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b2836f80-f887-41bf-a045-c31ff395e4ed · outbound

This paper cites Which P roblems H ave S trongly E xponential C omplexity? Journal of Computer and System Sciences , 63(4):512--530, 2001.

The Parametrised Complexity of Counting Small Sub-Hypergraphs Which P roblems H ave S trongly E xponential C omplexity? Journal of Computer and System Sciences , 63(4):512--530, 2001

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-15T20:13:35.814990Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 159a04e7-1b81-448a-8815-2b5c7f627a38 · outbound

This paper cites Adaptive Hypergraph Learning and its Application in Image Classification.

The Parametrised Complexity of Counting Small Sub-Hypergraphs Adaptive Hypergraph Learning and its Application in Image Classification

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-15T20:13:35.820370Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 76a30216-9249-49b9-b742-c4f264973558 · outbound

This paper cites The parameterised complexity of counting connected subgraphs and graph motifs.

The Parametrised Complexity of Counting Small Sub-Hypergraphs The parameterised complexity of counting connected subgraphs and graph motifs

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-15T20:13:35.898139Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7503ab51-4471-430c-aa41-d372579a9c14 · outbound

This paper cites Lov \'a sz.

The Parametrised Complexity of Counting Small Sub-Hypergraphs Lov \'a sz

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-15T20:13:35.960225Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 102bfd5b-b7ac-4b46-ba7f-3431d4e439ba · outbound

This paper cites Large Networks and Graph Limits , volume 60 of Colloquium Publications.

The Parametrised Complexity of Counting Small Sub-Hypergraphs Large Networks and Graph Limits , volume 60 of Colloquium Publications

Reference 36

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T20:13:39.291908Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 42eeb28e-2cb4-4984-a100-206d6c0fa717 · outbound

This paper cites Link prediction in social networks based on hypergraph.

The Parametrised Complexity of Counting Small Sub-Hypergraphs Link prediction in social networks based on hypergraph

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-15T20:13:36.078958Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 45cc0abe-e5e0-476e-9774-b8aa79209b51 · outbound

This paper cites Can Y ou B eat T reewidth? Theory of Computing.

The Parametrised Complexity of Counting Small Sub-Hypergraphs Can Y ou B eat T reewidth? Theory of Computing

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-15T20:13:36.193962Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 64cfc214-89be-4781-8ff5-a1a764b6fafd · outbound

This paper cites Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries.

The Parametrised Complexity of Counting Small Sub-Hypergraphs Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-15T20:13:36.200251Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c7f6fcc6-6804-48cb-8b8d-a47e5f33ebfc · outbound

This paper cites A short note on the counting complexity of conjunctive queries.

The Parametrised Complexity of Counting Small Sub-Hypergraphs A short note on the counting complexity of conjunctive queries

Reference 40

Resolution: unresolved; no resolver link, observed 2026-08-15T20:13:36.267110Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9c5e6cf3-c8d7-4e76-a120-9e626e829791 · outbound

This paper cites Hypergraph isomorphism for groups with restricted composition factors.

The Parametrised Complexity of Counting Small Sub-Hypergraphs Hypergraph isomorphism for groups with restricted composition factors

Reference 41

Resolution: verified exact; doi, observed 2026-08-15T20:13:36.732195Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 1231eee2-c0c8-4dcf-923d-0cdda1ec1378 · outbound

This paper cites Counting R estricted H omomorphisms via M \" o bius I nversion over M atroid L attices.

The Parametrised Complexity of Counting Small Sub-Hypergraphs Counting R estricted H omomorphisms via M \" o bius I nversion over M atroid L attices

Reference 42

Resolution: verified exact; doi, observed 2026-08-15T20:13:36.581639Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 180f231f-c10f-4402-a190-87c428c542e2 · outbound

This paper cites Counting induced subgraphs: A topological approach to \# w[1]-hardness.

The Parametrised Complexity of Counting Small Sub-Hypergraphs Counting induced subgraphs: A topological approach to \# w[1]-hardness

Reference 43

Resolution: unresolved; no resolver link, observed 2026-08-15T20:13:36.281629Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5b069f8f-1a1e-4135-9307-ef9e98a9a8ff · outbound

This paper cites Counting small induced subgraphs satisfying monotone properties.

The Parametrised Complexity of Counting Small Sub-Hypergraphs Counting small induced subgraphs satisfying monotone properties

Reference 44

Resolution: unresolved; no resolver link, observed 2026-08-15T20:13:36.315700Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f042de6b-d3cc-41bc-8a18-2fe159fb2c13 · outbound

This paper cites Fractional Graph Theory: A Rational Approach to the Theory of Graphs.

The Parametrised Complexity of Counting Small Sub-Hypergraphs Fractional Graph Theory: A Rational Approach to the Theory of Graphs

Reference 45

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T20:13:39.164625Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation a894aa37-36ff-4b4a-983c-57ad7dc0a4bf · outbound

This paper cites Vazirani.

The Parametrised Complexity of Counting Small Sub-Hypergraphs Vazirani

Reference 46

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T20:13:38.980827Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 581c1baa-90cb-403e-a117-b94b7a3070c8 · outbound

This paper cites Learning with hypergraphs: Clustering, classification, and embedding.

The Parametrised Complexity of Counting Small Sub-Hypergraphs Learning with hypergraphs: Clustering, classification, and embedding

Reference 47

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T20:13:38.964253Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

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.

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.