{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:N2BGA27PLQZYES3IXJZ555UT2N","short_pith_number":"pith:N2BGA27P","schema_version":"1.0","canonical_sha256":"6e82606bef5c33824b68ba73def693d3779de8d3a264e540b329abd1fa8eed83","source":{"kind":"arxiv","id":"1706.05941","version":1},"attestation_state":"computed","paper":{"title":"Kernelization of Constraint Satisfaction Problems: A Study through Universal Algebra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Magnus Wahlstr\\\"om, Victor Lagerkvist","submitted_at":"2017-06-19T13:46:54Z","abstract_excerpt":"A kernelization algorithm for a computational problem is a procedure which compresses an instance into an equivalent instance whose size is bounded with respect to a complexity parameter. For the Boolean satisfiability problem (SAT), and the constraint satisfaction problem (CSP), there exist many results concerning upper and lower bounds for kernelizability of specific problems, but it is safe to say that we lack general methods to determine whether a given SAT problem admits a kernel of a particular size. This could be contrasted to the currently flourishing research program of determining th"},"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":"1706.05941","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-19T13:46:54Z","cross_cats_sorted":[],"title_canon_sha256":"75bed589030a314a96776977babd0ec61e8873ba902f74eed46672659b61a3b5","abstract_canon_sha256":"b51886f03acd1c2054e023dc46edd6a59096a02ea062d2bf2b4821bb192f5f1c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:08.456218Z","signature_b64":"P1RglKGEwvOuWZMCzSUxspwxp/quBFysIJsw/3qYk52kpOmcF0raL1T//qF3/6qtRlu56AVNz9fKyh1DfnjgDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e82606bef5c33824b68ba73def693d3779de8d3a264e540b329abd1fa8eed83","last_reissued_at":"2026-05-18T00:42:08.455648Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:08.455648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Kernelization of Constraint Satisfaction Problems: A Study through Universal Algebra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Magnus Wahlstr\\\"om, Victor Lagerkvist","submitted_at":"2017-06-19T13:46:54Z","abstract_excerpt":"A kernelization algorithm for a computational problem is a procedure which compresses an instance into an equivalent instance whose size is bounded with respect to a complexity parameter. For the Boolean satisfiability problem (SAT), and the constraint satisfaction problem (CSP), there exist many results concerning upper and lower bounds for kernelizability of specific problems, but it is safe to say that we lack general methods to determine whether a given SAT problem admits a kernel of a particular size. This could be contrasted to the currently flourishing research program of determining th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05941","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":"1706.05941","created_at":"2026-05-18T00:42:08.455728+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.05941v1","created_at":"2026-05-18T00:42:08.455728+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05941","created_at":"2026-05-18T00:42:08.455728+00:00"},{"alias_kind":"pith_short_12","alias_value":"N2BGA27PLQZY","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"N2BGA27PLQZYES3I","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"N2BGA27P","created_at":"2026-05-18T12:31:31.346846+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/N2BGA27PLQZYES3IXJZ555UT2N","json":"https://pith.science/pith/N2BGA27PLQZYES3IXJZ555UT2N.json","graph_json":"https://pith.science/api/pith-number/N2BGA27PLQZYES3IXJZ555UT2N/graph.json","events_json":"https://pith.science/api/pith-number/N2BGA27PLQZYES3IXJZ555UT2N/events.json","paper":"https://pith.science/paper/N2BGA27P"},"agent_actions":{"view_html":"https://pith.science/pith/N2BGA27PLQZYES3IXJZ555UT2N","download_json":"https://pith.science/pith/N2BGA27PLQZYES3IXJZ555UT2N.json","view_paper":"https://pith.science/paper/N2BGA27P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.05941&json=true","fetch_graph":"https://pith.science/api/pith-number/N2BGA27PLQZYES3IXJZ555UT2N/graph.json","fetch_events":"https://pith.science/api/pith-number/N2BGA27PLQZYES3IXJZ555UT2N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N2BGA27PLQZYES3IXJZ555UT2N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N2BGA27PLQZYES3IXJZ555UT2N/action/storage_attestation","attest_author":"https://pith.science/pith/N2BGA27PLQZYES3IXJZ555UT2N/action/author_attestation","sign_citation":"https://pith.science/pith/N2BGA27PLQZYES3IXJZ555UT2N/action/citation_signature","submit_replication":"https://pith.science/pith/N2BGA27PLQZYES3IXJZ555UT2N/action/replication_record"}},"created_at":"2026-05-18T00:42:08.455728+00:00","updated_at":"2026-05-18T00:42:08.455728+00:00"}