{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ULWKA73PYU2KBWPLKWEPTR3EKO","short_pith_number":"pith:ULWKA73P","schema_version":"1.0","canonical_sha256":"a2eca07f6fc534a0d9eb5588f9c76453925032d2df16b315606b9460da460cad","source":{"kind":"arxiv","id":"2410.16377","version":2},"attestation_state":"computed","paper":{"title":"A Simple Model of Inference Scaling Laws","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Noam Levi","submitted_at":"2024-10-21T18:00:06Z","abstract_excerpt":"Neural scaling laws have garnered significant interest due to their ability to predict model performance as a function of increasing parameters, data, and compute. In this work, we propose a simple statistical ansatz based on memorization to study scaling laws in the context of inference, specifically how performance improves with multiple inference attempts. We explore the coverage, or pass@k metric, which measures the chance of success over repeated attempts and provide a motivation for the observed functional form of the inference scaling behavior of the coverage in large language models (L"},"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":"2410.16377","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2024-10-21T18:00:06Z","cross_cats_sorted":["cs.AI","cs.IT","cs.LG","math.IT"],"title_canon_sha256":"a1b2fcb3234215b9bb1dc62a84cea4f7af506c859eb021aaaaec14a1cc608354","abstract_canon_sha256":"805967667281f928d0110c2a72c8e4c8164d0302b61b27f61a37ed7f302f8623"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:45:56.613359Z","signature_b64":"CnrgHIlEpPSr7Pg9q/TOV5Q1SWtPwuD22mbAV5OysEGsZdlji0g1H2XJHJ+E68KRwNWIeBc986LhAre6e8iIDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2eca07f6fc534a0d9eb5588f9c76453925032d2df16b315606b9460da460cad","last_reissued_at":"2026-07-05T09:45:56.612890Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:45:56.612890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Simple Model of Inference Scaling Laws","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Noam Levi","submitted_at":"2024-10-21T18:00:06Z","abstract_excerpt":"Neural scaling laws have garnered significant interest due to their ability to predict model performance as a function of increasing parameters, data, and compute. In this work, we propose a simple statistical ansatz based on memorization to study scaling laws in the context of inference, specifically how performance improves with multiple inference attempts. We explore the coverage, or pass@k metric, which measures the chance of success over repeated attempts and provide a motivation for the observed functional form of the inference scaling behavior of the coverage in large language models (L"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.16377","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/2410.16377/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":"2410.16377","created_at":"2026-07-05T09:45:56.612949+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.16377v2","created_at":"2026-07-05T09:45:56.612949+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.16377","created_at":"2026-07-05T09:45:56.612949+00:00"},{"alias_kind":"pith_short_12","alias_value":"ULWKA73PYU2K","created_at":"2026-07-05T09:45:56.612949+00:00"},{"alias_kind":"pith_short_16","alias_value":"ULWKA73PYU2KBWPL","created_at":"2026-07-05T09:45:56.612949+00:00"},{"alias_kind":"pith_short_8","alias_value":"ULWKA73P","created_at":"2026-07-05T09:45:56.612949+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25986","citing_title":"The Inference-Compute Frontier and a Latency-Efficient Architecture for Limit Order Book Prediction","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2606.28661","citing_title":"When More Sampling Hurts: The Modal Ceiling and Correlation Ceiling of Test-Time Scaling","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08680","citing_title":"Semantic Voting: Execution-Grounded Consensus for LLM Code Generation","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08658","citing_title":"Sketch-and-Verify: Structured Inference-Time Scaling via Program Sketching","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ULWKA73PYU2KBWPLKWEPTR3EKO","json":"https://pith.science/pith/ULWKA73PYU2KBWPLKWEPTR3EKO.json","graph_json":"https://pith.science/api/pith-number/ULWKA73PYU2KBWPLKWEPTR3EKO/graph.json","events_json":"https://pith.science/api/pith-number/ULWKA73PYU2KBWPLKWEPTR3EKO/events.json","paper":"https://pith.science/paper/ULWKA73P"},"agent_actions":{"view_html":"https://pith.science/pith/ULWKA73PYU2KBWPLKWEPTR3EKO","download_json":"https://pith.science/pith/ULWKA73PYU2KBWPLKWEPTR3EKO.json","view_paper":"https://pith.science/paper/ULWKA73P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.16377&json=true","fetch_graph":"https://pith.science/api/pith-number/ULWKA73PYU2KBWPLKWEPTR3EKO/graph.json","fetch_events":"https://pith.science/api/pith-number/ULWKA73PYU2KBWPLKWEPTR3EKO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ULWKA73PYU2KBWPLKWEPTR3EKO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ULWKA73PYU2KBWPLKWEPTR3EKO/action/storage_attestation","attest_author":"https://pith.science/pith/ULWKA73PYU2KBWPLKWEPTR3EKO/action/author_attestation","sign_citation":"https://pith.science/pith/ULWKA73PYU2KBWPLKWEPTR3EKO/action/citation_signature","submit_replication":"https://pith.science/pith/ULWKA73PYU2KBWPLKWEPTR3EKO/action/replication_record"}},"created_at":"2026-07-05T09:45:56.612949+00:00","updated_at":"2026-07-05T09:45:56.612949+00:00"}