{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZVHOXCAKOXOLINAFRF5EV2ZGH4","short_pith_number":"pith:ZVHOXCAK","canonical_record":{"source":{"id":"1510.02639","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-09T11:36:23Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"aff87a0d75a81742c0a40352b0197c4145a78599c56b56c67a611df2cc685a39","abstract_canon_sha256":"7de29767ec9874cd3413cbb025d2e76ab8c4ab9457b0195f0b5e0eac4034d8c0"},"schema_version":"1.0"},"canonical_sha256":"cd4eeb880a75dcb43405897a4aeb263f0a957def2525d985ecd5c0c2aa1044e5","source":{"kind":"arxiv","id":"1510.02639","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.02639","created_at":"2026-05-18T01:30:41Z"},{"alias_kind":"arxiv_version","alias_value":"1510.02639v1","created_at":"2026-05-18T01:30:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02639","created_at":"2026-05-18T01:30:41Z"},{"alias_kind":"pith_short_12","alias_value":"ZVHOXCAKOXOL","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZVHOXCAKOXOLINAF","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZVHOXCAK","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZVHOXCAKOXOLINAFRF5EV2ZGH4","target":"record","payload":{"canonical_record":{"source":{"id":"1510.02639","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-09T11:36:23Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"aff87a0d75a81742c0a40352b0197c4145a78599c56b56c67a611df2cc685a39","abstract_canon_sha256":"7de29767ec9874cd3413cbb025d2e76ab8c4ab9457b0195f0b5e0eac4034d8c0"},"schema_version":"1.0"},"canonical_sha256":"cd4eeb880a75dcb43405897a4aeb263f0a957def2525d985ecd5c0c2aa1044e5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:41.856644Z","signature_b64":"LRM60q1sK9eTyAv/BfuUfMokab69066UmAfshpuFOSufmJ0l9+SLhFK5wb4lPjNhzbm2ksWAyCDw9HnGTwUFBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd4eeb880a75dcb43405897a4aeb263f0a957def2525d985ecd5c0c2aa1044e5","last_reissued_at":"2026-05-18T01:30:41.855992Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:41.855992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.02639","source_version":1,"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-18T01:30:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VZTvzPtGzKucyJm7INMdji6t8nn+s4XbCwoi+xgkwgAoUbDUywn5332X0DnjALosaj3c6uOCz/7O2ZtPJRi+Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:54:09.873357Z"},"content_sha256":"a8a361bb80091224792a2848086b50ed75b1a43a07ba5214f1773d68fe8837f2","schema_version":"1.0","event_id":"sha256:a8a361bb80091224792a2848086b50ed75b1a43a07ba5214f1773d68fe8837f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZVHOXCAKOXOLINAFRF5EV2ZGH4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Price of Connectivity for Feedback Vertex Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Dani\\\"el Paulusma, Marcin Kami\\'nski, Pim van 't Hof, R\\'emy Belmonte","submitted_at":"2015-10-09T11:36:23Z","abstract_excerpt":"Let fvs$(G)$ and cfvs(G) denote the cardinalities of a minimum feedback vertex set and a minimum connected feedback vertex set of a graph $G$, respectively. The price of connectivity for feedback vertex set (poc-fvs) for a class of graphs ${\\cal G}$ is defined as the maximum ratio $\\mbox{cfvs}(G)/\\mbox{fvs}(G)$ over all connected graphs $G\\in {\\cal G}$. We study the poc-fvs for graph classes defined by a finite family ${\\cal H}$ of forbidden induced subgraphs. We characterize exactly those finite families ${\\cal H}$ for which the poc-fvs for ${\\cal H}$-free graphs is upper bounded by a constan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02639","kind":"arxiv","version":1},"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-18T01:30:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9dRTzbK1DStKax8LhGSJReNeu3B4228Zh0ngSMoSemYkf2/7DV5kRHFDEcGJLR6sbFW+ZrVSrRBZaATNHAlIBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:54:09.874016Z"},"content_sha256":"ee16fb7fbdad5dbeffdce806110fdb677420a8fc34ddb5ea3d27ca8b82fbe25c","schema_version":"1.0","event_id":"sha256:ee16fb7fbdad5dbeffdce806110fdb677420a8fc34ddb5ea3d27ca8b82fbe25c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZVHOXCAKOXOLINAFRF5EV2ZGH4/bundle.json","state_url":"https://pith.science/pith/ZVHOXCAKOXOLINAFRF5EV2ZGH4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZVHOXCAKOXOLINAFRF5EV2ZGH4/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-05T01:54:09Z","links":{"resolver":"https://pith.science/pith/ZVHOXCAKOXOLINAFRF5EV2ZGH4","bundle":"https://pith.science/pith/ZVHOXCAKOXOLINAFRF5EV2ZGH4/bundle.json","state":"https://pith.science/pith/ZVHOXCAKOXOLINAFRF5EV2ZGH4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZVHOXCAKOXOLINAFRF5EV2ZGH4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZVHOXCAKOXOLINAFRF5EV2ZGH4","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":"7de29767ec9874cd3413cbb025d2e76ab8c4ab9457b0195f0b5e0eac4034d8c0","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-09T11:36:23Z","title_canon_sha256":"aff87a0d75a81742c0a40352b0197c4145a78599c56b56c67a611df2cc685a39"},"schema_version":"1.0","source":{"id":"1510.02639","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.02639","created_at":"2026-05-18T01:30:41Z"},{"alias_kind":"arxiv_version","alias_value":"1510.02639v1","created_at":"2026-05-18T01:30:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02639","created_at":"2026-05-18T01:30:41Z"},{"alias_kind":"pith_short_12","alias_value":"ZVHOXCAKOXOL","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZVHOXCAKOXOLINAF","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZVHOXCAK","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:ee16fb7fbdad5dbeffdce806110fdb677420a8fc34ddb5ea3d27ca8b82fbe25c","target":"graph","created_at":"2026-05-18T01:30:41Z","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":"Let fvs$(G)$ and cfvs(G) denote the cardinalities of a minimum feedback vertex set and a minimum connected feedback vertex set of a graph $G$, respectively. The price of connectivity for feedback vertex set (poc-fvs) for a class of graphs ${\\cal G}$ is defined as the maximum ratio $\\mbox{cfvs}(G)/\\mbox{fvs}(G)$ over all connected graphs $G\\in {\\cal G}$. We study the poc-fvs for graph classes defined by a finite family ${\\cal H}$ of forbidden induced subgraphs. We characterize exactly those finite families ${\\cal H}$ for which the poc-fvs for ${\\cal H}$-free graphs is upper bounded by a constan","authors_text":"Dani\\\"el Paulusma, Marcin Kami\\'nski, Pim van 't Hof, R\\'emy Belmonte","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-09T11:36:23Z","title":"The Price of Connectivity for Feedback Vertex Set"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02639","kind":"arxiv","version":1},"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:a8a361bb80091224792a2848086b50ed75b1a43a07ba5214f1773d68fe8837f2","target":"record","created_at":"2026-05-18T01:30:41Z","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":"7de29767ec9874cd3413cbb025d2e76ab8c4ab9457b0195f0b5e0eac4034d8c0","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-09T11:36:23Z","title_canon_sha256":"aff87a0d75a81742c0a40352b0197c4145a78599c56b56c67a611df2cc685a39"},"schema_version":"1.0","source":{"id":"1510.02639","kind":"arxiv","version":1}},"canonical_sha256":"cd4eeb880a75dcb43405897a4aeb263f0a957def2525d985ecd5c0c2aa1044e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd4eeb880a75dcb43405897a4aeb263f0a957def2525d985ecd5c0c2aa1044e5","first_computed_at":"2026-05-18T01:30:41.855992Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:41.855992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LRM60q1sK9eTyAv/BfuUfMokab69066UmAfshpuFOSufmJ0l9+SLhFK5wb4lPjNhzbm2ksWAyCDw9HnGTwUFBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:41.856644Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.02639","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a8a361bb80091224792a2848086b50ed75b1a43a07ba5214f1773d68fe8837f2","sha256:ee16fb7fbdad5dbeffdce806110fdb677420a8fc34ddb5ea3d27ca8b82fbe25c"],"state_sha256":"a2c1d059b404be04f362ceb0c3e470a709d5f95dc7df7f367c448824ddde53ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Gj30tpIkjRTmH5ROqwVi8O4cupxSeWwjUiW64ILKwLws0w2MvlWbdAPEpWfyzRcM4hSjmvuoZDJd+NzWLJGAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T01:54:09.877683Z","bundle_sha256":"0706a1647880bc6365c5347218c0d3989386899993c0534170a056ebe32e309d"}}