{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:2NXYWMAZ7LBPUJ3XWIOKOKEK2F","short_pith_number":"pith:2NXYWMAZ","schema_version":"1.0","canonical_sha256":"d36f8b3019fac2fa2777b21ca7288ad178e54a0fe8fc708648378bb9c5a44c0b","source":{"kind":"arxiv","id":"2407.05694","version":2},"attestation_state":"computed","paper":{"title":"On the Limitations of Compute Thresholds as a Governance Strategy","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.CL","cs.ET","cs.LG"],"primary_cat":"cs.AI","authors_text":"Sara Hooker","submitted_at":"2024-07-08T07:53:06Z","abstract_excerpt":"At face value, this essay is about understanding a fairly esoteric governance tool called compute thresholds. However, in order to grapple with whether these thresholds will achieve anything, we must first understand how they came to be. To do so, we need to engage with a decades-old debate at the heart of computer science progress, namely, is bigger always better? Does a certain inflection point of compute result in changes to the risk profile of a model? Hence, this essay may be of interest not only to policymakers and the wider public but also to computer scientists interested in understand"},"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.05694","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AI","submitted_at":"2024-07-08T07:53:06Z","cross_cats_sorted":["cs.CL","cs.ET","cs.LG"],"title_canon_sha256":"bf1d406b058e4d8c98e2dca9e1df6f9ac23bff11a1b64dfc424bb5435f0b1466","abstract_canon_sha256":"2f71367776a0ec083e5f1b7edb477ea6c98a724eeeea6739c4b327ea7aab318d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:49:53.951268Z","signature_b64":"oS3a4PVpUOsAkNyNyhlqbC9CZ2yrNQcirjECSEC9+EngzXaUoF0843YNfVOO0taqb9l9Yi4kW6/Kf7kNqimECw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d36f8b3019fac2fa2777b21ca7288ad178e54a0fe8fc708648378bb9c5a44c0b","last_reissued_at":"2026-07-05T08:49:53.950935Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:49:53.950935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Limitations of Compute Thresholds as a Governance Strategy","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.CL","cs.ET","cs.LG"],"primary_cat":"cs.AI","authors_text":"Sara Hooker","submitted_at":"2024-07-08T07:53:06Z","abstract_excerpt":"At face value, this essay is about understanding a fairly esoteric governance tool called compute thresholds. However, in order to grapple with whether these thresholds will achieve anything, we must first understand how they came to be. To do so, we need to engage with a decades-old debate at the heart of computer science progress, namely, is bigger always better? Does a certain inflection point of compute result in changes to the risk profile of a model? Hence, this essay may be of interest not only to policymakers and the wider public but also to computer scientists interested in understand"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.05694","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.05694/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.05694","created_at":"2026-07-05T08:49:53.950989+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.05694v2","created_at":"2026-07-05T08:49:53.950989+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.05694","created_at":"2026-07-05T08:49:53.950989+00:00"},{"alias_kind":"pith_short_12","alias_value":"2NXYWMAZ7LBP","created_at":"2026-07-05T08:49:53.950989+00:00"},{"alias_kind":"pith_short_16","alias_value":"2NXYWMAZ7LBPUJ3X","created_at":"2026-07-05T08:49:53.950989+00:00"},{"alias_kind":"pith_short_8","alias_value":"2NXYWMAZ","created_at":"2026-07-05T08:49:53.950989+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.28694","citing_title":"Verifying Restrictions on Frontier AI Research","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2604.04712","citing_title":"Hardware-Level Governance of AI Compute: A Feasibility Taxonomy for Regulatory Compliance and Treaty Verification","ref_index":36,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2NXYWMAZ7LBPUJ3XWIOKOKEK2F","json":"https://pith.science/pith/2NXYWMAZ7LBPUJ3XWIOKOKEK2F.json","graph_json":"https://pith.science/api/pith-number/2NXYWMAZ7LBPUJ3XWIOKOKEK2F/graph.json","events_json":"https://pith.science/api/pith-number/2NXYWMAZ7LBPUJ3XWIOKOKEK2F/events.json","paper":"https://pith.science/paper/2NXYWMAZ"},"agent_actions":{"view_html":"https://pith.science/pith/2NXYWMAZ7LBPUJ3XWIOKOKEK2F","download_json":"https://pith.science/pith/2NXYWMAZ7LBPUJ3XWIOKOKEK2F.json","view_paper":"https://pith.science/paper/2NXYWMAZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.05694&json=true","fetch_graph":"https://pith.science/api/pith-number/2NXYWMAZ7LBPUJ3XWIOKOKEK2F/graph.json","fetch_events":"https://pith.science/api/pith-number/2NXYWMAZ7LBPUJ3XWIOKOKEK2F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2NXYWMAZ7LBPUJ3XWIOKOKEK2F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2NXYWMAZ7LBPUJ3XWIOKOKEK2F/action/storage_attestation","attest_author":"https://pith.science/pith/2NXYWMAZ7LBPUJ3XWIOKOKEK2F/action/author_attestation","sign_citation":"https://pith.science/pith/2NXYWMAZ7LBPUJ3XWIOKOKEK2F/action/citation_signature","submit_replication":"https://pith.science/pith/2NXYWMAZ7LBPUJ3XWIOKOKEK2F/action/replication_record"}},"created_at":"2026-07-05T08:49:53.950989+00:00","updated_at":"2026-07-05T08:49:53.950989+00:00"}