{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:6QYHTMQZX6SQGT33T3ONXOWZPQ","short_pith_number":"pith:6QYHTMQZ","canonical_record":{"source":{"id":"2606.00770","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-05-30T15:21:37Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"50c857370fec03aaf294d266c119cdfff07e4d71b9d31cfeb59e95f82860d678","abstract_canon_sha256":"e466220de6da2d1f4d869f26c3c0c6be20fd1e2cb6067d94252357823688d332"},"schema_version":"1.0"},"canonical_sha256":"f43079b219bfa5034f7b9edcdbbad97c137148967c06ae9593774fff39aad27d","source":{"kind":"arxiv","id":"2606.00770","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.00770","created_at":"2026-06-02T01:04:05Z"},{"alias_kind":"arxiv_version","alias_value":"2606.00770v1","created_at":"2026-06-02T01:04:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.00770","created_at":"2026-06-02T01:04:05Z"},{"alias_kind":"pith_short_12","alias_value":"6QYHTMQZX6SQ","created_at":"2026-06-02T01:04:05Z"},{"alias_kind":"pith_short_16","alias_value":"6QYHTMQZX6SQGT33","created_at":"2026-06-02T01:04:05Z"},{"alias_kind":"pith_short_8","alias_value":"6QYHTMQZ","created_at":"2026-06-02T01:04:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:6QYHTMQZX6SQGT33T3ONXOWZPQ","target":"record","payload":{"canonical_record":{"source":{"id":"2606.00770","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-05-30T15:21:37Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"50c857370fec03aaf294d266c119cdfff07e4d71b9d31cfeb59e95f82860d678","abstract_canon_sha256":"e466220de6da2d1f4d869f26c3c0c6be20fd1e2cb6067d94252357823688d332"},"schema_version":"1.0"},"canonical_sha256":"f43079b219bfa5034f7b9edcdbbad97c137148967c06ae9593774fff39aad27d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T01:04:05.286461Z","signature_b64":"OTmFuH09mNJJbv32d8fHSjA67Ugaz0Xqz10uUDpxG8akAuH9eKI9TBJ2/txZfuc3tQ4CYrDCPVG1VnOJqjovBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f43079b219bfa5034f7b9edcdbbad97c137148967c06ae9593774fff39aad27d","last_reissued_at":"2026-06-02T01:04:05.286044Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T01:04:05.286044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.00770","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-06-02T01:04:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2s9pmqUzLYxbZvAu8KKZPnWlARtesVC7SdFn2m93YfdhBaxTHuThZiyxnjHP725k+kQ2kM1I1BR0oc3Rj939DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T13:13:59.876976Z"},"content_sha256":"6e78dac73be025b7f6a5a099728b6f841f2778bb0c00abcbfe7b68551df2054a","schema_version":"1.0","event_id":"sha256:6e78dac73be025b7f6a5a099728b6f841f2778bb0c00abcbfe7b68551df2054a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:6QYHTMQZX6SQGT33T3ONXOWZPQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Search-space Reduction for Boolean MinCSPs via Essential Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Bart M. P. Jansen, Ruben F. A. Verhaegh","submitted_at":"2026-05-30T15:21:37Z","abstract_excerpt":"For a fixed set $\\mathcal{F}$ of Boolean constraint types, a MinCSP$(\\mathcal{F})$-instance consists of a formula $F$ that applies $m$ constraints from $\\mathcal{F}$ to a set of $n$ Boolean variables. The goal is to remove a minimum subset of constraint applications from $F$ to make the remaining formula satisfiable. Previous work characterized how the choice of $\\mathcal{F}$ affects its polynomial-time solvability and approximability. We extend a recently introduced preprocessing framework for graph problems to the problem above. Rephrased in the context of CSPs, this framework defines a cons"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.00770","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.00770/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-02T01:04:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ly1eQ+zx/9kABHkKNeVTi2pEPtdXvJevRfIwTq6Vfr+TwY7pcyqSIS5R+j0PMb2cPlfN5u5hc9VsuRYjqNNuDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T13:13:59.877372Z"},"content_sha256":"332c41dcddcbffe310deb7b7d7b93ab3d80e48d28a1a71239b74c0ea35d50e4a","schema_version":"1.0","event_id":"sha256:332c41dcddcbffe310deb7b7d7b93ab3d80e48d28a1a71239b74c0ea35d50e4a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6QYHTMQZX6SQGT33T3ONXOWZPQ/bundle.json","state_url":"https://pith.science/pith/6QYHTMQZX6SQGT33T3ONXOWZPQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6QYHTMQZX6SQGT33T3ONXOWZPQ/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-30T13:13:59Z","links":{"resolver":"https://pith.science/pith/6QYHTMQZX6SQGT33T3ONXOWZPQ","bundle":"https://pith.science/pith/6QYHTMQZX6SQGT33T3ONXOWZPQ/bundle.json","state":"https://pith.science/pith/6QYHTMQZX6SQGT33T3ONXOWZPQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6QYHTMQZX6SQGT33T3ONXOWZPQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:6QYHTMQZX6SQGT33T3ONXOWZPQ","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":"e466220de6da2d1f4d869f26c3c0c6be20fd1e2cb6067d94252357823688d332","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-05-30T15:21:37Z","title_canon_sha256":"50c857370fec03aaf294d266c119cdfff07e4d71b9d31cfeb59e95f82860d678"},"schema_version":"1.0","source":{"id":"2606.00770","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.00770","created_at":"2026-06-02T01:04:05Z"},{"alias_kind":"arxiv_version","alias_value":"2606.00770v1","created_at":"2026-06-02T01:04:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.00770","created_at":"2026-06-02T01:04:05Z"},{"alias_kind":"pith_short_12","alias_value":"6QYHTMQZX6SQ","created_at":"2026-06-02T01:04:05Z"},{"alias_kind":"pith_short_16","alias_value":"6QYHTMQZX6SQGT33","created_at":"2026-06-02T01:04:05Z"},{"alias_kind":"pith_short_8","alias_value":"6QYHTMQZ","created_at":"2026-06-02T01:04:05Z"}],"graph_snapshots":[{"event_id":"sha256:332c41dcddcbffe310deb7b7d7b93ab3d80e48d28a1a71239b74c0ea35d50e4a","target":"graph","created_at":"2026-06-02T01:04: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.00770/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For a fixed set $\\mathcal{F}$ of Boolean constraint types, a MinCSP$(\\mathcal{F})$-instance consists of a formula $F$ that applies $m$ constraints from $\\mathcal{F}$ to a set of $n$ Boolean variables. The goal is to remove a minimum subset of constraint applications from $F$ to make the remaining formula satisfiable. Previous work characterized how the choice of $\\mathcal{F}$ affects its polynomial-time solvability and approximability. We extend a recently introduced preprocessing framework for graph problems to the problem above. Rephrased in the context of CSPs, this framework defines a cons","authors_text":"Bart M. P. Jansen, Ruben F. A. Verhaegh","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-05-30T15:21:37Z","title":"Search-space Reduction for Boolean MinCSPs via Essential Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.00770","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:6e78dac73be025b7f6a5a099728b6f841f2778bb0c00abcbfe7b68551df2054a","target":"record","created_at":"2026-06-02T01:04: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":"e466220de6da2d1f4d869f26c3c0c6be20fd1e2cb6067d94252357823688d332","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-05-30T15:21:37Z","title_canon_sha256":"50c857370fec03aaf294d266c119cdfff07e4d71b9d31cfeb59e95f82860d678"},"schema_version":"1.0","source":{"id":"2606.00770","kind":"arxiv","version":1}},"canonical_sha256":"f43079b219bfa5034f7b9edcdbbad97c137148967c06ae9593774fff39aad27d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f43079b219bfa5034f7b9edcdbbad97c137148967c06ae9593774fff39aad27d","first_computed_at":"2026-06-02T01:04:05.286044Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T01:04:05.286044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OTmFuH09mNJJbv32d8fHSjA67Ugaz0Xqz10uUDpxG8akAuH9eKI9TBJ2/txZfuc3tQ4CYrDCPVG1VnOJqjovBA==","signature_status":"signed_v1","signed_at":"2026-06-02T01:04:05.286461Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.00770","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e78dac73be025b7f6a5a099728b6f841f2778bb0c00abcbfe7b68551df2054a","sha256:332c41dcddcbffe310deb7b7d7b93ab3d80e48d28a1a71239b74c0ea35d50e4a"],"state_sha256":"c0d5d4757feef477fa63b2281506d602bbeb7e75617dee9c06f8dacdddbebb61"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LEGCCQ68Pa+BLWTQR03uXQeb4hts2gogqBRtgGiuRzUcPfLlb8UN3axIPdHV6IkR2xds1S/4VJ/z9N3Nkgd1Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T13:13:59.879426Z","bundle_sha256":"978d4cdecef10146f812937469de36f3f1d47a3c29eb0ab81c611e8906b410a5"}}