{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:IG7ANDQE7PYES722BBGMQGBDCV","short_pith_number":"pith:IG7ANDQE","canonical_record":{"source":{"id":"1303.2478","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-03-11T10:35:51Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"2193cc74bdd2bc343d45a937038ba7b33c4939e131706d047ae8d899b128aca5","abstract_canon_sha256":"2b42e781b28cd92240d70b10cb07a64a7c4a2b58057d797b9e6cda6e61c526cc"},"schema_version":"1.0"},"canonical_sha256":"41be068e04fbf0497f5a084cc81823156ab9ab1a33da501293448a3fb2518d60","source":{"kind":"arxiv","id":"1303.2478","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.2478","created_at":"2026-05-18T03:25:43Z"},{"alias_kind":"arxiv_version","alias_value":"1303.2478v2","created_at":"2026-05-18T03:25:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.2478","created_at":"2026-05-18T03:25:43Z"},{"alias_kind":"pith_short_12","alias_value":"IG7ANDQE7PYE","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"IG7ANDQE7PYES722","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"IG7ANDQE","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:IG7ANDQE7PYES722BBGMQGBDCV","target":"record","payload":{"canonical_record":{"source":{"id":"1303.2478","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-03-11T10:35:51Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"2193cc74bdd2bc343d45a937038ba7b33c4939e131706d047ae8d899b128aca5","abstract_canon_sha256":"2b42e781b28cd92240d70b10cb07a64a7c4a2b58057d797b9e6cda6e61c526cc"},"schema_version":"1.0"},"canonical_sha256":"41be068e04fbf0497f5a084cc81823156ab9ab1a33da501293448a3fb2518d60","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:43.297740Z","signature_b64":"VuyoVeR/KeAVA0s9rsLMNpPgqJtowDxmMMVPnEkAB/uHYoNKMp51XsM2AExfOSrynQFi5C2VUioCnKDVQq+BDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41be068e04fbf0497f5a084cc81823156ab9ab1a33da501293448a3fb2518d60","last_reissued_at":"2026-05-18T03:25:43.296850Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:43.296850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.2478","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-18T03:25:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kwsIeszERDNF7m3CwjcY9nUOi22BZaggVPtpsphZ19iT6oYth2xq4auap93+WzoQUUTk8a7VxxpraK/fzgwfBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:50:02.966664Z"},"content_sha256":"09a889f16b3721d57ffd9b349a694989e736071765b9c308788f601149c35e26","schema_version":"1.0","event_id":"sha256:09a889f16b3721d57ffd9b349a694989e736071765b9c308788f601149c35e26"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:IG7ANDQE7PYES722BBGMQGBDCV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Price of Connectivity for Vertex Cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Eglantine Camby, Jean Cardinal, Oliver Schaudt, Samuel Fiorini","submitted_at":"2013-03-11T10:35:51Z","abstract_excerpt":"The vertex cover number of a graph is the minimum number of vertices that are needed to cover all edges. When those vertices are further required to induce a connected subgraph, the corresponding number is called the connected vertex cover number, and is always greater or equal to the vertex cover number.\n  Connected vertex covers are found in many applications, and the relationship between those two graph invariants is therefore a natural question to investigate. For that purpose, we introduce the {\\em Price of Connectivity}, defined as the ratio between the two vertex cover numbers. We prove"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.2478","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-18T03:25:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TXScMgn6Fxm73ipw3asKJTEVUwP0xXmH1+Yi8RdsnIUJv1e7KglD7vt4lU9ewPE4hK8/ywjeaipLQXeh/+cHAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:50:02.967336Z"},"content_sha256":"b76dcafc743570228f113b155e7cc0a86635ca9a0b57fb4e168df3528e8724d8","schema_version":"1.0","event_id":"sha256:b76dcafc743570228f113b155e7cc0a86635ca9a0b57fb4e168df3528e8724d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IG7ANDQE7PYES722BBGMQGBDCV/bundle.json","state_url":"https://pith.science/pith/IG7ANDQE7PYES722BBGMQGBDCV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IG7ANDQE7PYES722BBGMQGBDCV/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-26T23:50:02Z","links":{"resolver":"https://pith.science/pith/IG7ANDQE7PYES722BBGMQGBDCV","bundle":"https://pith.science/pith/IG7ANDQE7PYES722BBGMQGBDCV/bundle.json","state":"https://pith.science/pith/IG7ANDQE7PYES722BBGMQGBDCV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IG7ANDQE7PYES722BBGMQGBDCV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:IG7ANDQE7PYES722BBGMQGBDCV","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":"2b42e781b28cd92240d70b10cb07a64a7c4a2b58057d797b9e6cda6e61c526cc","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-03-11T10:35:51Z","title_canon_sha256":"2193cc74bdd2bc343d45a937038ba7b33c4939e131706d047ae8d899b128aca5"},"schema_version":"1.0","source":{"id":"1303.2478","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.2478","created_at":"2026-05-18T03:25:43Z"},{"alias_kind":"arxiv_version","alias_value":"1303.2478v2","created_at":"2026-05-18T03:25:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.2478","created_at":"2026-05-18T03:25:43Z"},{"alias_kind":"pith_short_12","alias_value":"IG7ANDQE7PYE","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"IG7ANDQE7PYES722","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"IG7ANDQE","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:b76dcafc743570228f113b155e7cc0a86635ca9a0b57fb4e168df3528e8724d8","target":"graph","created_at":"2026-05-18T03:25:43Z","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 vertex cover number of a graph is the minimum number of vertices that are needed to cover all edges. When those vertices are further required to induce a connected subgraph, the corresponding number is called the connected vertex cover number, and is always greater or equal to the vertex cover number.\n  Connected vertex covers are found in many applications, and the relationship between those two graph invariants is therefore a natural question to investigate. For that purpose, we introduce the {\\em Price of Connectivity}, defined as the ratio between the two vertex cover numbers. We prove","authors_text":"Eglantine Camby, Jean Cardinal, Oliver Schaudt, Samuel Fiorini","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-03-11T10:35:51Z","title":"The Price of Connectivity for Vertex Cover"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.2478","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:09a889f16b3721d57ffd9b349a694989e736071765b9c308788f601149c35e26","target":"record","created_at":"2026-05-18T03:25:43Z","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":"2b42e781b28cd92240d70b10cb07a64a7c4a2b58057d797b9e6cda6e61c526cc","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-03-11T10:35:51Z","title_canon_sha256":"2193cc74bdd2bc343d45a937038ba7b33c4939e131706d047ae8d899b128aca5"},"schema_version":"1.0","source":{"id":"1303.2478","kind":"arxiv","version":2}},"canonical_sha256":"41be068e04fbf0497f5a084cc81823156ab9ab1a33da501293448a3fb2518d60","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41be068e04fbf0497f5a084cc81823156ab9ab1a33da501293448a3fb2518d60","first_computed_at":"2026-05-18T03:25:43.296850Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:43.296850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VuyoVeR/KeAVA0s9rsLMNpPgqJtowDxmMMVPnEkAB/uHYoNKMp51XsM2AExfOSrynQFi5C2VUioCnKDVQq+BDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:43.297740Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.2478","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09a889f16b3721d57ffd9b349a694989e736071765b9c308788f601149c35e26","sha256:b76dcafc743570228f113b155e7cc0a86635ca9a0b57fb4e168df3528e8724d8"],"state_sha256":"3eb80c8da519e5cd62d7719b343b384a84e72cc9dcc38cbb9af09415b10e94aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xkCarOhLgG85Ykd39tJOMh+wtd+gIO7iF5waWrPtiUmHAvxPa6Tus0rAob9/l8NDD/4YjVwgTqcNbHYsAcc2Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T23:50:02.971075Z","bundle_sha256":"48e3fcc4e14f269f5288dfd041a41673e479a22489fcff4fc16e4afa0ef88ae3"}}