{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:LFAOP24CTWJ6KYFN7SE7RKDKQ3","short_pith_number":"pith:LFAOP24C","canonical_record":{"source":{"id":"0907.3208","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-07-20T18:50:55Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"cdecee3c89e18570f9b0a0240c5b482fa0f135d28d8e7304fd26b876a8e43da0","abstract_canon_sha256":"7f5617ce197168aa3ed3e9e547893474a9a0d43db770295c6eee8dc8d251a986"},"schema_version":"1.0"},"canonical_sha256":"5940e7eb829d93e560adfc89f8a86a86ca2061439b4b89434809b00721be7ef4","source":{"kind":"arxiv","id":"0907.3208","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0907.3208","created_at":"2026-05-18T04:01:00Z"},{"alias_kind":"arxiv_version","alias_value":"0907.3208v2","created_at":"2026-05-18T04:01:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0907.3208","created_at":"2026-05-18T04:01:00Z"},{"alias_kind":"pith_short_12","alias_value":"LFAOP24CTWJ6","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"LFAOP24CTWJ6KYFN","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"LFAOP24C","created_at":"2026-05-18T12:26:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:LFAOP24CTWJ6KYFN7SE7RKDKQ3","target":"record","payload":{"canonical_record":{"source":{"id":"0907.3208","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-07-20T18:50:55Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"cdecee3c89e18570f9b0a0240c5b482fa0f135d28d8e7304fd26b876a8e43da0","abstract_canon_sha256":"7f5617ce197168aa3ed3e9e547893474a9a0d43db770295c6eee8dc8d251a986"},"schema_version":"1.0"},"canonical_sha256":"5940e7eb829d93e560adfc89f8a86a86ca2061439b4b89434809b00721be7ef4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:00.234546Z","signature_b64":"cD7Eguc2WA71vj3loWCLVgEiAAoROTMNaJkH+PrdeTyDCG/M0YH3x6EYxRn6/ihvx3luOpuXRaWoNKaVJjkFAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5940e7eb829d93e560adfc89f8a86a86ca2061439b4b89434809b00721be7ef4","last_reissued_at":"2026-05-18T04:01:00.233965Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:00.233965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0907.3208","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-18T04:01:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V4n2zeUqbltvUddpXU1TWUqLLF4JVaKTgiZdYghP4OFo0rjxc8cLbJlqHzfWu6PuF3uJ/1j8aDBmJ3fhgW+8Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:45:28.338265Z"},"content_sha256":"826b1919b85c1f207f3d778b371d6c9151d7af0104e0d866240e400a6a0b7c57","schema_version":"1.0","event_id":"sha256:826b1919b85c1f207f3d778b371d6c9151d7af0104e0d866240e400a6a0b7c57"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:LFAOP24CTWJ6KYFN7SE7RKDKQ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Linear Vertex Kernel for Maximum Internal Spanning Tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Fedor V. Fomin, Saket Saurabh, Serge Gaspers, St\\'ephan Thomass\\'e","submitted_at":"2009-07-20T18:50:55Z","abstract_excerpt":"We present a polynomial time algorithm that for any graph G and integer k >= 0, either finds a spanning tree with at least k internal vertices, or outputs a new graph G' on at most 3k vertices and an integer k' such that G has a spanning tree with at least k internal vertices if and only if G' has a spanning tree with at least k' internal vertices. In other words, we show that the Maximum Internal Spanning Tree problem parameterized by the number of internal vertices k, has a 3k-vertex kernel. Our result is based on an innovative application of a classical min-max result about hypertrees in hy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0907.3208","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-18T04:01:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pW9zl7CpnZFoV/4eeojh+HpRx6sj6RIIdSDhighfbDBcDAiEfPsdkkVBD8bLtqBSI5KNhQ5vXvex07TJCJw2Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:45:28.338633Z"},"content_sha256":"c66d313953d2c8ae6adcd669fb252460c9016401bd227102ab515920c5d29520","schema_version":"1.0","event_id":"sha256:c66d313953d2c8ae6adcd669fb252460c9016401bd227102ab515920c5d29520"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LFAOP24CTWJ6KYFN7SE7RKDKQ3/bundle.json","state_url":"https://pith.science/pith/LFAOP24CTWJ6KYFN7SE7RKDKQ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LFAOP24CTWJ6KYFN7SE7RKDKQ3/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-01T03:45:28Z","links":{"resolver":"https://pith.science/pith/LFAOP24CTWJ6KYFN7SE7RKDKQ3","bundle":"https://pith.science/pith/LFAOP24CTWJ6KYFN7SE7RKDKQ3/bundle.json","state":"https://pith.science/pith/LFAOP24CTWJ6KYFN7SE7RKDKQ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LFAOP24CTWJ6KYFN7SE7RKDKQ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:LFAOP24CTWJ6KYFN7SE7RKDKQ3","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":"7f5617ce197168aa3ed3e9e547893474a9a0d43db770295c6eee8dc8d251a986","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-07-20T18:50:55Z","title_canon_sha256":"cdecee3c89e18570f9b0a0240c5b482fa0f135d28d8e7304fd26b876a8e43da0"},"schema_version":"1.0","source":{"id":"0907.3208","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0907.3208","created_at":"2026-05-18T04:01:00Z"},{"alias_kind":"arxiv_version","alias_value":"0907.3208v2","created_at":"2026-05-18T04:01:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0907.3208","created_at":"2026-05-18T04:01:00Z"},{"alias_kind":"pith_short_12","alias_value":"LFAOP24CTWJ6","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"LFAOP24CTWJ6KYFN","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"LFAOP24C","created_at":"2026-05-18T12:26:00Z"}],"graph_snapshots":[{"event_id":"sha256:c66d313953d2c8ae6adcd669fb252460c9016401bd227102ab515920c5d29520","target":"graph","created_at":"2026-05-18T04:01:00Z","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":"We present a polynomial time algorithm that for any graph G and integer k >= 0, either finds a spanning tree with at least k internal vertices, or outputs a new graph G' on at most 3k vertices and an integer k' such that G has a spanning tree with at least k internal vertices if and only if G' has a spanning tree with at least k' internal vertices. In other words, we show that the Maximum Internal Spanning Tree problem parameterized by the number of internal vertices k, has a 3k-vertex kernel. Our result is based on an innovative application of a classical min-max result about hypertrees in hy","authors_text":"Fedor V. Fomin, Saket Saurabh, Serge Gaspers, St\\'ephan Thomass\\'e","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-07-20T18:50:55Z","title":"A Linear Vertex Kernel for Maximum Internal Spanning Tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0907.3208","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:826b1919b85c1f207f3d778b371d6c9151d7af0104e0d866240e400a6a0b7c57","target":"record","created_at":"2026-05-18T04:01:00Z","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":"7f5617ce197168aa3ed3e9e547893474a9a0d43db770295c6eee8dc8d251a986","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-07-20T18:50:55Z","title_canon_sha256":"cdecee3c89e18570f9b0a0240c5b482fa0f135d28d8e7304fd26b876a8e43da0"},"schema_version":"1.0","source":{"id":"0907.3208","kind":"arxiv","version":2}},"canonical_sha256":"5940e7eb829d93e560adfc89f8a86a86ca2061439b4b89434809b00721be7ef4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5940e7eb829d93e560adfc89f8a86a86ca2061439b4b89434809b00721be7ef4","first_computed_at":"2026-05-18T04:01:00.233965Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:01:00.233965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cD7Eguc2WA71vj3loWCLVgEiAAoROTMNaJkH+PrdeTyDCG/M0YH3x6EYxRn6/ihvx3luOpuXRaWoNKaVJjkFAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:01:00.234546Z","signed_message":"canonical_sha256_bytes"},"source_id":"0907.3208","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:826b1919b85c1f207f3d778b371d6c9151d7af0104e0d866240e400a6a0b7c57","sha256:c66d313953d2c8ae6adcd669fb252460c9016401bd227102ab515920c5d29520"],"state_sha256":"226f8e9ee381a60d9b0f77f3a94c1f35c1e60884d643573faa4e65c9fa38ac06"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"04GxmDFoJ82FEiT7PDUlgZD5v3bpjxILBhJjt1W1++Yc4EfzLy+DAjKHHI/KY147TZsc9SzjqbTf5wzGSwbDCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T03:45:28.340686Z","bundle_sha256":"e748ae742bf2fa7ec5ffae9cc31cf108be2de2344938953a13bc54b8eca4e05e"}}