{"as_of":"2026-08-22T02:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1ffbd37866fcf9e0bf8b8fff0b87eb529695ecdc7f6adde799bdfe67a7668ef5","coverage":[{"denominator":47,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":47,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T20:13:36.475158Z","state":"measured"},{"denominator":49,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":49,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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-15T19:52:07.692626Z","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-13T11:09:14.844818Z","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:8fc85accb6bea2feebed20b10936baeff6f77be52917fcdb1be269294b15fbb5","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-15T19:52:07.692626Z","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:c86f8561926b05c5bec60e5c566dfc3d168677ce8132fb4a0026a74866894961","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":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/cvpr.2005.89","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:13:37.810718Z","title":"Agarwal, Jongwoo Lim , L","venue":null,"work_id":"67569a6f-f5f8-4366-b188-fbabf659bfa4","year":2005},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:35.046303Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:7f52c854a979fa0e435343774d848f28fc7ab13ecd6d973fe2a62394361fa34b","observation_id":"da659ace-9507-4206-8bcd-cb0d7d814738","resolution":{"observed_at":"2026-08-15T20:13:37.892093Z","resolver_source":"doi","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:13:35.101048Z","title":"Clustering in graphs and hypergraphs with categorical edge labels","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:35.101048Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:f8886d529f49d805de4db3a8033e7b5adaf087c5e266b1b4f95dbfd7e428aae7","observation_id":"88ff5ac5-ccce-4404-a07e-cf99c8115132","resolution":{"observed_at":"2026-08-15T20:13:35.101048Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:13:35.106212Z","title":"Benson, Rediet Abebe, Michael T","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:35.106212Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:b0aabbc629cfaf99e253550265cfe4052fc51cbca4f7868f1d9d30530459c0ed","observation_id":"01043759-b25e-4a6b-8b9b-5906dc352b76","resolution":{"observed_at":"2026-08-15T20:13:35.106212Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3520240","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:13:37.593753Z","title":"Bera, Lior Gishboliner, Yevgeny Levanzov, C","venue":null,"work_id":"68a00184-1d21-4037-a95c-983395ec3fbc","year":2022},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:35.111751Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:e8f7ebf3128a328849a0014906d3170651066aa15ad062601a0243d2b62f5ba3","observation_id":"4cc0299f-4c00-4890-90ca-894a90605679","resolution":{"observed_at":"2026-08-15T20:13:37.712523Z","resolver_source":"doi","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/22m1535668","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:13:37.516312Z","title":"Counting Subgraphs in Somewhere Dense Graphs","venue":null,"work_id":"7911a6cf-a0e5-46e9-a089-7a9cc960d56c","year":2024},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:35.116893Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:edcd6cc062ecc85159873c4125a113b4db3526e03f0ba76c3dca9f401275a5e6","observation_id":"c28a494c-74ba-4345-ad51-1f997bcff346","resolution":{"observed_at":"2026-08-15T20:13:37.522375Z","resolver_source":"doi","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:13:35.122469Z","title":"The complexity of pattern counting in directed graphs, parameterised by the outdegree","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:35.122469Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:24b43d9bfbf4475193b44f5e9a032ee5e3f1c0657a827ec876c68b89d4d966ab","observation_id":"77ddb64d-a0d3-4a87-a2f7-cbe6d33b1dcb","resolution":{"observed_at":"2026-08-15T20:13:35.122469Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.05588","last_updated":"2021-06-01T16:30:26Z","snapshot_observed_at":"2026-08-16T18:40:07.803809Z","submitted_at":"2021-03-09T17:52:27Z","title":"Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies","version":2},"cited_work":{"arxiv_id":"2103.05588","doi":"10.48550/arxiv.2103.05588","metadata_source":"pith","pith_arxiv_id":"2103.05588","snapshot_observed_at":"2026-08-16T12:16:17.039197Z","title":"Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies","venue":"cs.CC","work_id":"894b477d-92f5-4885-ba1f-01b77e097969","year":2021},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:35.129784Z"},"links":{"cited_paper":"/paper/2103.05588","citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:288e7f716930ac53f9f788972c7b7047f8508eedfbfe5762d95bf369c9d8a135","observation_id":"89ffb45f-7978-4e5f-8fb9-e8ad3d5f7609","resolution":{"observed_at":"2026-08-15T20:13:37.503528Z","resolver_source":"local_arxiv","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:13:35.152758Z","title":"Homomorphisms are a good basis for counting small subgraphs","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:35.152758Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:ad2177d174a83b98fc6529d3adc73461990ef0ff22b913d37cd333d457e8cd7a","observation_id":"5a7366a7-bebc-4920-b055-aafde5323c58","resolution":{"observed_at":"2026-08-15T20:13:35.152758Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:13:35.248950Z","title":"Fomin, Lukasz Kowalik, Daniel Lokshtanov, D \\' a niel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:35.248950Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:d526f8829330b85e0ae7b870c62b478486db8f07d8e2808bbcf10cd9050f420b","observation_id":"cf9c39c1-ac7d-4d57-9d49-a4fce755cda6","resolution":{"observed_at":"2026-08-15T20:13:35.248950Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:13:35.276561Z","title":"The C omplexity of S atisfiability of S mall D epth C ircuits","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:35.276561Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:17b4bf7163aebe8f30bd24750741e41a707efe554181cc818620f86279554d2d","observation_id":"a3189541-b565-4a17-a39e-c751bafd193d","resolution":{"observed_at":"2026-08-15T20:13:35.276561Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:13:35.281027Z","title":"Complexity of C ounting S ubgraphs: O nly the B oundedness of the V ertex- C over N umber C ounts","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:35.281027Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:e71b553db9220482361bb57b82b9bc1e585fc9b7221d9733a93f7bdc60a18541","observation_id":"3fb517d3-6a03-43ee-bfd6-881659d61007","resolution":{"observed_at":"2026-08-15T20:13:35.281027Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:13:35.287020Z","title":"A T richotomy in the C omplexity of C ounting A nswers to C onjunctive Q ueries","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:35.287020Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:6266ba2f6c5eee8a959286dc8eadb3004debe09d4186d47e25d0a482c462879c","observation_id":"f2a424fb-6d3b-406d-ae97-f99952bb3b0c","resolution":{"observed_at":"2026-08-15T20:13:35.287020Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:13:35.291515Z","title":"Counting A nswers to E xistential P ositive Q ueries: A C omplexity C lassification","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:35.291515Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:1da9984d93c33d2603ef09f5fa0f085b2a91a9a11ee6d1d5cd4c33e990fb6679","observation_id":"a26f57c5-c465-41a0-b0d0-cf2d65efea21","resolution":{"observed_at":"2026-08-15T20:13:35.291515Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:13:35.296198Z","title":"Counting small induced subgraphs: Hardness via fourier analysis","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:35.296198Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:3246d76edab15f9692464338bb53723bf199dd7a8065b4be9447802cd640f8f0","observation_id":"2beb6694-bb40-41aa-83cf-d9eae050eb53","resolution":{"observed_at":"2026-08-15T20:13:35.296198Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:13:35.354127Z","title":"Understanding the C omplexity of I nduced S ubgraph I somorphisms","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:35.354127Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:441c851cd73ca2e37746fe9c0294b9641c3adba031b67a5bf95d376581de2611","observation_id":"8f104d44-41c5-41b2-802c-2c7a0e2f2544","resolution":{"observed_at":"2026-08-15T20:13:35.354127Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:13:35.407502Z","title":"Downey and Michael R","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:35.407502Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:8a7e6384b6cf72bda2cc95e43bc9246d0efc6a55047f5a11555b617ac44afcba","observation_id":"bc8c727d-7e62-4e77-9326-839645214e1b","resolution":{"observed_at":"2026-08-15T20:13:35.407502Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:13:35.413186Z","title":"The complexity of counting homomorphisms seen from the other side","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:35.413186Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:2bf7860d58551f8a0a38ed9acdb411368727d347aebcbbd081c098487ea3827f","observation_id":"6a93c187-ad15-4057-8993-4aa4d365e1a4","resolution":{"observed_at":"2026-08-15T20:13:35.413186Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00224-014-9543-y","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-18T11:03:46.223893Z","title":"Structural T ractability of C ounting of S olutions to C onjunctive Q ueries","venue":"Theory of Computing Systems","work_id":"95b5c063-4b75-4a35-983d-721b750b3e2b","year":2015},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:35.419494Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:c63b0afedf54e8b1b81944b317a8dc897a2b7f4df665d021abeff7a6f7d13e64","observation_id":"e38b6295-de6c-492d-9ce8-6dee678ca8c0","resolution":{"observed_at":"2026-08-15T20:13:37.273082Z","resolver_source":"doi","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:13:35.424342Z","title":"Counting Small Induced Subgraphs with Edge - Monotone Properties","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:35.424342Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:487dcf68ec6f532f84b9cf5b95d7388b7104d7cb8c4fe10ee93d445998cdfef0","observation_id":"2be33084-4539-4c6a-bdc5-2dc30861c7ca","resolution":{"observed_at":"2026-08-15T20:13:35.424342Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:13:35.428954Z","title":"From graph properties to graph parameters: Tight bounds for counting on small subgraphs","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:35.428954Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:95f6cbb311cb74139a3e30dc408dde15af127887d6321f87581edfa45e6a5d0d","observation_id":"9cc3ea13-d179-4e92-ada8-009e3ee2358f","resolution":{"observed_at":"2026-08-15T20:13:35.428954Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:13:35.432992Z","title":"Counting Answers to Existential Questions","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:35.432992Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:7a0fb8e2a196bcf67402da7cef407f3e4b820e979f88e9cd7e5d4b10f8dc2af0","observation_id":"56e47361-6992-464c-883e-2b7f0fea4c9f","resolution":{"observed_at":"2026-08-15T20:13:35.432992Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/s0097539799360768","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:13:37.006013Z","title":"Fixed- P arameter T ractability, D efinability, and M odel- C hecking","venue":null,"work_id":"0fdbdbc4-f940-4f77-aa85-2544003667b7","year":2001},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:35.437289Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:8fb622fa09120b0808a88d14d721c10e870a02cc2b481a483f8fb7fd6b20aa08","observation_id":"14e00c06-d171-4d00-82a1-56ee0b1eb4e1","resolution":{"observed_at":"2026-08-15T20:13:37.093381Z","resolver_source":"doi","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:13:35.441565Z","title":"Parameterized Complexity Theory","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:35.441565Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:3a8e4642173b7a5998872399232911415c8e5bd22a000186b091a1a8c5480a64","observation_id":"93d71a38-13cf-40bf-b17d-8b2712b9d4ac","resolution":{"observed_at":"2026-08-15T20:13:35.441565Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:13:35.527325Z","title":"Counting small induced subgraphs with hereditary properties","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:35.527325Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:a8cc849ea7c268459f3f87421e05f59a79039b4b16545cb8d541850fceee22c9","observation_id":"20bf3314-3263-4ea1-b712-42cf917f4107","resolution":{"observed_at":"2026-08-15T20:13:35.527325Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:13:35.595978Z","title":"Hypertree decompositions and tractable queries","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:35.595978Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:b48ad934df8835b01abb26ada81a29855352073722050edbf92fc5f4a0813d29","observation_id":"65c0af5d-f3e5-46a3-9173-37f48043e4c1","resolution":{"observed_at":"2026-08-15T20:13:35.595978Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:13:35.601295Z","title":"On tree width, bramble size, and expansion","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:35.601295Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:013b4256e4b888ad1ad3cab3b4b7240ee0eee7799067db1ad57f8ae858366658","observation_id":"1ce5216d-70f0-4baf-a359-c92ffaa047c2","resolution":{"observed_at":"2026-08-15T20:13:35.601295Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:13:35.634683Z","title":"Constraint solving via fractional edge covers","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:35.634683Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:a5edb46d91de6449fc6c95645fd6c0b6448dcb83574b040e19b4d494e85d02b4","observation_id":"788093fb-560f-494d-9cf6-504e3a478def","resolution":{"observed_at":"2026-08-15T20:13:35.634683Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2204.06353","last_updated":"2022-04-15T19:26:03Z","snapshot_observed_at":"2026-08-17T14:23:35.536192Z","submitted_at":"2022-04-13T13:09:35Z","title":"AHP: Learning to Negative Sample for Hyperedge Prediction","version":2},"cited_work":{"arxiv_id":"2204.06353","doi":"10.48550/arxiv.2204.06353","metadata_source":"pith","pith_arxiv_id":"2204.06353","snapshot_observed_at":"2026-08-16T12:16:17.039197Z","title":"AHP: Learning to Negative Sample for Hyperedge Prediction","venue":"cs.LG","work_id":"066417fb-1a4b-41a7-8e27-75a3e096bd52","year":2022},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:35.702904Z"},"links":{"cited_paper":"/paper/2204.06353","citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:e0791384c326356f8064c0608ce31109193c2c2bb0d46b3e6b2b89e3bc8f1884","observation_id":"bb0aa834-2f4e-4260-82f2-bcf91a88aa5a","resolution":{"observed_at":"2026-08-15T20:13:36.886770Z","resolver_source":"local_arxiv","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:13:35.708570Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:35.708570Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:c19245271e496426ec912a1681c75975e79c1e774ab6e38459c70680697d0d58","observation_id":"1d10c055-961e-49b4-8dbd-de8f6f9b1323","resolution":{"observed_at":"2026-08-15T20:13:35.708570Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:13:35.756392Z","title":"Learning on Weighted Hypergraphs to Integrate Protein Interactions and Gene Expressions for Cancer Outcome Prediction","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:35.756392Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:a8cfa53359cc274146dc389bb9379dc0b815956d067c2612a4da5f098702a26e","observation_id":"d59ac604-812c-41d9-a0ea-e9d2b7ebe1ca","resolution":{"observed_at":"2026-08-15T20:13:35.756392Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:13:35.809196Z","title":"On the C omplexity of k- S A T","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:35.809196Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:ea09be937da25510340e226eb8fac4f199cdc1aacbeae30682e8c86251060a87","observation_id":"35696075-a294-4340-9f6e-4ba1e75b2914","resolution":{"observed_at":"2026-08-15T20:13:35.809196Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:13:35.814990Z","title":"Which P roblems H ave S trongly E xponential C omplexity? Journal of Computer and System Sciences , 63(4):512--530, 2001","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:35.814990Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:3b14dfdf8d5bf8d90af1e217d7269045a28b7abdee5005258dacb9bfd3f14a81","observation_id":"b2836f80-f887-41bf-a045-c31ff395e4ed","resolution":{"observed_at":"2026-08-15T20:13:35.814990Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:13:35.820370Z","title":"Adaptive Hypergraph Learning and its Application in Image Classification","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:35.820370Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:bb38807915630ad5bba920fe820ae1f08b701a4d5b066b8e6980ce2121784e3f","observation_id":"159a04e7-1b81-448a-8815-2b5c7f627a38","resolution":{"observed_at":"2026-08-15T20:13:35.820370Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:13:35.898139Z","title":"The parameterised complexity of counting connected subgraphs and graph motifs","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:35.898139Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:5f3c3de9d434c437c6bf43eebf31f04e6f7d56e09b0baad491a45421f9be89a7","observation_id":"76a30216-9249-49b9-b742-c4f264973558","resolution":{"observed_at":"2026-08-15T20:13:35.898139Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:13:35.960225Z","title":"Lov \\'a sz","venue":null,"work_id":null,"year":1967},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:35.960225Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:f4760a41e65fc30b147fa1588f16a56494a35c9039ddf8337d6c7b399b911ab4","observation_id":"7503ab51-4471-430c-aa41-d372579a9c14","resolution":{"observed_at":"2026-08-15T20:13:35.960225Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:13:39.176121Z","title":"Large Networks and Graph Limits , volume 60 of Colloquium Publications","venue":null,"work_id":"f08bb55f-f25d-4383-b64e-3cec039ccf74","year":2012},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:35.965876Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:22c0d6374247bf45c18f8fccfb0dd3a3b0f26ffb4371b3dd3ddbe9ae23c88ab9","observation_id":"102bfd5b-b7ac-4b46-ba7f-3431d4e439ba","resolution":{"observed_at":"2026-08-15T20:13:39.291908Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:13:36.078958Z","title":"Link prediction in social networks based on hypergraph","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:36.078958Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:373bae7ea333f661193471d233f96dbec857c09ec61d61b13e177d1f3ca2e1cf","observation_id":"42eeb28e-2cb4-4984-a100-206d6c0fa717","resolution":{"observed_at":"2026-08-15T20:13:36.078958Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:13:36.193962Z","title":"Can Y ou B eat T reewidth? Theory of Computing","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:36.193962Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:6493e9f9e51b6288c76de815a0550e08629fb6291df8d713b82548407be229fe","observation_id":"45cc0abe-e5e0-476e-9774-b8aa79209b51","resolution":{"observed_at":"2026-08-15T20:13:36.193962Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:13:36.200251Z","title":"Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:36.200251Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:5f1303d7e76c7b98ef87c31caa416a492f333a2d673d5fdf691c679a5b8ac092","observation_id":"64cfc214-89be-4781-8ff5-a1a764b6fafd","resolution":{"observed_at":"2026-08-15T20:13:36.200251Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.01108","last_updated":"2021-12-02T10:33:18Z","snapshot_observed_at":"2026-08-16T17:37:36.304637Z","submitted_at":"2021-12-02T10:33:18Z","title":"A short note on the counting complexity of conjunctive queries","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.01108","snapshot_observed_at":"2026-08-15T20:13:36.267110Z","title":"A short note on the counting complexity of conjunctive queries","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:36.267110Z"},"links":{"cited_paper":"/paper/2112.01108","citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:9055678f99b313119504405aac5f4afa938f4d9e5e19a9f92d5cd2ade37b63c3","observation_id":"c7f6fcc6-6804-48cb-8b8d-a47e5f33ebfc","resolution":{"observed_at":"2026-08-15T20:13:36.267110Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3527667","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:13:36.682163Z","title":"Hypergraph isomorphism for groups with restricted composition factors","venue":null,"work_id":"9813e163-dbf4-42cf-85aa-73f94ce47666","year":2022},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:36.272540Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:8964d32a8204ec305f89e07a845546ed37a1ed0d2e970dbc7f794cee219ecc9e","observation_id":"9c5e6cf3-c8d7-4e76-a120-9e626e829791","resolution":{"observed_at":"2026-08-15T20:13:36.732195Z","resolver_source":"doi","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.esa.2017.63","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:13:36.519318Z","title":"Counting R estricted H omomorphisms via M \\\" o bius I nversion over M atroid L attices","venue":null,"work_id":"66645298-58d3-4203-a889-ae429fd131bf","year":2017},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:36.277269Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:449dd3af2006329a0d3464e1e13047fc9685a1c5c37325c7faafc27d36a8c9b1","observation_id":"1231eee2-c0c8-4dcf-923d-0cdda1ec1378","resolution":{"observed_at":"2026-08-15T20:13:36.581639Z","resolver_source":"doi","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:13:36.281629Z","title":"Counting induced subgraphs: A topological approach to \\# w[1]-hardness","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:36.281629Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:b1457a5105cbcb13e25397d945070cc959abbf2ccfb4c730b204bc70b262a3e0","observation_id":"180f231f-c10f-4402-a190-87c428c542e2","resolution":{"observed_at":"2026-08-15T20:13:36.281629Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:13:36.315700Z","title":"Counting small induced subgraphs satisfying monotone properties","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:36.315700Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:18181bcbe04693937b0b12e274e03549523b710e43435020e6eee7654c73d873","observation_id":"5b069f8f-1a1e-4135-9307-ef9e98a9a8ff","resolution":{"observed_at":"2026-08-15T20:13:36.315700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:13:39.046366Z","title":"Fractional Graph Theory: A Rational Approach to the Theory of Graphs","venue":null,"work_id":"1313b19c-d0f3-4d76-8836-eb1a148f9da2","year":2011},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:36.382065Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:3dde56ebd05acc536cc962051fa55be6cd8e0726b6f0b59d6d03c6a5d390b713","observation_id":"f042de6b-d3cc-41bc-8a18-2fe159fb2c13","resolution":{"observed_at":"2026-08-15T20:13:39.164625Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:13:38.975617Z","title":"Vazirani","venue":null,"work_id":"010de4ed-fc5f-49ad-82e5-c04522933c22","year":2001},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:36.469667Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:308c31b310b1f6c06850362e45c96ecb87f73a1c85d693eca26d1cd1a28a05ef","observation_id":"a894aa37-36ff-4b4a-983c-57ad7dc0a4bf","resolution":{"observed_at":"2026-08-15T20:13:38.980827Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:13:38.945559Z","title":"Learning with hypergraphs: Clustering, classification, and embedding","venue":null,"work_id":"f0af79c2-89a8-4e3f-a040-a1b4794f8a60","year":2006},"citing_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-15T20:13:36.475158Z"},"links":{"citing_paper":"/paper/2506.14081"},"observation_digest":"sha256:37c4b71dce9d1d07bc0303cd1b9809227b92946857c331d39010283dbb933139","observation_id":"581c1baa-90cb-403e-a117-b94b7a3070c8","resolution":{"observed_at":"2026-08-15T20:13:38.964253Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}}],"paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","latest_version":3,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-15T19:52:07.692626Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs"},"reference_resolution":{"displayed":47,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":34,"verified_exact":9,"verified_fuzzy":4},"total_outbound_references":47},"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 22 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 2 inbound Pith citation observations for arXiv:2506.14081."}