{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:BVWHQZYR7AIASKZQ2GORJYGGXM","short_pith_number":"pith:BVWHQZYR","schema_version":"1.0","canonical_sha256":"0d6c786711f810092b30d19d14e0c6bb159db95be62fcbae8634d223d0d78747","source":{"kind":"arxiv","id":"2506.22061","version":2},"attestation_state":"computed","paper":{"title":"Negated String Containment is Decidable (Technical Report)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Luk\\'a\\v{s} Hol\\'ik, Michal He\\v{c}ko, Ond\\v{r}ej Leng\\'al, Vojt\\v{e}ch Havlena","submitted_at":"2025-06-27T09:56:36Z","abstract_excerpt":"We provide a positive answer to a long-standing open question of the decidability of the not-contains string predicate. Not-contains is practically relevant, for instance in symbolic execution of string manipulating programs. Particularly, we show that the predicate $\\neg\\mathit{Contains}(x_1 \\ldots x_n, y_1 \\ldots y_m)$, where $x_1 \\ldots x_n$ and $y_1 \\ldots y_m$ are sequences of string variables constrained by regular languages, is decidable. Decidability of a not-contains predicate combined with chain-free word equations and regular membership constraints follows."},"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":"2506.22061","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2025-06-27T09:56:36Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"2d9beffcd428ff311db1d527c904d2e64bf3b660100b1af55a86c78165d28f93","abstract_canon_sha256":"cb39eb27876c1280058f055e6d174819794b04d67b46d6247cd914f0b3606aa6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:30:02.804658Z","signature_b64":"AMPsuuHTjYieQKaxoUcCvV9O9pTqjru1lxA0eb54OAdixca2sXq+AcWzjl+NuagLqp3PF8sM4gReMXq342RLBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d6c786711f810092b30d19d14e0c6bb159db95be62fcbae8634d223d0d78747","last_reissued_at":"2026-07-05T11:30:02.804160Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:30:02.804160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Negated String Containment is Decidable (Technical Report)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Luk\\'a\\v{s} Hol\\'ik, Michal He\\v{c}ko, Ond\\v{r}ej Leng\\'al, Vojt\\v{e}ch Havlena","submitted_at":"2025-06-27T09:56:36Z","abstract_excerpt":"We provide a positive answer to a long-standing open question of the decidability of the not-contains string predicate. Not-contains is practically relevant, for instance in symbolic execution of string manipulating programs. Particularly, we show that the predicate $\\neg\\mathit{Contains}(x_1 \\ldots x_n, y_1 \\ldots y_m)$, where $x_1 \\ldots x_n$ and $y_1 \\ldots y_m$ are sequences of string variables constrained by regular languages, is decidable. Decidability of a not-contains predicate combined with chain-free word equations and regular membership constraints follows."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.22061","kind":"arxiv","version":2},"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/2506.22061/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":"2506.22061","created_at":"2026-07-05T11:30:02.804218+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.22061v2","created_at":"2026-07-05T11:30:02.804218+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.22061","created_at":"2026-07-05T11:30:02.804218+00:00"},{"alias_kind":"pith_short_12","alias_value":"BVWHQZYR7AIA","created_at":"2026-07-05T11:30:02.804218+00:00"},{"alias_kind":"pith_short_16","alias_value":"BVWHQZYR7AIASKZQ","created_at":"2026-07-05T11:30:02.804218+00:00"},{"alias_kind":"pith_short_8","alias_value":"BVWHQZYR","created_at":"2026-07-05T11:30:02.804218+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/BVWHQZYR7AIASKZQ2GORJYGGXM","json":"https://pith.science/pith/BVWHQZYR7AIASKZQ2GORJYGGXM.json","graph_json":"https://pith.science/api/pith-number/BVWHQZYR7AIASKZQ2GORJYGGXM/graph.json","events_json":"https://pith.science/api/pith-number/BVWHQZYR7AIASKZQ2GORJYGGXM/events.json","paper":"https://pith.science/paper/BVWHQZYR"},"agent_actions":{"view_html":"https://pith.science/pith/BVWHQZYR7AIASKZQ2GORJYGGXM","download_json":"https://pith.science/pith/BVWHQZYR7AIASKZQ2GORJYGGXM.json","view_paper":"https://pith.science/paper/BVWHQZYR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.22061&json=true","fetch_graph":"https://pith.science/api/pith-number/BVWHQZYR7AIASKZQ2GORJYGGXM/graph.json","fetch_events":"https://pith.science/api/pith-number/BVWHQZYR7AIASKZQ2GORJYGGXM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BVWHQZYR7AIASKZQ2GORJYGGXM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BVWHQZYR7AIASKZQ2GORJYGGXM/action/storage_attestation","attest_author":"https://pith.science/pith/BVWHQZYR7AIASKZQ2GORJYGGXM/action/author_attestation","sign_citation":"https://pith.science/pith/BVWHQZYR7AIASKZQ2GORJYGGXM/action/citation_signature","submit_replication":"https://pith.science/pith/BVWHQZYR7AIASKZQ2GORJYGGXM/action/replication_record"}},"created_at":"2026-07-05T11:30:02.804218+00:00","updated_at":"2026-07-05T11:30:02.804218+00:00"}