{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ABW5LY2OBJ7Q43DNMUCKY74S2Z","short_pith_number":"pith:ABW5LY2O","canonical_record":{"source":{"id":"1510.01557","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-06T12:49:14Z","cross_cats_sorted":[],"title_canon_sha256":"661fa298321f0f6be42cdfcbcd63fb2a186e950227cec269947d85b77b4a2f12","abstract_canon_sha256":"28d8ac9be78f835a4937605cae0bfcbe5824d637a36c4dd21ccc8922f973fabb"},"schema_version":"1.0"},"canonical_sha256":"006dd5e34e0a7f0e6c6d6504ac7f92d65c70b9a7acf8f04acb97c759605ab62e","source":{"kind":"arxiv","id":"1510.01557","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.01557","created_at":"2026-05-18T01:30:56Z"},{"alias_kind":"arxiv_version","alias_value":"1510.01557v1","created_at":"2026-05-18T01:30:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.01557","created_at":"2026-05-18T01:30:56Z"},{"alias_kind":"pith_short_12","alias_value":"ABW5LY2OBJ7Q","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"ABW5LY2OBJ7Q43DN","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"ABW5LY2O","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ABW5LY2OBJ7Q43DNMUCKY74S2Z","target":"record","payload":{"canonical_record":{"source":{"id":"1510.01557","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-06T12:49:14Z","cross_cats_sorted":[],"title_canon_sha256":"661fa298321f0f6be42cdfcbcd63fb2a186e950227cec269947d85b77b4a2f12","abstract_canon_sha256":"28d8ac9be78f835a4937605cae0bfcbe5824d637a36c4dd21ccc8922f973fabb"},"schema_version":"1.0"},"canonical_sha256":"006dd5e34e0a7f0e6c6d6504ac7f92d65c70b9a7acf8f04acb97c759605ab62e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:56.623571Z","signature_b64":"3Jq1G4r8D7BO6dWAa9OK+bZSnwOLQ3pKuSaK4z8I7iZt8waL9wDshkg3EeohVojEXSvSN5JovdsbwuDAb/XXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"006dd5e34e0a7f0e6c6d6504ac7f92d65c70b9a7acf8f04acb97c759605ab62e","last_reissued_at":"2026-05-18T01:30:56.623180Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:56.623180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.01557","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:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"06p+9htsiJBNsmCquJ5lds3wY2UzzelE26IwhvdD5Kpws2ziKF6C2SdEgrwslGTHHUtBWZEI8+mL1GORR/eNAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:06:45.648576Z"},"content_sha256":"e2fb3e5dccd6676797516f583aea9f399b9336c271aa9e35877518e226084c4e","schema_version":"1.0","event_id":"sha256:e2fb3e5dccd6676797516f583aea9f399b9336c271aa9e35877518e226084c4e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ABW5LY2OBJ7Q43DNMUCKY74S2Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simultaneous Feedback Vertex Set: A Parameterized Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Akanksha Agrawal, Amer E. Mouawad, Daniel Lokshtanov, Saket Saurabh","submitted_at":"2015-10-06T12:49:14Z","abstract_excerpt":"Given a family of graphs $\\mathcal{F}$, a graph $G$, and a positive integer $k$, the $\\mathcal{F}$-Deletion problem asks whether we can delete at most $k$ vertices from $G$ to obtain a graph in $\\mathcal{F}$. $\\mathcal{F}$-Deletion generalizes many classical graph problems such as Vertex Cover, Feedback Vertex Set, and Odd Cycle Transversal. A graph $G = (V, \\cup_{i=1}^{\\alpha} E_{i})$, where the edge set of $G$ is partitioned into $\\alpha$ color classes, is called an $\\alpha$-edge-colored graph. A natural extension of the $\\mathcal{F}$-Deletion problem to edge-colored graphs is the $\\alpha$-S"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.01557","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:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6JglZilFt+7h7rOYzZSQzPd7Q5Ws6wurDjtqoscqoZ6qkv2zynTIPkWagi2260tWaz0QpdZN5hJR3Ehgc7mZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:06:45.649256Z"},"content_sha256":"ee8ecf675b66261d89a4b28ca3b8c90258d22419401da9ac973fce33d29b4aa2","schema_version":"1.0","event_id":"sha256:ee8ecf675b66261d89a4b28ca3b8c90258d22419401da9ac973fce33d29b4aa2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ABW5LY2OBJ7Q43DNMUCKY74S2Z/bundle.json","state_url":"https://pith.science/pith/ABW5LY2OBJ7Q43DNMUCKY74S2Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ABW5LY2OBJ7Q43DNMUCKY74S2Z/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-31T21:06:45Z","links":{"resolver":"https://pith.science/pith/ABW5LY2OBJ7Q43DNMUCKY74S2Z","bundle":"https://pith.science/pith/ABW5LY2OBJ7Q43DNMUCKY74S2Z/bundle.json","state":"https://pith.science/pith/ABW5LY2OBJ7Q43DNMUCKY74S2Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ABW5LY2OBJ7Q43DNMUCKY74S2Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ABW5LY2OBJ7Q43DNMUCKY74S2Z","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":"28d8ac9be78f835a4937605cae0bfcbe5824d637a36c4dd21ccc8922f973fabb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-06T12:49:14Z","title_canon_sha256":"661fa298321f0f6be42cdfcbcd63fb2a186e950227cec269947d85b77b4a2f12"},"schema_version":"1.0","source":{"id":"1510.01557","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.01557","created_at":"2026-05-18T01:30:56Z"},{"alias_kind":"arxiv_version","alias_value":"1510.01557v1","created_at":"2026-05-18T01:30:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.01557","created_at":"2026-05-18T01:30:56Z"},{"alias_kind":"pith_short_12","alias_value":"ABW5LY2OBJ7Q","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"ABW5LY2OBJ7Q43DN","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"ABW5LY2O","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:ee8ecf675b66261d89a4b28ca3b8c90258d22419401da9ac973fce33d29b4aa2","target":"graph","created_at":"2026-05-18T01:30:56Z","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":"Given a family of graphs $\\mathcal{F}$, a graph $G$, and a positive integer $k$, the $\\mathcal{F}$-Deletion problem asks whether we can delete at most $k$ vertices from $G$ to obtain a graph in $\\mathcal{F}$. $\\mathcal{F}$-Deletion generalizes many classical graph problems such as Vertex Cover, Feedback Vertex Set, and Odd Cycle Transversal. A graph $G = (V, \\cup_{i=1}^{\\alpha} E_{i})$, where the edge set of $G$ is partitioned into $\\alpha$ color classes, is called an $\\alpha$-edge-colored graph. A natural extension of the $\\mathcal{F}$-Deletion problem to edge-colored graphs is the $\\alpha$-S","authors_text":"Akanksha Agrawal, Amer E. Mouawad, Daniel Lokshtanov, Saket Saurabh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-06T12:49:14Z","title":"Simultaneous Feedback Vertex Set: A Parameterized Perspective"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.01557","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:e2fb3e5dccd6676797516f583aea9f399b9336c271aa9e35877518e226084c4e","target":"record","created_at":"2026-05-18T01:30:56Z","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":"28d8ac9be78f835a4937605cae0bfcbe5824d637a36c4dd21ccc8922f973fabb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-06T12:49:14Z","title_canon_sha256":"661fa298321f0f6be42cdfcbcd63fb2a186e950227cec269947d85b77b4a2f12"},"schema_version":"1.0","source":{"id":"1510.01557","kind":"arxiv","version":1}},"canonical_sha256":"006dd5e34e0a7f0e6c6d6504ac7f92d65c70b9a7acf8f04acb97c759605ab62e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"006dd5e34e0a7f0e6c6d6504ac7f92d65c70b9a7acf8f04acb97c759605ab62e","first_computed_at":"2026-05-18T01:30:56.623180Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:56.623180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3Jq1G4r8D7BO6dWAa9OK+bZSnwOLQ3pKuSaK4z8I7iZt8waL9wDshkg3EeohVojEXSvSN5JovdsbwuDAb/XXBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:56.623571Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.01557","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2fb3e5dccd6676797516f583aea9f399b9336c271aa9e35877518e226084c4e","sha256:ee8ecf675b66261d89a4b28ca3b8c90258d22419401da9ac973fce33d29b4aa2"],"state_sha256":"b792961c4474e98f6235fe5580b4618f949474088f25fa32213b7b0553bad1e2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MwS63rThfoILagdY+/wNyvcAExraIv0sR+uxpUUwbogzqbB9Xh/4Lqz5NeaDSyQUiJto9HfZkrO+EK7eYDSeCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T21:06:45.653201Z","bundle_sha256":"aebb572390a1df5639d4ebac003633017e347b12d8241ca89e8bbba45f026d02"}}