Paper Citation Record · LEDGER

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial

As of 8 August 2026, this Paper Citation Record lists 36 of 36 outbound references and 0 inbound Pith citation observations for arXiv:2505.22300.

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

pith.paper-citation-record.v1
2505.22300 v1

Coverage vector

measured 36 of 36 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-07T13:20:18.784746Z

measured 36 of 36 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-07T06:34:17.273281+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

36 of 36 outbound references displayed

verified exact6
verified fuzzy3
unresolved19
parse uncertain0
malformed identifier7
metadata mismatch1

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 6fc509c1-80b1-43e9-8409-23103666bb8c · outbound

This paper cites More asymmetry yields faster matrix multiplication.

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial More asymmetry yields faster matrix multiplication

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-07T13:20:14.609437Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b11df5f8-ccaa-4471-a462-910dab82e38e · outbound

This paper cites Current algorithms for detecting subgraphs of bounded treewidth are probably optimal.

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial Current algorithms for detecting subgraphs of bounded treewidth are probably optimal

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-07T13:20:14.730288Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 02423850-564a-46ad-8013-4095301811f4 · outbound

This paper cites Current Algorithms for Detecting Subgraphs of Bounded Treewidth are Probably Optimal.

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial Current Algorithms for Detecting Subgraphs of Bounded Treewidth are Probably Optimal

Reference 3

Resolution: verified exact; local_arxiv, observed 2026-08-07T13:20:21.425187Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation c2c03bc1-eda3-4919-8037-e00f1fa18078 · outbound

This paper cites Kanj, and Ge Xia.

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial Kanj, and Ge Xia

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-07T13:20:14.990127Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3ccf18a7-b418-416a-afef-0edada3c8afc · outbound

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

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial Homomorphisms are a good basis for counting small subgraphs

Reference 5

Resolution: malformed identifier; raw_fallback, observed 2026-08-07T13:20:21.184552Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 53b53773-228f-4a96-ba39-e29730dc805c · outbound

This paper cites an unresolved cited work.

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial Unresolved cited work

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-07T13:20:15.203535Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3436fd61-bfd7-43cf-a29c-3d02f64db6f9 · outbound

This paper cites Complexity of counting subgraphs: Only the bounded- ness of the vertex-cover number counts.

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial Complexity of counting subgraphs: Only the bounded- ness of the vertex-cover number counts

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-07T13:20:15.332966Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0a00374b-40f2-43bb-a07a-7076dbaa487a · outbound

This paper cites Counting small induced subgraphs: Hardness via fourier analysis.CoRR, abs/2407.07051, 2024.arXiv:2407.07051.

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial Counting small induced subgraphs: Hardness via fourier analysis.CoRR, abs/2407.07051, 2024.arXiv:2407.07051

Reference 8

Resolution: verified exact; raw_fallback, observed 2026-08-07T13:20:20.845976Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation d869c5a1-0bf2-4d49-bd79-e9f3b8ffdac4 · outbound

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

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial Counting small induced subgraphs: Hardness via Fourier analysis

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-07T13:20:15.541565Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c418b835-a257-46a0-9817-6d5b86150b8e · outbound

This paper cites Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh.Parameterized Algorithms.

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh.Parameterized Algorithms

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-07T13:20:15.646922Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 248df36c-8c83-4924-baea-b28e85c2ba3c · outbound

This paper cites Springer Berlin, 5 edition, 2017.doi:10.1007/ 978-3-662-53622-3.

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial Springer Berlin, 5 edition, 2017.doi:10.1007/ 978-3-662-53622-3

Reference 11

Resolution: malformed identifier; raw_fallback, observed 2026-08-07T13:20:22.591868Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 52165b95-a2c8-4bbb-86da-29797551c378 · outbound

This paper cites Counting induced sub- graphs: An algebraic approach to #W[1]-hardness.Algorithmica, 84(2):379–404, 2022.

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial Counting induced sub- graphs: An algebraic approach to #W[1]-hardness.Algorithmica, 84(2):379–404, 2022

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-07T13:20:15.844691Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dd3bba1d-6706-46c2-a2ea-46c7d3384f1f · outbound

This paper cites Counting small induced subgraphs with edge-monotone properties.

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial Counting small induced subgraphs with edge-monotone properties

Reference 13

Resolution: malformed identifier; no resolver link, observed 2026-08-07T13:20:15.968556Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e2d88fcc-fd56-4bb5-aa37-b354c207116e · outbound

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

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial From graph properties to graph param- eters: Tight bounds for counting on small subgraphs

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-07T13:20:16.007477Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d6d5b8fd-4038-407b-90d0-828f47f6fb44 · outbound

This paper cites Texts in Theoretical Computer Science.

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial Texts in Theoretical Computer Science

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-07T13:20:16.097616Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ce64c1ca-9e17-42ab-bd40-b6b86a90cbcb · outbound

This paper cites Counting small induced subgraphs with hereditary properties.

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial Counting small induced subgraphs with hereditary properties

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-07T13:20:16.225638Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 55891d7e-959b-4fa0-8d1e-ae61637dfbf1 · outbound

This paper cites Parameterised and fine-grained subgraph counting, modulo 2.Algorithmica, 86(4):944–1005, 2024.doi:10.1007/S00453-023-01178-0.

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial Parameterised and fine-grained subgraph counting, modulo 2.Algorithmica, 86(4):944–1005, 2024.doi:10.1007/S00453-023-01178-0

Reference 17

Resolution: verified exact; doi, observed 2026-08-07T13:20:19.984559Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 5b32812b-49f9-43e4-9cd4-78e079affea2 · outbound

This paper cites Whenistheevaluationofconjunctive queries tractable? In Jeffrey Scott Vitter, Paul G.

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial Whenistheevaluationofconjunctive queries tractable? In Jeffrey Scott Vitter, Paul G

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-07T13:20:16.505613Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 98dbd7b0-3f0f-4c31-b529-8cb4a33d07e4 · outbound

This paper cites On the complexity of k-SAT.J.

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial On the complexity of k-SAT.J

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-07T13:20:16.676468Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation aa61c7ac-4681-44a7-b143-b6a52a09a070 · outbound

This paper cites Which problems have strongly exponential complexity?J.

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial Which problems have strongly exponential complexity?J

Reference 20

Resolution: malformed identifier; no resolver link, observed 2026-08-07T13:20:16.761805Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1d4c3b39-77d0-4c39-bd29-b5e3f706c353 · outbound

This paper cites Finding a minimum circuit in a graph.SIAM J.

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial Finding a minimum circuit in a graph.SIAM J

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-07T13:20:16.839912Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1eca927d-79e0-4a37-b72c-b5fd3d22cff3 · outbound

This paper cites The parameterised complexity of counting connected sub- graphs and graph motifs.J.

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial The parameterised complexity of counting connected sub- graphs and graph motifs.J

Reference 22

Resolution: malformed identifier; no resolver link, observed 2026-08-07T13:20:16.934004Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 41fb3f00-02de-44cd-821f-43adc3c72f88 · outbound

This paper cites Some hard families of parameterized counting problems.

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial Some hard families of parameterized counting problems

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-07T13:20:17.164411Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9322c730-a8c2-4b57-a82f-75b45d7e762e · outbound

This paper cites Bronstein, İsmail İlkan Ceylan, and Matthias Lanzinger.

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial Bronstein, İsmail İlkan Ceylan, and Matthias Lanzinger

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T13:20:22.410877Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation dd02f77a-0998-40e2-b89d-c52d10af452f · outbound

This paper cites Kozlov.Combinatorial Algebraic Topology, volume 21 ofAlgorithms and compu- tation in mathematics.

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial Kozlov.Combinatorial Algebraic Topology, volume 21 ofAlgorithms and compu- tation in mathematics

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-07T13:20:17.364748Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8d9a8caf-36cb-4aa8-a63a-4747a236ac98 · outbound

This paper cites Best, and Peter van Emde Boas.

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial Best, and Peter van Emde Boas

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T13:20:22.289443Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 925892c2-c60c-40c8-be3b-94191101b75a · outbound

This paper cites Network motifs: Simple building blocks of complex networks.Science, 298(5594):824– 827, 2002.doi:10.1126/science.298.5594.824.

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial Network motifs: Simple building blocks of complex networks.Science, 298(5594):824– 827, 2002.doi:10.1126/science.298.5594.824

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-07T13:20:17.533887Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7745d886-9549-4a8c-8535-ee855c761a5b · outbound

This paper cites an unresolved cited work.

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial Unresolved cited work

Reference 28

Resolution: malformed identifier; raw_fallback, observed 2026-08-07T13:20:22.098975Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 6aa6fa18-d19b-4c58-9832-6b790a4991c9 · outbound

This paper cites On the complexity of the subgraph problem.Com- ment.

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial On the complexity of the subgraph problem.Com- ment

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T13:20:21.917546Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 83b41230-7a32-4b6d-9390-2bf1b30bbb30 · outbound

This paper cites Rosenberg.

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial Rosenberg

Reference 30

Resolution: metadata mismatch; raw_fallback, observed 2026-08-07T13:20:20.313623Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation c4703821-9bac-4c07-a386-fd7746672a35 · outbound

This paper cites Independent sets in regular graphs.Israel J.

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial Independent sets in regular graphs.Israel J

Reference 31

Resolution: verified exact; doi, observed 2026-08-07T13:20:19.720556Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation d92625cc-4ed6-4807-b509-16f91f787c90 · outbound

This paper cites Counting induced subgraphs: A topological approach to #W[1]-hardness.Algorithmica, 82(8):2267–2291, 2020.doi:10.1007/ S00453-020-00676-9.

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial Counting induced subgraphs: A topological approach to #W[1]-hardness.Algorithmica, 82(8):2267–2291, 2020.doi:10.1007/ S00453-020-00676-9

Reference 32

Resolution: malformed identifier; raw_fallback, observed 2026-08-07T13:20:21.652016Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 574a5129-3eaa-4e7a-8baf-cd263ba70422 · outbound

This paper cites Detecting and counting small sub- graphs, and evaluating a parameterized tutte polynomial: Lower bounds via toroidal grids and cayley graph expanders.

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial Detecting and counting small sub- graphs, and evaluating a parameterized tutte polynomial: Lower bounds via toroidal grids and cayley graph expanders

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-07T13:20:18.266886Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2b78fe6f-cbb8-45d2-83db-e125302df999 · outbound

This paper cites Counting small induced subgraphs sat- isfying monotone properties.SIAM J.

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial Counting small induced subgraphs sat- isfying monotone properties.SIAM J

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-07T13:20:18.406069Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 87bbf684-c385-435e-a66e-d76230b4825d · outbound

This paper cites StreaM - A stream- based algorithm for counting motifs in dynamic graphs.

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial StreaM - A stream- based algorithm for counting motifs in dynamic graphs

Reference 35

Resolution: verified exact; doi, observed 2026-08-07T13:20:19.431626Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 216fec75-8d23-4777-9208-5f0b19be2c6d · outbound

This paper cites Frequency concepts and pattern detection for the analysis of motifs in networks.Trans.

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial Frequency concepts and pattern detection for the analysis of motifs in networks.Trans

Reference 36

Resolution: verified exact; doi, observed 2026-08-07T13:20:19.154663Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Pith citing papers

No inbound Pith citation observations are available.