{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:Z22JB3O2SLRSX3CYFLR3F23VLW","short_pith_number":"pith:Z22JB3O2","canonical_record":{"source":{"id":"1606.06216","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-06-20T17:29:01Z","cross_cats_sorted":[],"title_canon_sha256":"1a2459ed83cb22dae27bc47ef8cf451c92023923431e213b31e0c5289b354440","abstract_canon_sha256":"e7271884f656757d9d74d39acad53ca2fb0371cde607b8f1e004ecb1f0e7af73"},"schema_version":"1.0"},"canonical_sha256":"ceb490edda92e32bec582ae3b2eb755d93d452a3069b84076e89f24fc6ffcb30","source":{"kind":"arxiv","id":"1606.06216","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.06216","created_at":"2026-05-18T01:09:41Z"},{"alias_kind":"arxiv_version","alias_value":"1606.06216v3","created_at":"2026-05-18T01:09:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06216","created_at":"2026-05-18T01:09:41Z"},{"alias_kind":"pith_short_12","alias_value":"Z22JB3O2SLRS","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"Z22JB3O2SLRSX3CY","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"Z22JB3O2","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:Z22JB3O2SLRSX3CYFLR3F23VLW","target":"record","payload":{"canonical_record":{"source":{"id":"1606.06216","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-06-20T17:29:01Z","cross_cats_sorted":[],"title_canon_sha256":"1a2459ed83cb22dae27bc47ef8cf451c92023923431e213b31e0c5289b354440","abstract_canon_sha256":"e7271884f656757d9d74d39acad53ca2fb0371cde607b8f1e004ecb1f0e7af73"},"schema_version":"1.0"},"canonical_sha256":"ceb490edda92e32bec582ae3b2eb755d93d452a3069b84076e89f24fc6ffcb30","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:41.375179Z","signature_b64":"DRUrVOVYWkbVcOGDvt4CFV6C8YzcvgKgLET8uJsY1/IEzjnktt8otKq2OmJYmNOHTOMosva0T8gp+B+285JFAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ceb490edda92e32bec582ae3b2eb755d93d452a3069b84076e89f24fc6ffcb30","last_reissued_at":"2026-05-18T01:09:41.374766Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:41.374766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.06216","source_version":3,"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-18T01:09:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uyn5xNgQzEAHntn8PAvMKfHWACqH2p4fvQjxtrXG7lfuY4B2gIALKTv4ZdHkf/YmEZrZ1kyEtYfia5XjasyZAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T16:49:01.054703Z"},"content_sha256":"729fe746aa393cb6e18f0589060b342f33e26e64bf6c9e5070dc4fddd5a4c90a","schema_version":"1.0","event_id":"sha256:729fe746aa393cb6e18f0589060b342f33e26e64bf6c9e5070dc4fddd5a4c90a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:Z22JB3O2SLRSX3CYFLR3F23VLW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Neural networks with differentiable structure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Thomas Miconi","submitted_at":"2016-06-20T17:29:01Z","abstract_excerpt":"While gradient descent has proven highly successful in learning connection weights for neural networks, the actual structure of these networks is usually determined by hand, or by other optimization algorithms. Here we describe a simple method to make network structure differentiable, and therefore accessible to gradient descent. We test this method on recurrent neural networks applied to simple sequence prediction problems. Starting with initial networks containing only one node, the method automatically builds networks that successfully solve the tasks. The number of nodes in the final netwo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06216","kind":"arxiv","version":3},"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-18T01:09:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MSfdZMUa9wGOazc2fE99slryoOv1tGAA4NcxL1GTyLg/Uo2b5fjfE6RDQP2AYJ7oD9UnUgzSlIGYVAjNlZpYDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T16:49:01.055062Z"},"content_sha256":"597221671b5d48c0a5eed26f82a59c1bea8ed03395b756c5a4dddd432a814672","schema_version":"1.0","event_id":"sha256:597221671b5d48c0a5eed26f82a59c1bea8ed03395b756c5a4dddd432a814672"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z22JB3O2SLRSX3CYFLR3F23VLW/bundle.json","state_url":"https://pith.science/pith/Z22JB3O2SLRSX3CYFLR3F23VLW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z22JB3O2SLRSX3CYFLR3F23VLW/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-05-22T16:49:01Z","links":{"resolver":"https://pith.science/pith/Z22JB3O2SLRSX3CYFLR3F23VLW","bundle":"https://pith.science/pith/Z22JB3O2SLRSX3CYFLR3F23VLW/bundle.json","state":"https://pith.science/pith/Z22JB3O2SLRSX3CYFLR3F23VLW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z22JB3O2SLRSX3CYFLR3F23VLW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:Z22JB3O2SLRSX3CYFLR3F23VLW","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":"e7271884f656757d9d74d39acad53ca2fb0371cde607b8f1e004ecb1f0e7af73","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-06-20T17:29:01Z","title_canon_sha256":"1a2459ed83cb22dae27bc47ef8cf451c92023923431e213b31e0c5289b354440"},"schema_version":"1.0","source":{"id":"1606.06216","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.06216","created_at":"2026-05-18T01:09:41Z"},{"alias_kind":"arxiv_version","alias_value":"1606.06216v3","created_at":"2026-05-18T01:09:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06216","created_at":"2026-05-18T01:09:41Z"},{"alias_kind":"pith_short_12","alias_value":"Z22JB3O2SLRS","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"Z22JB3O2SLRSX3CY","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"Z22JB3O2","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:597221671b5d48c0a5eed26f82a59c1bea8ed03395b756c5a4dddd432a814672","target":"graph","created_at":"2026-05-18T01:09:41Z","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":"While gradient descent has proven highly successful in learning connection weights for neural networks, the actual structure of these networks is usually determined by hand, or by other optimization algorithms. Here we describe a simple method to make network structure differentiable, and therefore accessible to gradient descent. We test this method on recurrent neural networks applied to simple sequence prediction problems. Starting with initial networks containing only one node, the method automatically builds networks that successfully solve the tasks. The number of nodes in the final netwo","authors_text":"Thomas Miconi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-06-20T17:29:01Z","title":"Neural networks with differentiable structure"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06216","kind":"arxiv","version":3},"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:729fe746aa393cb6e18f0589060b342f33e26e64bf6c9e5070dc4fddd5a4c90a","target":"record","created_at":"2026-05-18T01:09:41Z","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":"e7271884f656757d9d74d39acad53ca2fb0371cde607b8f1e004ecb1f0e7af73","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-06-20T17:29:01Z","title_canon_sha256":"1a2459ed83cb22dae27bc47ef8cf451c92023923431e213b31e0c5289b354440"},"schema_version":"1.0","source":{"id":"1606.06216","kind":"arxiv","version":3}},"canonical_sha256":"ceb490edda92e32bec582ae3b2eb755d93d452a3069b84076e89f24fc6ffcb30","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ceb490edda92e32bec582ae3b2eb755d93d452a3069b84076e89f24fc6ffcb30","first_computed_at":"2026-05-18T01:09:41.374766Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:41.374766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DRUrVOVYWkbVcOGDvt4CFV6C8YzcvgKgLET8uJsY1/IEzjnktt8otKq2OmJYmNOHTOMosva0T8gp+B+285JFAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:41.375179Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.06216","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:729fe746aa393cb6e18f0589060b342f33e26e64bf6c9e5070dc4fddd5a4c90a","sha256:597221671b5d48c0a5eed26f82a59c1bea8ed03395b756c5a4dddd432a814672"],"state_sha256":"81aed47065e7e5efb61412abc267a1599744e627dfff3d3ce8e88b8cecfcbb8c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gVQG00B53aPEC8A9I0vN/wmmIIpDM5WTH1cd0xCQnHAx7DCPpmAHyrD52MbNepMnZUJTH/pz5eTwhPPE/AAhBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T16:49:01.058268Z","bundle_sha256":"9e32f7d86046882c15d902881d6f5614517e23ab0587ecc09806a3628abefcbc"}}