{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:6EQPR6O2RAANPV6S4IOOYE33HR","short_pith_number":"pith:6EQPR6O2","schema_version":"1.0","canonical_sha256":"f120f8f9da8800d7d7d2e21cec137b3c5df59f16f3f9d17c7a2a2500413ba5a7","source":{"kind":"arxiv","id":"2504.04639","version":4},"attestation_state":"computed","paper":{"title":"Ineffectiveness for Search and Undecidability of PCSP Meta-Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL","cs.DS","cs.LO"],"primary_cat":"cs.CC","authors_text":"Alberto Larrauri","submitted_at":"2025-04-06T23:08:05Z","abstract_excerpt":"It is an open question whether the search and decision versions of promise CSPs are equivalent. Most known algorithms for PCSPs solve only their \\emph{decision} variant, and it is unknown whether they can be adapted to solve \\emph{search} as well. The main approaches, called BLP, AIP and BLP+AIP, handle a PCSP by finding a solution to a relaxation of some integer program. We prove that rounding those solutions to a proper search certificate can be as hard as any problem in the class TFNP. In other words, these algorithms are ineffective for search. Building on the algebraic approach to PCSPs, "},"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":"2504.04639","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-04-06T23:08:05Z","cross_cats_sorted":["cs.CL","cs.DS","cs.LO"],"title_canon_sha256":"e46fc9b32dab6973a156f27ad0f6a8490b8bd755ee81a94245443809d40dac76","abstract_canon_sha256":"efc71b38e1f86656ab11f6e5203905cc33ea61d81b0c4d8cf4e73775d783188f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T02:05:00.123942Z","signature_b64":"auAzX8HwIfY/mMlditx2omSmuUuBPvqH0Vhtgwrb0Dd4GIDZLXIsnO8yY3f6Sy2qSIVaYvQrHW7T7NCCdfTvAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f120f8f9da8800d7d7d2e21cec137b3c5df59f16f3f9d17c7a2a2500413ba5a7","last_reissued_at":"2026-05-26T02:05:00.123285Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T02:05:00.123285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ineffectiveness for Search and Undecidability of PCSP Meta-Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL","cs.DS","cs.LO"],"primary_cat":"cs.CC","authors_text":"Alberto Larrauri","submitted_at":"2025-04-06T23:08:05Z","abstract_excerpt":"It is an open question whether the search and decision versions of promise CSPs are equivalent. Most known algorithms for PCSPs solve only their \\emph{decision} variant, and it is unknown whether they can be adapted to solve \\emph{search} as well. The main approaches, called BLP, AIP and BLP+AIP, handle a PCSP by finding a solution to a relaxation of some integer program. We prove that rounding those solutions to a proper search certificate can be as hard as any problem in the class TFNP. In other words, these algorithms are ineffective for search. Building on the algebraic approach to PCSPs, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.04639","kind":"arxiv","version":4},"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/2504.04639/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2504.04639","created_at":"2026-05-26T02:05:00.123409+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.04639v4","created_at":"2026-05-26T02:05:00.123409+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.04639","created_at":"2026-05-26T02:05:00.123409+00:00"},{"alias_kind":"pith_short_12","alias_value":"6EQPR6O2RAAN","created_at":"2026-05-26T02:05:00.123409+00:00"},{"alias_kind":"pith_short_16","alias_value":"6EQPR6O2RAANPV6S","created_at":"2026-05-26T02:05:00.123409+00:00"},{"alias_kind":"pith_short_8","alias_value":"6EQPR6O2","created_at":"2026-05-26T02:05:00.123409+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/6EQPR6O2RAANPV6S4IOOYE33HR","json":"https://pith.science/pith/6EQPR6O2RAANPV6S4IOOYE33HR.json","graph_json":"https://pith.science/api/pith-number/6EQPR6O2RAANPV6S4IOOYE33HR/graph.json","events_json":"https://pith.science/api/pith-number/6EQPR6O2RAANPV6S4IOOYE33HR/events.json","paper":"https://pith.science/paper/6EQPR6O2"},"agent_actions":{"view_html":"https://pith.science/pith/6EQPR6O2RAANPV6S4IOOYE33HR","download_json":"https://pith.science/pith/6EQPR6O2RAANPV6S4IOOYE33HR.json","view_paper":"https://pith.science/paper/6EQPR6O2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.04639&json=true","fetch_graph":"https://pith.science/api/pith-number/6EQPR6O2RAANPV6S4IOOYE33HR/graph.json","fetch_events":"https://pith.science/api/pith-number/6EQPR6O2RAANPV6S4IOOYE33HR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6EQPR6O2RAANPV6S4IOOYE33HR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6EQPR6O2RAANPV6S4IOOYE33HR/action/storage_attestation","attest_author":"https://pith.science/pith/6EQPR6O2RAANPV6S4IOOYE33HR/action/author_attestation","sign_citation":"https://pith.science/pith/6EQPR6O2RAANPV6S4IOOYE33HR/action/citation_signature","submit_replication":"https://pith.science/pith/6EQPR6O2RAANPV6S4IOOYE33HR/action/replication_record"}},"created_at":"2026-05-26T02:05:00.123409+00:00","updated_at":"2026-05-26T02:05:00.123409+00:00"}