{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:DQDLFZWZWJLKOYXT3BUT44QVBZ","short_pith_number":"pith:DQDLFZWZ","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"},"canonical_sha256":"1c06b2e6d9b256a762f3d8693e72150e50b17a0625ec685e40ce72bcfb2cfb37","source":{"kind":"arxiv","id":"2505.22300","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.22300","created_at":"2026-07-05T11:11:12Z"},{"alias_kind":"arxiv_version","alias_value":"2505.22300v1","created_at":"2026-07-05T11:11:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.22300","created_at":"2026-07-05T11:11:12Z"},{"alias_kind":"pith_short_12","alias_value":"DQDLFZWZWJLK","created_at":"2026-07-05T11:11:12Z"},{"alias_kind":"pith_short_16","alias_value":"DQDLFZWZWJLKOYXT","created_at":"2026-07-05T11:11:12Z"},{"alias_kind":"pith_short_8","alias_value":"DQDLFZWZ","created_at":"2026-07-05T11:11:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:DQDLFZWZWJLKOYXT3BUT44QVBZ","target":"record","payload":{"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"},"canonical_sha256":"1c06b2e6d9b256a762f3d8693e72150e50b17a0625ec685e40ce72bcfb2cfb37","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"},"source_kind":"arxiv","source_id":"2505.22300","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:11:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0KBY5qzC5Nfh+tVoYkGjuLNRjcwOhmU33cYxlQ9EDfTkw6/Ay+1N5ayqHKXE8DFrdBkPMF/KBbzkQsWLyfX9Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T04:00:41.408332Z"},"content_sha256":"4c9e97c8b15872dbd6826d1280bdac99b43339fbd70e03c40cc49b45eed73145","schema_version":"1.0","event_id":"sha256:4c9e97c8b15872dbd6826d1280bdac99b43339fbd70e03c40cc49b45eed73145"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:DQDLFZWZWJLKOYXT3BUT44QVBZ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:11:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SVuoxcqC5Sl4kV5Z1qOIcyjT1cvPVw0XOl8B5s9Ef5HW913EjlqTTEazMb0wCedkGPRtE2v0HF5xW8+ZS2qQCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T04:00:41.408887Z"},"content_sha256":"7a8bec9163bec025c72451d30fe48c7442638fd85a1693b926d51524772f4fcc","schema_version":"1.0","event_id":"sha256:7a8bec9163bec025c72451d30fe48c7442638fd85a1693b926d51524772f4fcc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DQDLFZWZWJLKOYXT3BUT44QVBZ/bundle.json","state_url":"https://pith.science/pith/DQDLFZWZWJLKOYXT3BUT44QVBZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DQDLFZWZWJLKOYXT3BUT44QVBZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-08T04:00:41Z","links":{"resolver":"https://pith.science/pith/DQDLFZWZWJLKOYXT3BUT44QVBZ","bundle":"https://pith.science/pith/DQDLFZWZWJLKOYXT3BUT44QVBZ/bundle.json","state":"https://pith.science/pith/DQDLFZWZWJLKOYXT3BUT44QVBZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DQDLFZWZWJLKOYXT3BUT44QVBZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:DQDLFZWZWJLKOYXT3BUT44QVBZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"cf4e66747640f81017fee9e67238300aab7d67787507e9af7b2cfe523ba90d7f","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-05-28T12:37:30Z","title_canon_sha256":"d404d3f1500719e421db53df1e3929b4e85e1f2b52e40b9eaaf1f02c2cda7c64"},"schema_version":"1.0","source":{"id":"2505.22300","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.22300","created_at":"2026-07-05T11:11:12Z"},{"alias_kind":"arxiv_version","alias_value":"2505.22300v1","created_at":"2026-07-05T11:11:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.22300","created_at":"2026-07-05T11:11:12Z"},{"alias_kind":"pith_short_12","alias_value":"DQDLFZWZWJLK","created_at":"2026-07-05T11:11:12Z"},{"alias_kind":"pith_short_16","alias_value":"DQDLFZWZWJLKOYXT","created_at":"2026-07-05T11:11:12Z"},{"alias_kind":"pith_short_8","alias_value":"DQDLFZWZ","created_at":"2026-07-05T11:11:12Z"}],"graph_snapshots":[{"event_id":"sha256:7a8bec9163bec025c72451d30fe48c7442638fd85a1693b926d51524772f4fcc","target":"graph","created_at":"2026-07-05T11:11:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2505.22300/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 [","authors_text":"Daniel Neuen, Radu Curticapean, Simon D\\\"oring","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-05-28T12:37:30Z","title":"Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.22300","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4c9e97c8b15872dbd6826d1280bdac99b43339fbd70e03c40cc49b45eed73145","target":"record","created_at":"2026-07-05T11:11:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"cf4e66747640f81017fee9e67238300aab7d67787507e9af7b2cfe523ba90d7f","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-05-28T12:37:30Z","title_canon_sha256":"d404d3f1500719e421db53df1e3929b4e85e1f2b52e40b9eaaf1f02c2cda7c64"},"schema_version":"1.0","source":{"id":"2505.22300","kind":"arxiv","version":1}},"canonical_sha256":"1c06b2e6d9b256a762f3d8693e72150e50b17a0625ec685e40ce72bcfb2cfb37","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1c06b2e6d9b256a762f3d8693e72150e50b17a0625ec685e40ce72bcfb2cfb37","first_computed_at":"2026-07-05T11:11:12.855650Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:11:12.855650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YcoyJdqdEU9F3BHs/zut/YpkkwMAB6tQ/SoHXlxgdshoerYHePQ2jCvfvpm39mplkhCuECzsm8pqdNwdAwiYAA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:11:12.856170Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.22300","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c9e97c8b15872dbd6826d1280bdac99b43339fbd70e03c40cc49b45eed73145","sha256:7a8bec9163bec025c72451d30fe48c7442638fd85a1693b926d51524772f4fcc"],"state_sha256":"650d5043cdea207b51f02673a67eda89d34e3cff9f21cf8f45cea00fb0ef11de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8D5qVgUQmrqM4FR9OYvYva7EsQq7ztPRLHxE6HAlHmr8mjoUm3qZGs0W6LOioYgX8fyv/gfkwzRhOcY7JSzzBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T04:00:41.412205Z","bundle_sha256":"0acd523a0172a771e06727d5a88af2d505a20e6cc569b31390c54142d81c2a50"}}