{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7TPM33KQ64RUQ2KG6TDJBDN6EE","short_pith_number":"pith:7TPM33KQ","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"},"canonical_sha256":"fcdecded50f723486946f4c6908dbe21183377310ac334c7b37d06b887a52de9","source":{"kind":"arxiv","id":"1805.04223","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.04223","created_at":"2026-05-18T00:15:49Z"},{"alias_kind":"arxiv_version","alias_value":"1805.04223v2","created_at":"2026-05-18T00:15:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04223","created_at":"2026-05-18T00:15:49Z"},{"alias_kind":"pith_short_12","alias_value":"7TPM33KQ64RU","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7TPM33KQ64RUQ2KG","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7TPM33KQ","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7TPM33KQ64RUQ2KG6TDJBDN6EE","target":"record","payload":{"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"},"canonical_sha256":"fcdecded50f723486946f4c6908dbe21183377310ac334c7b37d06b887a52de9","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"},"source_kind":"arxiv","source_id":"1805.04223","source_version":2,"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-18T00:15:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7uzK65IuKA3kTUkBIhdcEcAhv8dD0h3uLFpo3+8X8sDvqRgIWQTlqm/mWt4bkvU9Kvl+vPdGIhLnCo9uz09wDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:20:22.975360Z"},"content_sha256":"6917052734e19a748b9ea9e8529ee8598680dcc1d57ee4df895387ae4849eedc","schema_version":"1.0","event_id":"sha256:6917052734e19a748b9ea9e8529ee8598680dcc1d57ee4df895387ae4849eedc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7TPM33KQ64RUQ2KG6TDJBDN6EE","target":"graph","payload":{"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"},"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-18T00:15:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ayr4onA3YfL0zI9PF2CQ7ECG5oSuNbC9et5P79USzbFx3yAWBfsGrHSCRXdMmSvIKVNmQetNzNwQsnvKLiATCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:20:22.975707Z"},"content_sha256":"a7182da81a26fe2365c8bca11b5187bfbd06755934316e2d18e9505e243ea93b","schema_version":"1.0","event_id":"sha256:a7182da81a26fe2365c8bca11b5187bfbd06755934316e2d18e9505e243ea93b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7TPM33KQ64RUQ2KG6TDJBDN6EE/bundle.json","state_url":"https://pith.science/pith/7TPM33KQ64RUQ2KG6TDJBDN6EE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7TPM33KQ64RUQ2KG6TDJBDN6EE/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-01T20:20:22Z","links":{"resolver":"https://pith.science/pith/7TPM33KQ64RUQ2KG6TDJBDN6EE","bundle":"https://pith.science/pith/7TPM33KQ64RUQ2KG6TDJBDN6EE/bundle.json","state":"https://pith.science/pith/7TPM33KQ64RUQ2KG6TDJBDN6EE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7TPM33KQ64RUQ2KG6TDJBDN6EE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7TPM33KQ64RUQ2KG6TDJBDN6EE","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":"068eafe65ac946e5b1042e82d47f97b693d35095812d3d73b14e1932e66101d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-05-11T02:08:49Z","title_canon_sha256":"07df46dd5d46915917722eae887c74248e25e05dc52cdc6a13e807a09cffae37"},"schema_version":"1.0","source":{"id":"1805.04223","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.04223","created_at":"2026-05-18T00:15:49Z"},{"alias_kind":"arxiv_version","alias_value":"1805.04223v2","created_at":"2026-05-18T00:15:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04223","created_at":"2026-05-18T00:15:49Z"},{"alias_kind":"pith_short_12","alias_value":"7TPM33KQ64RU","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7TPM33KQ64RUQ2KG","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7TPM33KQ","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:a7182da81a26fe2365c8bca11b5187bfbd06755934316e2d18e9505e243ea93b","target":"graph","created_at":"2026-05-18T00:15: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":"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.","authors_text":"Javiel Rojas-Ledesma, J\\'er\\'emy Barbay, Pablo P\\'erez-Lantero","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-05-11T02:08:49Z","title":"Computing Coverage Kernels Under Restricted Settings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04223","kind":"arxiv","version":2},"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:6917052734e19a748b9ea9e8529ee8598680dcc1d57ee4df895387ae4849eedc","target":"record","created_at":"2026-05-18T00:15: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":"068eafe65ac946e5b1042e82d47f97b693d35095812d3d73b14e1932e66101d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-05-11T02:08:49Z","title_canon_sha256":"07df46dd5d46915917722eae887c74248e25e05dc52cdc6a13e807a09cffae37"},"schema_version":"1.0","source":{"id":"1805.04223","kind":"arxiv","version":2}},"canonical_sha256":"fcdecded50f723486946f4c6908dbe21183377310ac334c7b37d06b887a52de9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fcdecded50f723486946f4c6908dbe21183377310ac334c7b37d06b887a52de9","first_computed_at":"2026-05-18T00:15:49.395406Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:49.395406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u1zLs/bjveEZHQTdl59Vmnr2ej0P5DDnG8j5niwpJ5mx/OSfaRpMaXnrbsUFkWYCKY2MCI5TcRmqpF6XT8SPAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:49.396290Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.04223","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6917052734e19a748b9ea9e8529ee8598680dcc1d57ee4df895387ae4849eedc","sha256:a7182da81a26fe2365c8bca11b5187bfbd06755934316e2d18e9505e243ea93b"],"state_sha256":"74733d1bbc0e4ee336e02747ab4c7b7f48f4bad239fe40cf54a623876fbb1f5a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q7VKRXhI3i6N46XW0OpA4dkhv4/3fbdgF0er64VdsaIzvcvdPHjYUWz2IgtOrMIKp2/ADQIxMndOLnkJuPR5Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T20:20:22.977565Z","bundle_sha256":"d362b4254b68907d385a155514e8d8fc1e9bd05970179d871c7375dd0f3a08d0"}}