{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CLZJXYCE5VKX4CCW5DZKWGBFZN","short_pith_number":"pith:CLZJXYCE","schema_version":"1.0","canonical_sha256":"12f29be044ed557e0856e8f2ab1825cb6f5816f5fe54a0123072a382decd8aa6","source":{"kind":"arxiv","id":"1510.05093","version":1},"attestation_state":"computed","paper":{"title":"Faster algorithms to enumerate hypergraph transversals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Dieter Kratsch, Jean-Francois Couturier, Manfred Cochefert, Serge Gaspers","submitted_at":"2015-10-17T07:56:35Z","abstract_excerpt":"A transversal of a hypergraph is a set of vertices intersecting each hyperedge. We design and analyze new exponential-time algorithms to enumerate all inclusion-minimal transversals of a hypergraph. For each fixed k>2, our algorithms for hypergraphs of rank k, where the rank is the maximum size of a hyperedge, outperform the previous best. This also implies improved upper bounds on the maximum number of minimal transversals in n-vertex hypergraphs of rank k>2. Our main algorithm is a branching algorithm whose running time is analyzed with Measure and Conquer. It enumerates all minimal transver"},"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":"1510.05093","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-17T07:56:35Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"1fbff0226205da40cafdffb46fe60745c4fe3224a87fe01a87c8fcdc7605867a","abstract_canon_sha256":"d49d2df186522a6acb040f545441d8617b54e1bddb97dcc1268af17e4c470e7c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:53.193721Z","signature_b64":"TE5INJVKWCEgKpzQqbgjLkWpLPcLyUW/vtw9w0Layq9a7SV50qesnLk4zApnY+dLHMMx3C6dQ6b4UUiuz+pZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12f29be044ed557e0856e8f2ab1825cb6f5816f5fe54a0123072a382decd8aa6","last_reissued_at":"2026-05-18T01:29:53.193223Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:53.193223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster algorithms to enumerate hypergraph transversals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Dieter Kratsch, Jean-Francois Couturier, Manfred Cochefert, Serge Gaspers","submitted_at":"2015-10-17T07:56:35Z","abstract_excerpt":"A transversal of a hypergraph is a set of vertices intersecting each hyperedge. We design and analyze new exponential-time algorithms to enumerate all inclusion-minimal transversals of a hypergraph. For each fixed k>2, our algorithms for hypergraphs of rank k, where the rank is the maximum size of a hyperedge, outperform the previous best. This also implies improved upper bounds on the maximum number of minimal transversals in n-vertex hypergraphs of rank k>2. Our main algorithm is a branching algorithm whose running time is analyzed with Measure and Conquer. It enumerates all minimal transver"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.05093","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":"1510.05093","created_at":"2026-05-18T01:29:53.193290+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.05093v1","created_at":"2026-05-18T01:29:53.193290+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.05093","created_at":"2026-05-18T01:29:53.193290+00:00"},{"alias_kind":"pith_short_12","alias_value":"CLZJXYCE5VKX","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"CLZJXYCE5VKX4CCW","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"CLZJXYCE","created_at":"2026-05-18T12:29:17.054201+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/CLZJXYCE5VKX4CCW5DZKWGBFZN","json":"https://pith.science/pith/CLZJXYCE5VKX4CCW5DZKWGBFZN.json","graph_json":"https://pith.science/api/pith-number/CLZJXYCE5VKX4CCW5DZKWGBFZN/graph.json","events_json":"https://pith.science/api/pith-number/CLZJXYCE5VKX4CCW5DZKWGBFZN/events.json","paper":"https://pith.science/paper/CLZJXYCE"},"agent_actions":{"view_html":"https://pith.science/pith/CLZJXYCE5VKX4CCW5DZKWGBFZN","download_json":"https://pith.science/pith/CLZJXYCE5VKX4CCW5DZKWGBFZN.json","view_paper":"https://pith.science/paper/CLZJXYCE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.05093&json=true","fetch_graph":"https://pith.science/api/pith-number/CLZJXYCE5VKX4CCW5DZKWGBFZN/graph.json","fetch_events":"https://pith.science/api/pith-number/CLZJXYCE5VKX4CCW5DZKWGBFZN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CLZJXYCE5VKX4CCW5DZKWGBFZN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CLZJXYCE5VKX4CCW5DZKWGBFZN/action/storage_attestation","attest_author":"https://pith.science/pith/CLZJXYCE5VKX4CCW5DZKWGBFZN/action/author_attestation","sign_citation":"https://pith.science/pith/CLZJXYCE5VKX4CCW5DZKWGBFZN/action/citation_signature","submit_replication":"https://pith.science/pith/CLZJXYCE5VKX4CCW5DZKWGBFZN/action/replication_record"}},"created_at":"2026-05-18T01:29:53.193290+00:00","updated_at":"2026-05-18T01:29:53.193290+00:00"}