{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GB6MADSO56KRCVMQIX7ZZ7CML4","short_pith_number":"pith:GB6MADSO","canonical_record":{"source":{"id":"1712.08362","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-22T09:18:52Z","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"title_canon_sha256":"8d2b48aeb97cdfc13037c269c9886cc01a1bc1cf52193c50b7efca73d616454c","abstract_canon_sha256":"003abd69e013f9dbfbfb1f4b7e2ce8c5f6c5d05f71903b6a521bb527d01f68cb"},"schema_version":"1.0"},"canonical_sha256":"307cc00e4eef9511559045ff9cfc4c5f3ca66098adf2c38d94dd0e84b3032aff","source":{"kind":"arxiv","id":"1712.08362","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.08362","created_at":"2026-05-18T00:11:28Z"},{"alias_kind":"arxiv_version","alias_value":"1712.08362v3","created_at":"2026-05-18T00:11:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08362","created_at":"2026-05-18T00:11:28Z"},{"alias_kind":"pith_short_12","alias_value":"GB6MADSO56KR","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GB6MADSO56KRCVMQ","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GB6MADSO","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GB6MADSO56KRCVMQIX7ZZ7CML4","target":"record","payload":{"canonical_record":{"source":{"id":"1712.08362","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-22T09:18:52Z","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"title_canon_sha256":"8d2b48aeb97cdfc13037c269c9886cc01a1bc1cf52193c50b7efca73d616454c","abstract_canon_sha256":"003abd69e013f9dbfbfb1f4b7e2ce8c5f6c5d05f71903b6a521bb527d01f68cb"},"schema_version":"1.0"},"canonical_sha256":"307cc00e4eef9511559045ff9cfc4c5f3ca66098adf2c38d94dd0e84b3032aff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:28.112013Z","signature_b64":"HbC3Td4Cc23cxIYJJR9VG1Pd71fXgzARsgNa8PtEreaUwBtJ4G1El53qTqIp9InJ6eZ9i9jVG9cXOpZMjiUiBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"307cc00e4eef9511559045ff9cfc4c5f3ca66098adf2c38d94dd0e84b3032aff","last_reissued_at":"2026-05-18T00:11:28.111638Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:28.111638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.08362","source_version":3,"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:11:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oIXp5MWT2njxR6XevnKtxxsphp3ae5gq3bC8qS0TclY3IP/U093LDougMEX+Tn4mY58Untne3HE8NuC4p1yGDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:43:59.067522Z"},"content_sha256":"3f2e785581a4d7c2ac8a721ffeef7d96a901b3163c41fbbe1fdaef5df0d86274","schema_version":"1.0","event_id":"sha256:3f2e785581a4d7c2ac8a721ffeef7d96a901b3163c41fbbe1fdaef5df0d86274"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GB6MADSO56KRCVMQIX7ZZ7CML4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Connected Vertex Cover for $(sP_1+P_5)$-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Daniel Paulusma, Giacomo Paesani, Matthew Johnson","submitted_at":"2017-12-22T09:18:52Z","abstract_excerpt":"The Connected Vertex Cover problem is to decide if a graph G has a vertex cover of size at most $k$ that induces a connected subgraph of $G$. This is a well-studied problem, known to be NP-complete for restricted graph classes, and, in particular, for $H$-free graphs if $H$ is not a linear forest (a graph is $H$-free if it does not contain $H$ as an induced subgraph). It is easy to see that Connected Vertex Cover is polynomial-time solvable for $P_4$-free graphs. We continue the search for tractable graph classes: we prove that it is also polynomial-time solvable for $(sP_1+P_5)$-free graphs f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.08362","kind":"arxiv","version":3},"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:11:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kuO1astA2dJc6yp9Q2+rz4WvvVaDz09kTl6t3iWfWyzquCnYmO62OBH+OJvE8buaf09sHcFY5I+GI8qEoUciAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:43:59.067908Z"},"content_sha256":"65426f2da2d1f7bcde9f3ec1f5ea9ad222634f6db4f61cf04a225894b1ef0cd4","schema_version":"1.0","event_id":"sha256:65426f2da2d1f7bcde9f3ec1f5ea9ad222634f6db4f61cf04a225894b1ef0cd4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GB6MADSO56KRCVMQIX7ZZ7CML4/bundle.json","state_url":"https://pith.science/pith/GB6MADSO56KRCVMQIX7ZZ7CML4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GB6MADSO56KRCVMQIX7ZZ7CML4/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-02T15:43:59Z","links":{"resolver":"https://pith.science/pith/GB6MADSO56KRCVMQIX7ZZ7CML4","bundle":"https://pith.science/pith/GB6MADSO56KRCVMQIX7ZZ7CML4/bundle.json","state":"https://pith.science/pith/GB6MADSO56KRCVMQIX7ZZ7CML4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GB6MADSO56KRCVMQIX7ZZ7CML4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GB6MADSO56KRCVMQIX7ZZ7CML4","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":"003abd69e013f9dbfbfb1f4b7e2ce8c5f6c5d05f71903b6a521bb527d01f68cb","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-22T09:18:52Z","title_canon_sha256":"8d2b48aeb97cdfc13037c269c9886cc01a1bc1cf52193c50b7efca73d616454c"},"schema_version":"1.0","source":{"id":"1712.08362","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.08362","created_at":"2026-05-18T00:11:28Z"},{"alias_kind":"arxiv_version","alias_value":"1712.08362v3","created_at":"2026-05-18T00:11:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08362","created_at":"2026-05-18T00:11:28Z"},{"alias_kind":"pith_short_12","alias_value":"GB6MADSO56KR","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GB6MADSO56KRCVMQ","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GB6MADSO","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:65426f2da2d1f7bcde9f3ec1f5ea9ad222634f6db4f61cf04a225894b1ef0cd4","target":"graph","created_at":"2026-05-18T00:11:28Z","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 Connected Vertex Cover problem is to decide if a graph G has a vertex cover of size at most $k$ that induces a connected subgraph of $G$. This is a well-studied problem, known to be NP-complete for restricted graph classes, and, in particular, for $H$-free graphs if $H$ is not a linear forest (a graph is $H$-free if it does not contain $H$ as an induced subgraph). It is easy to see that Connected Vertex Cover is polynomial-time solvable for $P_4$-free graphs. We continue the search for tractable graph classes: we prove that it is also polynomial-time solvable for $(sP_1+P_5)$-free graphs f","authors_text":"Daniel Paulusma, Giacomo Paesani, Matthew Johnson","cross_cats":["cs.CC","cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-22T09:18:52Z","title":"Connected Vertex Cover for $(sP_1+P_5)$-Free Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.08362","kind":"arxiv","version":3},"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:3f2e785581a4d7c2ac8a721ffeef7d96a901b3163c41fbbe1fdaef5df0d86274","target":"record","created_at":"2026-05-18T00:11:28Z","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":"003abd69e013f9dbfbfb1f4b7e2ce8c5f6c5d05f71903b6a521bb527d01f68cb","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-22T09:18:52Z","title_canon_sha256":"8d2b48aeb97cdfc13037c269c9886cc01a1bc1cf52193c50b7efca73d616454c"},"schema_version":"1.0","source":{"id":"1712.08362","kind":"arxiv","version":3}},"canonical_sha256":"307cc00e4eef9511559045ff9cfc4c5f3ca66098adf2c38d94dd0e84b3032aff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"307cc00e4eef9511559045ff9cfc4c5f3ca66098adf2c38d94dd0e84b3032aff","first_computed_at":"2026-05-18T00:11:28.111638Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:28.111638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HbC3Td4Cc23cxIYJJR9VG1Pd71fXgzARsgNa8PtEreaUwBtJ4G1El53qTqIp9InJ6eZ9i9jVG9cXOpZMjiUiBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:28.112013Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.08362","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f2e785581a4d7c2ac8a721ffeef7d96a901b3163c41fbbe1fdaef5df0d86274","sha256:65426f2da2d1f7bcde9f3ec1f5ea9ad222634f6db4f61cf04a225894b1ef0cd4"],"state_sha256":"04257fe2505424dcdb9a69ce4bc6b03dca1fe6856630923715a697d913d0fbe3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oUV1/R3GqiKplXXscA7XDmJIWnXklyZk+KyVau+uPK2i4BeWO7QGbYnjnXm9FwJLCoZeAxw/rfxjFVc6BW+oBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T15:43:59.069975Z","bundle_sha256":"1bd6d0852e47f622e2a1b52c1ab17763bc1bd9cd5304cd7c45d9de2aa8656171"}}