{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:E6YSASFLKN374IQ55Q33HYVT4B","short_pith_number":"pith:E6YSASFL","canonical_record":{"source":{"id":"1101.4491","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-24T10:42:46Z","cross_cats_sorted":[],"title_canon_sha256":"021edf5c72cb1117e046aeddd83d9c1e9e0de92a4750af68bd9088adcfdc6050","abstract_canon_sha256":"d388e5720abf88aeff82e8e4371dc969848671fb892f23ae032e75fb34da8bb8"},"schema_version":"1.0"},"canonical_sha256":"27b12048ab5377fe221dec37b3e2b3e0795edb4548dc61b0a28e2a16b564fe58","source":{"kind":"arxiv","id":"1101.4491","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.4491","created_at":"2026-05-18T03:00:40Z"},{"alias_kind":"arxiv_version","alias_value":"1101.4491v3","created_at":"2026-05-18T03:00:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.4491","created_at":"2026-05-18T03:00:40Z"},{"alias_kind":"pith_short_12","alias_value":"E6YSASFLKN37","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"E6YSASFLKN374IQ5","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"E6YSASFL","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:E6YSASFLKN374IQ55Q33HYVT4B","target":"record","payload":{"canonical_record":{"source":{"id":"1101.4491","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-24T10:42:46Z","cross_cats_sorted":[],"title_canon_sha256":"021edf5c72cb1117e046aeddd83d9c1e9e0de92a4750af68bd9088adcfdc6050","abstract_canon_sha256":"d388e5720abf88aeff82e8e4371dc969848671fb892f23ae032e75fb34da8bb8"},"schema_version":"1.0"},"canonical_sha256":"27b12048ab5377fe221dec37b3e2b3e0795edb4548dc61b0a28e2a16b564fe58","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:40.051517Z","signature_b64":"CzzC5K+bbI/qsw9/pbVRlYuNUEHJPcvt1anhHlPxkwZ0rGx+j9lGvdA9dpXEoeh0DO8ReMA9N7kNu78Ddp6iCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27b12048ab5377fe221dec37b3e2b3e0795edb4548dc61b0a28e2a16b564fe58","last_reissued_at":"2026-05-18T03:00:40.050773Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:40.050773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.4491","source_version":3,"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-18T03:00:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PW8f65HhTgXNvT4ht3fK5wztPMjjWMh2JChZGROVd691ITUAFuvQvBmw0V9SPt7dJASinX/WuvcQdI12VDfaBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:41:39.039267Z"},"content_sha256":"f54147d485b87c0a9bc3e653a951b62bf19379fb5ea8b283b437361c49bf04ff","schema_version":"1.0","event_id":"sha256:f54147d485b87c0a9bc3e653a951b62bf19379fb5ea8b283b437361c49bf04ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:E6YSASFLKN374IQ55Q33HYVT4B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Conflict Packing: an unifying technique to obtain polynomial kernels for editing problems on dense instances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anthony Perez, Christophe Paul, St\\'ephan Thomass\\'e","submitted_at":"2011-01-24T10:42:46Z","abstract_excerpt":"We develop a technique that we call Conflict Packing in the context of kernelization, obtaining (and improving) several polynomial kernels for editing problems on dense instances. We apply this technique on several well-studied problems: Feedback Arc Set in (Bipartite) Tournaments, Dense Rooted Triplet Inconsistency and Betweenness in Tournaments. For the former, one is given a (bipartite) tournament $T = (V,A)$ and seeks a set of at most $k$ arcs whose reversal in $T$ results in an acyclic (bipartite) tournament. While a linear vertex-kernel is already known for the first problem, using the C"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.4491","kind":"arxiv","version":3},"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-18T03:00:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e5K53a7o5L5UPLS0wZFt8MSr6fzbofw12N/2qTDqeiAuiAFkrFdwLPl4mJ2ixa1xmaFncMaXYgy6V+5soQZTBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:41:39.039898Z"},"content_sha256":"bb9d55bb0d8f8a2ae4bedcc9f61baf0e26bd7295b9d2fe413eef8ae3298f2057","schema_version":"1.0","event_id":"sha256:bb9d55bb0d8f8a2ae4bedcc9f61baf0e26bd7295b9d2fe413eef8ae3298f2057"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E6YSASFLKN374IQ55Q33HYVT4B/bundle.json","state_url":"https://pith.science/pith/E6YSASFLKN374IQ55Q33HYVT4B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E6YSASFLKN374IQ55Q33HYVT4B/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-26T17:41:39Z","links":{"resolver":"https://pith.science/pith/E6YSASFLKN374IQ55Q33HYVT4B","bundle":"https://pith.science/pith/E6YSASFLKN374IQ55Q33HYVT4B/bundle.json","state":"https://pith.science/pith/E6YSASFLKN374IQ55Q33HYVT4B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E6YSASFLKN374IQ55Q33HYVT4B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:E6YSASFLKN374IQ55Q33HYVT4B","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":"d388e5720abf88aeff82e8e4371dc969848671fb892f23ae032e75fb34da8bb8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-24T10:42:46Z","title_canon_sha256":"021edf5c72cb1117e046aeddd83d9c1e9e0de92a4750af68bd9088adcfdc6050"},"schema_version":"1.0","source":{"id":"1101.4491","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.4491","created_at":"2026-05-18T03:00:40Z"},{"alias_kind":"arxiv_version","alias_value":"1101.4491v3","created_at":"2026-05-18T03:00:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.4491","created_at":"2026-05-18T03:00:40Z"},{"alias_kind":"pith_short_12","alias_value":"E6YSASFLKN37","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"E6YSASFLKN374IQ5","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"E6YSASFL","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:bb9d55bb0d8f8a2ae4bedcc9f61baf0e26bd7295b9d2fe413eef8ae3298f2057","target":"graph","created_at":"2026-05-18T03:00:40Z","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 develop a technique that we call Conflict Packing in the context of kernelization, obtaining (and improving) several polynomial kernels for editing problems on dense instances. We apply this technique on several well-studied problems: Feedback Arc Set in (Bipartite) Tournaments, Dense Rooted Triplet Inconsistency and Betweenness in Tournaments. For the former, one is given a (bipartite) tournament $T = (V,A)$ and seeks a set of at most $k$ arcs whose reversal in $T$ results in an acyclic (bipartite) tournament. While a linear vertex-kernel is already known for the first problem, using the C","authors_text":"Anthony Perez, Christophe Paul, St\\'ephan Thomass\\'e","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-24T10:42:46Z","title":"Conflict Packing: an unifying technique to obtain polynomial kernels for editing problems on dense instances"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.4491","kind":"arxiv","version":3},"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:f54147d485b87c0a9bc3e653a951b62bf19379fb5ea8b283b437361c49bf04ff","target":"record","created_at":"2026-05-18T03:00:40Z","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":"d388e5720abf88aeff82e8e4371dc969848671fb892f23ae032e75fb34da8bb8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-24T10:42:46Z","title_canon_sha256":"021edf5c72cb1117e046aeddd83d9c1e9e0de92a4750af68bd9088adcfdc6050"},"schema_version":"1.0","source":{"id":"1101.4491","kind":"arxiv","version":3}},"canonical_sha256":"27b12048ab5377fe221dec37b3e2b3e0795edb4548dc61b0a28e2a16b564fe58","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27b12048ab5377fe221dec37b3e2b3e0795edb4548dc61b0a28e2a16b564fe58","first_computed_at":"2026-05-18T03:00:40.050773Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:00:40.050773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CzzC5K+bbI/qsw9/pbVRlYuNUEHJPcvt1anhHlPxkwZ0rGx+j9lGvdA9dpXEoeh0DO8ReMA9N7kNu78Ddp6iCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:00:40.051517Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.4491","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f54147d485b87c0a9bc3e653a951b62bf19379fb5ea8b283b437361c49bf04ff","sha256:bb9d55bb0d8f8a2ae4bedcc9f61baf0e26bd7295b9d2fe413eef8ae3298f2057"],"state_sha256":"e8b086d69eb274a850b82faa0c1539c3c4a1b56ebe05cdf4c71ab779d5564123"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"61CGX+D0cyZAzdACVh9a4+Yks6RWmPXMzImQLAl71ZLWri3RpVvcWlGrY0RI7nh+CHcZucyJd1P+TZ/IBy7NCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:41:39.043675Z","bundle_sha256":"1e297a647afce46518538fb601fe88d5b73a271663ba24a048e17957ca8a093c"}}