{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4WQNKZSJGF27IU6GRBMPP6PZIX","short_pith_number":"pith:4WQNKZSJ","canonical_record":{"source":{"id":"1803.02251","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-06T15:24:41Z","cross_cats_sorted":[],"title_canon_sha256":"34c71847fff0d35519f993e6cc86fad295163a8cf82f46ea266b59b780e2277c","abstract_canon_sha256":"fcd568a22f2a96890f31c6ae22953107dff3375f766e9f311b0d3b8e5333de4f"},"schema_version":"1.0"},"canonical_sha256":"e5a0d566493175f453c68858f7f9f945e1642dc3c5041c099db066b1a1a79732","source":{"kind":"arxiv","id":"1803.02251","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.02251","created_at":"2026-05-18T00:21:55Z"},{"alias_kind":"arxiv_version","alias_value":"1803.02251v1","created_at":"2026-05-18T00:21:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02251","created_at":"2026-05-18T00:21:55Z"},{"alias_kind":"pith_short_12","alias_value":"4WQNKZSJGF27","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4WQNKZSJGF27IU6G","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4WQNKZSJ","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4WQNKZSJGF27IU6GRBMPP6PZIX","target":"record","payload":{"canonical_record":{"source":{"id":"1803.02251","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-06T15:24:41Z","cross_cats_sorted":[],"title_canon_sha256":"34c71847fff0d35519f993e6cc86fad295163a8cf82f46ea266b59b780e2277c","abstract_canon_sha256":"fcd568a22f2a96890f31c6ae22953107dff3375f766e9f311b0d3b8e5333de4f"},"schema_version":"1.0"},"canonical_sha256":"e5a0d566493175f453c68858f7f9f945e1642dc3c5041c099db066b1a1a79732","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:55.400522Z","signature_b64":"jSW4UpD3Xlw2LfIAjqu85IaLpcPc5cVrY8CsM0t6lAR0HnSyu8+iO+leq7glt2cZRcjKJAuenLfB6zJEyPwcAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5a0d566493175f453c68858f7f9f945e1642dc3c5041c099db066b1a1a79732","last_reissued_at":"2026-05-18T00:21:55.399894Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:55.399894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.02251","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:21:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oEkqEAy/vHiwZJ5LWoBlZV8PfrhZM4ZE2RdRAj7CqFWK9NBWSknN09+um4PbTw1Gs2H6i9pBkM03Adi5kQXTDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T07:21:26.207656Z"},"content_sha256":"6e8ba15ea7c5ca7a00d4c5c9b1b35abe07119c9499c85c310188cd06db20c25d","schema_version":"1.0","event_id":"sha256:6e8ba15ea7c5ca7a00d4c5c9b1b35abe07119c9499c85c310188cd06db20c25d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4WQNKZSJGF27IU6GRBMPP6PZIX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deep Information Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Giulio Franzese, Monica Visintin","submitted_at":"2018-03-06T15:24:41Z","abstract_excerpt":"We describe a novel classifier with a tree structure, designed using information theory concepts. This Information Network is made of information nodes, that compress the input data, and multiplexers, that connect two or more input nodes to an output node. Each information node is trained, independently of the others, to minimize a local cost function that minimizes the mutual information between its input and output with the constraint of keeping a given mutual information between its output and the target (information bottleneck). We show that the system is able to provide good results in te"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.02251","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:21:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tMS2k9SF3XfFooi4IA5Fwl2rx+WZnSIhScbzs9O/+UIo0mBo4n4+20A0+JZsXqYQ0ZmLk7AWkMi1NOSlbWbSCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T07:21:26.208005Z"},"content_sha256":"252494d467760fe0faf7d3f917a452af506ae4bdaa5b86f1d5d1063a125144a3","schema_version":"1.0","event_id":"sha256:252494d467760fe0faf7d3f917a452af506ae4bdaa5b86f1d5d1063a125144a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4WQNKZSJGF27IU6GRBMPP6PZIX/bundle.json","state_url":"https://pith.science/pith/4WQNKZSJGF27IU6GRBMPP6PZIX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4WQNKZSJGF27IU6GRBMPP6PZIX/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-24T07:21:26Z","links":{"resolver":"https://pith.science/pith/4WQNKZSJGF27IU6GRBMPP6PZIX","bundle":"https://pith.science/pith/4WQNKZSJGF27IU6GRBMPP6PZIX/bundle.json","state":"https://pith.science/pith/4WQNKZSJGF27IU6GRBMPP6PZIX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4WQNKZSJGF27IU6GRBMPP6PZIX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4WQNKZSJGF27IU6GRBMPP6PZIX","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":"fcd568a22f2a96890f31c6ae22953107dff3375f766e9f311b0d3b8e5333de4f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-06T15:24:41Z","title_canon_sha256":"34c71847fff0d35519f993e6cc86fad295163a8cf82f46ea266b59b780e2277c"},"schema_version":"1.0","source":{"id":"1803.02251","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.02251","created_at":"2026-05-18T00:21:55Z"},{"alias_kind":"arxiv_version","alias_value":"1803.02251v1","created_at":"2026-05-18T00:21:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02251","created_at":"2026-05-18T00:21:55Z"},{"alias_kind":"pith_short_12","alias_value":"4WQNKZSJGF27","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4WQNKZSJGF27IU6G","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4WQNKZSJ","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:252494d467760fe0faf7d3f917a452af506ae4bdaa5b86f1d5d1063a125144a3","target":"graph","created_at":"2026-05-18T00:21:55Z","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":"We describe a novel classifier with a tree structure, designed using information theory concepts. This Information Network is made of information nodes, that compress the input data, and multiplexers, that connect two or more input nodes to an output node. Each information node is trained, independently of the others, to minimize a local cost function that minimizes the mutual information between its input and output with the constraint of keeping a given mutual information between its output and the target (information bottleneck). We show that the system is able to provide good results in te","authors_text":"Giulio Franzese, Monica Visintin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-06T15:24:41Z","title":"Deep Information Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.02251","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:6e8ba15ea7c5ca7a00d4c5c9b1b35abe07119c9499c85c310188cd06db20c25d","target":"record","created_at":"2026-05-18T00:21:55Z","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":"fcd568a22f2a96890f31c6ae22953107dff3375f766e9f311b0d3b8e5333de4f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-06T15:24:41Z","title_canon_sha256":"34c71847fff0d35519f993e6cc86fad295163a8cf82f46ea266b59b780e2277c"},"schema_version":"1.0","source":{"id":"1803.02251","kind":"arxiv","version":1}},"canonical_sha256":"e5a0d566493175f453c68858f7f9f945e1642dc3c5041c099db066b1a1a79732","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e5a0d566493175f453c68858f7f9f945e1642dc3c5041c099db066b1a1a79732","first_computed_at":"2026-05-18T00:21:55.399894Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:55.399894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jSW4UpD3Xlw2LfIAjqu85IaLpcPc5cVrY8CsM0t6lAR0HnSyu8+iO+leq7glt2cZRcjKJAuenLfB6zJEyPwcAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:55.400522Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.02251","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e8ba15ea7c5ca7a00d4c5c9b1b35abe07119c9499c85c310188cd06db20c25d","sha256:252494d467760fe0faf7d3f917a452af506ae4bdaa5b86f1d5d1063a125144a3"],"state_sha256":"30cce637450299b93b273f5eda6b2be84b1faa9baea3ce4e7bfd2526e128cd0b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KbGNCLl0m09THjT+ufwRBos3CYFKKEcxF4gQvSTFQ49ch7cN/qYR1aMVGAz2iK0g4mwLaU0rPxlnJujtFDMODw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T07:21:26.209939Z","bundle_sha256":"fc2c328350860e917bb417d161d0a9909c561c6bf5a809088f8f23bdee3968e1"}}