{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KFEDWI7BIG7O2RKXAKKRCUHOCS","short_pith_number":"pith:KFEDWI7B","canonical_record":{"source":{"id":"1702.02470","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-02-07T15:45:39Z","cross_cats_sorted":[],"title_canon_sha256":"c3cee9a09710cdb51c727e6d8bc8acb80a605c2bdb6092d2ee837adabc39364d","abstract_canon_sha256":"ec9ceec5402f7913a3492c015b5df2d5ffe9b17442de6e2dae520e00dbb74eea"},"schema_version":"1.0"},"canonical_sha256":"51483b23e141beed455702951150ee14b918154f1a5dda15c913fcfb765da5e0","source":{"kind":"arxiv","id":"1702.02470","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.02470","created_at":"2026-05-18T00:51:05Z"},{"alias_kind":"arxiv_version","alias_value":"1702.02470v1","created_at":"2026-05-18T00:51:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02470","created_at":"2026-05-18T00:51:05Z"},{"alias_kind":"pith_short_12","alias_value":"KFEDWI7BIG7O","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KFEDWI7BIG7O2RKX","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KFEDWI7B","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KFEDWI7BIG7O2RKXAKKRCUHOCS","target":"record","payload":{"canonical_record":{"source":{"id":"1702.02470","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-02-07T15:45:39Z","cross_cats_sorted":[],"title_canon_sha256":"c3cee9a09710cdb51c727e6d8bc8acb80a605c2bdb6092d2ee837adabc39364d","abstract_canon_sha256":"ec9ceec5402f7913a3492c015b5df2d5ffe9b17442de6e2dae520e00dbb74eea"},"schema_version":"1.0"},"canonical_sha256":"51483b23e141beed455702951150ee14b918154f1a5dda15c913fcfb765da5e0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:05.876646Z","signature_b64":"CkxBXdGaIv/ER6zUeP2TNUIKrTy7qnctmv8iCq8I2G5JjgM2hUj5LtWGwg3eDFjWCjL7xaGuFsgbnoBs3JJ3CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51483b23e141beed455702951150ee14b918154f1a5dda15c913fcfb765da5e0","last_reissued_at":"2026-05-18T00:51:05.876236Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:05.876236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.02470","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-18T00:51:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CJfpNuvyyzJcNRGWv0kUvS72rCzDdZ40mkCy/CGRBMWcVZrEdpGLNXIemPnc6wI0yrLFMyrJ2Yzb+HotyvqCDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:03:47.645385Z"},"content_sha256":"8e23cfc402955e77430cec58920b7bfd7fc2168d028c75abbb767ad9f2851c70","schema_version":"1.0","event_id":"sha256:8e23cfc402955e77430cec58920b7bfd7fc2168d028c75abbb767ad9f2851c70"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KFEDWI7BIG7O2RKXAKKRCUHOCS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Propagation via Kernelization: The Vertex Cover Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Cl\\'ement Carbonnel (LAAS-ROC), Emmanuel H\\'ebrard (LAAS-ROC)","submitted_at":"2017-02-07T15:45:39Z","abstract_excerpt":"The technique of kernelization consists in extracting, from an instance of a problem, an essentially equivalent instance whose size is bounded in a parameter k. Besides being the basis for efficient param-eterized algorithms, this method also provides a wealth of information to reason about in the context of constraint programming. We study the use of kernelization for designing propagators through the example of the Vertex Cover constraint. Since the classic kernelization rules often correspond to dominance rather than consistency, we introduce the notion of \"loss-less\" kernel. While our prel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02470","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-18T00:51:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KE6Fi9WAF93mV0jB45A1kdIV3iGN9jDvVe1q6oReaWJZjmjuZM9nCHQ2QuKoeki3yx1qgCMWx6YVtUhpFDUSBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:03:47.645736Z"},"content_sha256":"e66f82102e065651407663e0d8f356a47d3a871a1a4420c7f86bf04917a7ad2e","schema_version":"1.0","event_id":"sha256:e66f82102e065651407663e0d8f356a47d3a871a1a4420c7f86bf04917a7ad2e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KFEDWI7BIG7O2RKXAKKRCUHOCS/bundle.json","state_url":"https://pith.science/pith/KFEDWI7BIG7O2RKXAKKRCUHOCS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KFEDWI7BIG7O2RKXAKKRCUHOCS/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-23T15:03:47Z","links":{"resolver":"https://pith.science/pith/KFEDWI7BIG7O2RKXAKKRCUHOCS","bundle":"https://pith.science/pith/KFEDWI7BIG7O2RKXAKKRCUHOCS/bundle.json","state":"https://pith.science/pith/KFEDWI7BIG7O2RKXAKKRCUHOCS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KFEDWI7BIG7O2RKXAKKRCUHOCS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KFEDWI7BIG7O2RKXAKKRCUHOCS","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":"ec9ceec5402f7913a3492c015b5df2d5ffe9b17442de6e2dae520e00dbb74eea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-02-07T15:45:39Z","title_canon_sha256":"c3cee9a09710cdb51c727e6d8bc8acb80a605c2bdb6092d2ee837adabc39364d"},"schema_version":"1.0","source":{"id":"1702.02470","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.02470","created_at":"2026-05-18T00:51:05Z"},{"alias_kind":"arxiv_version","alias_value":"1702.02470v1","created_at":"2026-05-18T00:51:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02470","created_at":"2026-05-18T00:51:05Z"},{"alias_kind":"pith_short_12","alias_value":"KFEDWI7BIG7O","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KFEDWI7BIG7O2RKX","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KFEDWI7B","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:e66f82102e065651407663e0d8f356a47d3a871a1a4420c7f86bf04917a7ad2e","target":"graph","created_at":"2026-05-18T00:51:05Z","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 technique of kernelization consists in extracting, from an instance of a problem, an essentially equivalent instance whose size is bounded in a parameter k. Besides being the basis for efficient param-eterized algorithms, this method also provides a wealth of information to reason about in the context of constraint programming. We study the use of kernelization for designing propagators through the example of the Vertex Cover constraint. Since the classic kernelization rules often correspond to dominance rather than consistency, we introduce the notion of \"loss-less\" kernel. While our prel","authors_text":"Cl\\'ement Carbonnel (LAAS-ROC), Emmanuel H\\'ebrard (LAAS-ROC)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-02-07T15:45:39Z","title":"Propagation via Kernelization: The Vertex Cover Constraint"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02470","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:8e23cfc402955e77430cec58920b7bfd7fc2168d028c75abbb767ad9f2851c70","target":"record","created_at":"2026-05-18T00:51:05Z","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":"ec9ceec5402f7913a3492c015b5df2d5ffe9b17442de6e2dae520e00dbb74eea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-02-07T15:45:39Z","title_canon_sha256":"c3cee9a09710cdb51c727e6d8bc8acb80a605c2bdb6092d2ee837adabc39364d"},"schema_version":"1.0","source":{"id":"1702.02470","kind":"arxiv","version":1}},"canonical_sha256":"51483b23e141beed455702951150ee14b918154f1a5dda15c913fcfb765da5e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51483b23e141beed455702951150ee14b918154f1a5dda15c913fcfb765da5e0","first_computed_at":"2026-05-18T00:51:05.876236Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:05.876236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CkxBXdGaIv/ER6zUeP2TNUIKrTy7qnctmv8iCq8I2G5JjgM2hUj5LtWGwg3eDFjWCjL7xaGuFsgbnoBs3JJ3CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:05.876646Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.02470","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e23cfc402955e77430cec58920b7bfd7fc2168d028c75abbb767ad9f2851c70","sha256:e66f82102e065651407663e0d8f356a47d3a871a1a4420c7f86bf04917a7ad2e"],"state_sha256":"fcbb1548887326b332e93a213403c38313d131de20db8797139aa060535352ab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RLfXd99wZGDkAqMPIPwIPLmt8CFxEEzTKbX0DXQHoF9LhpMIgOjvy/gDqU3L4qaB99unrbt3DYznTD+rtv4bCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T15:03:47.647923Z","bundle_sha256":"d7819e11f34febb546fda57d8f5e2bca42ac05da51f679a6d7b9b89171207786"}}