{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TKDC37BGMXSXKK32AAWAM7K7QX","short_pith_number":"pith:TKDC37BG","schema_version":"1.0","canonical_sha256":"9a862dfc2665e5752b7a002c067d5f85fd4bed5c9e34ae6b245b5c1c255b6da1","source":{"kind":"arxiv","id":"1403.6331","version":2},"attestation_state":"computed","paper":{"title":"On the Computational Complexity of Vertex Integrity and Component Order Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Markus Sortland Dregi, P{\\aa}l Gr{\\o}n{\\aa}s Drange, Pim van 't Hof","submitted_at":"2014-03-25T13:11:09Z","abstract_excerpt":"The Weighted Vertex Integrity (wVI) problem takes as input an $n$-vertex graph $G$, a weight function $w:V(G)\\to\\mathbb{N}$, and an integer $p$. The task is to decide if there exists a set $X\\subseteq V(G)$ such that the weight of $X$ plus the weight of a heaviest component of $G-X$ is at most $p$. Among other results, we prove that:\n  (1) wVI is NP-complete on co-comparability graphs, even if each vertex has weight $1$;\n  (2) wVI can be solved in $O(p^{p+1}n)$ time;\n  (3) wVI admits a kernel with at most $p^3$ vertices.\n  Result (1) refutes a conjecture by Ray and Deogun and answers an open q"},"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":"1403.6331","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-25T13:11:09Z","cross_cats_sorted":[],"title_canon_sha256":"0dc6baaa7bdf9889058a32cfe0d95341d9ed9e16e5cd39f0d0972c21c605166d","abstract_canon_sha256":"95f35d975d6e6ae163ee09d20ecbd4e7ab42ac9e5b0dcc55e53bca61a534a695"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:07.521430Z","signature_b64":"CsleePz0EsfhTZQeJo/hRBNLKRW621SbST0Mnodx7Bsu3OlNadANmp172qNmwdmeGKWz5sXj3JVoWMPeI6M8BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a862dfc2665e5752b7a002c067d5f85fd4bed5c9e34ae6b245b5c1c255b6da1","last_reissued_at":"2026-05-18T02:32:07.521030Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:07.521030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Computational Complexity of Vertex Integrity and Component Order Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Markus Sortland Dregi, P{\\aa}l Gr{\\o}n{\\aa}s Drange, Pim van 't Hof","submitted_at":"2014-03-25T13:11:09Z","abstract_excerpt":"The Weighted Vertex Integrity (wVI) problem takes as input an $n$-vertex graph $G$, a weight function $w:V(G)\\to\\mathbb{N}$, and an integer $p$. The task is to decide if there exists a set $X\\subseteq V(G)$ such that the weight of $X$ plus the weight of a heaviest component of $G-X$ is at most $p$. Among other results, we prove that:\n  (1) wVI is NP-complete on co-comparability graphs, even if each vertex has weight $1$;\n  (2) wVI can be solved in $O(p^{p+1}n)$ time;\n  (3) wVI admits a kernel with at most $p^3$ vertices.\n  Result (1) refutes a conjecture by Ray and Deogun and answers an open q"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.6331","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":"1403.6331","created_at":"2026-05-18T02:32:07.521090+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.6331v2","created_at":"2026-05-18T02:32:07.521090+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6331","created_at":"2026-05-18T02:32:07.521090+00:00"},{"alias_kind":"pith_short_12","alias_value":"TKDC37BGMXSX","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"TKDC37BGMXSXKK32","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"TKDC37BG","created_at":"2026-05-18T12:28:49.207871+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/TKDC37BGMXSXKK32AAWAM7K7QX","json":"https://pith.science/pith/TKDC37BGMXSXKK32AAWAM7K7QX.json","graph_json":"https://pith.science/api/pith-number/TKDC37BGMXSXKK32AAWAM7K7QX/graph.json","events_json":"https://pith.science/api/pith-number/TKDC37BGMXSXKK32AAWAM7K7QX/events.json","paper":"https://pith.science/paper/TKDC37BG"},"agent_actions":{"view_html":"https://pith.science/pith/TKDC37BGMXSXKK32AAWAM7K7QX","download_json":"https://pith.science/pith/TKDC37BGMXSXKK32AAWAM7K7QX.json","view_paper":"https://pith.science/paper/TKDC37BG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.6331&json=true","fetch_graph":"https://pith.science/api/pith-number/TKDC37BGMXSXKK32AAWAM7K7QX/graph.json","fetch_events":"https://pith.science/api/pith-number/TKDC37BGMXSXKK32AAWAM7K7QX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TKDC37BGMXSXKK32AAWAM7K7QX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TKDC37BGMXSXKK32AAWAM7K7QX/action/storage_attestation","attest_author":"https://pith.science/pith/TKDC37BGMXSXKK32AAWAM7K7QX/action/author_attestation","sign_citation":"https://pith.science/pith/TKDC37BGMXSXKK32AAWAM7K7QX/action/citation_signature","submit_replication":"https://pith.science/pith/TKDC37BGMXSXKK32AAWAM7K7QX/action/replication_record"}},"created_at":"2026-05-18T02:32:07.521090+00:00","updated_at":"2026-05-18T02:32:07.521090+00:00"}