{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:UF5RR27IZXZCMWUQDQVQ4GVC2W","short_pith_number":"pith:UF5RR27I","canonical_record":{"source":{"id":"1707.04780","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-07-15T19:46:25Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"eb77806e6019508630b0d0c7244b6e2a36cff4d2bdd2189307c0c4367f6762d5","abstract_canon_sha256":"41e16a463553565e825b2fbe0e5f5807ae07fa9a35977d2b7710e6c5ddad6b60"},"schema_version":"1.0"},"canonical_sha256":"a17b18ebe8cdf2265a901c2b0e1aa2d5a99107bc45973f272685bf7eaecc813c","source":{"kind":"arxiv","id":"1707.04780","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04780","created_at":"2026-05-18T00:12:48Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04780v2","created_at":"2026-05-18T00:12:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04780","created_at":"2026-05-18T00:12:48Z"},{"alias_kind":"pith_short_12","alias_value":"UF5RR27IZXZC","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UF5RR27IZXZCMWUQ","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UF5RR27I","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:UF5RR27IZXZCMWUQDQVQ4GVC2W","target":"record","payload":{"canonical_record":{"source":{"id":"1707.04780","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-07-15T19:46:25Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"eb77806e6019508630b0d0c7244b6e2a36cff4d2bdd2189307c0c4367f6762d5","abstract_canon_sha256":"41e16a463553565e825b2fbe0e5f5807ae07fa9a35977d2b7710e6c5ddad6b60"},"schema_version":"1.0"},"canonical_sha256":"a17b18ebe8cdf2265a901c2b0e1aa2d5a99107bc45973f272685bf7eaecc813c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:48.782503Z","signature_b64":"Uxw3RClQk0kUWJdc+dIdqqX1+bfKmELiutNIzpG8320TE50O2oCAgx3ccA8+3TP8qNAkYsd5BOMKnJALCp2oCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a17b18ebe8cdf2265a901c2b0e1aa2d5a99107bc45973f272685bf7eaecc813c","last_reissued_at":"2026-05-18T00:12:48.781932Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:48.781932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.04780","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-05-18T00:12:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tRMqw6AXpt7MI629VpqV38lDiwO9lFVe3uHGzYlBi1NOeddDAGToYFY6w5jX+sDJgjbkzGN4nbwGKrQxZKXBCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:05:22.198132Z"},"content_sha256":"52a9c8509b77ef4f75c2dda47b5763d92d4323196557723bc2dc9377f2ecefe5","schema_version":"1.0","event_id":"sha256:52a9c8509b77ef4f75c2dda47b5763d92d4323196557723bc2dc9377f2ecefe5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:UF5RR27IZXZCMWUQDQVQ4GVC2W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Science","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.NE","authors_text":"Antonio Liotta, Decebal Constantin Mocanu, Elena Mocanu, Madeleine Gibescu, Peter Stone, Phuong H. Nguyen","submitted_at":"2017-07-15T19:46:25Z","abstract_excerpt":"Through the success of deep learning in various domains, artificial neural networks are currently among the most used artificial intelligence methods. Taking inspiration from the network properties of biological neural networks (e.g. sparsity, scale-freeness), we argue that (contrary to general practice) artificial neural networks, too, should not have fully-connected layers. Here we propose sparse evolutionary training of artificial neural networks, an algorithm which evolves an initial sparse topology (Erd\\H{o}s-R\\'enyi random graph) of two consecutive layers of neurons into a scale-free top"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04780","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":""},"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:12:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZIIKDJgcFeqYt2KQmvC/G3w/7LCbRtaHlJ63FkyqUrIZTOFbyzTqLjX+p3L002YskwMk+lxXE+oo84rOq9HeBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:05:22.198658Z"},"content_sha256":"f6a633dd2198f3936dc2860183d2da29c8e99ddbcf11f3f83a79c7a234d9396d","schema_version":"1.0","event_id":"sha256:f6a633dd2198f3936dc2860183d2da29c8e99ddbcf11f3f83a79c7a234d9396d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UF5RR27IZXZCMWUQDQVQ4GVC2W/bundle.json","state_url":"https://pith.science/pith/UF5RR27IZXZCMWUQDQVQ4GVC2W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UF5RR27IZXZCMWUQDQVQ4GVC2W/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-02T19:05:22Z","links":{"resolver":"https://pith.science/pith/UF5RR27IZXZCMWUQDQVQ4GVC2W","bundle":"https://pith.science/pith/UF5RR27IZXZCMWUQDQVQ4GVC2W/bundle.json","state":"https://pith.science/pith/UF5RR27IZXZCMWUQDQVQ4GVC2W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UF5RR27IZXZCMWUQDQVQ4GVC2W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UF5RR27IZXZCMWUQDQVQ4GVC2W","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":"41e16a463553565e825b2fbe0e5f5807ae07fa9a35977d2b7710e6c5ddad6b60","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-07-15T19:46:25Z","title_canon_sha256":"eb77806e6019508630b0d0c7244b6e2a36cff4d2bdd2189307c0c4367f6762d5"},"schema_version":"1.0","source":{"id":"1707.04780","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04780","created_at":"2026-05-18T00:12:48Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04780v2","created_at":"2026-05-18T00:12:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04780","created_at":"2026-05-18T00:12:48Z"},{"alias_kind":"pith_short_12","alias_value":"UF5RR27IZXZC","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UF5RR27IZXZCMWUQ","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UF5RR27I","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:f6a633dd2198f3936dc2860183d2da29c8e99ddbcf11f3f83a79c7a234d9396d","target":"graph","created_at":"2026-05-18T00:12:48Z","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":"Through the success of deep learning in various domains, artificial neural networks are currently among the most used artificial intelligence methods. Taking inspiration from the network properties of biological neural networks (e.g. sparsity, scale-freeness), we argue that (contrary to general practice) artificial neural networks, too, should not have fully-connected layers. Here we propose sparse evolutionary training of artificial neural networks, an algorithm which evolves an initial sparse topology (Erd\\H{o}s-R\\'enyi random graph) of two consecutive layers of neurons into a scale-free top","authors_text":"Antonio Liotta, Decebal Constantin Mocanu, Elena Mocanu, Madeleine Gibescu, Peter Stone, Phuong H. Nguyen","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-07-15T19:46:25Z","title":"Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Science"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04780","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:52a9c8509b77ef4f75c2dda47b5763d92d4323196557723bc2dc9377f2ecefe5","target":"record","created_at":"2026-05-18T00:12:48Z","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":"41e16a463553565e825b2fbe0e5f5807ae07fa9a35977d2b7710e6c5ddad6b60","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-07-15T19:46:25Z","title_canon_sha256":"eb77806e6019508630b0d0c7244b6e2a36cff4d2bdd2189307c0c4367f6762d5"},"schema_version":"1.0","source":{"id":"1707.04780","kind":"arxiv","version":2}},"canonical_sha256":"a17b18ebe8cdf2265a901c2b0e1aa2d5a99107bc45973f272685bf7eaecc813c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a17b18ebe8cdf2265a901c2b0e1aa2d5a99107bc45973f272685bf7eaecc813c","first_computed_at":"2026-05-18T00:12:48.781932Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:48.781932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Uxw3RClQk0kUWJdc+dIdqqX1+bfKmELiutNIzpG8320TE50O2oCAgx3ccA8+3TP8qNAkYsd5BOMKnJALCp2oCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:48.782503Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.04780","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:52a9c8509b77ef4f75c2dda47b5763d92d4323196557723bc2dc9377f2ecefe5","sha256:f6a633dd2198f3936dc2860183d2da29c8e99ddbcf11f3f83a79c7a234d9396d"],"state_sha256":"c0fa5266919b8dbcb0a3906dcab70c54e03e003a4712beb8062e5914bfd804ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oVciiCau1W/yoc5lf3Fki7/X658/TDpPudyxG1dVffDefjqbtfGiEvilbnjN/pHZ3LDTRWPEZrJLX4i1Q928Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T19:05:22.201043Z","bundle_sha256":"6b76e06c49cb4a3136f2df0162e1f13a5828737a4bad7886cfa6b4372c9ff475"}}