{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:OGMYVV2HREKMPR7CGNLKVQS32R","short_pith_number":"pith:OGMYVV2H","schema_version":"1.0","canonical_sha256":"71998ad7478914c7c7e23356aac25bd45e660c729f0ed80b3f8ca5f96d9c460e","source":{"kind":"arxiv","id":"2505.04075","version":2},"attestation_state":"computed","paper":{"title":"Rethinking LLM Advancement: Compute-Dependent and Independent Paths to Progress","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Anqi Qu, Henry Josephson, Jack Sanderson, Spencer Guo, Teddy Foley","submitted_at":"2025-05-07T02:26:17Z","abstract_excerpt":"Regulatory efforts to govern large language model (LLM) development have predominantly focused on restricting access to high-performance computational resources. This study evaluates the efficacy of such measures by examining whether LLM capabilities can advance through algorithmic innovation in compute-constrained environments. We propose a novel framework distinguishing compute-dependent innovations--which yield disproportionate benefits at high compute--from compute-independent innovations, which improve efficiency across compute scales. The impact is quantified using Compute-Equivalent Gai"},"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":"2505.04075","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-07T02:26:17Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"cf84ca3c337c5dd482d94de4e13231e9f093009091ccee85eeaf6f98aaa0a90a","abstract_canon_sha256":"89afee7143efc256f1f48856cb275d7d0750a548ecc4d1261e5d5e0e40003438"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:16:33.661947Z","signature_b64":"e0hrgPT1nS7Lq6n6RtKuBGoaqrgh1mw0G0xFTSV6B7rqBA+dS3hZAqa2p46/RRmPhKVJesaMhkEBYCMxG/PSDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71998ad7478914c7c7e23356aac25bd45e660c729f0ed80b3f8ca5f96d9c460e","last_reissued_at":"2026-07-05T11:16:33.661397Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:16:33.661397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rethinking LLM Advancement: Compute-Dependent and Independent Paths to Progress","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Anqi Qu, Henry Josephson, Jack Sanderson, Spencer Guo, Teddy Foley","submitted_at":"2025-05-07T02:26:17Z","abstract_excerpt":"Regulatory efforts to govern large language model (LLM) development have predominantly focused on restricting access to high-performance computational resources. This study evaluates the efficacy of such measures by examining whether LLM capabilities can advance through algorithmic innovation in compute-constrained environments. We propose a novel framework distinguishing compute-dependent innovations--which yield disproportionate benefits at high compute--from compute-independent innovations, which improve efficiency across compute scales. The impact is quantified using Compute-Equivalent Gai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.04075","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/2505.04075/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":"2505.04075","created_at":"2026-07-05T11:16:33.661459+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.04075v2","created_at":"2026-07-05T11:16:33.661459+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.04075","created_at":"2026-07-05T11:16:33.661459+00:00"},{"alias_kind":"pith_short_12","alias_value":"OGMYVV2HREKM","created_at":"2026-07-05T11:16:33.661459+00:00"},{"alias_kind":"pith_short_16","alias_value":"OGMYVV2HREKMPR7C","created_at":"2026-07-05T11:16:33.661459+00:00"},{"alias_kind":"pith_short_8","alias_value":"OGMYVV2H","created_at":"2026-07-05T11:16:33.661459+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.12876","citing_title":"Multi-Bitwidth Quantization for LLMs Using Additive Codebooks","ref_index":95,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OGMYVV2HREKMPR7CGNLKVQS32R","json":"https://pith.science/pith/OGMYVV2HREKMPR7CGNLKVQS32R.json","graph_json":"https://pith.science/api/pith-number/OGMYVV2HREKMPR7CGNLKVQS32R/graph.json","events_json":"https://pith.science/api/pith-number/OGMYVV2HREKMPR7CGNLKVQS32R/events.json","paper":"https://pith.science/paper/OGMYVV2H"},"agent_actions":{"view_html":"https://pith.science/pith/OGMYVV2HREKMPR7CGNLKVQS32R","download_json":"https://pith.science/pith/OGMYVV2HREKMPR7CGNLKVQS32R.json","view_paper":"https://pith.science/paper/OGMYVV2H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.04075&json=true","fetch_graph":"https://pith.science/api/pith-number/OGMYVV2HREKMPR7CGNLKVQS32R/graph.json","fetch_events":"https://pith.science/api/pith-number/OGMYVV2HREKMPR7CGNLKVQS32R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OGMYVV2HREKMPR7CGNLKVQS32R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OGMYVV2HREKMPR7CGNLKVQS32R/action/storage_attestation","attest_author":"https://pith.science/pith/OGMYVV2HREKMPR7CGNLKVQS32R/action/author_attestation","sign_citation":"https://pith.science/pith/OGMYVV2HREKMPR7CGNLKVQS32R/action/citation_signature","submit_replication":"https://pith.science/pith/OGMYVV2HREKMPR7CGNLKVQS32R/action/replication_record"}},"created_at":"2026-07-05T11:16:33.661459+00:00","updated_at":"2026-07-05T11:16:33.661459+00:00"}