{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:RPR3MPOHDDYBSY4CAVIOFEDO52","short_pith_number":"pith:RPR3MPOH","schema_version":"1.0","canonical_sha256":"8be3b63dc718f01963820550e2906eee9c8715180034e9fae2295ca1799bf48d","source":{"kind":"arxiv","id":"2402.13414","version":2},"attestation_state":"computed","paper":{"title":"Harnessing Large Language Models as Post-hoc Correctors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"Davide Mottin, Kuangyu Zhou, Zhiqiang Zhong","submitted_at":"2024-02-20T22:50:41Z","abstract_excerpt":"As Machine Learning (ML) models grow in size and demand higher-quality training data, the expenses associated with re-training and fine-tuning these models are escalating rapidly. Inspired by recent impressive achievements of Large Language Models (LLMs) in different fields, this paper delves into the question: can LLMs efficiently improve an ML's performance at a minimal cost? We show that, through our proposed training-free framework LlmCorr, an LLM can work as a post-hoc corrector to propose corrections for the predictions of an arbitrary ML model. In particular, we form a contextual knowle"},"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":"2402.13414","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-20T22:50:41Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"4f9c96b03582670d147993bb7fd9f6e8eef98fb766a288a6f9421efbad77a636","abstract_canon_sha256":"dafb7bf11473bb2f1810b161a60d864607a248cf60b5e2b654b0329a75fe50fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:36:22.853123Z","signature_b64":"R1PGz3Kk2SWG0koALtvkyk1bGV2V8AR/S9oLUKgtogEjAsTNkM7Z9fyt2mjQi82y3meCr6HZDqOb29YbnuHvAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8be3b63dc718f01963820550e2906eee9c8715180034e9fae2295ca1799bf48d","last_reissued_at":"2026-07-05T08:36:22.852636Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:36:22.852636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Harnessing Large Language Models as Post-hoc Correctors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"Davide Mottin, Kuangyu Zhou, Zhiqiang Zhong","submitted_at":"2024-02-20T22:50:41Z","abstract_excerpt":"As Machine Learning (ML) models grow in size and demand higher-quality training data, the expenses associated with re-training and fine-tuning these models are escalating rapidly. Inspired by recent impressive achievements of Large Language Models (LLMs) in different fields, this paper delves into the question: can LLMs efficiently improve an ML's performance at a minimal cost? We show that, through our proposed training-free framework LlmCorr, an LLM can work as a post-hoc corrector to propose corrections for the predictions of an arbitrary ML model. In particular, we form a contextual knowle"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.13414","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/2402.13414/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":"2402.13414","created_at":"2026-07-05T08:36:22.852695+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.13414v2","created_at":"2026-07-05T08:36:22.852695+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.13414","created_at":"2026-07-05T08:36:22.852695+00:00"},{"alias_kind":"pith_short_12","alias_value":"RPR3MPOHDDYB","created_at":"2026-07-05T08:36:22.852695+00:00"},{"alias_kind":"pith_short_16","alias_value":"RPR3MPOHDDYBSY4C","created_at":"2026-07-05T08:36:22.852695+00:00"},{"alias_kind":"pith_short_8","alias_value":"RPR3MPOH","created_at":"2026-07-05T08:36:22.852695+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2601.17609","citing_title":"What Language Models Know But Don't Say: Non-Generative Prior Extraction for Generalization","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2604.10389","citing_title":"BLUEmed: Retrieval-Augmented Multi-Agent Debate for Clinical Error Detection","ref_index":45,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RPR3MPOHDDYBSY4CAVIOFEDO52","json":"https://pith.science/pith/RPR3MPOHDDYBSY4CAVIOFEDO52.json","graph_json":"https://pith.science/api/pith-number/RPR3MPOHDDYBSY4CAVIOFEDO52/graph.json","events_json":"https://pith.science/api/pith-number/RPR3MPOHDDYBSY4CAVIOFEDO52/events.json","paper":"https://pith.science/paper/RPR3MPOH"},"agent_actions":{"view_html":"https://pith.science/pith/RPR3MPOHDDYBSY4CAVIOFEDO52","download_json":"https://pith.science/pith/RPR3MPOHDDYBSY4CAVIOFEDO52.json","view_paper":"https://pith.science/paper/RPR3MPOH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.13414&json=true","fetch_graph":"https://pith.science/api/pith-number/RPR3MPOHDDYBSY4CAVIOFEDO52/graph.json","fetch_events":"https://pith.science/api/pith-number/RPR3MPOHDDYBSY4CAVIOFEDO52/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RPR3MPOHDDYBSY4CAVIOFEDO52/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RPR3MPOHDDYBSY4CAVIOFEDO52/action/storage_attestation","attest_author":"https://pith.science/pith/RPR3MPOHDDYBSY4CAVIOFEDO52/action/author_attestation","sign_citation":"https://pith.science/pith/RPR3MPOHDDYBSY4CAVIOFEDO52/action/citation_signature","submit_replication":"https://pith.science/pith/RPR3MPOHDDYBSY4CAVIOFEDO52/action/replication_record"}},"created_at":"2026-07-05T08:36:22.852695+00:00","updated_at":"2026-07-05T08:36:22.852695+00:00"}