{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OM2MP7ZNA3OZEG45MNZR32VWZT","short_pith_number":"pith:OM2MP7ZN","schema_version":"1.0","canonical_sha256":"7334c7ff2d06dd921b9d63731deab6ccf0e102a192ca3971a7d18a9c4bbe1e93","source":{"kind":"arxiv","id":"1809.06171","version":1},"attestation_state":"computed","paper":{"title":"Best-case and Worst-case Sparsifiability of Boolean CSPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Astrid Pieterse, Bart M. P. Jansen, Hubie Chen","submitted_at":"2018-09-17T13:00:18Z","abstract_excerpt":"We continue the investigation of polynomial-time sparsification for NP-complete Boolean Constraint Satisfaction Problems (CSPs). The goal in sparsification is to reduce the number of constraints in a problem instance without changing the answer, such that a bound on the number of resulting constraints can be given in terms of the number of variables n. We investigate how the worst-case sparsification size depends on the types of constraints allowed in the problem formulation (the constraint language). Two algorithmic results are presented. The first result essentially shows that for any arity "},"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":"1809.06171","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-09-17T13:00:18Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3bf1addd007f92ab11b486e6c491d6cb2bf3c68a17a3bede25bf891133f5b026","abstract_canon_sha256":"420d64e477af7d6c1ebb97505a35f0607bccd4c06f2c952ad30ccbd5a8b296be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:35.430259Z","signature_b64":"vRZFrSw2K4rMSoFvCfDvxL25YKz57k0fMZx3pokeVuoUdU4PFwaKm2f1VQfMqD4PGQGn2eetp3YtI7Ll2/ikBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7334c7ff2d06dd921b9d63731deab6ccf0e102a192ca3971a7d18a9c4bbe1e93","last_reissued_at":"2026-05-18T00:05:35.429861Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:35.429861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Best-case and Worst-case Sparsifiability of Boolean CSPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Astrid Pieterse, Bart M. P. Jansen, Hubie Chen","submitted_at":"2018-09-17T13:00:18Z","abstract_excerpt":"We continue the investigation of polynomial-time sparsification for NP-complete Boolean Constraint Satisfaction Problems (CSPs). The goal in sparsification is to reduce the number of constraints in a problem instance without changing the answer, such that a bound on the number of resulting constraints can be given in terms of the number of variables n. We investigate how the worst-case sparsification size depends on the types of constraints allowed in the problem formulation (the constraint language). Two algorithmic results are presented. The first result essentially shows that for any arity "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.06171","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":"1809.06171","created_at":"2026-05-18T00:05:35.429926+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.06171v1","created_at":"2026-05-18T00:05:35.429926+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.06171","created_at":"2026-05-18T00:05:35.429926+00:00"},{"alias_kind":"pith_short_12","alias_value":"OM2MP7ZNA3OZ","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OM2MP7ZNA3OZEG45","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OM2MP7ZN","created_at":"2026-05-18T12:32:43.782077+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.17878","citing_title":"Strong Sparsification for 1-in-3-SAT via Polynomial Freiman-Ruzsa","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OM2MP7ZNA3OZEG45MNZR32VWZT","json":"https://pith.science/pith/OM2MP7ZNA3OZEG45MNZR32VWZT.json","graph_json":"https://pith.science/api/pith-number/OM2MP7ZNA3OZEG45MNZR32VWZT/graph.json","events_json":"https://pith.science/api/pith-number/OM2MP7ZNA3OZEG45MNZR32VWZT/events.json","paper":"https://pith.science/paper/OM2MP7ZN"},"agent_actions":{"view_html":"https://pith.science/pith/OM2MP7ZNA3OZEG45MNZR32VWZT","download_json":"https://pith.science/pith/OM2MP7ZNA3OZEG45MNZR32VWZT.json","view_paper":"https://pith.science/paper/OM2MP7ZN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.06171&json=true","fetch_graph":"https://pith.science/api/pith-number/OM2MP7ZNA3OZEG45MNZR32VWZT/graph.json","fetch_events":"https://pith.science/api/pith-number/OM2MP7ZNA3OZEG45MNZR32VWZT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OM2MP7ZNA3OZEG45MNZR32VWZT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OM2MP7ZNA3OZEG45MNZR32VWZT/action/storage_attestation","attest_author":"https://pith.science/pith/OM2MP7ZNA3OZEG45MNZR32VWZT/action/author_attestation","sign_citation":"https://pith.science/pith/OM2MP7ZNA3OZEG45MNZR32VWZT/action/citation_signature","submit_replication":"https://pith.science/pith/OM2MP7ZNA3OZEG45MNZR32VWZT/action/replication_record"}},"created_at":"2026-05-18T00:05:35.429926+00:00","updated_at":"2026-05-18T00:05:35.429926+00:00"}