{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:4WN4LU45QAEM6LSJXTDWLYQHSU","short_pith_number":"pith:4WN4LU45","canonical_record":{"source":{"id":"0809.2858","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2008-09-17T06:16:37Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2f4bdb73fb39377e6adad5b92196f396ae97ad07067ea1e13a3c1490ad39f1ba","abstract_canon_sha256":"334e6f7c83249eb49ce8ab2940fe0bba31d51ba65af8402764d9f9b19b5f1f06"},"schema_version":"1.0"},"canonical_sha256":"e59bc5d39d8008cf2e49bcc765e207952971e4e43b44ff8ee93bea76b7924cf3","source":{"kind":"arxiv","id":"0809.2858","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0809.2858","created_at":"2026-05-18T02:15:34Z"},{"alias_kind":"arxiv_version","alias_value":"0809.2858v2","created_at":"2026-05-18T02:15:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0809.2858","created_at":"2026-05-18T02:15:34Z"},{"alias_kind":"pith_short_12","alias_value":"4WN4LU45QAEM","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"4WN4LU45QAEM6LSJ","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"4WN4LU45","created_at":"2026-05-18T12:25:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:4WN4LU45QAEM6LSJXTDWLYQHSU","target":"record","payload":{"canonical_record":{"source":{"id":"0809.2858","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2008-09-17T06:16:37Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2f4bdb73fb39377e6adad5b92196f396ae97ad07067ea1e13a3c1490ad39f1ba","abstract_canon_sha256":"334e6f7c83249eb49ce8ab2940fe0bba31d51ba65af8402764d9f9b19b5f1f06"},"schema_version":"1.0"},"canonical_sha256":"e59bc5d39d8008cf2e49bcc765e207952971e4e43b44ff8ee93bea76b7924cf3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:15:34.498383Z","signature_b64":"JywXG97AIBArkTKzD3X+MX/2ej9yChU6WayAAI73Exggtr4eA2LI0yJpnkgOKmVBLq5gufGQMWNDsZ0guqv2Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e59bc5d39d8008cf2e49bcc765e207952971e4e43b44ff8ee93bea76b7924cf3","last_reissued_at":"2026-05-18T02:15:34.497756Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:15:34.497756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0809.2858","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:15:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K1FITxk/5Bt0OT/3MA4UrkVv3EqjHfysl0vrp15zePJb6BSPitagbCttVHe/MhZbtyv1EuEbN9VyuSHMcKfNDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:31:46.303188Z"},"content_sha256":"33023959403b309ad769a77c630ec524ba37ceca9fdb10fd21f7d1d62191bb2c","schema_version":"1.0","event_id":"sha256:33023959403b309ad769a77c630ec524ba37ceca9fdb10fd21f7d1d62191bb2c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:4WN4LU45QAEM6LSJXTDWLYQHSU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polynomial kernels for 3-leaf power graph modification problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Anthony Perez, Christophe Paul, Stephane Bessy","submitted_at":"2008-09-17T06:16:37Z","abstract_excerpt":"A graph G=(V,E) is a 3-leaf power iff there exists a tree T whose leaves are V and such that (u,v) is an edge iff u and v are at distance at most 3 in T. The 3-leaf power graph edge modification problems, i.e. edition (also known as the closest 3-leaf power), completion and edge-deletion, are FTP when parameterized by the size of the edge set modification. However polynomial kernel was known for none of these three problems. For each of them, we provide cubic kernels that can be computed in linear time for each of these problems. We thereby answer an open problem first mentioned by Dom, Guo, H"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0809.2858","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:15:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2WvpSkTcQlpg0U2sTljnhGs4eXGCkzuInmv4oBdJQFsV9rBugvgDK3gpG6InKe3sFeis21hMSL9WXlLfEYkjDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:31:46.303844Z"},"content_sha256":"b4d7b2cc0557781666a0127042e3427f7f0fb5d1f76b6ce3631ada78b4596e85","schema_version":"1.0","event_id":"sha256:b4d7b2cc0557781666a0127042e3427f7f0fb5d1f76b6ce3631ada78b4596e85"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4WN4LU45QAEM6LSJXTDWLYQHSU/bundle.json","state_url":"https://pith.science/pith/4WN4LU45QAEM6LSJXTDWLYQHSU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4WN4LU45QAEM6LSJXTDWLYQHSU/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-26T16:31:46Z","links":{"resolver":"https://pith.science/pith/4WN4LU45QAEM6LSJXTDWLYQHSU","bundle":"https://pith.science/pith/4WN4LU45QAEM6LSJXTDWLYQHSU/bundle.json","state":"https://pith.science/pith/4WN4LU45QAEM6LSJXTDWLYQHSU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4WN4LU45QAEM6LSJXTDWLYQHSU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:4WN4LU45QAEM6LSJXTDWLYQHSU","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":"334e6f7c83249eb49ce8ab2940fe0bba31d51ba65af8402764d9f9b19b5f1f06","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2008-09-17T06:16:37Z","title_canon_sha256":"2f4bdb73fb39377e6adad5b92196f396ae97ad07067ea1e13a3c1490ad39f1ba"},"schema_version":"1.0","source":{"id":"0809.2858","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0809.2858","created_at":"2026-05-18T02:15:34Z"},{"alias_kind":"arxiv_version","alias_value":"0809.2858v2","created_at":"2026-05-18T02:15:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0809.2858","created_at":"2026-05-18T02:15:34Z"},{"alias_kind":"pith_short_12","alias_value":"4WN4LU45QAEM","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"4WN4LU45QAEM6LSJ","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"4WN4LU45","created_at":"2026-05-18T12:25:56Z"}],"graph_snapshots":[{"event_id":"sha256:b4d7b2cc0557781666a0127042e3427f7f0fb5d1f76b6ce3631ada78b4596e85","target":"graph","created_at":"2026-05-18T02:15:34Z","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":"A graph G=(V,E) is a 3-leaf power iff there exists a tree T whose leaves are V and such that (u,v) is an edge iff u and v are at distance at most 3 in T. The 3-leaf power graph edge modification problems, i.e. edition (also known as the closest 3-leaf power), completion and edge-deletion, are FTP when parameterized by the size of the edge set modification. However polynomial kernel was known for none of these three problems. For each of them, we provide cubic kernels that can be computed in linear time for each of these problems. We thereby answer an open problem first mentioned by Dom, Guo, H","authors_text":"Anthony Perez, Christophe Paul, Stephane Bessy","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2008-09-17T06:16:37Z","title":"Polynomial kernels for 3-leaf power graph modification problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0809.2858","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:33023959403b309ad769a77c630ec524ba37ceca9fdb10fd21f7d1d62191bb2c","target":"record","created_at":"2026-05-18T02:15:34Z","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":"334e6f7c83249eb49ce8ab2940fe0bba31d51ba65af8402764d9f9b19b5f1f06","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2008-09-17T06:16:37Z","title_canon_sha256":"2f4bdb73fb39377e6adad5b92196f396ae97ad07067ea1e13a3c1490ad39f1ba"},"schema_version":"1.0","source":{"id":"0809.2858","kind":"arxiv","version":2}},"canonical_sha256":"e59bc5d39d8008cf2e49bcc765e207952971e4e43b44ff8ee93bea76b7924cf3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e59bc5d39d8008cf2e49bcc765e207952971e4e43b44ff8ee93bea76b7924cf3","first_computed_at":"2026-05-18T02:15:34.497756Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:15:34.497756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JywXG97AIBArkTKzD3X+MX/2ej9yChU6WayAAI73Exggtr4eA2LI0yJpnkgOKmVBLq5gufGQMWNDsZ0guqv2Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:15:34.498383Z","signed_message":"canonical_sha256_bytes"},"source_id":"0809.2858","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33023959403b309ad769a77c630ec524ba37ceca9fdb10fd21f7d1d62191bb2c","sha256:b4d7b2cc0557781666a0127042e3427f7f0fb5d1f76b6ce3631ada78b4596e85"],"state_sha256":"812a8074b17c60a21839335e98d21ec26be642c14707a6e92be3864fcf3bba53"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ueuAPiYgLMo9JYNxu1U8C+R9eI6/cC7TkFwwuea0guaIFgACESK6nro0h1f8LFRH4rzHAcmGDt1fx6aHLXIUBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:31:46.307268Z","bundle_sha256":"40b349cb99ab21a558f5817d0a28f18d102bfbbbbef4c049a8af3d9df87ef4de"}}