{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OF3YDZ7XYXIUWSMFL7T5HRZB7O","short_pith_number":"pith:OF3YDZ7X","canonical_record":{"source":{"id":"1710.04580","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-12T16:02:19Z","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"title_canon_sha256":"3eaec2ff0490cde329a0eed604591f8c6dc3bd4ec4ebe111aedf3ce71edffffa","abstract_canon_sha256":"9b9e867baa1b67fb0f96d43bf6115382286d7d6c1e131aaf8ff46ba18bb5e388"},"schema_version":"1.0"},"canonical_sha256":"717781e7f7c5d14b49855fe7d3c721fbb88bc9202950a0071f6baab5a3ddd4f0","source":{"kind":"arxiv","id":"1710.04580","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.04580","created_at":"2026-05-18T00:33:00Z"},{"alias_kind":"arxiv_version","alias_value":"1710.04580v1","created_at":"2026-05-18T00:33:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.04580","created_at":"2026-05-18T00:33:00Z"},{"alias_kind":"pith_short_12","alias_value":"OF3YDZ7XYXIU","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OF3YDZ7XYXIUWSMF","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OF3YDZ7X","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OF3YDZ7XYXIUWSMFL7T5HRZB7O","target":"record","payload":{"canonical_record":{"source":{"id":"1710.04580","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-12T16:02:19Z","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"title_canon_sha256":"3eaec2ff0490cde329a0eed604591f8c6dc3bd4ec4ebe111aedf3ce71edffffa","abstract_canon_sha256":"9b9e867baa1b67fb0f96d43bf6115382286d7d6c1e131aaf8ff46ba18bb5e388"},"schema_version":"1.0"},"canonical_sha256":"717781e7f7c5d14b49855fe7d3c721fbb88bc9202950a0071f6baab5a3ddd4f0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:00.610664Z","signature_b64":"QoW98EK8/Ae24BN5CAOMJPgMLH/Gh2uyRJ09w7TDoVBO03tkUutMUe1GiHRrGs1bIm/a/BT5VcLmw9xj8+qeAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"717781e7f7c5d14b49855fe7d3c721fbb88bc9202950a0071f6baab5a3ddd4f0","last_reissued_at":"2026-05-18T00:33:00.610235Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:00.610235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.04580","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:33:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1vy0xdKtN74ccfCWVL8zGjyPqHnKRJ4id8j56s9P6s38VMgtUJIU+8VHhn1oZz2VZE8gP43/meIa7nZHXID1Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:31:46.818969Z"},"content_sha256":"67a6f9b3ddf96416662bb828d949e1f5bbace451a8668210e51fea9a2fc8b01d","schema_version":"1.0","event_id":"sha256:67a6f9b3ddf96416662bb828d949e1f5bbace451a8668210e51fea9a2fc8b01d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OF3YDZ7XYXIUWSMFL7T5HRZB7O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Additivity of Information in Multilayer Networks via Additive Gaussian Noise Transforms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Galen Reeves","submitted_at":"2017-10-12T16:02:19Z","abstract_excerpt":"Multilayer (or deep) networks are powerful probabilistic models based on multiple stages of a linear transform followed by a non-linear (possibly random) function. In general, the linear transforms are defined by matrices and the non-linear functions are defined by information channels. These models have gained great popularity due to their ability to characterize complex probabilistic relationships arising in a wide variety of inference problems. The contribution of this paper is a new method for analyzing the fundamental limits of statistical inference in settings where the model is known. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.04580","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:33:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O422n/KDEsLUJkz7ZI5McTZPxKtbLsc1VoV2HEDKmV9A+dRG7zIpZ5QSXx/KvO5JCh/9iPbc5rDgebaWrA7GBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:31:46.819683Z"},"content_sha256":"b62b7def0597589db9e341a24ae3923a83298b16d0c7dd2884eb94db4165bb87","schema_version":"1.0","event_id":"sha256:b62b7def0597589db9e341a24ae3923a83298b16d0c7dd2884eb94db4165bb87"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OF3YDZ7XYXIUWSMFL7T5HRZB7O/bundle.json","state_url":"https://pith.science/pith/OF3YDZ7XYXIUWSMFL7T5HRZB7O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OF3YDZ7XYXIUWSMFL7T5HRZB7O/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-27T10:31:46Z","links":{"resolver":"https://pith.science/pith/OF3YDZ7XYXIUWSMFL7T5HRZB7O","bundle":"https://pith.science/pith/OF3YDZ7XYXIUWSMFL7T5HRZB7O/bundle.json","state":"https://pith.science/pith/OF3YDZ7XYXIUWSMFL7T5HRZB7O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OF3YDZ7XYXIUWSMFL7T5HRZB7O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OF3YDZ7XYXIUWSMFL7T5HRZB7O","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":"9b9e867baa1b67fb0f96d43bf6115382286d7d6c1e131aaf8ff46ba18bb5e388","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-12T16:02:19Z","title_canon_sha256":"3eaec2ff0490cde329a0eed604591f8c6dc3bd4ec4ebe111aedf3ce71edffffa"},"schema_version":"1.0","source":{"id":"1710.04580","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.04580","created_at":"2026-05-18T00:33:00Z"},{"alias_kind":"arxiv_version","alias_value":"1710.04580v1","created_at":"2026-05-18T00:33:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.04580","created_at":"2026-05-18T00:33:00Z"},{"alias_kind":"pith_short_12","alias_value":"OF3YDZ7XYXIU","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OF3YDZ7XYXIUWSMF","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OF3YDZ7X","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:b62b7def0597589db9e341a24ae3923a83298b16d0c7dd2884eb94db4165bb87","target":"graph","created_at":"2026-05-18T00:33:00Z","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":"Multilayer (or deep) networks are powerful probabilistic models based on multiple stages of a linear transform followed by a non-linear (possibly random) function. In general, the linear transforms are defined by matrices and the non-linear functions are defined by information channels. These models have gained great popularity due to their ability to characterize complex probabilistic relationships arising in a wide variety of inference problems. The contribution of this paper is a new method for analyzing the fundamental limits of statistical inference in settings where the model is known. T","authors_text":"Galen Reeves","cross_cats":["cs.LG","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-12T16:02:19Z","title":"Additivity of Information in Multilayer Networks via Additive Gaussian Noise Transforms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.04580","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:67a6f9b3ddf96416662bb828d949e1f5bbace451a8668210e51fea9a2fc8b01d","target":"record","created_at":"2026-05-18T00:33:00Z","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":"9b9e867baa1b67fb0f96d43bf6115382286d7d6c1e131aaf8ff46ba18bb5e388","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-12T16:02:19Z","title_canon_sha256":"3eaec2ff0490cde329a0eed604591f8c6dc3bd4ec4ebe111aedf3ce71edffffa"},"schema_version":"1.0","source":{"id":"1710.04580","kind":"arxiv","version":1}},"canonical_sha256":"717781e7f7c5d14b49855fe7d3c721fbb88bc9202950a0071f6baab5a3ddd4f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"717781e7f7c5d14b49855fe7d3c721fbb88bc9202950a0071f6baab5a3ddd4f0","first_computed_at":"2026-05-18T00:33:00.610235Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:00.610235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QoW98EK8/Ae24BN5CAOMJPgMLH/Gh2uyRJ09w7TDoVBO03tkUutMUe1GiHRrGs1bIm/a/BT5VcLmw9xj8+qeAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:00.610664Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.04580","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67a6f9b3ddf96416662bb828d949e1f5bbace451a8668210e51fea9a2fc8b01d","sha256:b62b7def0597589db9e341a24ae3923a83298b16d0c7dd2884eb94db4165bb87"],"state_sha256":"58694725f5be42a4ba51aafb2793b1ed24f1b9a1c87b01d954c6c305d9d44e36"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S1Ow3cLBwUkvEJe202Refx5GP5CwhZ5LtIlck8JCRAjc646wgBF3PzvnrRi9iP6J8GFXI9Gz+I52VR5FU3qXAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T10:31:46.825501Z","bundle_sha256":"691f93c67eb6893d10a71133727f03b75397d081ece33ac7ca22c48ad16996b7"}}