{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:CLZJXYCE5VKX4CCW5DZKWGBFZN","short_pith_number":"pith:CLZJXYCE","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"},"canonical_sha256":"12f29be044ed557e0856e8f2ab1825cb6f5816f5fe54a0123072a382decd8aa6","source":{"kind":"arxiv","id":"1510.05093","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.05093","created_at":"2026-05-18T01:29:53Z"},{"alias_kind":"arxiv_version","alias_value":"1510.05093v1","created_at":"2026-05-18T01:29:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.05093","created_at":"2026-05-18T01:29:53Z"},{"alias_kind":"pith_short_12","alias_value":"CLZJXYCE5VKX","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CLZJXYCE5VKX4CCW","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CLZJXYCE","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:CLZJXYCE5VKX4CCW5DZKWGBFZN","target":"record","payload":{"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"},"canonical_sha256":"12f29be044ed557e0856e8f2ab1825cb6f5816f5fe54a0123072a382decd8aa6","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"},"source_kind":"arxiv","source_id":"1510.05093","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-05-18T01:29:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kh5qX1QMra9y2gsvpz1XCNcEah6lXMG7Gq5ODNVFlfqiYOPcYaTmCXUNktwECnAD+jryHV9pHXpFd9P9ihU6CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:58:31.192375Z"},"content_sha256":"e7d2379363cf67aefb7586fee61271acdfaf870bf9320b7279b6725d325b7de2","schema_version":"1.0","event_id":"sha256:e7d2379363cf67aefb7586fee61271acdfaf870bf9320b7279b6725d325b7de2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:CLZJXYCE5VKX4CCW5DZKWGBFZN","target":"graph","payload":{"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"},"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-05-18T01:29:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"60Zm4aqOPdcO9hdWc/57C/YIvUuSw09WOQiEkFSXShOz1p6CXy84KOQvZZhz0sP7GptD2m7Yr6nEdI/sVr+TDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:58:31.193058Z"},"content_sha256":"b43605835dc6378e0428477dc7d6f063833ea5bb0f945e750f21d88a966c4f30","schema_version":"1.0","event_id":"sha256:b43605835dc6378e0428477dc7d6f063833ea5bb0f945e750f21d88a966c4f30"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CLZJXYCE5VKX4CCW5DZKWGBFZN/bundle.json","state_url":"https://pith.science/pith/CLZJXYCE5VKX4CCW5DZKWGBFZN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CLZJXYCE5VKX4CCW5DZKWGBFZN/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-06-10T23:58:31Z","links":{"resolver":"https://pith.science/pith/CLZJXYCE5VKX4CCW5DZKWGBFZN","bundle":"https://pith.science/pith/CLZJXYCE5VKX4CCW5DZKWGBFZN/bundle.json","state":"https://pith.science/pith/CLZJXYCE5VKX4CCW5DZKWGBFZN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CLZJXYCE5VKX4CCW5DZKWGBFZN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CLZJXYCE5VKX4CCW5DZKWGBFZN","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":"d49d2df186522a6acb040f545441d8617b54e1bddb97dcc1268af17e4c470e7c","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-17T07:56:35Z","title_canon_sha256":"1fbff0226205da40cafdffb46fe60745c4fe3224a87fe01a87c8fcdc7605867a"},"schema_version":"1.0","source":{"id":"1510.05093","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.05093","created_at":"2026-05-18T01:29:53Z"},{"alias_kind":"arxiv_version","alias_value":"1510.05093v1","created_at":"2026-05-18T01:29:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.05093","created_at":"2026-05-18T01:29:53Z"},{"alias_kind":"pith_short_12","alias_value":"CLZJXYCE5VKX","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CLZJXYCE5VKX4CCW","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CLZJXYCE","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:b43605835dc6378e0428477dc7d6f063833ea5bb0f945e750f21d88a966c4f30","target":"graph","created_at":"2026-05-18T01:29:53Z","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"},"paper":{"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","authors_text":"Dieter Kratsch, Jean-Francois Couturier, Manfred Cochefert, Serge Gaspers","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-17T07:56:35Z","title":"Faster algorithms to enumerate hypergraph transversals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.05093","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:e7d2379363cf67aefb7586fee61271acdfaf870bf9320b7279b6725d325b7de2","target":"record","created_at":"2026-05-18T01:29:53Z","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":"d49d2df186522a6acb040f545441d8617b54e1bddb97dcc1268af17e4c470e7c","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-17T07:56:35Z","title_canon_sha256":"1fbff0226205da40cafdffb46fe60745c4fe3224a87fe01a87c8fcdc7605867a"},"schema_version":"1.0","source":{"id":"1510.05093","kind":"arxiv","version":1}},"canonical_sha256":"12f29be044ed557e0856e8f2ab1825cb6f5816f5fe54a0123072a382decd8aa6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"12f29be044ed557e0856e8f2ab1825cb6f5816f5fe54a0123072a382decd8aa6","first_computed_at":"2026-05-18T01:29:53.193223Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:53.193223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TE5INJVKWCEgKpzQqbgjLkWpLPcLyUW/vtw9w0Layq9a7SV50qesnLk4zApnY+dLHMMx3C6dQ6b4UUiuz+pZDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:53.193721Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.05093","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7d2379363cf67aefb7586fee61271acdfaf870bf9320b7279b6725d325b7de2","sha256:b43605835dc6378e0428477dc7d6f063833ea5bb0f945e750f21d88a966c4f30"],"state_sha256":"a61854f965b54136d89639d3a931532c16793684695e149a22766828181fa671"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x3bMPlrfIySGqi7zoso4leVz5IP871dox00pBI1L+EvWlo/tFSGSAqohqMGGq5t+/KUX3WSfZ/1mLX0kYBg0AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T23:58:31.196703Z","bundle_sha256":"028d9c8264d1bec169685bf2527073deaa0b95fa0fbbb8b12b83963094e8cec6"}}