{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:242KCTUG2TLW7ONU3BAEZ6XI2K","short_pith_number":"pith:242KCTUG","schema_version":"1.0","canonical_sha256":"d734a14e86d4d76fb9b4d8404cfae8d28603ce82f3934643b12191f70feaa19c","source":{"kind":"arxiv","id":"2506.16639","version":1},"attestation_state":"computed","paper":{"title":"LLM-based Satisfiability Checking of String Requirements by Consistent Data and Checker Generation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Aren A. Babikian, Boqi Chen, D\\'aniel Varr\\'o, Gunter Mussbacher, Shuzhao Feng","submitted_at":"2025-06-19T22:41:43Z","abstract_excerpt":"Requirements over strings, commonly represented using natural language (NL), are particularly relevant for software systems due to their heavy reliance on string data manipulation. While individual requirements can usually be analyzed manually, verifying properties (e.g., satisfiability) over sets of NL requirements is particularly challenging. Formal approaches (e.g., SMT solvers) may efficiently verify such properties, but are known to have theoretical limitations. Additionally, the translation of NL requirements into formal constraints typically requires significant manual effort. Recently,"},"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.16639","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2025-06-19T22:41:43Z","cross_cats_sorted":[],"title_canon_sha256":"3810df0c156dce24d3259bfc6fb7e9abf6c42f83751b0c87a6c27d70fddd2e4c","abstract_canon_sha256":"e9e720e8845ae0cfe1b4bd3a6f4855c2512d4a653c530ed640ea7d76b9c047a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:24:39.964367Z","signature_b64":"7Dqlx3GwxviaHGdS0uY3Yr6cnBZfWGDAjsjq7otV6nPlOqilc1fbYA1GmvR8ClbWnZAOX1HbqQobC+a9SiUSAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d734a14e86d4d76fb9b4d8404cfae8d28603ce82f3934643b12191f70feaa19c","last_reissued_at":"2026-07-05T11:24:39.963911Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:24:39.963911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LLM-based Satisfiability Checking of String Requirements by Consistent Data and Checker Generation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Aren A. Babikian, Boqi Chen, D\\'aniel Varr\\'o, Gunter Mussbacher, Shuzhao Feng","submitted_at":"2025-06-19T22:41:43Z","abstract_excerpt":"Requirements over strings, commonly represented using natural language (NL), are particularly relevant for software systems due to their heavy reliance on string data manipulation. While individual requirements can usually be analyzed manually, verifying properties (e.g., satisfiability) over sets of NL requirements is particularly challenging. Formal approaches (e.g., SMT solvers) may efficiently verify such properties, but are known to have theoretical limitations. Additionally, the translation of NL requirements into formal constraints typically requires significant manual effort. Recently,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.16639","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/2506.16639/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.16639","created_at":"2026-07-05T11:24:39.963963+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.16639v1","created_at":"2026-07-05T11:24:39.963963+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.16639","created_at":"2026-07-05T11:24:39.963963+00:00"},{"alias_kind":"pith_short_12","alias_value":"242KCTUG2TLW","created_at":"2026-07-05T11:24:39.963963+00:00"},{"alias_kind":"pith_short_16","alias_value":"242KCTUG2TLW7ONU","created_at":"2026-07-05T11:24:39.963963+00:00"},{"alias_kind":"pith_short_8","alias_value":"242KCTUG","created_at":"2026-07-05T11:24:39.963963+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/242KCTUG2TLW7ONU3BAEZ6XI2K","json":"https://pith.science/pith/242KCTUG2TLW7ONU3BAEZ6XI2K.json","graph_json":"https://pith.science/api/pith-number/242KCTUG2TLW7ONU3BAEZ6XI2K/graph.json","events_json":"https://pith.science/api/pith-number/242KCTUG2TLW7ONU3BAEZ6XI2K/events.json","paper":"https://pith.science/paper/242KCTUG"},"agent_actions":{"view_html":"https://pith.science/pith/242KCTUG2TLW7ONU3BAEZ6XI2K","download_json":"https://pith.science/pith/242KCTUG2TLW7ONU3BAEZ6XI2K.json","view_paper":"https://pith.science/paper/242KCTUG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.16639&json=true","fetch_graph":"https://pith.science/api/pith-number/242KCTUG2TLW7ONU3BAEZ6XI2K/graph.json","fetch_events":"https://pith.science/api/pith-number/242KCTUG2TLW7ONU3BAEZ6XI2K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/242KCTUG2TLW7ONU3BAEZ6XI2K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/242KCTUG2TLW7ONU3BAEZ6XI2K/action/storage_attestation","attest_author":"https://pith.science/pith/242KCTUG2TLW7ONU3BAEZ6XI2K/action/author_attestation","sign_citation":"https://pith.science/pith/242KCTUG2TLW7ONU3BAEZ6XI2K/action/citation_signature","submit_replication":"https://pith.science/pith/242KCTUG2TLW7ONU3BAEZ6XI2K/action/replication_record"}},"created_at":"2026-07-05T11:24:39.963963+00:00","updated_at":"2026-07-05T11:24:39.963963+00:00"}