{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5NT5ZWRK3TFXZTTVD4QT5XJOPX","short_pith_number":"pith:5NT5ZWRK","schema_version":"1.0","canonical_sha256":"eb67dcda2adccb7cce751f213edd2e7df45653f2cbea1badc66df1bbeb973b73","source":{"kind":"arxiv","id":"1808.05017","version":1},"attestation_state":"computed","paper":{"title":"Counting Minimal Transversals of $\\beta$-Acyclic Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kant\\'e","submitted_at":"2018-08-15T09:49:44Z","abstract_excerpt":"We prove that one can count in polynomial time the number of minimal transversals of $\\beta$-acyclic hypergraphs. In consequence, we can count in polynomial time the number of minimal dominating sets of strongly chordal graphs, continuing the line of research initiated in [M.M. Kant\\'e and T. Uno, Counting Minimal Dominating Sets, TAMC'17]."},"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":"1808.05017","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-15T09:49:44Z","cross_cats_sorted":[],"title_canon_sha256":"47d08f6276c1eca62f3148d75bacea02c05a99ad4bd97f6a50bdc01cb0808d1b","abstract_canon_sha256":"b985b13a99041a650072eb15964e76e2747f0bcea354c0a4a4acd0de23cbe8ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:01.900185Z","signature_b64":"rhKeP1jGvzaMngtvZAxl4OFIz0oK52MCVYdR2KFlfCDmhXRHGanvmLL1VnDixOQ+THY1FdrH17GDTpT6OU84Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb67dcda2adccb7cce751f213edd2e7df45653f2cbea1badc66df1bbeb973b73","last_reissued_at":"2026-05-18T00:08:01.899620Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:01.899620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting Minimal Transversals of $\\beta$-Acyclic Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kant\\'e","submitted_at":"2018-08-15T09:49:44Z","abstract_excerpt":"We prove that one can count in polynomial time the number of minimal transversals of $\\beta$-acyclic hypergraphs. In consequence, we can count in polynomial time the number of minimal dominating sets of strongly chordal graphs, continuing the line of research initiated in [M.M. Kant\\'e and T. Uno, Counting Minimal Dominating Sets, TAMC'17]."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.05017","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":""},"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":"1808.05017","created_at":"2026-05-18T00:08:01.899697+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.05017v1","created_at":"2026-05-18T00:08:01.899697+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.05017","created_at":"2026-05-18T00:08:01.899697+00:00"},{"alias_kind":"pith_short_12","alias_value":"5NT5ZWRK3TFX","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5NT5ZWRK3TFXZTTV","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5NT5ZWRK","created_at":"2026-05-18T12:32:08.215937+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/5NT5ZWRK3TFXZTTVD4QT5XJOPX","json":"https://pith.science/pith/5NT5ZWRK3TFXZTTVD4QT5XJOPX.json","graph_json":"https://pith.science/api/pith-number/5NT5ZWRK3TFXZTTVD4QT5XJOPX/graph.json","events_json":"https://pith.science/api/pith-number/5NT5ZWRK3TFXZTTVD4QT5XJOPX/events.json","paper":"https://pith.science/paper/5NT5ZWRK"},"agent_actions":{"view_html":"https://pith.science/pith/5NT5ZWRK3TFXZTTVD4QT5XJOPX","download_json":"https://pith.science/pith/5NT5ZWRK3TFXZTTVD4QT5XJOPX.json","view_paper":"https://pith.science/paper/5NT5ZWRK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.05017&json=true","fetch_graph":"https://pith.science/api/pith-number/5NT5ZWRK3TFXZTTVD4QT5XJOPX/graph.json","fetch_events":"https://pith.science/api/pith-number/5NT5ZWRK3TFXZTTVD4QT5XJOPX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5NT5ZWRK3TFXZTTVD4QT5XJOPX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5NT5ZWRK3TFXZTTVD4QT5XJOPX/action/storage_attestation","attest_author":"https://pith.science/pith/5NT5ZWRK3TFXZTTVD4QT5XJOPX/action/author_attestation","sign_citation":"https://pith.science/pith/5NT5ZWRK3TFXZTTVD4QT5XJOPX/action/citation_signature","submit_replication":"https://pith.science/pith/5NT5ZWRK3TFXZTTVD4QT5XJOPX/action/replication_record"}},"created_at":"2026-05-18T00:08:01.899697+00:00","updated_at":"2026-05-18T00:08:01.899697+00:00"}