{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:DQDLFZWZWJLKOYXT3BUT44QVBZ","short_pith_number":"pith:DQDLFZWZ","schema_version":"1.0","canonical_sha256":"1c06b2e6d9b256a762f3d8693e72150e50b17a0625ec685e40ce72bcfb2cfb37","source":{"kind":"arxiv","id":"2505.22300","version":1},"attestation_state":"computed","paper":{"title":"Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Daniel Neuen, Radu Curticapean, Simon D\\\"oring","submitted_at":"2025-05-28T12:37:30Z","abstract_excerpt":"We consider the parameterized problem $\\#$IndSub$(\\Phi)$ for fixed graph properties $\\Phi$: Given a graph $G$ and an integer $k$, this problem asks to count the number of induced $k$-vertex subgraphs satisfying $\\Phi$. D\\\"orfler et al. [Algorithmica 2022] and Roth et al. [SICOMP 2024] conjectured that $\\#$IndSub$(\\Phi)$ is $\\#$W[1]-hard for all non-meager properties $\\Phi$, i.e., properties that are nontrivial for infinitely many $k$. This conjecture has been confirmed for several restricted types of properties, including all hereditary properties [STOC 2022] and all edge-monotone properties ["},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2505.22300","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-05-28T12:37:30Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d404d3f1500719e421db53df1e3929b4e85e1f2b52e40b9eaaf1f02c2cda7c64","abstract_canon_sha256":"cf4e66747640f81017fee9e67238300aab7d67787507e9af7b2cfe523ba90d7f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:11:12.856170Z","signature_b64":"YcoyJdqdEU9F3BHs/zut/YpkkwMAB6tQ/SoHXlxgdshoerYHePQ2jCvfvpm39mplkhCuECzsm8pqdNwdAwiYAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c06b2e6d9b256a762f3d8693e72150e50b17a0625ec685e40ce72bcfb2cfb37","last_reissued_at":"2026-07-05T11:11:12.855650Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:11:12.855650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Daniel Neuen, Radu Curticapean, Simon D\\\"oring","submitted_at":"2025-05-28T12:37:30Z","abstract_excerpt":"We consider the parameterized problem $\\#$IndSub$(\\Phi)$ for fixed graph properties $\\Phi$: Given a graph $G$ and an integer $k$, this problem asks to count the number of induced $k$-vertex subgraphs satisfying $\\Phi$. D\\\"orfler et al. [Algorithmica 2022] and Roth et al. [SICOMP 2024] conjectured that $\\#$IndSub$(\\Phi)$ is $\\#$W[1]-hard for all non-meager properties $\\Phi$, i.e., properties that are nontrivial for infinitely many $k$. This conjecture has been confirmed for several restricted types of properties, including all hereditary properties [STOC 2022] and all edge-monotone properties ["},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.22300","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.22300/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2505.22300","created_at":"2026-07-05T11:11:12.855715+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.22300v1","created_at":"2026-07-05T11:11:12.855715+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.22300","created_at":"2026-07-05T11:11:12.855715+00:00"},{"alias_kind":"pith_short_12","alias_value":"DQDLFZWZWJLK","created_at":"2026-07-05T11:11:12.855715+00:00"},{"alias_kind":"pith_short_16","alias_value":"DQDLFZWZWJLKOYXT","created_at":"2026-07-05T11:11:12.855715+00:00"},{"alias_kind":"pith_short_8","alias_value":"DQDLFZWZ","created_at":"2026-07-05T11:11:12.855715+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DQDLFZWZWJLKOYXT3BUT44QVBZ","json":"https://pith.science/pith/DQDLFZWZWJLKOYXT3BUT44QVBZ.json","graph_json":"https://pith.science/api/pith-number/DQDLFZWZWJLKOYXT3BUT44QVBZ/graph.json","events_json":"https://pith.science/api/pith-number/DQDLFZWZWJLKOYXT3BUT44QVBZ/events.json","paper":"https://pith.science/paper/DQDLFZWZ"},"agent_actions":{"view_html":"https://pith.science/pith/DQDLFZWZWJLKOYXT3BUT44QVBZ","download_json":"https://pith.science/pith/DQDLFZWZWJLKOYXT3BUT44QVBZ.json","view_paper":"https://pith.science/paper/DQDLFZWZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.22300&json=true","fetch_graph":"https://pith.science/api/pith-number/DQDLFZWZWJLKOYXT3BUT44QVBZ/graph.json","fetch_events":"https://pith.science/api/pith-number/DQDLFZWZWJLKOYXT3BUT44QVBZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DQDLFZWZWJLKOYXT3BUT44QVBZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DQDLFZWZWJLKOYXT3BUT44QVBZ/action/storage_attestation","attest_author":"https://pith.science/pith/DQDLFZWZWJLKOYXT3BUT44QVBZ/action/author_attestation","sign_citation":"https://pith.science/pith/DQDLFZWZWJLKOYXT3BUT44QVBZ/action/citation_signature","submit_replication":"https://pith.science/pith/DQDLFZWZWJLKOYXT3BUT44QVBZ/action/replication_record"}},"created_at":"2026-07-05T11:11:12.855715+00:00","updated_at":"2026-07-05T11:11:12.855715+00:00"}