{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:GYKOSSHJY6TDYSBIYB43K7BTG4","short_pith_number":"pith:GYKOSSHJ","schema_version":"1.0","canonical_sha256":"3614e948e9c7a63c4828c079b57c33373548a82f51512bc511818b2e549787e8","source":{"kind":"arxiv","id":"2407.04899","version":2},"attestation_state":"computed","paper":{"title":"Algorithmic Language Models with Neurally Compiled Libraries","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL","cs.PL"],"primary_cat":"cs.AI","authors_text":"Lucas Saldyt, Subbarao Kambhampati","submitted_at":"2024-07-06T00:27:05Z","abstract_excerpt":"Important tasks such as reasoning and planning are fundamentally algorithmic, meaning that solving them robustly requires acquiring true reasoning or planning algorithms, rather than shortcuts. Large Language Models lack true algorithmic ability primarily because of the limitations of neural network optimization algorithms, their optimization data and optimization objective, but also due to architectural inexpressivity. To solve this, our paper proposes augmenting LLMs with a library of fundamental operations and sophisticated differentiable programs, so that common algorithms do not need to 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":"2407.04899","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-07-06T00:27:05Z","cross_cats_sorted":["cs.CL","cs.PL"],"title_canon_sha256":"cf4d722981eb1f58676878d9186adb84a77b60e73db67b269bb704e54329b689","abstract_canon_sha256":"39c8644f3865bc3d3229d3123c5074fa27bba608fee1104bbb1225a84242b97c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:08:58.699592Z","signature_b64":"TPf4S3RZX5GW6JyVZvozVhSGY7A76Qc5xlbYo3wOJkFBWx7hwgUCTjaplNkvSHPFOw8oa/JZET3DvQwFRLVJDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3614e948e9c7a63c4828c079b57c33373548a82f51512bc511818b2e549787e8","last_reissued_at":"2026-07-05T11:08:58.699104Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:08:58.699104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithmic Language Models with Neurally Compiled Libraries","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL","cs.PL"],"primary_cat":"cs.AI","authors_text":"Lucas Saldyt, Subbarao Kambhampati","submitted_at":"2024-07-06T00:27:05Z","abstract_excerpt":"Important tasks such as reasoning and planning are fundamentally algorithmic, meaning that solving them robustly requires acquiring true reasoning or planning algorithms, rather than shortcuts. Large Language Models lack true algorithmic ability primarily because of the limitations of neural network optimization algorithms, their optimization data and optimization objective, but also due to architectural inexpressivity. To solve this, our paper proposes augmenting LLMs with a library of fundamental operations and sophisticated differentiable programs, so that common algorithms do not need to b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.04899","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/2407.04899/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":"2407.04899","created_at":"2026-07-05T11:08:58.699161+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.04899v2","created_at":"2026-07-05T11:08:58.699161+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.04899","created_at":"2026-07-05T11:08:58.699161+00:00"},{"alias_kind":"pith_short_12","alias_value":"GYKOSSHJY6TD","created_at":"2026-07-05T11:08:58.699161+00:00"},{"alias_kind":"pith_short_16","alias_value":"GYKOSSHJY6TDYSBI","created_at":"2026-07-05T11:08:58.699161+00:00"},{"alias_kind":"pith_short_8","alias_value":"GYKOSSHJ","created_at":"2026-07-05T11:08:58.699161+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.08816","citing_title":"Loom: A Scalable Analytical Neural Computer Architecture","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GYKOSSHJY6TDYSBIYB43K7BTG4","json":"https://pith.science/pith/GYKOSSHJY6TDYSBIYB43K7BTG4.json","graph_json":"https://pith.science/api/pith-number/GYKOSSHJY6TDYSBIYB43K7BTG4/graph.json","events_json":"https://pith.science/api/pith-number/GYKOSSHJY6TDYSBIYB43K7BTG4/events.json","paper":"https://pith.science/paper/GYKOSSHJ"},"agent_actions":{"view_html":"https://pith.science/pith/GYKOSSHJY6TDYSBIYB43K7BTG4","download_json":"https://pith.science/pith/GYKOSSHJY6TDYSBIYB43K7BTG4.json","view_paper":"https://pith.science/paper/GYKOSSHJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.04899&json=true","fetch_graph":"https://pith.science/api/pith-number/GYKOSSHJY6TDYSBIYB43K7BTG4/graph.json","fetch_events":"https://pith.science/api/pith-number/GYKOSSHJY6TDYSBIYB43K7BTG4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GYKOSSHJY6TDYSBIYB43K7BTG4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GYKOSSHJY6TDYSBIYB43K7BTG4/action/storage_attestation","attest_author":"https://pith.science/pith/GYKOSSHJY6TDYSBIYB43K7BTG4/action/author_attestation","sign_citation":"https://pith.science/pith/GYKOSSHJY6TDYSBIYB43K7BTG4/action/citation_signature","submit_replication":"https://pith.science/pith/GYKOSSHJY6TDYSBIYB43K7BTG4/action/replication_record"}},"created_at":"2026-07-05T11:08:58.699161+00:00","updated_at":"2026-07-05T11:08:58.699161+00:00"}