{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:KN53N7E3GW2C7CVHBEJGZQGWDO","short_pith_number":"pith:KN53N7E3","canonical_record":{"source":{"id":"2402.05164","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-07T18:58:18Z","cross_cats_sorted":["cs.AI","cs.NE"],"title_canon_sha256":"b1295b5c5f14bd07d41249811ed6c3180767134150d26db6f9acc482abde323f","abstract_canon_sha256":"3e1466253298fed8d57070b960133890c4cc06a38e5da7ea3750300c15eb5936"},"schema_version":"1.0"},"canonical_sha256":"537bb6fc9b35b42f8aa709126cc0d61bbd15f469e675741ee691abc0400dbae9","source":{"kind":"arxiv","id":"2402.05164","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.05164","created_at":"2026-07-05T08:19:22Z"},{"alias_kind":"arxiv_version","alias_value":"2402.05164v2","created_at":"2026-07-05T08:19:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.05164","created_at":"2026-07-05T08:19:22Z"},{"alias_kind":"pith_short_12","alias_value":"KN53N7E3GW2C","created_at":"2026-07-05T08:19:22Z"},{"alias_kind":"pith_short_16","alias_value":"KN53N7E3GW2C7CVH","created_at":"2026-07-05T08:19:22Z"},{"alias_kind":"pith_short_8","alias_value":"KN53N7E3","created_at":"2026-07-05T08:19:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:KN53N7E3GW2C7CVHBEJGZQGWDO","target":"record","payload":{"canonical_record":{"source":{"id":"2402.05164","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-07T18:58:18Z","cross_cats_sorted":["cs.AI","cs.NE"],"title_canon_sha256":"b1295b5c5f14bd07d41249811ed6c3180767134150d26db6f9acc482abde323f","abstract_canon_sha256":"3e1466253298fed8d57070b960133890c4cc06a38e5da7ea3750300c15eb5936"},"schema_version":"1.0"},"canonical_sha256":"537bb6fc9b35b42f8aa709126cc0d61bbd15f469e675741ee691abc0400dbae9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:19:22.348461Z","signature_b64":"on8gsrd7Lw9PvSPQfuN1DB36LHVD9xuQaBYsgWLy2s1BihhZddA+CynuFn5XxVuDkBEtWdtW4LpyAEX2aeV/Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"537bb6fc9b35b42f8aa709126cc0d61bbd15f469e675741ee691abc0400dbae9","last_reissued_at":"2026-07-05T08:19:22.347965Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:19:22.347965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2402.05164","source_version":2,"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-07-05T08:19:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TbbHAXHX3CNRfCZ0X1ePY8xvLrsrl8I/vy38yCmjrD0MDHx7STrWvmRvndlYK0yNoYHN6MuYb8I4Yjec8FPRAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T18:18:21.834483Z"},"content_sha256":"cca5c4f3d0e4814a32e585b28084803aa4f70483d17e71cdd0678a1372f255da","schema_version":"1.0","event_id":"sha256:cca5c4f3d0e4814a32e585b28084803aa4f70483d17e71cdd0678a1372f255da"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:KN53N7E3GW2C7CVHBEJGZQGWDO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Resource Model For Neural Scaling Law","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.NE"],"primary_cat":"cs.LG","authors_text":"Jeff Gore, Jinyeop Song, Max Tegmark, Ziming Liu","submitted_at":"2024-02-07T18:58:18Z","abstract_excerpt":"Neural scaling laws characterize how model performance improves as the model size scales up. Inspired by empirical observations, we introduce a resource model of neural scaling. A task is usually composite hence can be decomposed into many subtasks, which compete for resources (measured by the number of neurons allocated to subtasks). On toy problems, we empirically find that: (1) The loss of a subtask is inversely proportional to its allocated neurons. (2) When multiple subtasks are present in a composite task, the resources acquired by each subtask uniformly grow as models get larger, keepin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.05164","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.05164/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:19:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pPWMK8HqMixGFIPCC0Gu9LT4kYLO0Fa9eWMjgelUF2ikxXAID7eIeT84QzwJIZlIuPr2zCrOr4da3Su9WVtgDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T18:18:21.835593Z"},"content_sha256":"8f8ee3eb8fae82ada1905b7bffee4851fdf9c50d3a5d9b493d5d2dafe1b912b0","schema_version":"1.0","event_id":"sha256:8f8ee3eb8fae82ada1905b7bffee4851fdf9c50d3a5d9b493d5d2dafe1b912b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KN53N7E3GW2C7CVHBEJGZQGWDO/bundle.json","state_url":"https://pith.science/pith/KN53N7E3GW2C7CVHBEJGZQGWDO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KN53N7E3GW2C7CVHBEJGZQGWDO/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-08-17T18:18:21Z","links":{"resolver":"https://pith.science/pith/KN53N7E3GW2C7CVHBEJGZQGWDO","bundle":"https://pith.science/pith/KN53N7E3GW2C7CVHBEJGZQGWDO/bundle.json","state":"https://pith.science/pith/KN53N7E3GW2C7CVHBEJGZQGWDO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KN53N7E3GW2C7CVHBEJGZQGWDO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:KN53N7E3GW2C7CVHBEJGZQGWDO","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":"3e1466253298fed8d57070b960133890c4cc06a38e5da7ea3750300c15eb5936","cross_cats_sorted":["cs.AI","cs.NE"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-07T18:58:18Z","title_canon_sha256":"b1295b5c5f14bd07d41249811ed6c3180767134150d26db6f9acc482abde323f"},"schema_version":"1.0","source":{"id":"2402.05164","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.05164","created_at":"2026-07-05T08:19:22Z"},{"alias_kind":"arxiv_version","alias_value":"2402.05164v2","created_at":"2026-07-05T08:19:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.05164","created_at":"2026-07-05T08:19:22Z"},{"alias_kind":"pith_short_12","alias_value":"KN53N7E3GW2C","created_at":"2026-07-05T08:19:22Z"},{"alias_kind":"pith_short_16","alias_value":"KN53N7E3GW2C7CVH","created_at":"2026-07-05T08:19:22Z"},{"alias_kind":"pith_short_8","alias_value":"KN53N7E3","created_at":"2026-07-05T08:19:22Z"}],"graph_snapshots":[{"event_id":"sha256:8f8ee3eb8fae82ada1905b7bffee4851fdf9c50d3a5d9b493d5d2dafe1b912b0","target":"graph","created_at":"2026-07-05T08:19:22Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2402.05164/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Neural scaling laws characterize how model performance improves as the model size scales up. Inspired by empirical observations, we introduce a resource model of neural scaling. A task is usually composite hence can be decomposed into many subtasks, which compete for resources (measured by the number of neurons allocated to subtasks). On toy problems, we empirically find that: (1) The loss of a subtask is inversely proportional to its allocated neurons. (2) When multiple subtasks are present in a composite task, the resources acquired by each subtask uniformly grow as models get larger, keepin","authors_text":"Jeff Gore, Jinyeop Song, Max Tegmark, Ziming Liu","cross_cats":["cs.AI","cs.NE"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-07T18:58:18Z","title":"A Resource Model For Neural Scaling Law"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.05164","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:cca5c4f3d0e4814a32e585b28084803aa4f70483d17e71cdd0678a1372f255da","target":"record","created_at":"2026-07-05T08:19:22Z","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":"3e1466253298fed8d57070b960133890c4cc06a38e5da7ea3750300c15eb5936","cross_cats_sorted":["cs.AI","cs.NE"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-07T18:58:18Z","title_canon_sha256":"b1295b5c5f14bd07d41249811ed6c3180767134150d26db6f9acc482abde323f"},"schema_version":"1.0","source":{"id":"2402.05164","kind":"arxiv","version":2}},"canonical_sha256":"537bb6fc9b35b42f8aa709126cc0d61bbd15f469e675741ee691abc0400dbae9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"537bb6fc9b35b42f8aa709126cc0d61bbd15f469e675741ee691abc0400dbae9","first_computed_at":"2026-07-05T08:19:22.347965Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:19:22.347965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"on8gsrd7Lw9PvSPQfuN1DB36LHVD9xuQaBYsgWLy2s1BihhZddA+CynuFn5XxVuDkBEtWdtW4LpyAEX2aeV/Cg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:19:22.348461Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.05164","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cca5c4f3d0e4814a32e585b28084803aa4f70483d17e71cdd0678a1372f255da","sha256:8f8ee3eb8fae82ada1905b7bffee4851fdf9c50d3a5d9b493d5d2dafe1b912b0"],"state_sha256":"8861feb52c24ccdce48bf8e1121e70e7563231f14faacf065e629c31792ea0bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zN8705hmdKyL1Ez4Aw9wOW5malgONg4tCFVvd8ukrTIDWd2T75+bpqFBe/nyLv1AAkZOOYf1qTVXHSqmj6CnBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T18:18:21.842057Z","bundle_sha256":"1247325a5caa34b08c5a0206babc67694210e90b14030f14ce00c62c63675b54"}}