{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:DMWFKYQ4NNMGUXNI2GAZ3ETJRN","short_pith_number":"pith:DMWFKYQ4","schema_version":"1.0","canonical_sha256":"1b2c55621c6b586a5da8d1819d92698b5d0675ed3e559ec3e6605f6fddf3ded7","source":{"kind":"arxiv","id":"1007.4011","version":1},"attestation_state":"computed","paper":{"title":"On the (non-)existence of polynomial kernels for Pl-free edge modification problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anthony Perez, Christophe Paul, Sylvain Guillemot","submitted_at":"2010-07-22T21:14:40Z","abstract_excerpt":"Given a graph G = (V,E) and an integer k, an edge modification problem for a graph property P consists in deciding whether there exists a set of edges F of size at most k such that the graph H = (V,E \\vartriangle F) satisfies the property P. In the P edge-completion problem, the set F of edges is constrained to be disjoint from E; in the P edge-deletion problem, F is a subset of E; no constraint is imposed on F in the P edge-edition problem. A number of optimization problems can be expressed in terms of graph modification problems which have been extensively studied in the context of parameter"},"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":"1007.4011","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-07-22T21:14:40Z","cross_cats_sorted":[],"title_canon_sha256":"7ea942543d5756b547cf8ba5b62696b22e62cad34fe4a2356c57607d02ec8f92","abstract_canon_sha256":"5830e0749f6c73930c1f40e7228db7e0fda997b4ab7830d500adc00909afbcd4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:06:11.357887Z","signature_b64":"lU+p3wfTvN9zC1gVrJsfUYRnxMIGrCoOvlvrcCEfOPi1mh25rR+qP2kvAzkbo+Yh1Y49JqcM3Z9W1L1OIIrMAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b2c55621c6b586a5da8d1819d92698b5d0675ed3e559ec3e6605f6fddf3ded7","last_reissued_at":"2026-05-18T02:06:11.357255Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:06:11.357255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the (non-)existence of polynomial kernels for Pl-free edge modification problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anthony Perez, Christophe Paul, Sylvain Guillemot","submitted_at":"2010-07-22T21:14:40Z","abstract_excerpt":"Given a graph G = (V,E) and an integer k, an edge modification problem for a graph property P consists in deciding whether there exists a set of edges F of size at most k such that the graph H = (V,E \\vartriangle F) satisfies the property P. In the P edge-completion problem, the set F of edges is constrained to be disjoint from E; in the P edge-deletion problem, F is a subset of E; no constraint is imposed on F in the P edge-edition problem. A number of optimization problems can be expressed in terms of graph modification problems which have been extensively studied in the context of parameter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.4011","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1007.4011","created_at":"2026-05-18T02:06:11.357356+00:00"},{"alias_kind":"arxiv_version","alias_value":"1007.4011v1","created_at":"2026-05-18T02:06:11.357356+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.4011","created_at":"2026-05-18T02:06:11.357356+00:00"},{"alias_kind":"pith_short_12","alias_value":"DMWFKYQ4NNMG","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"DMWFKYQ4NNMGUXNI","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"DMWFKYQ4","created_at":"2026-05-18T12:26:06.534383+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/DMWFKYQ4NNMGUXNI2GAZ3ETJRN","json":"https://pith.science/pith/DMWFKYQ4NNMGUXNI2GAZ3ETJRN.json","graph_json":"https://pith.science/api/pith-number/DMWFKYQ4NNMGUXNI2GAZ3ETJRN/graph.json","events_json":"https://pith.science/api/pith-number/DMWFKYQ4NNMGUXNI2GAZ3ETJRN/events.json","paper":"https://pith.science/paper/DMWFKYQ4"},"agent_actions":{"view_html":"https://pith.science/pith/DMWFKYQ4NNMGUXNI2GAZ3ETJRN","download_json":"https://pith.science/pith/DMWFKYQ4NNMGUXNI2GAZ3ETJRN.json","view_paper":"https://pith.science/paper/DMWFKYQ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1007.4011&json=true","fetch_graph":"https://pith.science/api/pith-number/DMWFKYQ4NNMGUXNI2GAZ3ETJRN/graph.json","fetch_events":"https://pith.science/api/pith-number/DMWFKYQ4NNMGUXNI2GAZ3ETJRN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DMWFKYQ4NNMGUXNI2GAZ3ETJRN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DMWFKYQ4NNMGUXNI2GAZ3ETJRN/action/storage_attestation","attest_author":"https://pith.science/pith/DMWFKYQ4NNMGUXNI2GAZ3ETJRN/action/author_attestation","sign_citation":"https://pith.science/pith/DMWFKYQ4NNMGUXNI2GAZ3ETJRN/action/citation_signature","submit_replication":"https://pith.science/pith/DMWFKYQ4NNMGUXNI2GAZ3ETJRN/action/replication_record"}},"created_at":"2026-05-18T02:06:11.357356+00:00","updated_at":"2026-05-18T02:06:11.357356+00:00"}