{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:DMWFKYQ4NNMGUXNI2GAZ3ETJRN","short_pith_number":"pith:DMWFKYQ4","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"},"canonical_sha256":"1b2c55621c6b586a5da8d1819d92698b5d0675ed3e559ec3e6605f6fddf3ded7","source":{"kind":"arxiv","id":"1007.4011","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.4011","created_at":"2026-05-18T02:06:11Z"},{"alias_kind":"arxiv_version","alias_value":"1007.4011v1","created_at":"2026-05-18T02:06:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.4011","created_at":"2026-05-18T02:06:11Z"},{"alias_kind":"pith_short_12","alias_value":"DMWFKYQ4NNMG","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"DMWFKYQ4NNMGUXNI","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"DMWFKYQ4","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:DMWFKYQ4NNMGUXNI2GAZ3ETJRN","target":"record","payload":{"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"},"canonical_sha256":"1b2c55621c6b586a5da8d1819d92698b5d0675ed3e559ec3e6605f6fddf3ded7","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"},"source_kind":"arxiv","source_id":"1007.4011","source_version":1,"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:06:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H0zrtis8ojbiyD71xAXCmGVTLbGqVv+74TfG+8F5SGpH0If8oEbji8/T19hXvXcW55n4k60JbsEtg/2mwFOMAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:50:34.617425Z"},"content_sha256":"db0b1d8c5e817599829c96d0387ed5bf49b36de7c408275eeb79d8070c1fd00d","schema_version":"1.0","event_id":"sha256:db0b1d8c5e817599829c96d0387ed5bf49b36de7c408275eeb79d8070c1fd00d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:DMWFKYQ4NNMGUXNI2GAZ3ETJRN","target":"graph","payload":{"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"},"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:06:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9vz99t/RcXzQBfZAMtm+JnlMZ2bYRT5gSX1GXaMuhJD9Wbe+QpAuLF++PB9kCYraovVidJcwDCDN8i1D6wpnDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:50:34.618076Z"},"content_sha256":"77f281e41ad48fd8ef68ed06c653e6e0c05482a305edcd667965acab94809980","schema_version":"1.0","event_id":"sha256:77f281e41ad48fd8ef68ed06c653e6e0c05482a305edcd667965acab94809980"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DMWFKYQ4NNMGUXNI2GAZ3ETJRN/bundle.json","state_url":"https://pith.science/pith/DMWFKYQ4NNMGUXNI2GAZ3ETJRN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DMWFKYQ4NNMGUXNI2GAZ3ETJRN/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-26T20:50:34Z","links":{"resolver":"https://pith.science/pith/DMWFKYQ4NNMGUXNI2GAZ3ETJRN","bundle":"https://pith.science/pith/DMWFKYQ4NNMGUXNI2GAZ3ETJRN/bundle.json","state":"https://pith.science/pith/DMWFKYQ4NNMGUXNI2GAZ3ETJRN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DMWFKYQ4NNMGUXNI2GAZ3ETJRN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:DMWFKYQ4NNMGUXNI2GAZ3ETJRN","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":"5830e0749f6c73930c1f40e7228db7e0fda997b4ab7830d500adc00909afbcd4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-07-22T21:14:40Z","title_canon_sha256":"7ea942543d5756b547cf8ba5b62696b22e62cad34fe4a2356c57607d02ec8f92"},"schema_version":"1.0","source":{"id":"1007.4011","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.4011","created_at":"2026-05-18T02:06:11Z"},{"alias_kind":"arxiv_version","alias_value":"1007.4011v1","created_at":"2026-05-18T02:06:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.4011","created_at":"2026-05-18T02:06:11Z"},{"alias_kind":"pith_short_12","alias_value":"DMWFKYQ4NNMG","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"DMWFKYQ4NNMGUXNI","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"DMWFKYQ4","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:77f281e41ad48fd8ef68ed06c653e6e0c05482a305edcd667965acab94809980","target":"graph","created_at":"2026-05-18T02:06:11Z","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":"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","authors_text":"Anthony Perez, Christophe Paul, Sylvain Guillemot","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-07-22T21:14:40Z","title":"On the (non-)existence of polynomial kernels for Pl-free edge modification problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.4011","kind":"arxiv","version":1},"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:db0b1d8c5e817599829c96d0387ed5bf49b36de7c408275eeb79d8070c1fd00d","target":"record","created_at":"2026-05-18T02:06:11Z","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":"5830e0749f6c73930c1f40e7228db7e0fda997b4ab7830d500adc00909afbcd4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-07-22T21:14:40Z","title_canon_sha256":"7ea942543d5756b547cf8ba5b62696b22e62cad34fe4a2356c57607d02ec8f92"},"schema_version":"1.0","source":{"id":"1007.4011","kind":"arxiv","version":1}},"canonical_sha256":"1b2c55621c6b586a5da8d1819d92698b5d0675ed3e559ec3e6605f6fddf3ded7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b2c55621c6b586a5da8d1819d92698b5d0675ed3e559ec3e6605f6fddf3ded7","first_computed_at":"2026-05-18T02:06:11.357255Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:06:11.357255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lU+p3wfTvN9zC1gVrJsfUYRnxMIGrCoOvlvrcCEfOPi1mh25rR+qP2kvAzkbo+Yh1Y49JqcM3Z9W1L1OIIrMAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:06:11.357887Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.4011","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db0b1d8c5e817599829c96d0387ed5bf49b36de7c408275eeb79d8070c1fd00d","sha256:77f281e41ad48fd8ef68ed06c653e6e0c05482a305edcd667965acab94809980"],"state_sha256":"c9bf43bf36de26bc3d285d66256998c57b0e62a8f133dc9b49291e6cb9347b77"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qLJzidpUdzdgSnJvZTqfl9MVGQs05WZ1XdMrgQ4alraeytZxcSEm1vtadzooBGGqKCdasWG5wd7mIVUT1OIsDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T20:50:34.621311Z","bundle_sha256":"cdd4ee1d389c80f476e54802b8e700d7b0f1734e91177e4c9aacf501c940e2db"}}