{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:3KO4SMIMSC24V7SCEWWVKCHQJC","short_pith_number":"pith:3KO4SMIM","canonical_record":{"source":{"id":"2305.09424","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-05-16T13:30:15Z","cross_cats_sorted":[],"title_canon_sha256":"56addadbbf7239266f080bf7f0d9f9125d523636056e1da5cf895588139b08fc","abstract_canon_sha256":"669dc53798ec5aeec498ae6a42ae57bc2aedc4a1b9234e879203a8e13827d460"},"schema_version":"1.0"},"canonical_sha256":"da9dc9310c90b5cafe4225ad5508f048acefb1382ca796d344b7f7210d2e495d","source":{"kind":"arxiv","id":"2305.09424","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.09424","created_at":"2026-07-05T06:10:47Z"},{"alias_kind":"arxiv_version","alias_value":"2305.09424v1","created_at":"2026-07-05T06:10:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.09424","created_at":"2026-07-05T06:10:47Z"},{"alias_kind":"pith_short_12","alias_value":"3KO4SMIMSC24","created_at":"2026-07-05T06:10:47Z"},{"alias_kind":"pith_short_16","alias_value":"3KO4SMIMSC24V7SC","created_at":"2026-07-05T06:10:47Z"},{"alias_kind":"pith_short_8","alias_value":"3KO4SMIM","created_at":"2026-07-05T06:10:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:3KO4SMIMSC24V7SCEWWVKCHQJC","target":"record","payload":{"canonical_record":{"source":{"id":"2305.09424","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-05-16T13:30:15Z","cross_cats_sorted":[],"title_canon_sha256":"56addadbbf7239266f080bf7f0d9f9125d523636056e1da5cf895588139b08fc","abstract_canon_sha256":"669dc53798ec5aeec498ae6a42ae57bc2aedc4a1b9234e879203a8e13827d460"},"schema_version":"1.0"},"canonical_sha256":"da9dc9310c90b5cafe4225ad5508f048acefb1382ca796d344b7f7210d2e495d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:10:47.783471Z","signature_b64":"yJ3qckXDMPrQf+71i5t+G63ikcucY2Gf59o1Z536gdJjDSB+FpmexvhavkSlF7Bij+OXhfniztXmstKRQbFDBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da9dc9310c90b5cafe4225ad5508f048acefb1382ca796d344b7f7210d2e495d","last_reissued_at":"2026-07-05T06:10:47.783076Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:10:47.783076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2305.09424","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-07-05T06:10:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NZ0MRJqBDABlFSLh9KGjUjq9y7Pey/EX4XHC9K4aRGcVDFt8nFDcCIk48Tb7p7RHopKwaKVzgW2SXmajrzoQBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T05:51:30.281992Z"},"content_sha256":"c46bea98ce667f22c791401300a62d67d8000e160db2cfae4e977514f0365971","schema_version":"1.0","event_id":"sha256:c46bea98ce667f22c791401300a62d67d8000e160db2cfae4e977514f0365971"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:3KO4SMIMSC24V7SCEWWVKCHQJC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unwrapping All ReLU Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Mattia Jacopo Villani, Peter McBurney","submitted_at":"2023-05-16T13:30:15Z","abstract_excerpt":"Deep ReLU Networks can be decomposed into a collection of linear models, each defined in a region of a partition of the input space. This paper provides three results extending this theory. First, we extend this linear decompositions to Graph Neural networks and tensor convolutional networks, as well as networks with multiplicative interactions. Second, we provide proofs that neural networks can be understood as interpretable models such as Multivariate Decision trees and logical theories. Finally, we show how this model leads to computing cheap and exact SHAP values. We validate the theory th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.09424","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2305.09424/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T06:10:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+f15OYlkQGrkjGd38RSzRPzlCTWOpiEyjb9aFOeCYQpIu+5ng3vUNd+4PlIgWFn/O0hgfbDTLo5QrAqPs/isBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T05:51:30.282484Z"},"content_sha256":"fc88246c3ab20702b9e130d319abdedce9fbd02be0452223a4380d92dad92a99","schema_version":"1.0","event_id":"sha256:fc88246c3ab20702b9e130d319abdedce9fbd02be0452223a4380d92dad92a99"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3KO4SMIMSC24V7SCEWWVKCHQJC/bundle.json","state_url":"https://pith.science/pith/3KO4SMIMSC24V7SCEWWVKCHQJC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3KO4SMIMSC24V7SCEWWVKCHQJC/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-08-22T05:51:30Z","links":{"resolver":"https://pith.science/pith/3KO4SMIMSC24V7SCEWWVKCHQJC","bundle":"https://pith.science/pith/3KO4SMIMSC24V7SCEWWVKCHQJC/bundle.json","state":"https://pith.science/pith/3KO4SMIMSC24V7SCEWWVKCHQJC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3KO4SMIMSC24V7SCEWWVKCHQJC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:3KO4SMIMSC24V7SCEWWVKCHQJC","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":"669dc53798ec5aeec498ae6a42ae57bc2aedc4a1b9234e879203a8e13827d460","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-05-16T13:30:15Z","title_canon_sha256":"56addadbbf7239266f080bf7f0d9f9125d523636056e1da5cf895588139b08fc"},"schema_version":"1.0","source":{"id":"2305.09424","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.09424","created_at":"2026-07-05T06:10:47Z"},{"alias_kind":"arxiv_version","alias_value":"2305.09424v1","created_at":"2026-07-05T06:10:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.09424","created_at":"2026-07-05T06:10:47Z"},{"alias_kind":"pith_short_12","alias_value":"3KO4SMIMSC24","created_at":"2026-07-05T06:10:47Z"},{"alias_kind":"pith_short_16","alias_value":"3KO4SMIMSC24V7SC","created_at":"2026-07-05T06:10:47Z"},{"alias_kind":"pith_short_8","alias_value":"3KO4SMIM","created_at":"2026-07-05T06:10:47Z"}],"graph_snapshots":[{"event_id":"sha256:fc88246c3ab20702b9e130d319abdedce9fbd02be0452223a4380d92dad92a99","target":"graph","created_at":"2026-07-05T06:10:47Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2305.09424/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Deep ReLU Networks can be decomposed into a collection of linear models, each defined in a region of a partition of the input space. This paper provides three results extending this theory. First, we extend this linear decompositions to Graph Neural networks and tensor convolutional networks, as well as networks with multiplicative interactions. Second, we provide proofs that neural networks can be understood as interpretable models such as Multivariate Decision trees and logical theories. Finally, we show how this model leads to computing cheap and exact SHAP values. We validate the theory th","authors_text":"Mattia Jacopo Villani, Peter McBurney","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-05-16T13:30:15Z","title":"Unwrapping All ReLU Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.09424","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:c46bea98ce667f22c791401300a62d67d8000e160db2cfae4e977514f0365971","target":"record","created_at":"2026-07-05T06:10:47Z","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":"669dc53798ec5aeec498ae6a42ae57bc2aedc4a1b9234e879203a8e13827d460","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-05-16T13:30:15Z","title_canon_sha256":"56addadbbf7239266f080bf7f0d9f9125d523636056e1da5cf895588139b08fc"},"schema_version":"1.0","source":{"id":"2305.09424","kind":"arxiv","version":1}},"canonical_sha256":"da9dc9310c90b5cafe4225ad5508f048acefb1382ca796d344b7f7210d2e495d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da9dc9310c90b5cafe4225ad5508f048acefb1382ca796d344b7f7210d2e495d","first_computed_at":"2026-07-05T06:10:47.783076Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:10:47.783076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yJ3qckXDMPrQf+71i5t+G63ikcucY2Gf59o1Z536gdJjDSB+FpmexvhavkSlF7Bij+OXhfniztXmstKRQbFDBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:10:47.783471Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.09424","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c46bea98ce667f22c791401300a62d67d8000e160db2cfae4e977514f0365971","sha256:fc88246c3ab20702b9e130d319abdedce9fbd02be0452223a4380d92dad92a99"],"state_sha256":"e72ff99b70078645fa75ca6643c458d1493dea32cd141efe78fcd104ef6dce3b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jxLNjRygMEIasA0MpU2khNgsVDES9mwMLJ2Q6YnhDgVYz7uXh9ZQlh5Q2oeGfv8B53cLhOD+LU4JLewXmz4xCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T05:51:30.286620Z","bundle_sha256":"b1b192d04bbd0f8b3d26e048124ab4cc04b1ff5caffa20d78e517f6f7822eb2e"}}