{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:4DRJJTBJVX3GDXCJ6DQYZVMH3R","short_pith_number":"pith:4DRJJTBJ","canonical_record":{"source":{"id":"2509.08150","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-09-09T21:14:44Z","cross_cats_sorted":[],"title_canon_sha256":"c9e66f0cf7ecfbf763a3a6b082a41d68dd6aa04635cb4119ec3f055b4f444de5","abstract_canon_sha256":"7afa38ff3067e1a7ddf6fe2f7bfdb5ec17829c584e73a2cb2b205c848da227d4"},"schema_version":"1.0"},"canonical_sha256":"e0e294cc29adf661dc49f0e18cd587dc51166323354bade7de235f7c4fdbc2ea","source":{"kind":"arxiv","id":"2509.08150","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.08150","created_at":"2026-05-26T01:02:27Z"},{"alias_kind":"arxiv_version","alias_value":"2509.08150v6","created_at":"2026-05-26T01:02:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.08150","created_at":"2026-05-26T01:02:27Z"},{"alias_kind":"pith_short_12","alias_value":"4DRJJTBJVX3G","created_at":"2026-05-26T01:02:27Z"},{"alias_kind":"pith_short_16","alias_value":"4DRJJTBJVX3GDXCJ","created_at":"2026-05-26T01:02:27Z"},{"alias_kind":"pith_short_8","alias_value":"4DRJJTBJ","created_at":"2026-05-26T01:02:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:4DRJJTBJVX3GDXCJ6DQYZVMH3R","target":"record","payload":{"canonical_record":{"source":{"id":"2509.08150","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-09-09T21:14:44Z","cross_cats_sorted":[],"title_canon_sha256":"c9e66f0cf7ecfbf763a3a6b082a41d68dd6aa04635cb4119ec3f055b4f444de5","abstract_canon_sha256":"7afa38ff3067e1a7ddf6fe2f7bfdb5ec17829c584e73a2cb2b205c848da227d4"},"schema_version":"1.0"},"canonical_sha256":"e0e294cc29adf661dc49f0e18cd587dc51166323354bade7de235f7c4fdbc2ea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T01:02:27.672645Z","signature_b64":"/XM/vMBSRIp7CNw1+PkxBCTszArXW+15bb2HStlvsFPTWM29RFHgNLIr/KgkB1FrBY/xb7ab2W9DwItXp6CnCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0e294cc29adf661dc49f0e18cd587dc51166323354bade7de235f7c4fdbc2ea","last_reissued_at":"2026-05-26T01:02:27.671991Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T01:02:27.671991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2509.08150","source_version":6,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-26T01:02:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YrH5FB89FNGg4edKyx6aVnYW3MzDcENCOe8fFBBPZ9YFVi6ItIyTr6d035rIpHj/8n5MTVADvGjSahlXM+fgCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:02:10.620029Z"},"content_sha256":"83d926013f919172819d307e28486ee7de7462fbcabfd79be9928188b6aaf183","schema_version":"1.0","event_id":"sha256:83d926013f919172819d307e28486ee7de7462fbcabfd79be9928188b6aaf183"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:4DRJJTBJVX3GDXCJ6DQYZVMH3R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Verbalized Algorithms: Classical Algorithms are All You Need (Mostly)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Verbalized algorithms limit LLMs to elementary string operations inside classical procedures that carry theoretical guarantees, improving the accuracy-runtime tradeoff on reasoning tasks.","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Christian Farrell, Hari Pathanjaly, Marko Pavic, Masataro Asai, Sarvesh Chezhian, Supriya Lall","submitted_at":"2025-09-09T21:14:44Z","abstract_excerpt":"Reasoning is a fundamentally algorithmic task. Yet current work on LLM-based reasoning relies on free-form generation whose theoretical guarantees (soundness, completeness, complexity, optimality) remain poorly understood. We argue that we should not treat them as general-purpose reasoners, and as an alternative, we propose a paradigm we call \\emph{verbalized algorithms} (VAs), which combines LLMs and various algorithms with established guarantees. Instead of betting on LLM's ability to solve a reasoning task, VAs limit their scope by decomposing the task down to simple elementary operations o"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Verbalized algorithms that limit LLMs to elementary string operations inside classical algorithms with established guarantees push the accuracy-runtime Pareto front on numerical reasoning, topic clustering, Wi-Fi access point optimization, and multi-hop Q&A RAG.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That LLMs can reliably and consistently answer the elementary string operations (e.g., binary comparisons or similarity judgments) required by the chosen classical algorithms without introducing errors that propagate through the overall procedure.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Verbalized algorithms integrate LLMs as oracles for simple string operations within classical algorithms to improve accuracy-runtime tradeoffs on sorting, clustering, submodular maximization, and multi-hop QA.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Verbalized algorithms limit LLMs to elementary string operations inside classical procedures that carry theoretical guarantees, improving the accuracy-runtime tradeoff on reasoning tasks.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"3782849feda53a3e7a089a9a92913b5f0e58e3256666cb1be80b21af82003679"},"source":{"id":"2509.08150","kind":"arxiv","version":6},"verdict":{"id":"80f95e75-1e95-45fb-a355-56f5f1fbc1b7","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-18T17:15:53.833347Z","strongest_claim":"Verbalized algorithms that limit LLMs to elementary string operations inside classical algorithms with established guarantees push the accuracy-runtime Pareto front on numerical reasoning, topic clustering, Wi-Fi access point optimization, and multi-hop Q&A RAG.","one_line_summary":"Verbalized algorithms integrate LLMs as oracles for simple string operations within classical algorithms to improve accuracy-runtime tradeoffs on sorting, clustering, submodular maximization, and multi-hop QA.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That LLMs can reliably and consistently answer the elementary string operations (e.g., binary comparisons or similarity judgments) required by the chosen classical algorithms without introducing errors that propagate through the overall procedure.","pith_extraction_headline":"Verbalized algorithms limit LLMs to elementary string operations inside classical procedures that carry theoretical guarantees, improving the accuracy-runtime tradeoff on reasoning tasks."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2509.08150/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":2,"snapshot_sha256":"41a3c1f42c5fa4cfeb6d0465d34a45ae47df2945e16110eab0e59a7ab495716c"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"80f95e75-1e95-45fb-a355-56f5f1fbc1b7"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-26T01:02:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"356Bmt9cXNnda+xQYveZhpPRAdZVBfHKEaVnHLrbXpqZN9rJmEIh9O43hdnbeJlx5iQukV4babYqw2MSxgpnDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:02:10.620982Z"},"content_sha256":"f54b79cd3ca6d6b546b8ecbdc06c74dbc7b1ffa4c3093750146782ebfba3cfd4","schema_version":"1.0","event_id":"sha256:f54b79cd3ca6d6b546b8ecbdc06c74dbc7b1ffa4c3093750146782ebfba3cfd4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4DRJJTBJVX3GDXCJ6DQYZVMH3R/bundle.json","state_url":"https://pith.science/pith/4DRJJTBJVX3GDXCJ6DQYZVMH3R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4DRJJTBJVX3GDXCJ6DQYZVMH3R/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T07:02:10Z","links":{"resolver":"https://pith.science/pith/4DRJJTBJVX3GDXCJ6DQYZVMH3R","bundle":"https://pith.science/pith/4DRJJTBJVX3GDXCJ6DQYZVMH3R/bundle.json","state":"https://pith.science/pith/4DRJJTBJVX3GDXCJ6DQYZVMH3R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4DRJJTBJVX3GDXCJ6DQYZVMH3R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:4DRJJTBJVX3GDXCJ6DQYZVMH3R","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7afa38ff3067e1a7ddf6fe2f7bfdb5ec17829c584e73a2cb2b205c848da227d4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-09-09T21:14:44Z","title_canon_sha256":"c9e66f0cf7ecfbf763a3a6b082a41d68dd6aa04635cb4119ec3f055b4f444de5"},"schema_version":"1.0","source":{"id":"2509.08150","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.08150","created_at":"2026-05-26T01:02:27Z"},{"alias_kind":"arxiv_version","alias_value":"2509.08150v6","created_at":"2026-05-26T01:02:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.08150","created_at":"2026-05-26T01:02:27Z"},{"alias_kind":"pith_short_12","alias_value":"4DRJJTBJVX3G","created_at":"2026-05-26T01:02:27Z"},{"alias_kind":"pith_short_16","alias_value":"4DRJJTBJVX3GDXCJ","created_at":"2026-05-26T01:02:27Z"},{"alias_kind":"pith_short_8","alias_value":"4DRJJTBJ","created_at":"2026-05-26T01:02:27Z"}],"graph_snapshots":[{"event_id":"sha256:f54b79cd3ca6d6b546b8ecbdc06c74dbc7b1ffa4c3093750146782ebfba3cfd4","target":"graph","created_at":"2026-05-26T01:02:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Verbalized algorithms that limit LLMs to elementary string operations inside classical algorithms with established guarantees push the accuracy-runtime Pareto front on numerical reasoning, topic clustering, Wi-Fi access point optimization, and multi-hop Q&A RAG."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That LLMs can reliably and consistently answer the elementary string operations (e.g., binary comparisons or similarity judgments) required by the chosen classical algorithms without introducing errors that propagate through the overall procedure."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Verbalized algorithms integrate LLMs as oracles for simple string operations within classical algorithms to improve accuracy-runtime tradeoffs on sorting, clustering, submodular maximization, and multi-hop QA."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Verbalized algorithms limit LLMs to elementary string operations inside classical procedures that carry theoretical guarantees, improving the accuracy-runtime tradeoff on reasoning tasks."}],"snapshot_sha256":"3782849feda53a3e7a089a9a92913b5f0e58e3256666cb1be80b21af82003679"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"41a3c1f42c5fa4cfeb6d0465d34a45ae47df2945e16110eab0e59a7ab495716c"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2509.08150/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Reasoning is a fundamentally algorithmic task. Yet current work on LLM-based reasoning relies on free-form generation whose theoretical guarantees (soundness, completeness, complexity, optimality) remain poorly understood. We argue that we should not treat them as general-purpose reasoners, and as an alternative, we propose a paradigm we call \\emph{verbalized algorithms} (VAs), which combines LLMs and various algorithms with established guarantees. Instead of betting on LLM's ability to solve a reasoning task, VAs limit their scope by decomposing the task down to simple elementary operations o","authors_text":"Christian Farrell, Hari Pathanjaly, Marko Pavic, Masataro Asai, Sarvesh Chezhian, Supriya Lall","cross_cats":[],"headline":"Verbalized algorithms limit LLMs to elementary string operations inside classical procedures that carry theoretical guarantees, improving the accuracy-runtime tradeoff on reasoning tasks.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-09-09T21:14:44Z","title":"Verbalized Algorithms: Classical Algorithms are All You Need (Mostly)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.08150","kind":"arxiv","version":6},"verdict":{"created_at":"2026-05-18T17:15:53.833347Z","id":"80f95e75-1e95-45fb-a355-56f5f1fbc1b7","model_set":{"reader":"grok-4.3"},"one_line_summary":"Verbalized algorithms integrate LLMs as oracles for simple string operations within classical algorithms to improve accuracy-runtime tradeoffs on sorting, clustering, submodular maximization, and multi-hop QA.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Verbalized algorithms limit LLMs to elementary string operations inside classical procedures that carry theoretical guarantees, improving the accuracy-runtime tradeoff on reasoning tasks.","strongest_claim":"Verbalized algorithms that limit LLMs to elementary string operations inside classical algorithms with established guarantees push the accuracy-runtime Pareto front on numerical reasoning, topic clustering, Wi-Fi access point optimization, and multi-hop Q&A RAG.","weakest_assumption":"That LLMs can reliably and consistently answer the elementary string operations (e.g., binary comparisons or similarity judgments) required by the chosen classical algorithms without introducing errors that propagate through the overall procedure."}},"verdict_id":"80f95e75-1e95-45fb-a355-56f5f1fbc1b7"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:83d926013f919172819d307e28486ee7de7462fbcabfd79be9928188b6aaf183","target":"record","created_at":"2026-05-26T01:02:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7afa38ff3067e1a7ddf6fe2f7bfdb5ec17829c584e73a2cb2b205c848da227d4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-09-09T21:14:44Z","title_canon_sha256":"c9e66f0cf7ecfbf763a3a6b082a41d68dd6aa04635cb4119ec3f055b4f444de5"},"schema_version":"1.0","source":{"id":"2509.08150","kind":"arxiv","version":6}},"canonical_sha256":"e0e294cc29adf661dc49f0e18cd587dc51166323354bade7de235f7c4fdbc2ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0e294cc29adf661dc49f0e18cd587dc51166323354bade7de235f7c4fdbc2ea","first_computed_at":"2026-05-26T01:02:27.671991Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T01:02:27.671991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/XM/vMBSRIp7CNw1+PkxBCTszArXW+15bb2HStlvsFPTWM29RFHgNLIr/KgkB1FrBY/xb7ab2W9DwItXp6CnCA==","signature_status":"signed_v1","signed_at":"2026-05-26T01:02:27.672645Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.08150","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83d926013f919172819d307e28486ee7de7462fbcabfd79be9928188b6aaf183","sha256:f54b79cd3ca6d6b546b8ecbdc06c74dbc7b1ffa4c3093750146782ebfba3cfd4"],"state_sha256":"0cb83b3b05bf58f88a1816516f45c50b3dd9cb470dbb834d22e42bbbb627fd1a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"onj/GO0U0yiSbrLcz5YS3NqR/6dLi5LsP3AQ8ObBy5ctmzswf6RVnFo+Qrj0K/o0zPd+oond2sMfHqXLQua4BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T07:02:10.625401Z","bundle_sha256":"6d6ce9c49dfe6872455e810f74d82df761aed2d71e5390001261075a184fe941"}}