{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:HDTM3GENUXRFOSE4RPQ6J5TTZI","short_pith_number":"pith:HDTM3GEN","schema_version":"1.0","canonical_sha256":"38e6cd988da5e257489c8be1e4f673ca284ec4faa897571a1d85e568104dd524","source":{"kind":"arxiv","id":"2506.01840","version":2},"attestation_state":"computed","paper":{"title":"Minimal Pair-Based Evaluation of Code-Switching","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Igor Sterner, Simone Teufel","submitted_at":"2025-06-02T16:27:53Z","abstract_excerpt":"There is a lack of an evaluation methodology that estimates the extent to which large language models (LLMs) use code-switching (CS) in the same way as bilinguals. Existing methods do not have wide language coverage, fail to account for the diverse range of CS phenomena, or do not scale. We propose an intervention based on minimal pairs of CS. Each minimal pair contains one naturally occurring CS sentence and one minimally manipulated variant. We collect up to 1,000 such pairs each for 11 language pairs. Our human experiments show that, for every language pair, bilinguals consistently prefer t"},"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.01840","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-06-02T16:27:53Z","cross_cats_sorted":[],"title_canon_sha256":"29ebf09476017743f5350a8154ed376ebecf55b24cdfef143ec9ae3f485c972c","abstract_canon_sha256":"5343d0ecd68cc9baa00e438d764678493cb76c611899f217bf438a5b65d900ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:43:32.500122Z","signature_b64":"bLWLyHiZe8p3u0l787g9BTzoq/Hd47wg+x0v87nHjrbn6gTx1Xq9/xF+fTOXdik7ft5eJp7l4BHZx4iD9eK6BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38e6cd988da5e257489c8be1e4f673ca284ec4faa897571a1d85e568104dd524","last_reissued_at":"2026-07-05T11:43:32.499642Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:43:32.499642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimal Pair-Based Evaluation of Code-Switching","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Igor Sterner, Simone Teufel","submitted_at":"2025-06-02T16:27:53Z","abstract_excerpt":"There is a lack of an evaluation methodology that estimates the extent to which large language models (LLMs) use code-switching (CS) in the same way as bilinguals. Existing methods do not have wide language coverage, fail to account for the diverse range of CS phenomena, or do not scale. We propose an intervention based on minimal pairs of CS. Each minimal pair contains one naturally occurring CS sentence and one minimally manipulated variant. We collect up to 1,000 such pairs each for 11 language pairs. Our human experiments show that, for every language pair, bilinguals consistently prefer t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.01840","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.01840/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.01840","created_at":"2026-07-05T11:43:32.499700+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.01840v2","created_at":"2026-07-05T11:43:32.499700+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.01840","created_at":"2026-07-05T11:43:32.499700+00:00"},{"alias_kind":"pith_short_12","alias_value":"HDTM3GENUXRF","created_at":"2026-07-05T11:43:32.499700+00:00"},{"alias_kind":"pith_short_16","alias_value":"HDTM3GENUXRFOSE4","created_at":"2026-07-05T11:43:32.499700+00:00"},{"alias_kind":"pith_short_8","alias_value":"HDTM3GEN","created_at":"2026-07-05T11:43:32.499700+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2602.11181","citing_title":"Code Mixologist : A Practitioner's Guide to Building Code-Mixed LLMs","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HDTM3GENUXRFOSE4RPQ6J5TTZI","json":"https://pith.science/pith/HDTM3GENUXRFOSE4RPQ6J5TTZI.json","graph_json":"https://pith.science/api/pith-number/HDTM3GENUXRFOSE4RPQ6J5TTZI/graph.json","events_json":"https://pith.science/api/pith-number/HDTM3GENUXRFOSE4RPQ6J5TTZI/events.json","paper":"https://pith.science/paper/HDTM3GEN"},"agent_actions":{"view_html":"https://pith.science/pith/HDTM3GENUXRFOSE4RPQ6J5TTZI","download_json":"https://pith.science/pith/HDTM3GENUXRFOSE4RPQ6J5TTZI.json","view_paper":"https://pith.science/paper/HDTM3GEN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.01840&json=true","fetch_graph":"https://pith.science/api/pith-number/HDTM3GENUXRFOSE4RPQ6J5TTZI/graph.json","fetch_events":"https://pith.science/api/pith-number/HDTM3GENUXRFOSE4RPQ6J5TTZI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HDTM3GENUXRFOSE4RPQ6J5TTZI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HDTM3GENUXRFOSE4RPQ6J5TTZI/action/storage_attestation","attest_author":"https://pith.science/pith/HDTM3GENUXRFOSE4RPQ6J5TTZI/action/author_attestation","sign_citation":"https://pith.science/pith/HDTM3GENUXRFOSE4RPQ6J5TTZI/action/citation_signature","submit_replication":"https://pith.science/pith/HDTM3GENUXRFOSE4RPQ6J5TTZI/action/replication_record"}},"created_at":"2026-07-05T11:43:32.499700+00:00","updated_at":"2026-07-05T11:43:32.499700+00:00"}