{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:TKDC37BGMXSXKK32AAWAM7K7QX","short_pith_number":"pith:TKDC37BG","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"},"canonical_sha256":"9a862dfc2665e5752b7a002c067d5f85fd4bed5c9e34ae6b245b5c1c255b6da1","source":{"kind":"arxiv","id":"1403.6331","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.6331","created_at":"2026-05-18T02:32:07Z"},{"alias_kind":"arxiv_version","alias_value":"1403.6331v2","created_at":"2026-05-18T02:32:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6331","created_at":"2026-05-18T02:32:07Z"},{"alias_kind":"pith_short_12","alias_value":"TKDC37BGMXSX","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TKDC37BGMXSXKK32","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TKDC37BG","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:TKDC37BGMXSXKK32AAWAM7K7QX","target":"record","payload":{"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"},"canonical_sha256":"9a862dfc2665e5752b7a002c067d5f85fd4bed5c9e34ae6b245b5c1c255b6da1","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"},"source_kind":"arxiv","source_id":"1403.6331","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-18T02:32:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R0rtk3dsEIyNoltVGNwoUvDvi9Fr+TgUiVXYnZkgqJWCKbSx/mZoaryGF/GXGgqwxmU78QlBeJqMettcz80IAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:52:38.802107Z"},"content_sha256":"b865f7541938e39c6e404a16e6d60dda59e6a1613877daab0496f5feb942511c","schema_version":"1.0","event_id":"sha256:b865f7541938e39c6e404a16e6d60dda59e6a1613877daab0496f5feb942511c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:TKDC37BGMXSXKK32AAWAM7K7QX","target":"graph","payload":{"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"},"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:32:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w9hQ+vSkIxzBLYZnrXh/KoRYmjAoIDO/S17V/bD2/y5cLUf2GYdrbi6EG3r2CZe4WfMnS6CS0WT+fIp3y/tTCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:52:38.802632Z"},"content_sha256":"7d5099d934de4e68b9687f292060e3de9198422449d4cde67eee37ab529d3362","schema_version":"1.0","event_id":"sha256:7d5099d934de4e68b9687f292060e3de9198422449d4cde67eee37ab529d3362"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TKDC37BGMXSXKK32AAWAM7K7QX/bundle.json","state_url":"https://pith.science/pith/TKDC37BGMXSXKK32AAWAM7K7QX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TKDC37BGMXSXKK32AAWAM7K7QX/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-26T22:52:38Z","links":{"resolver":"https://pith.science/pith/TKDC37BGMXSXKK32AAWAM7K7QX","bundle":"https://pith.science/pith/TKDC37BGMXSXKK32AAWAM7K7QX/bundle.json","state":"https://pith.science/pith/TKDC37BGMXSXKK32AAWAM7K7QX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TKDC37BGMXSXKK32AAWAM7K7QX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TKDC37BGMXSXKK32AAWAM7K7QX","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":"95f35d975d6e6ae163ee09d20ecbd4e7ab42ac9e5b0dcc55e53bca61a534a695","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-25T13:11:09Z","title_canon_sha256":"0dc6baaa7bdf9889058a32cfe0d95341d9ed9e16e5cd39f0d0972c21c605166d"},"schema_version":"1.0","source":{"id":"1403.6331","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.6331","created_at":"2026-05-18T02:32:07Z"},{"alias_kind":"arxiv_version","alias_value":"1403.6331v2","created_at":"2026-05-18T02:32:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6331","created_at":"2026-05-18T02:32:07Z"},{"alias_kind":"pith_short_12","alias_value":"TKDC37BGMXSX","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TKDC37BGMXSXKK32","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TKDC37BG","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:7d5099d934de4e68b9687f292060e3de9198422449d4cde67eee37ab529d3362","target":"graph","created_at":"2026-05-18T02:32:07Z","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 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","authors_text":"Markus Sortland Dregi, P{\\aa}l Gr{\\o}n{\\aa}s Drange, Pim van 't Hof","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-25T13:11:09Z","title":"On the Computational Complexity of Vertex Integrity and Component Order Connectivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.6331","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:b865f7541938e39c6e404a16e6d60dda59e6a1613877daab0496f5feb942511c","target":"record","created_at":"2026-05-18T02:32:07Z","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":"95f35d975d6e6ae163ee09d20ecbd4e7ab42ac9e5b0dcc55e53bca61a534a695","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-25T13:11:09Z","title_canon_sha256":"0dc6baaa7bdf9889058a32cfe0d95341d9ed9e16e5cd39f0d0972c21c605166d"},"schema_version":"1.0","source":{"id":"1403.6331","kind":"arxiv","version":2}},"canonical_sha256":"9a862dfc2665e5752b7a002c067d5f85fd4bed5c9e34ae6b245b5c1c255b6da1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a862dfc2665e5752b7a002c067d5f85fd4bed5c9e34ae6b245b5c1c255b6da1","first_computed_at":"2026-05-18T02:32:07.521030Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:07.521030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CsleePz0EsfhTZQeJo/hRBNLKRW621SbST0Mnodx7Bsu3OlNadANmp172qNmwdmeGKWz5sXj3JVoWMPeI6M8BA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:07.521430Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.6331","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b865f7541938e39c6e404a16e6d60dda59e6a1613877daab0496f5feb942511c","sha256:7d5099d934de4e68b9687f292060e3de9198422449d4cde67eee37ab529d3362"],"state_sha256":"7844ae108190cfd4c3a66e8625fbe2ef5a122c41e0a02cfcbbc7c79818dbb71b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5aXVqC/9/CYxT4NW0XrlBHelzCrZnVt+dMyY/5ADbACmMUc9Z/M595HDE8Y8fRgWHKBVW+YqyWVhVR2MubDKBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T22:52:38.806127Z","bundle_sha256":"2c2e23c31033a7169f564675a5563610509646be04d2a017dd966aa85def7b8d"}}