{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KFEDWI7BIG7O2RKXAKKRCUHOCS","short_pith_number":"pith:KFEDWI7B","schema_version":"1.0","canonical_sha256":"51483b23e141beed455702951150ee14b918154f1a5dda15c913fcfb765da5e0","source":{"kind":"arxiv","id":"1702.02470","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1702.02470","created_at":"2026-05-18T00:51:05.876297+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.02470v1","created_at":"2026-05-18T00:51:05.876297+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02470","created_at":"2026-05-18T00:51:05.876297+00:00"},{"alias_kind":"pith_short_12","alias_value":"KFEDWI7BIG7O","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"KFEDWI7BIG7O2RKX","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"KFEDWI7B","created_at":"2026-05-18T12:31:24.725408+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/KFEDWI7BIG7O2RKXAKKRCUHOCS","json":"https://pith.science/pith/KFEDWI7BIG7O2RKXAKKRCUHOCS.json","graph_json":"https://pith.science/api/pith-number/KFEDWI7BIG7O2RKXAKKRCUHOCS/graph.json","events_json":"https://pith.science/api/pith-number/KFEDWI7BIG7O2RKXAKKRCUHOCS/events.json","paper":"https://pith.science/paper/KFEDWI7B"},"agent_actions":{"view_html":"https://pith.science/pith/KFEDWI7BIG7O2RKXAKKRCUHOCS","download_json":"https://pith.science/pith/KFEDWI7BIG7O2RKXAKKRCUHOCS.json","view_paper":"https://pith.science/paper/KFEDWI7B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.02470&json=true","fetch_graph":"https://pith.science/api/pith-number/KFEDWI7BIG7O2RKXAKKRCUHOCS/graph.json","fetch_events":"https://pith.science/api/pith-number/KFEDWI7BIG7O2RKXAKKRCUHOCS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KFEDWI7BIG7O2RKXAKKRCUHOCS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KFEDWI7BIG7O2RKXAKKRCUHOCS/action/storage_attestation","attest_author":"https://pith.science/pith/KFEDWI7BIG7O2RKXAKKRCUHOCS/action/author_attestation","sign_citation":"https://pith.science/pith/KFEDWI7BIG7O2RKXAKKRCUHOCS/action/citation_signature","submit_replication":"https://pith.science/pith/KFEDWI7BIG7O2RKXAKKRCUHOCS/action/replication_record"}},"created_at":"2026-05-18T00:51:05.876297+00:00","updated_at":"2026-05-18T00:51:05.876297+00:00"}