Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-07-11T09:42:28.508680Z
Paper Citation Record · LEDGER
The Fine-Grained Complexity of Counting Hypergraph Motifs
As of 12 August 2026, this Paper Citation Record lists 56 of 56 outbound references and 0 inbound Pith citation observations for arXiv:2607.05040.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-12T06:34:41.77262+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
56 of 56 outbound references displayed
- verified exact0
- verified fuzzy0
- unresolved56
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 5217e403-2fca-4dd0-be02-45d598a966e9 · outbound
This paper cites Popular conjectures imply strong lower bounds for dynamic problems.
The Fine-Grained Complexity of Counting Hypergraph Motifs Popular conjectures imply strong lower bounds for dynamic problems
Reference 1
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 8b392e71-9aaf-4331-8f63-c858b050b5ef · outbound
This paper cites Beyond Pairwise Clustering.
The Fine-Grained Complexity of Counting Hypergraph Motifs Beyond Pairwise Clustering
Reference 2
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 5e93a2ec-efba-44d2-a67c-df3d9799e2f9 · outbound
This paper cites Ahmed, Jennifer Neville, Ryan A.
The Fine-Grained Complexity of Counting Hypergraph Motifs Ahmed, Jennifer Neville, Ryan A
Reference 3
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 6ff6a793-e9e6-45a4-8b6f-7a63191bf1e8 · outbound
This paper cites Parameterised Holant Problems.
The Fine-Grained Complexity of Counting Hypergraph Motifs Parameterised Holant Problems
Reference 4
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 5792a211-944d-4d8c-8d61-1368d8aaf20d · outbound
This paper cites Parameterised holant prob- lems.
The Fine-Grained Complexity of Counting Hypergraph Motifs Parameterised holant prob- lems
Reference 5
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 48feaea6-7ded-494d-9286-c3f606e32d6c · outbound
This paper cites Cenk Sahinalp.
The Fine-Grained Complexity of Counting Hypergraph Motifs Cenk Sahinalp
Reference 6
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 0e5a1fb6-8134-4fe4-8726-520503906aa4 · outbound
This paper cites Clustering in graphs and hypergraphs with categorical edge labels.
The Fine-Grained Complexity of Counting Hypergraph Motifs Clustering in graphs and hypergraphs with categorical edge labels
Reference 7
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation aab03b9f-0a03-470e-8ba8-8e1dc31b8ea6 · outbound
This paper cites On the desirability of acyclic database schemes.J.
The Fine-Grained Complexity of Counting Hypergraph Motifs On the desirability of acyclic database schemes.J
Reference 8
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 7f77b887-05c4-4301-b511-1f707cf15a4c · outbound
This paper cites Benson, Rediet Abebe, Michael T.
The Fine-Grained Complexity of Counting Hypergraph Motifs Benson, Rediet Abebe, Michael T
Reference 9
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation be740208-d3a5-4d57-9cc6-5b70e74d6072 · outbound
This paper cites (The relevance of the list: propositional logic and complexity of the first order).
The Fine-Grained Complexity of Counting Hypergraph Motifs (The relevance of the list: propositional logic and complexity of the first order)
Reference 10
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 88c594fd-358f-4e81-87a1-c06824d4d896 · outbound
This paper cites Hypergraph acyclicity revisited.ACM Comput.
The Fine-Grained Complexity of Counting Hypergraph Motifs Hypergraph acyclicity revisited.ACM Comput
Reference 11
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation fac1be79-4342-4d26-9181-9adc8e75a61c · outbound
This paper cites The Parametrised Complexity of Counting Small Sub-Hypergraphs.
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.
Observation 196105b3-4858-4029-9403-820d6523503b · outbound
This paper cites The parameterised complexity of counting small sub-hypergraphs.
The Fine-Grained Complexity of Counting Hypergraph Motifs The parameterised complexity of counting small sub-hypergraphs
Reference 13
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation aec8bddb-9144-44ca-9445-3ccfb89de2f1 · outbound
This paper cites Counting subgraphs in somewhere dense graphs.SIAM J.
The Fine-Grained Complexity of Counting Hypergraph Motifs Counting subgraphs in somewhere dense graphs.SIAM J
Reference 14
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 2312f4b0-bcc2-4bfc-a3df-ae5fdcef94f4 · outbound
This paper cites Counting answers to existential positive queries: A complexity classifi- cation.
The Fine-Grained Complexity of Counting Hypergraph Motifs Counting answers to existential positive queries: A complexity classifi- cation
Reference 15
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation a37ad3a5-471f-4e7c-98fc-6ee4e57dfd4c · outbound
This paper cites Juedes, Iyad A.
The Fine-Grained Complexity of Counting Hypergraph Motifs Juedes, Iyad A
Reference 16
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 99e4f9d9-4c0c-48dc-b674-bb43f430440d · outbound
This paper cites Kanj, and Ge Xia.
The Fine-Grained Complexity of Counting Hypergraph Motifs Kanj, and Ge Xia
Reference 17
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation f58bb129-ff74-4215-bc33-c9524540f640 · outbound
This paper cites Understanding the Complexity of Induced Subgraph Isomorphisms.
The Fine-Grained Complexity of Counting Hypergraph Motifs Understanding the Complexity of Induced Subgraph Isomorphisms
Reference 18
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 16dfb0ec-598c-40eb-bcee-7644869a5a46 · outbound
This paper cites Homomorphisms are a good basis for counting small subgraphs.
The Fine-Grained Complexity of Counting Hypergraph Motifs Homomorphisms are a good basis for counting small subgraphs
Reference 19
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 8ef28f39-69de-461a-a424-9e8356b5fd97 · outbound
This paper cites Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover Number Counts.
The Fine-Grained Complexity of Counting Hypergraph Motifs Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover Number Counts
Reference 20
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation d653dcec-0a72-465d-bfa7-fc42460e3d3c · outbound
This paper cites Fomin, Lukasz Kowalik, Daniel Lokshtanov, D´ aniel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh.Parameterized Algorithms.
The Fine-Grained Complexity of Counting Hypergraph Motifs Fomin, Lukasz Kowalik, Daniel Lokshtanov, D´ aniel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh.Parameterized Algorithms
Reference 21
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 4651a336-a0da-4146-9b89-db9b23cee272 · outbound
This paper cites The complexity of counting homomorphisms seen from the other side.Theor.
The Fine-Grained Complexity of Counting Hypergraph Motifs The complexity of counting homomorphisms seen from the other side.Theor
Reference 22
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation c7c4ff48-425c-4e48-9c40-5082aa86a022 · outbound
This paper cites Counting induced subgraphs: An algebraic approach to #w[1]-hardness.Algorithmica, 84(2):379–404, 2022.
The Fine-Grained Complexity of Counting Hypergraph Motifs Counting induced subgraphs: An algebraic approach to #w[1]-hardness.Algorithmica, 84(2):379–404, 2022
Reference 23
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 55571962-b4d0-4115-af62-2cde24dc4992 · outbound
This paper cites Counting small induced subgraphs with edge-monotone properties.
The Fine-Grained Complexity of Counting Hypergraph Motifs Counting small induced subgraphs with edge-monotone properties
Reference 24
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 6f1a67bb-6dab-426a-87a2-2878527e6979 · outbound
This paper cites Counting small induced subgraphs with hereditary properties.SIAM J.
The Fine-Grained Complexity of Counting Hypergraph Motifs Counting small induced subgraphs with hereditary properties.SIAM J
Reference 25
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 117535e6-7462-42a2-b5b5-5a19d588de55 · outbound
This paper cites an unresolved cited work.
The Fine-Grained Complexity of Counting Hypergraph Motifs Unresolved cited work
Reference 26
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation d39f9910-2a77-45f9-99e5-8360914b468f · outbound
This paper cites Hypertree decompositions and tractable queries.
The Fine-Grained Complexity of Counting Hypergraph Motifs Hypertree decompositions and tractable queries
Reference 27
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 78e6696f-266c-4d6c-970a-6fedee96e9ca · outbound
This paper cites an unresolved cited work.
The Fine-Grained Complexity of Counting Hypergraph Motifs Unresolved cited work
Reference 28
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 4f7efdaf-4c86-40ce-8a6e-3c0668a74a3b · outbound
This paper cites The complexity of homomorphism and constraint satisfaction problems seen from the other side.J.
The Fine-Grained Complexity of Counting Hypergraph Motifs The complexity of homomorphism and constraint satisfaction problems seen from the other side.J
Reference 29
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 641c95ed-3619-43de-9dae-c038623ba14d · outbound
This paper cites Constraint solving via fractional edge covers.ACM Trans.
The Fine-Grained Complexity of Counting Hypergraph Motifs Constraint solving via fractional edge covers.ACM Trans
Reference 30
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 4c240ae7-9ea8-4914-9f1e-63a760da3d33 · outbound
This paper cites an unresolved cited work.
The Fine-Grained Complexity of Counting Hypergraph Motifs Unresolved cited work
Reference 31
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 2885c249-950b-46eb-b601-fe089a73ac4d · outbound
This paper cites AHP: learning to negative sample for hyperedge prediction.
The Fine-Grained Complexity of Counting Hypergraph Motifs AHP: learning to negative sample for hyperedge prediction
Reference 32
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 0ed278d0-77d0-459c-ad89-6cd5d0bd26fb · outbound
This paper cites Learning on Weighted Hypergraphs to Integrate Protein Interactions and Gene Expressions for Cancer Outcome Prediction.
The Fine-Grained Complexity of Counting Hypergraph Motifs Learning on Weighted Hypergraphs to Integrate Protein Interactions and Gene Expressions for Cancer Outcome Prediction
Reference 33
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation e74f97c1-d926-4bf5-a99c-32775881bbe0 · outbound
This paper cites On the Complexity of k-SAT.J.
The Fine-Grained Complexity of Counting Hypergraph Motifs On the Complexity of k-SAT.J
Reference 34
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 3509a13f-ed3a-4f27-986a-03ce666f1a90 · outbound
This paper cites Adaptive Hypergraph Learning and its Application in Image Classification.IEEE Transactions on Image Processing, 21, 2012.
The Fine-Grained Complexity of Counting Hypergraph Motifs Adaptive Hypergraph Learning and its Application in Image Classification.IEEE Transactions on Image Processing, 21, 2012
Reference 35
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 249e54b3-2006-40b8-bb78-a080955c8358 · outbound
This paper cites Topological network alignment uncovers biological function and phylogeny.Journal of the Royal Society Interface, 7(50):1341–1354, 2010.
The Fine-Grained Complexity of Counting Hypergraph Motifs Topological network alignment uncovers biological function and phylogeny.Journal of the Royal Society Interface, 7(50):1341–1354, 2010
Reference 36
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 6503b37a-3045-4a2b-8205-538d1e51cd14 · outbound
This paper cites Hypergraph motifs: Concepts, algorithms, and discoveries.
The Fine-Grained Complexity of Counting Hypergraph Motifs Hypergraph motifs: Concepts, algorithms, and discoveries
Reference 37
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation c204530a-2766-4bf6-bfae-2fe09a8e33ad · outbound
This paper cites Hypergraph motifs and their extensions beyond binary.VLDB J., 33(3):625–665, 2024.
The Fine-Grained Complexity of Counting Hypergraph Motifs Hypergraph motifs and their extensions beyond binary.VLDB J., 33(3):625–665, 2024
Reference 38
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation a9fb3329-1a92-440c-b7fb-05af002e2ded · outbound
This paper cites Link prediction in social networks based on hypergraph.
The Fine-Grained Complexity of Counting Hypergraph Motifs Link prediction in social networks based on hypergraph
Reference 39
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 269a9204-6558-470e-bc7f-6694facf2bd9 · outbound
This paper cites American Mathematical Society, 2012.
The Fine-Grained Complexity of Counting Hypergraph Motifs American Mathematical Society, 2012
Reference 40
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 1e2d222e-9541-446d-b296-6031be40f920 · outbound
This paper cites Tractable hypergraph properties for constraint satisfaction and conjunctive queries.J.
The Fine-Grained Complexity of Counting Hypergraph Motifs Tractable hypergraph properties for constraint satisfaction and conjunctive queries.J
Reference 41
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation fc8ff1ed-9a65-49fe-baeb-a854949b449d · outbound
This paper cites Lower Bounds for Conjunctive Query Evaluation.
The Fine-Grained Complexity of Counting Hypergraph Motifs Lower Bounds for Conjunctive Query Evaluation
Reference 42
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation b738eb5e-0a54-4181-af4f-157f28eeecb2 · outbound
This paper cites Lower bounds for conjunctive query evaluation.
The Fine-Grained Complexity of Counting Hypergraph Motifs Lower bounds for conjunctive query evaluation
Reference 43
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation f2611c23-705b-447b-b22f-4e5249c1e06d · outbound
This paper cites an unresolved cited work.
The Fine-Grained Complexity of Counting Hypergraph Motifs Unresolved cited work
Reference 44
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 261b93a2-365d-44b0-9a05-ffbc65803b4e · outbound
This paper cites Parameterized counting and cayley graph expanders.SIAM J.
The Fine-Grained Complexity of Counting Hypergraph Motifs Parameterized counting and cayley graph expanders.SIAM J
Reference 45
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 1cec487f-87a8-45fa-bc7d-e9d3c2a4d285 · outbound
This paper cites Counting and finding homomorphisms is universal for parameterized complexity theory.
The Fine-Grained Complexity of Counting Hypergraph Motifs Counting and finding homomorphisms is universal for parameterized complexity theory
Reference 46
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 2b6c04b0-797c-4753-b718-9f2e5c818d90 · outbound
This paper cites Query answering exploiting structural properties.SIGMOD Rec., 34(3):91–99, 2005.
The Fine-Grained Complexity of Counting Hypergraph Motifs Query answering exploiting structural properties.SIGMOD Rec., 34(3):91–99, 2005
Reference 47
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 30ee32f4-a5b2-4c8f-8173-c9a0105ad7ea · outbound
This paper cites StreaM - A Stream-Based Algo- rithm for Counting Motifs in Dynamic Graphs.
The Fine-Grained Complexity of Counting Hypergraph Motifs StreaM - A Stream-Based Algo- rithm for Counting Motifs in Dynamic Graphs
Reference 48
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 4c1b00c9-c096-4820-ac6b-783450cebdea · outbound
This paper cites Network motifs in the transcriptional regulation network of escherichia coli.Nature Genetics, 31(1):64–68, 2002.
The Fine-Grained Complexity of Counting Hypergraph Motifs Network motifs in the transcriptional regulation network of escherichia coli.Nature Genetics, 31(1):64–68, 2002
Reference 49
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 7f1b486c-7a91-482f-ba08-0c321f9ab6e1 · outbound
This paper cites Stanley.Enumerative Combinatorics.
The Fine-Grained Complexity of Counting Hypergraph Motifs Stanley.Enumerative Combinatorics
Reference 50
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 5a481d91-ccb9-446a-afa8-81a48e725b20 · outbound
This paper cites Counting motifs in the human interactome.Nature communications, 4(1):1–8, 2013.
The Fine-Grained Complexity of Counting Hypergraph Motifs Counting motifs in the human interactome.Nature communications, 4(1):1–8, 2013
Reference 51
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation b9295909-9145-4eda-b6eb-035689f8b054 · outbound
This paper cites Tsourakakis, Jakub Pachocki, and Michael Mitzenmacher.
The Fine-Grained Complexity of Counting Hypergraph Motifs Tsourakakis, Jakub Pachocki, and Michael Mitzenmacher
Reference 52
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation f1facfb7-3099-4a64-ada1-181ee3de9e8d · outbound
This paper cites Kleinberg.
The Fine-Grained Complexity of Counting Hypergraph Motifs Kleinberg
Reference 53
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation d0a06128-75a4-4cea-935b-74dd2b21a10d · outbound
This paper cites Algorithms for acyclic database schemes.
The Fine-Grained Complexity of Counting Hypergraph Motifs Algorithms for acyclic database schemes
Reference 54
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 18933f87-3c3c-4241-aaa7-95fd8bc8f569 · outbound
This paper cites an unresolved cited work.
The Fine-Grained Complexity of Counting Hypergraph Motifs Unresolved cited work
Reference 55
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 62677022-f766-4653-8417-b407e51be19a · outbound
This paper cites Learning with hypergraphs: Clustering, classification, and embedding.
The Fine-Grained Complexity of Counting Hypergraph Motifs Learning with hypergraphs: Clustering, classification, and embedding
Reference 56
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T09:42:28.508680Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Pith citing papers
No inbound Pith citation observations are available.