{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:DNFORYJKSDZ3IFTGLUD4GIEGJP","short_pith_number":"pith:DNFORYJK","canonical_record":{"source":{"id":"1105.2704","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-05-13T12:21:17Z","cross_cats_sorted":[],"title_canon_sha256":"59145ab2c2e3e74433ae6ad6a796fb2821b6c1f927ef1d2e33ad1c27674999f4","abstract_canon_sha256":"9d4d66b29d53c774baa4ca6978923ea40732cadd634d63964035a56f672f402b"},"schema_version":"1.0"},"canonical_sha256":"1b4ae8e12a90f3b416665d07c320864bfade51701c4078dab567461d528170e8","source":{"kind":"arxiv","id":"1105.2704","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.2704","created_at":"2026-05-18T02:40:47Z"},{"alias_kind":"arxiv_version","alias_value":"1105.2704v2","created_at":"2026-05-18T02:40:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.2704","created_at":"2026-05-18T02:40:47Z"},{"alias_kind":"pith_short_12","alias_value":"DNFORYJKSDZ3","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DNFORYJKSDZ3IFTG","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DNFORYJK","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:DNFORYJKSDZ3IFTGLUD4GIEGJP","target":"record","payload":{"canonical_record":{"source":{"id":"1105.2704","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-05-13T12:21:17Z","cross_cats_sorted":[],"title_canon_sha256":"59145ab2c2e3e74433ae6ad6a796fb2821b6c1f927ef1d2e33ad1c27674999f4","abstract_canon_sha256":"9d4d66b29d53c774baa4ca6978923ea40732cadd634d63964035a56f672f402b"},"schema_version":"1.0"},"canonical_sha256":"1b4ae8e12a90f3b416665d07c320864bfade51701c4078dab567461d528170e8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:47.761443Z","signature_b64":"KgCoYBylYMQTRrCA2zmCelJY/6w3vg6aNaqpGJRA6+PlIRighnyEuz3UxDufNB69Ik6FG7cFA8y/VWwNmE+ZCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b4ae8e12a90f3b416665d07c320864bfade51701c4078dab567461d528170e8","last_reissued_at":"2026-05-18T02:40:47.760970Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:47.760970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.2704","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:40:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zPjxj6LMBlxxYjnlFsC9ayzA3YEcN06OmmEuOMNlW/ECCQYvE9+2ljh8D3QNZz/7tuP05MzCo/Alt9Sba7qfAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T18:47:03.175022Z"},"content_sha256":"c4258135a6462c577d2b1d1cedfea91ea351b67b1db40798773983c004e45743","schema_version":"1.0","event_id":"sha256:c4258135a6462c577d2b1d1cedfea91ea351b67b1db40798773983c004e45743"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:DNFORYJKSDZ3IFTGLUD4GIEGJP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hitting and Harvesting Pumpkins","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christophe Paul, Gwena\\\"el Joret, Ignasi Sau, Saket Saurabh, St\\'ephan Thomass\\'e","submitted_at":"2011-05-13T12:21:17Z","abstract_excerpt":"The \"c-pumpkin\" is the graph with two vertices linked by c>0 parallel edges. A c-pumpkin-model in a graph G is a pair A,B of disjoint subsets of vertices of G, each inducing a connected subgraph of G, such that there are at least c edges in G between A and B. We focus on covering and packing c-pumpkin-models in a given graph: On the one hand, we provide an FPT algorithm running in time 2^O(k) n^O(1) deciding, for any fixed c>0, whether all c-pumpkin-models can be covered by at most k vertices. This generalizes known single-exponential FPT algorithms for Vertex Cover and Feedback Vertex Set, wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.2704","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:40:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5+Crt8NX11nlRTNRtByssrnXSxXuYqPMV804TS+RUGctJ6Ms++cxJlZUSljMyD0bSyavOsJ5Lq2Vvq2eIBSJBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T18:47:03.175445Z"},"content_sha256":"347c4a5cb1bbe6b7af47afb593d0a6f9f4c5d2f94205429c13e262a2d8d8ff25","schema_version":"1.0","event_id":"sha256:347c4a5cb1bbe6b7af47afb593d0a6f9f4c5d2f94205429c13e262a2d8d8ff25"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DNFORYJKSDZ3IFTGLUD4GIEGJP/bundle.json","state_url":"https://pith.science/pith/DNFORYJKSDZ3IFTGLUD4GIEGJP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DNFORYJKSDZ3IFTGLUD4GIEGJP/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-05T18:47:03Z","links":{"resolver":"https://pith.science/pith/DNFORYJKSDZ3IFTGLUD4GIEGJP","bundle":"https://pith.science/pith/DNFORYJKSDZ3IFTGLUD4GIEGJP/bundle.json","state":"https://pith.science/pith/DNFORYJKSDZ3IFTGLUD4GIEGJP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DNFORYJKSDZ3IFTGLUD4GIEGJP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:DNFORYJKSDZ3IFTGLUD4GIEGJP","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":"9d4d66b29d53c774baa4ca6978923ea40732cadd634d63964035a56f672f402b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-05-13T12:21:17Z","title_canon_sha256":"59145ab2c2e3e74433ae6ad6a796fb2821b6c1f927ef1d2e33ad1c27674999f4"},"schema_version":"1.0","source":{"id":"1105.2704","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.2704","created_at":"2026-05-18T02:40:47Z"},{"alias_kind":"arxiv_version","alias_value":"1105.2704v2","created_at":"2026-05-18T02:40:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.2704","created_at":"2026-05-18T02:40:47Z"},{"alias_kind":"pith_short_12","alias_value":"DNFORYJKSDZ3","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DNFORYJKSDZ3IFTG","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DNFORYJK","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:347c4a5cb1bbe6b7af47afb593d0a6f9f4c5d2f94205429c13e262a2d8d8ff25","target":"graph","created_at":"2026-05-18T02:40:47Z","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 \"c-pumpkin\" is the graph with two vertices linked by c>0 parallel edges. A c-pumpkin-model in a graph G is a pair A,B of disjoint subsets of vertices of G, each inducing a connected subgraph of G, such that there are at least c edges in G between A and B. We focus on covering and packing c-pumpkin-models in a given graph: On the one hand, we provide an FPT algorithm running in time 2^O(k) n^O(1) deciding, for any fixed c>0, whether all c-pumpkin-models can be covered by at most k vertices. This generalizes known single-exponential FPT algorithms for Vertex Cover and Feedback Vertex Set, wh","authors_text":"Christophe Paul, Gwena\\\"el Joret, Ignasi Sau, Saket Saurabh, St\\'ephan Thomass\\'e","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-05-13T12:21:17Z","title":"Hitting and Harvesting Pumpkins"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.2704","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:c4258135a6462c577d2b1d1cedfea91ea351b67b1db40798773983c004e45743","target":"record","created_at":"2026-05-18T02:40:47Z","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":"9d4d66b29d53c774baa4ca6978923ea40732cadd634d63964035a56f672f402b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-05-13T12:21:17Z","title_canon_sha256":"59145ab2c2e3e74433ae6ad6a796fb2821b6c1f927ef1d2e33ad1c27674999f4"},"schema_version":"1.0","source":{"id":"1105.2704","kind":"arxiv","version":2}},"canonical_sha256":"1b4ae8e12a90f3b416665d07c320864bfade51701c4078dab567461d528170e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b4ae8e12a90f3b416665d07c320864bfade51701c4078dab567461d528170e8","first_computed_at":"2026-05-18T02:40:47.760970Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:40:47.760970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KgCoYBylYMQTRrCA2zmCelJY/6w3vg6aNaqpGJRA6+PlIRighnyEuz3UxDufNB69Ik6FG7cFA8y/VWwNmE+ZCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:40:47.761443Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.2704","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c4258135a6462c577d2b1d1cedfea91ea351b67b1db40798773983c004e45743","sha256:347c4a5cb1bbe6b7af47afb593d0a6f9f4c5d2f94205429c13e262a2d8d8ff25"],"state_sha256":"d0a2153ab051ce32b6be31fa904d77c217621aa5439a13c61989af6f60e82918"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iwX8B/R4JZmpxTHjF67lgiIBlft0pu1MwmWU1um3KsltD5EtmRcxCgZHUoYws2eMwKOkpaP1zwUS8ypWhqxfBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T18:47:03.177668Z","bundle_sha256":"9a7522ea56b80d74154ba086843e840d625a866e560f35b457157f1ba459a28e"}}