{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7TPM33KQ64RUQ2KG6TDJBDN6EE","short_pith_number":"pith:7TPM33KQ","schema_version":"1.0","canonical_sha256":"fcdecded50f723486946f4c6908dbe21183377310ac334c7b37d06b887a52de9","source":{"kind":"arxiv","id":"1805.04223","version":2},"attestation_state":"computed","paper":{"title":"Computing Coverage Kernels Under Restricted Settings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Javiel Rojas-Ledesma, J\\'er\\'emy Barbay, Pablo P\\'erez-Lantero","submitted_at":"2018-05-11T02:08:49Z","abstract_excerpt":"We consider the Minimum Coverage Kernel problem: given a set $B$ of $d$-dimensional boxes, find a subset of $B$ of minimum size covering the same region as $B$. This problem is $\\mathsf{NP}$-hard, but as for many $\\mathsf{NP}$-hard problems on graphs, the problem becomes solvable in polynomial time under restrictions on the graph induced by $B$. We consider various classes of graphs, show that Minimum Coverage Kernel remains $\\mathsf{NP}$-hard even for severely restricted instances, and provide two polynomial time approximation algorithms for this problem."},"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":"1805.04223","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-05-11T02:08:49Z","cross_cats_sorted":[],"title_canon_sha256":"07df46dd5d46915917722eae887c74248e25e05dc52cdc6a13e807a09cffae37","abstract_canon_sha256":"068eafe65ac946e5b1042e82d47f97b693d35095812d3d73b14e1932e66101d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:49.396290Z","signature_b64":"u1zLs/bjveEZHQTdl59Vmnr2ej0P5DDnG8j5niwpJ5mx/OSfaRpMaXnrbsUFkWYCKY2MCI5TcRmqpF6XT8SPAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fcdecded50f723486946f4c6908dbe21183377310ac334c7b37d06b887a52de9","last_reissued_at":"2026-05-18T00:15:49.395406Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:49.395406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing Coverage Kernels Under Restricted Settings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Javiel Rojas-Ledesma, J\\'er\\'emy Barbay, Pablo P\\'erez-Lantero","submitted_at":"2018-05-11T02:08:49Z","abstract_excerpt":"We consider the Minimum Coverage Kernel problem: given a set $B$ of $d$-dimensional boxes, find a subset of $B$ of minimum size covering the same region as $B$. This problem is $\\mathsf{NP}$-hard, but as for many $\\mathsf{NP}$-hard problems on graphs, the problem becomes solvable in polynomial time under restrictions on the graph induced by $B$. We consider various classes of graphs, show that Minimum Coverage Kernel remains $\\mathsf{NP}$-hard even for severely restricted instances, and provide two polynomial time approximation algorithms for this problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04223","kind":"arxiv","version":2},"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":"1805.04223","created_at":"2026-05-18T00:15:49.395547+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.04223v2","created_at":"2026-05-18T00:15:49.395547+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04223","created_at":"2026-05-18T00:15:49.395547+00:00"},{"alias_kind":"pith_short_12","alias_value":"7TPM33KQ64RU","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7TPM33KQ64RUQ2KG","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7TPM33KQ","created_at":"2026-05-18T12:32:11.075285+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/7TPM33KQ64RUQ2KG6TDJBDN6EE","json":"https://pith.science/pith/7TPM33KQ64RUQ2KG6TDJBDN6EE.json","graph_json":"https://pith.science/api/pith-number/7TPM33KQ64RUQ2KG6TDJBDN6EE/graph.json","events_json":"https://pith.science/api/pith-number/7TPM33KQ64RUQ2KG6TDJBDN6EE/events.json","paper":"https://pith.science/paper/7TPM33KQ"},"agent_actions":{"view_html":"https://pith.science/pith/7TPM33KQ64RUQ2KG6TDJBDN6EE","download_json":"https://pith.science/pith/7TPM33KQ64RUQ2KG6TDJBDN6EE.json","view_paper":"https://pith.science/paper/7TPM33KQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.04223&json=true","fetch_graph":"https://pith.science/api/pith-number/7TPM33KQ64RUQ2KG6TDJBDN6EE/graph.json","fetch_events":"https://pith.science/api/pith-number/7TPM33KQ64RUQ2KG6TDJBDN6EE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7TPM33KQ64RUQ2KG6TDJBDN6EE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7TPM33KQ64RUQ2KG6TDJBDN6EE/action/storage_attestation","attest_author":"https://pith.science/pith/7TPM33KQ64RUQ2KG6TDJBDN6EE/action/author_attestation","sign_citation":"https://pith.science/pith/7TPM33KQ64RUQ2KG6TDJBDN6EE/action/citation_signature","submit_replication":"https://pith.science/pith/7TPM33KQ64RUQ2KG6TDJBDN6EE/action/replication_record"}},"created_at":"2026-05-18T00:15:49.395547+00:00","updated_at":"2026-05-18T00:15:49.395547+00:00"}