{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VTRFISH236U4BWLNJND6UX2KR5","short_pith_number":"pith:VTRFISH2","schema_version":"1.0","canonical_sha256":"ace25448fadfa9c0d96d4b47ea5f4a8f43d68551866c7c2a6193da7143478f4c","source":{"kind":"arxiv","id":"2506.14081","version":2},"attestation_state":"computed","paper":{"title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Holger Dell, Julian Brinkmann, Marco Bressan, Marc Roth, Philip Wellnitz","submitted_at":"2025-06-17T00:33:22Z","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}$"},"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":"2506.14081","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2025-06-17T00:33:22Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f5358d8223839f0e417c251c490e63ac4cc3e70f12ef7106e919a4e84097bd79","abstract_canon_sha256":"6ea8b39c6b3a3d6c599329fd7f92b0e76f1cb6d877d0c05f2c30b9593ab5963a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T01:05:07.262380Z","signature_b64":"ePplrw4nKivkgCLKtx5jaUv00AVIQr+3ktU5RtvB9UUxJlh5gG0L7MPiHgy1aDpTyXACndn6lAqKR29nBKxhAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ace25448fadfa9c0d96d4b47ea5f4a8f43d68551866c7c2a6193da7143478f4c","last_reissued_at":"2026-06-09T01:05:07.261799Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T01:05:07.261799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Holger Dell, Julian Brinkmann, Marco Bressan, Marc Roth, Philip Wellnitz","submitted_at":"2025-06-17T00:33:22Z","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}$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.14081","kind":"arxiv","version":2},"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/2506.14081/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":"2506.14081","created_at":"2026-06-09T01:05:07.261877+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.14081v2","created_at":"2026-06-09T01:05:07.261877+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.14081","created_at":"2026-06-09T01:05:07.261877+00:00"},{"alias_kind":"pith_short_12","alias_value":"VTRFISH236U4","created_at":"2026-06-09T01:05:07.261877+00:00"},{"alias_kind":"pith_short_16","alias_value":"VTRFISH236U4BWLN","created_at":"2026-06-09T01:05:07.261877+00:00"},{"alias_kind":"pith_short_8","alias_value":"VTRFISH2","created_at":"2026-06-09T01:05:07.261877+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/VTRFISH236U4BWLNJND6UX2KR5","json":"https://pith.science/pith/VTRFISH236U4BWLNJND6UX2KR5.json","graph_json":"https://pith.science/api/pith-number/VTRFISH236U4BWLNJND6UX2KR5/graph.json","events_json":"https://pith.science/api/pith-number/VTRFISH236U4BWLNJND6UX2KR5/events.json","paper":"https://pith.science/paper/VTRFISH2"},"agent_actions":{"view_html":"https://pith.science/pith/VTRFISH236U4BWLNJND6UX2KR5","download_json":"https://pith.science/pith/VTRFISH236U4BWLNJND6UX2KR5.json","view_paper":"https://pith.science/paper/VTRFISH2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.14081&json=true","fetch_graph":"https://pith.science/api/pith-number/VTRFISH236U4BWLNJND6UX2KR5/graph.json","fetch_events":"https://pith.science/api/pith-number/VTRFISH236U4BWLNJND6UX2KR5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VTRFISH236U4BWLNJND6UX2KR5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VTRFISH236U4BWLNJND6UX2KR5/action/storage_attestation","attest_author":"https://pith.science/pith/VTRFISH236U4BWLNJND6UX2KR5/action/author_attestation","sign_citation":"https://pith.science/pith/VTRFISH236U4BWLNJND6UX2KR5/action/citation_signature","submit_replication":"https://pith.science/pith/VTRFISH236U4BWLNJND6UX2KR5/action/replication_record"}},"created_at":"2026-06-09T01:05:07.261877+00:00","updated_at":"2026-06-09T01:05:07.261877+00:00"}