{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:UUHWPQWWB3N43R6RCENGWORYVZ","short_pith_number":"pith:UUHWPQWW","schema_version":"1.0","canonical_sha256":"a50f67c2d60edbcdc7d1111a6b3a38ae458216b90b2098635af9fece4ba09bb4","source":{"kind":"arxiv","id":"2406.12725","version":1},"attestation_state":"computed","paper":{"title":"Can Large Language Models Code Like a Linguist?: A Case Study in Low Resource Sound Law Induction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Anna Cai, Aravind Mysore, Atharva Naik, Clayton Marr, David Mortensen, Hong Sng, Kalvin Chang, Kexun Zhang, Nathaniel Robinson, Rebecca Byrnes","submitted_at":"2024-06-18T15:46:04Z","abstract_excerpt":"Historical linguists have long written a kind of incompletely formalized ''program'' that converts reconstructed words in an ancestor language into words in one of its attested descendants that consist of a series of ordered string rewrite functions (called sound laws). They do this by observing pairs of words in the reconstructed language (protoforms) and the descendent language (reflexes) and constructing a program that transforms protoforms into reflexes. However, writing these programs is error-prone and time-consuming. Prior work has successfully scaffolded this process computationally, b"},"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":"2406.12725","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-06-18T15:46:04Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"1436a02bdd9596c1d032a8f05d8a2ce0f7ebff3e734b790acdb0f869f63534f3","abstract_canon_sha256":"737e9bad40a6f8a3b51114e227cb44402904383ab9b7812d0f5932bb3598c414"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:43:24.884428Z","signature_b64":"mJwqRxmVCiGWd117RTVr3t18pcWt2xTjSqYY0hic9lDEcEi9kjww6Hkl7KpHppo3kcjaBwKxgKi4YoBIS1XWCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a50f67c2d60edbcdc7d1111a6b3a38ae458216b90b2098635af9fece4ba09bb4","last_reissued_at":"2026-07-05T10:43:24.883932Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:43:24.883932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Can Large Language Models Code Like a Linguist?: A Case Study in Low Resource Sound Law Induction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Anna Cai, Aravind Mysore, Atharva Naik, Clayton Marr, David Mortensen, Hong Sng, Kalvin Chang, Kexun Zhang, Nathaniel Robinson, Rebecca Byrnes","submitted_at":"2024-06-18T15:46:04Z","abstract_excerpt":"Historical linguists have long written a kind of incompletely formalized ''program'' that converts reconstructed words in an ancestor language into words in one of its attested descendants that consist of a series of ordered string rewrite functions (called sound laws). They do this by observing pairs of words in the reconstructed language (protoforms) and the descendent language (reflexes) and constructing a program that transforms protoforms into reflexes. However, writing these programs is error-prone and time-consuming. Prior work has successfully scaffolded this process computationally, b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.12725","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/2406.12725/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":"2406.12725","created_at":"2026-07-05T10:43:24.883988+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.12725v1","created_at":"2026-07-05T10:43:24.883988+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.12725","created_at":"2026-07-05T10:43:24.883988+00:00"},{"alias_kind":"pith_short_12","alias_value":"UUHWPQWWB3N4","created_at":"2026-07-05T10:43:24.883988+00:00"},{"alias_kind":"pith_short_16","alias_value":"UUHWPQWWB3N43R6R","created_at":"2026-07-05T10:43:24.883988+00:00"},{"alias_kind":"pith_short_8","alias_value":"UUHWPQWW","created_at":"2026-07-05T10:43:24.883988+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/UUHWPQWWB3N43R6RCENGWORYVZ","json":"https://pith.science/pith/UUHWPQWWB3N43R6RCENGWORYVZ.json","graph_json":"https://pith.science/api/pith-number/UUHWPQWWB3N43R6RCENGWORYVZ/graph.json","events_json":"https://pith.science/api/pith-number/UUHWPQWWB3N43R6RCENGWORYVZ/events.json","paper":"https://pith.science/paper/UUHWPQWW"},"agent_actions":{"view_html":"https://pith.science/pith/UUHWPQWWB3N43R6RCENGWORYVZ","download_json":"https://pith.science/pith/UUHWPQWWB3N43R6RCENGWORYVZ.json","view_paper":"https://pith.science/paper/UUHWPQWW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.12725&json=true","fetch_graph":"https://pith.science/api/pith-number/UUHWPQWWB3N43R6RCENGWORYVZ/graph.json","fetch_events":"https://pith.science/api/pith-number/UUHWPQWWB3N43R6RCENGWORYVZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UUHWPQWWB3N43R6RCENGWORYVZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UUHWPQWWB3N43R6RCENGWORYVZ/action/storage_attestation","attest_author":"https://pith.science/pith/UUHWPQWWB3N43R6RCENGWORYVZ/action/author_attestation","sign_citation":"https://pith.science/pith/UUHWPQWWB3N43R6RCENGWORYVZ/action/citation_signature","submit_replication":"https://pith.science/pith/UUHWPQWWB3N43R6RCENGWORYVZ/action/replication_record"}},"created_at":"2026-07-05T10:43:24.883988+00:00","updated_at":"2026-07-05T10:43:24.883988+00:00"}