{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YO7WSKNN5DHLRLL7VLKGCUYVCH","short_pith_number":"pith:YO7WSKNN","schema_version":"1.0","canonical_sha256":"c3bf6929ade8ceb8ad7faad461531511d8989c8707dba5faac08bec8bba6d717","source":{"kind":"arxiv","id":"1505.06025","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1505.06025","created_at":"2026-05-18T02:03:49.350044+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.06025v1","created_at":"2026-05-18T02:03:49.350044+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06025","created_at":"2026-05-18T02:03:49.350044+00:00"},{"alias_kind":"pith_short_12","alias_value":"YO7WSKNN5DHL","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"YO7WSKNN5DHLRLL7","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"YO7WSKNN","created_at":"2026-05-18T12:29:50.041715+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/YO7WSKNN5DHLRLL7VLKGCUYVCH","json":"https://pith.science/pith/YO7WSKNN5DHLRLL7VLKGCUYVCH.json","graph_json":"https://pith.science/api/pith-number/YO7WSKNN5DHLRLL7VLKGCUYVCH/graph.json","events_json":"https://pith.science/api/pith-number/YO7WSKNN5DHLRLL7VLKGCUYVCH/events.json","paper":"https://pith.science/paper/YO7WSKNN"},"agent_actions":{"view_html":"https://pith.science/pith/YO7WSKNN5DHLRLL7VLKGCUYVCH","download_json":"https://pith.science/pith/YO7WSKNN5DHLRLL7VLKGCUYVCH.json","view_paper":"https://pith.science/paper/YO7WSKNN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.06025&json=true","fetch_graph":"https://pith.science/api/pith-number/YO7WSKNN5DHLRLL7VLKGCUYVCH/graph.json","fetch_events":"https://pith.science/api/pith-number/YO7WSKNN5DHLRLL7VLKGCUYVCH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YO7WSKNN5DHLRLL7VLKGCUYVCH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YO7WSKNN5DHLRLL7VLKGCUYVCH/action/storage_attestation","attest_author":"https://pith.science/pith/YO7WSKNN5DHLRLL7VLKGCUYVCH/action/author_attestation","sign_citation":"https://pith.science/pith/YO7WSKNN5DHLRLL7VLKGCUYVCH/action/citation_signature","submit_replication":"https://pith.science/pith/YO7WSKNN5DHLRLL7VLKGCUYVCH/action/replication_record"}},"created_at":"2026-05-18T02:03:49.350044+00:00","updated_at":"2026-05-18T02:03:49.350044+00:00"}