{"as_of":"2026-08-08T05:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:298eb516817b38ce169ed471a068ec0a92d1250f625b55b01f625d03acdcdc3e","coverage":[{"denominator":36,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":36,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:20:18.784746Z","state":"measured"},{"denominator":36,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":36,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2505.22300/citation-record","integrity":"/paper/2505.22300/integrity","json":"/paper/2505.22300/citation-record.json","paper":"/paper/2505.22300"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:20:14.609437Z","title":"More asymmetry yields faster matrix multiplication","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.22300","last_updated":"2025-05-28T12:37:30Z","snapshot_observed_at":"2026-08-07T13:08:18.186974Z","submitted_at":"2025-05-28T12:37:30Z","title":"Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T13:20:14.609437Z"},"links":{"citing_paper":"/paper/2505.22300"},"observation_digest":"sha256:155cc0a7cf274c4dbc79101b25822453970243dddfef552918be5bd4200ad062","observation_id":"6fc509c1-80b1-43e9-8409-23103666bb8c","resolution":{"observed_at":"2026-08-07T13:20:14.609437Z","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-07T13:20:14.730288Z","title":"Current algorithms for detecting subgraphs of bounded treewidth are probably optimal","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.22300","last_updated":"2025-05-28T12:37:30Z","snapshot_observed_at":"2026-08-07T13:08:18.186974Z","submitted_at":"2025-05-28T12:37:30Z","title":"Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T13:20:14.730288Z"},"links":{"citing_paper":"/paper/2505.22300"},"observation_digest":"sha256:752ffbfd926279999ff304993045c6009f518a13afde563ce4929fe317c14179","observation_id":"b11df5f8-ccaa-4471-a462-910dab82e38e","resolution":{"observed_at":"2026-08-07T13:20:14.730288Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2105.05062","last_updated":"2021-05-11T14:12:43Z","snapshot_observed_at":"2026-08-06T11:25:21.409024Z","submitted_at":"2021-05-11T14:12:43Z","title":"Current Algorithms for Detecting Subgraphs of Bounded Treewidth are Probably Optimal","version":1},"cited_work":{"arxiv_id":"2105.05062","doi":null,"metadata_source":"pith","pith_arxiv_id":"2105.05062","snapshot_observed_at":"2026-08-07T13:20:21.320765Z","title":"Current Algorithms for Detecting Subgraphs of Bounded Treewidth are Probably Optimal","venue":"cs.DS","work_id":"b4ed25c5-3aea-4db8-9a18-c1313898510e","year":2021},"citing_paper":{"arxiv_id":"2505.22300","last_updated":"2025-05-28T12:37:30Z","snapshot_observed_at":"2026-08-07T13:08:18.186974Z","submitted_at":"2025-05-28T12:37:30Z","title":"Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T13:20:14.866648Z"},"links":{"cited_paper":"/paper/2105.05062","citing_paper":"/paper/2505.22300"},"observation_digest":"sha256:17bb2fb5734d1736db94b65ab8766032851f82a4e38633902bbc1867bf4735d2","observation_id":"02423850-564a-46ad-8013-4095301811f4","resolution":{"observed_at":"2026-08-07T13:20:21.425187Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:20:14.990127Z","title":"Kanj, and Ge Xia","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2505.22300","last_updated":"2025-05-28T12:37:30Z","snapshot_observed_at":"2026-08-07T13:08:18.186974Z","submitted_at":"2025-05-28T12:37:30Z","title":"Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T13:20:14.990127Z"},"links":{"citing_paper":"/paper/2505.22300"},"observation_digest":"sha256:e28bd3a28b6d3921e4b8e92634a979a79c27a93bfa1eeed4db82b78da29eecf7","observation_id":"c2c03bc1-eda3-4919-8037-e00f1fa18078","resolution":{"observed_at":"2026-08-07T13:20:14.990127Z","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":"5399.30555","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:20:21.042240Z","title":"Homomorphisms are a good basis for counting small subgraphs","venue":null,"work_id":"4d9e7b27-bf4d-4a21-9153-2933872f300f","year":2017},"citing_paper":{"arxiv_id":"2505.22300","last_updated":"2025-05-28T12:37:30Z","snapshot_observed_at":"2026-08-07T13:08:18.186974Z","submitted_at":"2025-05-28T12:37:30Z","title":"Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T13:20:15.095329Z"},"links":{"citing_paper":"/paper/2505.22300"},"observation_digest":"sha256:b529effba8149512259e7ce8180be7a452898893b2d7ab3937f3fe40d62a2138","observation_id":"3ccf18a7-b418-416a-afef-0edada3c8afc","resolution":{"observed_at":"2026-08-07T13:20:21.184552Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:20:15.203535Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.22300","last_updated":"2025-05-28T12:37:30Z","snapshot_observed_at":"2026-08-07T13:08:18.186974Z","submitted_at":"2025-05-28T12:37:30Z","title":"Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T13:20:15.203535Z"},"links":{"citing_paper":"/paper/2505.22300"},"observation_digest":"sha256:ca3c68315ca9db4520c26f314b4108eb187636bf9d25401eaf538e1e685257ee","observation_id":"53b53773-228f-4a96-ba39-e29730dc805c","resolution":{"observed_at":"2026-08-07T13:20:15.203535Z","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-07T13:20:15.332966Z","title":"Complexity of counting subgraphs: Only the bounded- ness of the vertex-cover number counts","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.22300","last_updated":"2025-05-28T12:37:30Z","snapshot_observed_at":"2026-08-07T13:08:18.186974Z","submitted_at":"2025-05-28T12:37:30Z","title":"Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T13:20:15.332966Z"},"links":{"citing_paper":"/paper/2505.22300"},"observation_digest":"sha256:2a9091af9e0726a3f5442fdb717dcb6138699f6a80f30acb18b160ad25aa9ca4","observation_id":"3436fd61-bfd7-43cf-a29c-3d02f64db6f9","resolution":{"observed_at":"2026-08-07T13:20:15.332966Z","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":"2407.07051","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:20:20.783965Z","title":"Counting small induced subgraphs: Hardness via fourier analysis.CoRR, abs/2407.07051, 2024.arXiv:2407.07051","venue":null,"work_id":"b8e9bccb-387a-4de3-9268-4324e19081b9","year":2024},"citing_paper":{"arxiv_id":"2505.22300","last_updated":"2025-05-28T12:37:30Z","snapshot_observed_at":"2026-08-07T13:08:18.186974Z","submitted_at":"2025-05-28T12:37:30Z","title":"Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T13:20:15.410405Z"},"links":{"citing_paper":"/paper/2505.22300"},"observation_digest":"sha256:8e9cbb35b2d849a354af67c41cefb7031416fe721698fbae5060a0f5f5813a39","observation_id":"0a00374b-40f2-43bb-a07a-7076dbaa487a","resolution":{"observed_at":"2026-08-07T13:20:20.845976Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:20:15.541565Z","title":"Counting small induced subgraphs: Hardness via Fourier analysis","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.22300","last_updated":"2025-05-28T12:37:30Z","snapshot_observed_at":"2026-08-07T13:08:18.186974Z","submitted_at":"2025-05-28T12:37:30Z","title":"Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T13:20:15.541565Z"},"links":{"citing_paper":"/paper/2505.22300"},"observation_digest":"sha256:2491880709c04b72a39dbaa4807d452420f4acd9a4dcab2db4776cd7a8e9c32d","observation_id":"d869c5a1-0bf2-4d49-bd79-e9f3b8ffdac4","resolution":{"observed_at":"2026-08-07T13:20:15.541565Z","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-07T13:20:15.646922Z","title":"Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh.Parameterized Algorithms","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.22300","last_updated":"2025-05-28T12:37:30Z","snapshot_observed_at":"2026-08-07T13:08:18.186974Z","submitted_at":"2025-05-28T12:37:30Z","title":"Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T13:20:15.646922Z"},"links":{"citing_paper":"/paper/2505.22300"},"observation_digest":"sha256:fde40112c63a6b2087a30e3ca9d1af13ba9b70c9d4d81f32267d00c7ff471d8f","observation_id":"c418b835-a257-46a0-9817-6d5b86150b8e","resolution":{"observed_at":"2026-08-07T13:20:15.646922Z","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-07T13:20:22.512653Z","title":"Springer Berlin, 5 edition, 2017.doi:10.1007/ 978-3-662-53622-3","venue":null,"work_id":"33ede631-4d28-4c5e-bde3-f90c0437a287","year":2017},"citing_paper":{"arxiv_id":"2505.22300","last_updated":"2025-05-28T12:37:30Z","snapshot_observed_at":"2026-08-07T13:08:18.186974Z","submitted_at":"2025-05-28T12:37:30Z","title":"Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T13:20:15.713900Z"},"links":{"citing_paper":"/paper/2505.22300"},"observation_digest":"sha256:5f581a116ec7b0ab736b820326f938de88a5c3106b2a3115f50f79a43384c33f","observation_id":"248df36c-8c83-4924-baea-b28e85c2ba3c","resolution":{"observed_at":"2026-08-07T13:20:22.591868Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:20:15.844691Z","title":"Counting induced sub- graphs: An algebraic approach to #W[1]-hardness.Algorithmica, 84(2):379–404, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.22300","last_updated":"2025-05-28T12:37:30Z","snapshot_observed_at":"2026-08-07T13:08:18.186974Z","submitted_at":"2025-05-28T12:37:30Z","title":"Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T13:20:15.844691Z"},"links":{"citing_paper":"/paper/2505.22300"},"observation_digest":"sha256:3ff70f82d72985c54bf04023900369c1144c03fe936551ff155f5a91409647f5","observation_id":"52165b95-a2c8-4bbb-86da-29797551c378","resolution":{"observed_at":"2026-08-07T13:20:15.844691Z","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-07T13:20:15.968556Z","title":"Counting small induced subgraphs with edge-monotone properties","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.22300","last_updated":"2025-05-28T12:37:30Z","snapshot_observed_at":"2026-08-07T13:08:18.186974Z","submitted_at":"2025-05-28T12:37:30Z","title":"Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T13:20:15.968556Z"},"links":{"citing_paper":"/paper/2505.22300"},"observation_digest":"sha256:bc6657f9acfd148a59e134ac62c86ace5a5bf003c304e79434291fc71a3dbf97","observation_id":"dd3bba1d-6706-46c2-a2ea-46c7d3384f1f","resolution":{"observed_at":"2026-08-07T13:20:15.968556Z","resolver_source":null,"status":"malformed_identifier"},"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-07T13:20:16.007477Z","title":"From graph properties to graph param- eters: Tight bounds for counting on small subgraphs","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.22300","last_updated":"2025-05-28T12:37:30Z","snapshot_observed_at":"2026-08-07T13:08:18.186974Z","submitted_at":"2025-05-28T12:37:30Z","title":"Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T13:20:16.007477Z"},"links":{"citing_paper":"/paper/2505.22300"},"observation_digest":"sha256:e0b2c917908eaa794779c92779cfee1f522e248b078b13c97b6d971d07b7b56c","observation_id":"e2d88fcc-fd56-4bb5-aa37-b354c207116e","resolution":{"observed_at":"2026-08-07T13:20:16.007477Z","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-07T13:20:16.097616Z","title":"Texts in Theoretical Computer Science","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2505.22300","last_updated":"2025-05-28T12:37:30Z","snapshot_observed_at":"2026-08-07T13:08:18.186974Z","submitted_at":"2025-05-28T12:37:30Z","title":"Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T13:20:16.097616Z"},"links":{"citing_paper":"/paper/2505.22300"},"observation_digest":"sha256:2686ca07060e8bcfc9d706c4044f49ae7a7f1009d528f1aa19101c4a0de1a29e","observation_id":"d6d5b8fd-4038-407b-90d0-828f47f6fb44","resolution":{"observed_at":"2026-08-07T13:20:16.097616Z","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-07T13:20:16.225638Z","title":"Counting small induced subgraphs with hereditary properties","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.22300","last_updated":"2025-05-28T12:37:30Z","snapshot_observed_at":"2026-08-07T13:08:18.186974Z","submitted_at":"2025-05-28T12:37:30Z","title":"Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T13:20:16.225638Z"},"links":{"citing_paper":"/paper/2505.22300"},"observation_digest":"sha256:7c6f3afbfb31c70a7171291ac75f2bea75d91d5efa65de76cfd59e72d3e5efe5","observation_id":"ce64c1ca-9e17-42ab-bd40-b6b86a90cbcb","resolution":{"observed_at":"2026-08-07T13:20:16.225638Z","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/s00453-023-01178-0","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:20:19.887513Z","title":"Parameterised and fine-grained subgraph counting, modulo 2.Algorithmica, 86(4):944–1005, 2024.doi:10.1007/S00453-023-01178-0","venue":null,"work_id":"a9d488d4-0560-4f0a-817a-0170e0396c54","year":2024},"citing_paper":{"arxiv_id":"2505.22300","last_updated":"2025-05-28T12:37:30Z","snapshot_observed_at":"2026-08-07T13:08:18.186974Z","submitted_at":"2025-05-28T12:37:30Z","title":"Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T13:20:16.407437Z"},"links":{"citing_paper":"/paper/2505.22300"},"observation_digest":"sha256:87ea362f0f17636b6ce7f1e4768add28647d840aea0ab4698270725bb257fd01","observation_id":"55891d7e-959b-4fa0-8d1e-ae61637dfbf1","resolution":{"observed_at":"2026-08-07T13:20:19.984559Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:20:16.505613Z","title":"Whenistheevaluationofconjunctive queries tractable? In Jeffrey Scott Vitter, Paul G","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2505.22300","last_updated":"2025-05-28T12:37:30Z","snapshot_observed_at":"2026-08-07T13:08:18.186974Z","submitted_at":"2025-05-28T12:37:30Z","title":"Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T13:20:16.505613Z"},"links":{"citing_paper":"/paper/2505.22300"},"observation_digest":"sha256:4e382fee2ddf5de6821e62466fa24e03988c7f13a10caeb98b5cc744ba491a1e","observation_id":"5b32812b-49f9-43e4-9cd4-78e079affea2","resolution":{"observed_at":"2026-08-07T13:20:16.505613Z","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-07T13:20:16.676468Z","title":"On the complexity of k-SAT.J","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2505.22300","last_updated":"2025-05-28T12:37:30Z","snapshot_observed_at":"2026-08-07T13:08:18.186974Z","submitted_at":"2025-05-28T12:37:30Z","title":"Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T13:20:16.676468Z"},"links":{"citing_paper":"/paper/2505.22300"},"observation_digest":"sha256:f90219e8a042aae7c297221ef32e675bac74c3f9b35f73e0df9e7228b9aa5a8d","observation_id":"98dbd7b0-3f0f-4c31-b529-8cb4a33d07e4","resolution":{"observed_at":"2026-08-07T13:20:16.676468Z","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-07T13:20:16.761805Z","title":"Which problems have strongly exponential complexity?J","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2505.22300","last_updated":"2025-05-28T12:37:30Z","snapshot_observed_at":"2026-08-07T13:08:18.186974Z","submitted_at":"2025-05-28T12:37:30Z","title":"Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T13:20:16.761805Z"},"links":{"citing_paper":"/paper/2505.22300"},"observation_digest":"sha256:0377ce56afdf5385b6d18f9ea6a2428d6cc51a5c0796db4607cdbcfdc3fbe026","observation_id":"aa61c7ac-4681-44a7-b143-b6a52a09a070","resolution":{"observed_at":"2026-08-07T13:20:16.761805Z","resolver_source":null,"status":"malformed_identifier"},"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-07T13:20:16.839912Z","title":"Finding a minimum circuit in a graph.SIAM J","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2505.22300","last_updated":"2025-05-28T12:37:30Z","snapshot_observed_at":"2026-08-07T13:08:18.186974Z","submitted_at":"2025-05-28T12:37:30Z","title":"Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T13:20:16.839912Z"},"links":{"citing_paper":"/paper/2505.22300"},"observation_digest":"sha256:e823fc377ef5d73c261c88bebee5616ba18a325632ec3f10cd2c3bfa62139e19","observation_id":"1d4c3b39-77d0-4c39-bd29-b5e3f706c353","resolution":{"observed_at":"2026-08-07T13:20:16.839912Z","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-07T13:20:16.934004Z","title":"The parameterised complexity of counting connected sub- graphs and graph motifs.J","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.22300","last_updated":"2025-05-28T12:37:30Z","snapshot_observed_at":"2026-08-07T13:08:18.186974Z","submitted_at":"2025-05-28T12:37:30Z","title":"Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T13:20:16.934004Z"},"links":{"citing_paper":"/paper/2505.22300"},"observation_digest":"sha256:8c87d0c61eb0ba23a37d43fedfdd7b973d1328c0d84741ddd92a55863a3a1d7d","observation_id":"1eca927d-79e0-4a37-b72c-b5fd3d22cff3","resolution":{"observed_at":"2026-08-07T13:20:16.934004Z","resolver_source":null,"status":"malformed_identifier"},"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-07T13:20:17.164411Z","title":"Some hard families of parameterized counting problems","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.22300","last_updated":"2025-05-28T12:37:30Z","snapshot_observed_at":"2026-08-07T13:08:18.186974Z","submitted_at":"2025-05-28T12:37:30Z","title":"Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T13:20:17.164411Z"},"links":{"citing_paper":"/paper/2505.22300"},"observation_digest":"sha256:a29d2940483bb33ab8b1ae1d90eb98345bc8f3bba2b8cc88af6174338cacbef6","observation_id":"41fb3f00-02de-44cd-821f-43adc3c72f88","resolution":{"observed_at":"2026-08-07T13:20:17.164411Z","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-07T13:20:22.354327Z","title":"Bronstein, İsmail İlkan Ceylan, and Matthias Lanzinger","venue":null,"work_id":"5ad8bbd5-bdbc-4600-a6f4-896a82b3e387","year":2024},"citing_paper":{"arxiv_id":"2505.22300","last_updated":"2025-05-28T12:37:30Z","snapshot_observed_at":"2026-08-07T13:08:18.186974Z","submitted_at":"2025-05-28T12:37:30Z","title":"Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T13:20:17.242468Z"},"links":{"citing_paper":"/paper/2505.22300"},"observation_digest":"sha256:37ff5713e39b2b68158efddd2e426e3689800784536ceaf7f7a6b8730793d806","observation_id":"9322c730-a8c2-4b57-a82f-75b45d7e762e","resolution":{"observed_at":"2026-08-07T13:20:22.410877Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:20:17.364748Z","title":"Kozlov.Combinatorial Algebraic Topology, volume 21 ofAlgorithms and compu- tation in mathematics","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2505.22300","last_updated":"2025-05-28T12:37:30Z","snapshot_observed_at":"2026-08-07T13:08:18.186974Z","submitted_at":"2025-05-28T12:37:30Z","title":"Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T13:20:17.364748Z"},"links":{"citing_paper":"/paper/2505.22300"},"observation_digest":"sha256:10a7b0f9f976f7983ab685eb7506bdb631d77aa5cf106e5b6281c9c3ab564196","observation_id":"dd02f77a-0998-40e2-b89d-c52d10af452f","resolution":{"observed_at":"2026-08-07T13:20:17.364748Z","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-07T13:20:22.216556Z","title":"Best, and Peter van Emde Boas","venue":null,"work_id":"8941d676-8fb4-45bb-9dea-21589bee34a1","year":1974},"citing_paper":{"arxiv_id":"2505.22300","last_updated":"2025-05-28T12:37:30Z","snapshot_observed_at":"2026-08-07T13:08:18.186974Z","submitted_at":"2025-05-28T12:37:30Z","title":"Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T13:20:17.456485Z"},"links":{"citing_paper":"/paper/2505.22300"},"observation_digest":"sha256:acccba2e6caab6a5db53601c828cf4158815f4213779068297a96eceb40ce2b9","observation_id":"8d9a8caf-36cb-4aa8-a63a-4747a236ac98","resolution":{"observed_at":"2026-08-07T13:20:22.289443Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:20:17.533887Z","title":"Network motifs: Simple building blocks of complex networks.Science, 298(5594):824– 827, 2002.doi:10.1126/science.298.5594.824","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2505.22300","last_updated":"2025-05-28T12:37:30Z","snapshot_observed_at":"2026-08-07T13:08:18.186974Z","submitted_at":"2025-05-28T12:37:30Z","title":"Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T13:20:17.533887Z"},"links":{"citing_paper":"/paper/2505.22300"},"observation_digest":"sha256:892b406986c4a28c1bb9ff530eb55fb1acdb899e69e56e0f16f617df7bc43fc8","observation_id":"925892c2-c60c-40c8-be3b-94191101b75a","resolution":{"observed_at":"2026-08-07T13:20:17.533887Z","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-07T13:20:22.026471Z","title":null,"venue":null,"work_id":"6e9fa731-39d4-45a2-a28a-e5015a52224b","year":1974},"citing_paper":{"arxiv_id":"2505.22300","last_updated":"2025-05-28T12:37:30Z","snapshot_observed_at":"2026-08-07T13:08:18.186974Z","submitted_at":"2025-05-28T12:37:30Z","title":"Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T13:20:17.617607Z"},"links":{"citing_paper":"/paper/2505.22300"},"observation_digest":"sha256:4f0bdcdba23ea2534eae7d8f8b1716fb9c79092d4c53b118b0550f95b261deb6","observation_id":"7745d886-9549-4a8c-8535-ee855c761a5b","resolution":{"observed_at":"2026-08-07T13:20:22.098975Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:20:21.795011Z","title":"On the complexity of the subgraph problem.Com- ment","venue":null,"work_id":"1b2df424-4daf-444d-a8f8-6a6da6c63f57","year":1985},"citing_paper":{"arxiv_id":"2505.22300","last_updated":"2025-05-28T12:37:30Z","snapshot_observed_at":"2026-08-07T13:08:18.186974Z","submitted_at":"2025-05-28T12:37:30Z","title":"Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T13:20:17.774784Z"},"links":{"citing_paper":"/paper/2505.22300"},"observation_digest":"sha256:3ad76bedf8c2ff10ce15f29acd5123742dc7b31eaf17490297d87d91118fbfbb","observation_id":"6aa6fa18-d19b-4c58-9832-6b790a4991c9","resolution":{"observed_at":"2026-08-07T13:20:21.917546Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"8299.10083","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:20:20.251251Z","title":"Rosenberg","venue":null,"work_id":"5a891d0f-43e7-4b29-92e2-711cd29d68ad","year":1973},"citing_paper":{"arxiv_id":"2505.22300","last_updated":"2025-05-28T12:37:30Z","snapshot_observed_at":"2026-08-07T13:08:18.186974Z","submitted_at":"2025-05-28T12:37:30Z","title":"Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T13:20:17.927063Z"},"links":{"citing_paper":"/paper/2505.22300"},"observation_digest":"sha256:8f7825a13470a30bc126b34cc2fcade986174dc6c643d8234e76700e48503dd7","observation_id":"83b41230-7a32-4b6d-9390-2bf1b30bbb30","resolution":{"observed_at":"2026-08-07T13:20:20.313623Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf02759743","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:20:19.564514Z","title":"Independent sets in regular graphs.Israel J","venue":null,"work_id":"2c017e9b-d36a-4817-9912-409e6d6470ee","year":1964},"citing_paper":{"arxiv_id":"2505.22300","last_updated":"2025-05-28T12:37:30Z","snapshot_observed_at":"2026-08-07T13:08:18.186974Z","submitted_at":"2025-05-28T12:37:30Z","title":"Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T13:20:18.013580Z"},"links":{"citing_paper":"/paper/2505.22300"},"observation_digest":"sha256:251d67dc05a3bf22d9f741fe62ad25d5894d00aa0964bfa57bcd5a5d5281e9a4","observation_id":"c4703821-9bac-4c07-a386-fd7746672a35","resolution":{"observed_at":"2026-08-07T13:20:19.720556Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:20:21.555749Z","title":"Counting induced subgraphs: A topological approach to #W[1]-hardness.Algorithmica, 82(8):2267–2291, 2020.doi:10.1007/ S00453-020-00676-9","venue":null,"work_id":"3ac9ccf9-213a-4247-a215-e77cdfcc95d7","year":2020},"citing_paper":{"arxiv_id":"2505.22300","last_updated":"2025-05-28T12:37:30Z","snapshot_observed_at":"2026-08-07T13:08:18.186974Z","submitted_at":"2025-05-28T12:37:30Z","title":"Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T13:20:18.125432Z"},"links":{"citing_paper":"/paper/2505.22300"},"observation_digest":"sha256:70674be8cebe1082adf20f5159b8082b9f381e9c53dd384155bcd7d77d43519b","observation_id":"d92625cc-4ed6-4807-b509-16f91f787c90","resolution":{"observed_at":"2026-08-07T13:20:21.652016Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T13:20:18.266886Z","title":"Detecting and counting small sub- graphs, and evaluating a parameterized tutte polynomial: Lower bounds via toroidal grids and cayley graph expanders","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.22300","last_updated":"2025-05-28T12:37:30Z","snapshot_observed_at":"2026-08-07T13:08:18.186974Z","submitted_at":"2025-05-28T12:37:30Z","title":"Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T13:20:18.266886Z"},"links":{"citing_paper":"/paper/2505.22300"},"observation_digest":"sha256:2864c4a32456e0bed31d75cd305ea59cf064cfe6a51610ea9a1176cc5c29b24d","observation_id":"574a5129-3eaa-4e7a-8baf-cd263ba70422","resolution":{"observed_at":"2026-08-07T13:20:18.266886Z","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-07T13:20:18.406069Z","title":"Counting small induced subgraphs sat- isfying monotone properties.SIAM J","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.22300","last_updated":"2025-05-28T12:37:30Z","snapshot_observed_at":"2026-08-07T13:08:18.186974Z","submitted_at":"2025-05-28T12:37:30Z","title":"Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T13:20:18.406069Z"},"links":{"citing_paper":"/paper/2505.22300"},"observation_digest":"sha256:d7e943ac20a4c11a4d53730e95424c9f7dccc8e2a8f4cd19c4ebcd53eaaa3990","observation_id":"2b78fe6f-cbb8-45d2-83db-e125302df999","resolution":{"observed_at":"2026-08-07T13:20:18.406069Z","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/978-3-319-21233-3","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:20:19.329475Z","title":"StreaM - A stream- based algorithm for counting motifs in dynamic graphs","venue":null,"work_id":"d9194646-a671-459a-a0c6-5608afc6f513","year":2015},"citing_paper":{"arxiv_id":"2505.22300","last_updated":"2025-05-28T12:37:30Z","snapshot_observed_at":"2026-08-07T13:08:18.186974Z","submitted_at":"2025-05-28T12:37:30Z","title":"Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T13:20:18.565978Z"},"links":{"citing_paper":"/paper/2505.22300"},"observation_digest":"sha256:fdc003ee397d57d02dac195823cee98aa5177fe7078ee33c9c4e2a86d47d57e8","observation_id":"87bbf684-c385-435e-a66e-d76230b4825d","resolution":{"observed_at":"2026-08-07T13:20:19.431626Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/11599128","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:20:18.979928Z","title":"Frequency concepts and pattern detection for the analysis of motifs in networks.Trans","venue":null,"work_id":"f6284fdb-74dc-4ee9-8f04-9e58cec0c5b1","year":2005},"citing_paper":{"arxiv_id":"2505.22300","last_updated":"2025-05-28T12:37:30Z","snapshot_observed_at":"2026-08-07T13:08:18.186974Z","submitted_at":"2025-05-28T12:37:30Z","title":"Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T13:20:18.784746Z"},"links":{"citing_paper":"/paper/2505.22300"},"observation_digest":"sha256:0e71a534b73f61bbe5208f758c8663bffd879fabc9e4e0cac5c079e5c47585d2","observation_id":"216fec75-8d23-4777-9208-5f0b19be2c6d","resolution":{"observed_at":"2026-08-07T13:20:19.154663Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.22300","last_updated":"2025-05-28T12:37:30Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-07T13:08:18.186974Z","submitted_at":"2025-05-28T12:37:30Z","title":"Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial"},"reference_resolution":{"displayed":36,"state_counts":{"malformed_identifier":7,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":19,"verified_exact":6,"verified_fuzzy":3},"total_outbound_references":36},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"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."}