{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:YO7WSKNN5DHLRLL7VLKGCUYVCH","short_pith_number":"pith:YO7WSKNN","canonical_record":{"source":{"id":"1505.06025","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-05-22T11:06:52Z","cross_cats_sorted":[],"title_canon_sha256":"1954016cab5a94a11f14d548dfa6b303491fc4bea7d4bee5d2c3f46f62171ba7","abstract_canon_sha256":"537da3919b3d52f87be6103815f24359f87dc5386c2138a9b28f58a38ecd638f"},"schema_version":"1.0"},"canonical_sha256":"c3bf6929ade8ceb8ad7faad461531511d8989c8707dba5faac08bec8bba6d717","source":{"kind":"arxiv","id":"1505.06025","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.06025","created_at":"2026-05-18T02:03:49Z"},{"alias_kind":"arxiv_version","alias_value":"1505.06025v1","created_at":"2026-05-18T02:03:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06025","created_at":"2026-05-18T02:03:49Z"},{"alias_kind":"pith_short_12","alias_value":"YO7WSKNN5DHL","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YO7WSKNN5DHLRLL7","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YO7WSKNN","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:YO7WSKNN5DHLRLL7VLKGCUYVCH","target":"record","payload":{"canonical_record":{"source":{"id":"1505.06025","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-05-22T11:06:52Z","cross_cats_sorted":[],"title_canon_sha256":"1954016cab5a94a11f14d548dfa6b303491fc4bea7d4bee5d2c3f46f62171ba7","abstract_canon_sha256":"537da3919b3d52f87be6103815f24359f87dc5386c2138a9b28f58a38ecd638f"},"schema_version":"1.0"},"canonical_sha256":"c3bf6929ade8ceb8ad7faad461531511d8989c8707dba5faac08bec8bba6d717","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:49.350671Z","signature_b64":"2tCZVL47Aj6VFHJXeFD2k3DqaxmbDAxcmJHXrb4t0lxpA1Sudzs/qnOs5T4f0i0p9TbpKtAo4YOzaK6VCoflDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3bf6929ade8ceb8ad7faad461531511d8989c8707dba5faac08bec8bba6d717","last_reissued_at":"2026-05-18T02:03:49.349923Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:49.349923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.06025","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-18T02:03:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J3hVja5BqPcr4feFGiO/I8yjxJyljIhhotBibDMqTChthhch+78cuTHibVrIpI9B/CdFgHOLPX1WBU/FBJjaDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:01:40.449777Z"},"content_sha256":"47eacccbdd77c05eb627079c363ee19ea7137454b64a48022b3b95e42d5bb1ad","schema_version":"1.0","event_id":"sha256:47eacccbdd77c05eb627079c363ee19ea7137454b64a48022b3b95e42d5bb1ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:YO7WSKNN5DHLRLL7VLKGCUYVCH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Incremental complexity of a bi-objective hypergraph transversal problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Arnaud Mary, Etienne Birmel\\'e (MAP5), Marie-France Sagot (LBBE Lyon / INRIA Grenoble Rh\\^one-Alpes), Ricardo Andrade (LBBE Lyon / INRIA Grenoble Rh\\^one-Alpes), Thomas Picchetti (MAP5)","submitted_at":"2015-05-22T11:06:52Z","abstract_excerpt":"The hypergraph transversal problem has been intensively studied, from both a theoretical and a practical point of view. In particular , its incremental complexity is known to be quasi-polynomial in general and polynomial for bounded hypergraphs. Recent applications in computational biology however require to solve a generalization of this problem, that we call bi-objective transversal problem. The instance is in this case composed of a pair of hypergraphs (A, B), and the aim is to find minimal sets which hit all the hyperedges of A while intersecting a minimal set of hyperedges of B. In this p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06025","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-18T02:03:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6akNorPgmAZzrMuSnb0d/QcEm/rtOw3s6VcoNVcr/nQeo2ouzICcocRkRKlFmKvI+2//ydQABBC9UGAfPKhXAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:01:40.450137Z"},"content_sha256":"f2e97935ef219545315538b1107173dc327a8a5bbecf94354852131a262efaef","schema_version":"1.0","event_id":"sha256:f2e97935ef219545315538b1107173dc327a8a5bbecf94354852131a262efaef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YO7WSKNN5DHLRLL7VLKGCUYVCH/bundle.json","state_url":"https://pith.science/pith/YO7WSKNN5DHLRLL7VLKGCUYVCH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YO7WSKNN5DHLRLL7VLKGCUYVCH/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-05-28T16:01:40Z","links":{"resolver":"https://pith.science/pith/YO7WSKNN5DHLRLL7VLKGCUYVCH","bundle":"https://pith.science/pith/YO7WSKNN5DHLRLL7VLKGCUYVCH/bundle.json","state":"https://pith.science/pith/YO7WSKNN5DHLRLL7VLKGCUYVCH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YO7WSKNN5DHLRLL7VLKGCUYVCH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:YO7WSKNN5DHLRLL7VLKGCUYVCH","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":"537da3919b3d52f87be6103815f24359f87dc5386c2138a9b28f58a38ecd638f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-05-22T11:06:52Z","title_canon_sha256":"1954016cab5a94a11f14d548dfa6b303491fc4bea7d4bee5d2c3f46f62171ba7"},"schema_version":"1.0","source":{"id":"1505.06025","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.06025","created_at":"2026-05-18T02:03:49Z"},{"alias_kind":"arxiv_version","alias_value":"1505.06025v1","created_at":"2026-05-18T02:03:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06025","created_at":"2026-05-18T02:03:49Z"},{"alias_kind":"pith_short_12","alias_value":"YO7WSKNN5DHL","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YO7WSKNN5DHLRLL7","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YO7WSKNN","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:f2e97935ef219545315538b1107173dc327a8a5bbecf94354852131a262efaef","target":"graph","created_at":"2026-05-18T02:03:49Z","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":"The hypergraph transversal problem has been intensively studied, from both a theoretical and a practical point of view. In particular , its incremental complexity is known to be quasi-polynomial in general and polynomial for bounded hypergraphs. Recent applications in computational biology however require to solve a generalization of this problem, that we call bi-objective transversal problem. The instance is in this case composed of a pair of hypergraphs (A, B), and the aim is to find minimal sets which hit all the hyperedges of A while intersecting a minimal set of hyperedges of B. In this p","authors_text":"Arnaud Mary, Etienne Birmel\\'e (MAP5), Marie-France Sagot (LBBE Lyon / INRIA Grenoble Rh\\^one-Alpes), Ricardo Andrade (LBBE Lyon / INRIA Grenoble Rh\\^one-Alpes), Thomas Picchetti (MAP5)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-05-22T11:06:52Z","title":"Incremental complexity of a bi-objective hypergraph transversal problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06025","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:47eacccbdd77c05eb627079c363ee19ea7137454b64a48022b3b95e42d5bb1ad","target":"record","created_at":"2026-05-18T02:03:49Z","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":"537da3919b3d52f87be6103815f24359f87dc5386c2138a9b28f58a38ecd638f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-05-22T11:06:52Z","title_canon_sha256":"1954016cab5a94a11f14d548dfa6b303491fc4bea7d4bee5d2c3f46f62171ba7"},"schema_version":"1.0","source":{"id":"1505.06025","kind":"arxiv","version":1}},"canonical_sha256":"c3bf6929ade8ceb8ad7faad461531511d8989c8707dba5faac08bec8bba6d717","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c3bf6929ade8ceb8ad7faad461531511d8989c8707dba5faac08bec8bba6d717","first_computed_at":"2026-05-18T02:03:49.349923Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:03:49.349923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2tCZVL47Aj6VFHJXeFD2k3DqaxmbDAxcmJHXrb4t0lxpA1Sudzs/qnOs5T4f0i0p9TbpKtAo4YOzaK6VCoflDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:03:49.350671Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.06025","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:47eacccbdd77c05eb627079c363ee19ea7137454b64a48022b3b95e42d5bb1ad","sha256:f2e97935ef219545315538b1107173dc327a8a5bbecf94354852131a262efaef"],"state_sha256":"b7a7ba1e33b4a343999804a1bb9cee8a2053471e0a91ce070b7cd6c47cc4da5e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pALUrS74QeONv2vYVjviD1B5DEPHlyVAfWxaBKiCjvnASLekMB96WPKgJkGkGME+Lv8/LPYLZvNhmRNiWmGJCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T16:01:40.452289Z","bundle_sha256":"7c44ce486d47d72d874d5008802ad086ae596aa2d84d51c3d00dd2c9eb0161d3"}}