{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:VTRFISH236U4BWLNJND6UX2KR5","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":"6ea8b39c6b3a3d6c599329fd7f92b0e76f1cb6d877d0c05f2c30b9593ab5963a","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2025-06-17T00:33:22Z","title_canon_sha256":"f5358d8223839f0e417c251c490e63ac4cc3e70f12ef7106e919a4e84097bd79"},"schema_version":"1.0","source":{"id":"2506.14081","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.14081","created_at":"2026-06-09T01:05:07Z"},{"alias_kind":"arxiv_version","alias_value":"2506.14081v2","created_at":"2026-06-09T01:05:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.14081","created_at":"2026-06-09T01:05:07Z"},{"alias_kind":"pith_short_12","alias_value":"VTRFISH236U4","created_at":"2026-06-09T01:05:07Z"},{"alias_kind":"pith_short_16","alias_value":"VTRFISH236U4BWLN","created_at":"2026-06-09T01:05:07Z"},{"alias_kind":"pith_short_8","alias_value":"VTRFISH2","created_at":"2026-06-09T01:05:07Z"}],"graph_snapshots":[{"event_id":"sha256:59fa2784b11fd36797312803786abf5b94b95d07de0ede2d5f5058772768c2c2","target":"graph","created_at":"2026-06-09T01:05:07Z","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/2506.14081/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Subgraph counting is a fundamental and well-studied problem whose computational complexity is well understood. Quite surprisingly, the hypergraph version of subgraph counting has been almost ignored. In this work, we address this gap by investigating the most basic sub-hypergraph counting problem: given a (small) hypergraph $H$ and a (large) hypergraph $G$, compute the number of sub-hypergraphs of $G$ isomorphic to $H$. Formally, for a family $\\mathcal{H}$ of hypergraphs, let #Sub($\\mathcal{H}$) be the restriction of the problem to $H \\in \\mathcal{H}$; the induced variant #IndSub($\\mathcal{H}$","authors_text":"Holger Dell, Julian Brinkmann, Marco Bressan, Marc Roth, Philip Wellnitz","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.14081","kind":"arxiv","version":2},"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:0cd42e360d98077fee9bc613092ef0fff220b08168ecfeb00556b589f909508a","target":"record","created_at":"2026-06-09T01:05:07Z","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":"6ea8b39c6b3a3d6c599329fd7f92b0e76f1cb6d877d0c05f2c30b9593ab5963a","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2025-06-17T00:33:22Z","title_canon_sha256":"f5358d8223839f0e417c251c490e63ac4cc3e70f12ef7106e919a4e84097bd79"},"schema_version":"1.0","source":{"id":"2506.14081","kind":"arxiv","version":2}},"canonical_sha256":"ace25448fadfa9c0d96d4b47ea5f4a8f43d68551866c7c2a6193da7143478f4c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ace25448fadfa9c0d96d4b47ea5f4a8f43d68551866c7c2a6193da7143478f4c","first_computed_at":"2026-06-09T01:05:07.261799Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-09T01:05:07.261799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ePplrw4nKivkgCLKtx5jaUv00AVIQr+3ktU5RtvB9UUxJlh5gG0L7MPiHgy1aDpTyXACndn6lAqKR29nBKxhAw==","signature_status":"signed_v1","signed_at":"2026-06-09T01:05:07.262380Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.14081","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0cd42e360d98077fee9bc613092ef0fff220b08168ecfeb00556b589f909508a","sha256:59fa2784b11fd36797312803786abf5b94b95d07de0ede2d5f5058772768c2c2"],"state_sha256":"54f0b19f2022d7a7ea863f76b5cd7de5dbd55e349e2530b0a6dafa2236bcdc05"}