{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:DNFORYJKSDZ3IFTGLUD4GIEGJP","short_pith_number":"pith:DNFORYJK","schema_version":"1.0","canonical_sha256":"1b4ae8e12a90f3b416665d07c320864bfade51701c4078dab567461d528170e8","source":{"kind":"arxiv","id":"1105.2704","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1105.2704","created_at":"2026-05-18T02:40:47.761046+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.2704v2","created_at":"2026-05-18T02:40:47.761046+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.2704","created_at":"2026-05-18T02:40:47.761046+00:00"},{"alias_kind":"pith_short_12","alias_value":"DNFORYJKSDZ3","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"DNFORYJKSDZ3IFTG","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"DNFORYJK","created_at":"2026-05-18T12:26:26.731475+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DNFORYJKSDZ3IFTGLUD4GIEGJP","json":"https://pith.science/pith/DNFORYJKSDZ3IFTGLUD4GIEGJP.json","graph_json":"https://pith.science/api/pith-number/DNFORYJKSDZ3IFTGLUD4GIEGJP/graph.json","events_json":"https://pith.science/api/pith-number/DNFORYJKSDZ3IFTGLUD4GIEGJP/events.json","paper":"https://pith.science/paper/DNFORYJK"},"agent_actions":{"view_html":"https://pith.science/pith/DNFORYJKSDZ3IFTGLUD4GIEGJP","download_json":"https://pith.science/pith/DNFORYJKSDZ3IFTGLUD4GIEGJP.json","view_paper":"https://pith.science/paper/DNFORYJK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.2704&json=true","fetch_graph":"https://pith.science/api/pith-number/DNFORYJKSDZ3IFTGLUD4GIEGJP/graph.json","fetch_events":"https://pith.science/api/pith-number/DNFORYJKSDZ3IFTGLUD4GIEGJP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DNFORYJKSDZ3IFTGLUD4GIEGJP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DNFORYJKSDZ3IFTGLUD4GIEGJP/action/storage_attestation","attest_author":"https://pith.science/pith/DNFORYJKSDZ3IFTGLUD4GIEGJP/action/author_attestation","sign_citation":"https://pith.science/pith/DNFORYJKSDZ3IFTGLUD4GIEGJP/action/citation_signature","submit_replication":"https://pith.science/pith/DNFORYJKSDZ3IFTGLUD4GIEGJP/action/replication_record"}},"created_at":"2026-05-18T02:40:47.761046+00:00","updated_at":"2026-05-18T02:40:47.761046+00:00"}