{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:UF2NKNWMX7NE46T5BB6ENGNNFB","short_pith_number":"pith:UF2NKNWM","canonical_record":{"source":{"id":"1712.05440","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-14T20:31:29Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"fc73db334fe9d36dbd86b79f142376094df9ee1fe01c4cdc1b4d101aeec7a1f5","abstract_canon_sha256":"ba0c143e0d93735cce6b1ceba36dc2f6862c5b928ee456e7dc888f62bb3a2e9a"},"schema_version":"1.0"},"canonical_sha256":"a174d536ccbfda4e7a7d087c4699ad28451faf5d06548b17a70f4e5afd1a9790","source":{"kind":"arxiv","id":"1712.05440","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.05440","created_at":"2026-05-18T00:27:56Z"},{"alias_kind":"arxiv_version","alias_value":"1712.05440v1","created_at":"2026-05-18T00:27:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05440","created_at":"2026-05-18T00:27:56Z"},{"alias_kind":"pith_short_12","alias_value":"UF2NKNWMX7NE","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UF2NKNWMX7NE46T5","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UF2NKNWM","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:UF2NKNWMX7NE46T5BB6ENGNNFB","target":"record","payload":{"canonical_record":{"source":{"id":"1712.05440","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-14T20:31:29Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"fc73db334fe9d36dbd86b79f142376094df9ee1fe01c4cdc1b4d101aeec7a1f5","abstract_canon_sha256":"ba0c143e0d93735cce6b1ceba36dc2f6862c5b928ee456e7dc888f62bb3a2e9a"},"schema_version":"1.0"},"canonical_sha256":"a174d536ccbfda4e7a7d087c4699ad28451faf5d06548b17a70f4e5afd1a9790","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:56.458512Z","signature_b64":"5NV/PBa65Rb70e+Y/lhXgWZxIqlR0676zBTg5o3L1UGnWx7HYawRmGz/MDfDL20zMgOan2lPmAyPSJ+sRMTfDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a174d536ccbfda4e7a7d087c4699ad28451faf5d06548b17a70f4e5afd1a9790","last_reissued_at":"2026-05-18T00:27:56.457849Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:56.457849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.05440","source_version":1,"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-05-18T00:27:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4ATdGecDuYNBdK36MtB0tx/b6RJXWVoc/ucwGz+DoRHammSdrrDL1buUmoa53qZteYGw/S0VLZQmlpFxWg7FDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T14:53:46.851346Z"},"content_sha256":"da6c6a225d3a1c148a366bc1c94f514a808883de06d54281b30439c2d66509f5","schema_version":"1.0","event_id":"sha256:da6c6a225d3a1c148a366bc1c94f514a808883de06d54281b30439c2d66509f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:UF2NKNWMX7NE46T5BB6ENGNNFB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nonparametric Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.LG","authors_text":"George Philipp, Jaime G. Carbonell","submitted_at":"2017-12-14T20:31:29Z","abstract_excerpt":"Automatically determining the optimal size of a neural network for a given task without prior information currently requires an expensive global search and training many networks from scratch. In this paper, we address the problem of automatically finding a good network size during a single training cycle. We introduce *nonparametric neural networks*, a non-probabilistic framework for conducting optimization over all possible network sizes and prove its soundness when network growth is limited via an L_p penalty. We train networks under this framework by continuously adding new units while eli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05440","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T00:27:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EMfgSj/3SjSG8JKNvg2NM5HOOjJCcyydc/USHtng3zLMwBWtWll6tZYbhtx2WQP/uA4msDSimRksmpgXziN2Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T14:53:46.851706Z"},"content_sha256":"a4bac948a76f8725cbe27dd5fb0f5379e55787c80fb9e2858b0f15dfc068706f","schema_version":"1.0","event_id":"sha256:a4bac948a76f8725cbe27dd5fb0f5379e55787c80fb9e2858b0f15dfc068706f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UF2NKNWMX7NE46T5BB6ENGNNFB/bundle.json","state_url":"https://pith.science/pith/UF2NKNWMX7NE46T5BB6ENGNNFB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UF2NKNWMX7NE46T5BB6ENGNNFB/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-06-20T14:53:46Z","links":{"resolver":"https://pith.science/pith/UF2NKNWMX7NE46T5BB6ENGNNFB","bundle":"https://pith.science/pith/UF2NKNWMX7NE46T5BB6ENGNNFB/bundle.json","state":"https://pith.science/pith/UF2NKNWMX7NE46T5BB6ENGNNFB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UF2NKNWMX7NE46T5BB6ENGNNFB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UF2NKNWMX7NE46T5BB6ENGNNFB","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":"ba0c143e0d93735cce6b1ceba36dc2f6862c5b928ee456e7dc888f62bb3a2e9a","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-14T20:31:29Z","title_canon_sha256":"fc73db334fe9d36dbd86b79f142376094df9ee1fe01c4cdc1b4d101aeec7a1f5"},"schema_version":"1.0","source":{"id":"1712.05440","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.05440","created_at":"2026-05-18T00:27:56Z"},{"alias_kind":"arxiv_version","alias_value":"1712.05440v1","created_at":"2026-05-18T00:27:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05440","created_at":"2026-05-18T00:27:56Z"},{"alias_kind":"pith_short_12","alias_value":"UF2NKNWMX7NE","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UF2NKNWMX7NE46T5","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UF2NKNWM","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:a4bac948a76f8725cbe27dd5fb0f5379e55787c80fb9e2858b0f15dfc068706f","target":"graph","created_at":"2026-05-18T00:27:56Z","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"},"paper":{"abstract_excerpt":"Automatically determining the optimal size of a neural network for a given task without prior information currently requires an expensive global search and training many networks from scratch. In this paper, we address the problem of automatically finding a good network size during a single training cycle. We introduce *nonparametric neural networks*, a non-probabilistic framework for conducting optimization over all possible network sizes and prove its soundness when network growth is limited via an L_p penalty. We train networks under this framework by continuously adding new units while eli","authors_text":"George Philipp, Jaime G. Carbonell","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-14T20:31:29Z","title":"Nonparametric Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05440","kind":"arxiv","version":1},"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:da6c6a225d3a1c148a366bc1c94f514a808883de06d54281b30439c2d66509f5","target":"record","created_at":"2026-05-18T00:27:56Z","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":"ba0c143e0d93735cce6b1ceba36dc2f6862c5b928ee456e7dc888f62bb3a2e9a","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-14T20:31:29Z","title_canon_sha256":"fc73db334fe9d36dbd86b79f142376094df9ee1fe01c4cdc1b4d101aeec7a1f5"},"schema_version":"1.0","source":{"id":"1712.05440","kind":"arxiv","version":1}},"canonical_sha256":"a174d536ccbfda4e7a7d087c4699ad28451faf5d06548b17a70f4e5afd1a9790","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a174d536ccbfda4e7a7d087c4699ad28451faf5d06548b17a70f4e5afd1a9790","first_computed_at":"2026-05-18T00:27:56.457849Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:56.457849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5NV/PBa65Rb70e+Y/lhXgWZxIqlR0676zBTg5o3L1UGnWx7HYawRmGz/MDfDL20zMgOan2lPmAyPSJ+sRMTfDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:56.458512Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.05440","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da6c6a225d3a1c148a366bc1c94f514a808883de06d54281b30439c2d66509f5","sha256:a4bac948a76f8725cbe27dd5fb0f5379e55787c80fb9e2858b0f15dfc068706f"],"state_sha256":"1443db49430f6b96e67bf467be9087fd45473619075b524a3ce18a58cdb78a0d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wq/YxWn4UwU9/taTlfDGW9tzpcbuTjEchEWpuMW1NNd0G0xtNIq75V9/aRXWC9EnlJC9Hv3TBMh9iSkdNU7vAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T14:53:46.853714Z","bundle_sha256":"5b92fa5522b9db18fe05701bdec98c06394edbda75ea0773f460a1bb5b24b86a"}}