{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:E6SKQ53PXZAC3TXP6OB5YQUXNG","short_pith_number":"pith:E6SKQ53P","canonical_record":{"source":{"id":"2504.08842","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-04-10T21:28:16Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"2d0d5c3efd7e27952f180c8f3d7195ade807dc8e660ae7b70853ad41a2f9e339","abstract_canon_sha256":"a2f508cf6ad6c835daa104f2fbbad8c772546bdb1d97e113158245c46d14c8d9"},"schema_version":"1.0"},"canonical_sha256":"27a4a8776fbe402dceeff383dc4297698f9360529457b4c753f244449ce30133","source":{"kind":"arxiv","id":"2504.08842","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.08842","created_at":"2026-07-05T10:58:47Z"},{"alias_kind":"arxiv_version","alias_value":"2504.08842v2","created_at":"2026-07-05T10:58:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.08842","created_at":"2026-07-05T10:58:47Z"},{"alias_kind":"pith_short_12","alias_value":"E6SKQ53PXZAC","created_at":"2026-07-05T10:58:47Z"},{"alias_kind":"pith_short_16","alias_value":"E6SKQ53PXZAC3TXP","created_at":"2026-07-05T10:58:47Z"},{"alias_kind":"pith_short_8","alias_value":"E6SKQ53P","created_at":"2026-07-05T10:58:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:E6SKQ53PXZAC3TXP6OB5YQUXNG","target":"record","payload":{"canonical_record":{"source":{"id":"2504.08842","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-04-10T21:28:16Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"2d0d5c3efd7e27952f180c8f3d7195ade807dc8e660ae7b70853ad41a2f9e339","abstract_canon_sha256":"a2f508cf6ad6c835daa104f2fbbad8c772546bdb1d97e113158245c46d14c8d9"},"schema_version":"1.0"},"canonical_sha256":"27a4a8776fbe402dceeff383dc4297698f9360529457b4c753f244449ce30133","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:58:47.379187Z","signature_b64":"BKEVoh433IJGGJQKWBh/+wxiEvL85XfdGDxYFoMUtgr7EeHreD4rk7NHojR/O/6jxJqNkEHIxUkCEv8sqFTfAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27a4a8776fbe402dceeff383dc4297698f9360529457b4c753f244449ce30133","last_reissued_at":"2026-07-05T10:58:47.378668Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:58:47.378668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.08842","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-07-05T10:58:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cAfwqmHKPgq3NmRA29GHymHjDt5my706IuSCgYrj9koUAqW9SkvWAgLj5HY8sRmDMV11h88FubBXdWRGyGmcCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T02:05:08.850082Z"},"content_sha256":"1e9f394182f4eb9d00d57cff7655c8b0500b4729a75750ba75639775dd228f29","schema_version":"1.0","event_id":"sha256:1e9f394182f4eb9d00d57cff7655c8b0500b4729a75750ba75639775dd228f29"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:E6SKQ53PXZAC3TXP6OB5YQUXNG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Combinatorial Interpretability of Neural Computation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.LG","authors_text":"Dan Alistarh, Micah Adler, Nir Shavit","submitted_at":"2025-04-10T21:28:16Z","abstract_excerpt":"We introduce combinatorial interpretability, a methodology for understanding neural computation by analyzing the combinatorial structures in the sign-based categorization of a network's weights and biases. We demonstrate its power through feature channel coding, a theory that explains how neural networks compute Boolean expressions and potentially underlies other categories of neural network computation. According to this theory, features are computed via feature channels: unique cross-neuron encodings shared among the inputs the feature operates on. Because different feature channels share ne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.08842","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.08842/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-05T10:58:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WXiGC4gKuEYEORG47eydyTusPGjYK8iHatQZJJBCX6B7IQQ52BRBcGaRxByhSJ25ruHIS/yuC09k/G8fx/c6DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T02:05:08.850973Z"},"content_sha256":"74af4e1ae6234b7c15775a42876a80319642917b10161cb4b2da05c739599e69","schema_version":"1.0","event_id":"sha256:74af4e1ae6234b7c15775a42876a80319642917b10161cb4b2da05c739599e69"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E6SKQ53PXZAC3TXP6OB5YQUXNG/bundle.json","state_url":"https://pith.science/pith/E6SKQ53PXZAC3TXP6OB5YQUXNG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E6SKQ53PXZAC3TXP6OB5YQUXNG/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-17T02:05:08Z","links":{"resolver":"https://pith.science/pith/E6SKQ53PXZAC3TXP6OB5YQUXNG","bundle":"https://pith.science/pith/E6SKQ53PXZAC3TXP6OB5YQUXNG/bundle.json","state":"https://pith.science/pith/E6SKQ53PXZAC3TXP6OB5YQUXNG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E6SKQ53PXZAC3TXP6OB5YQUXNG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:E6SKQ53PXZAC3TXP6OB5YQUXNG","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":"a2f508cf6ad6c835daa104f2fbbad8c772546bdb1d97e113158245c46d14c8d9","cross_cats_sorted":["cs.NE"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-04-10T21:28:16Z","title_canon_sha256":"2d0d5c3efd7e27952f180c8f3d7195ade807dc8e660ae7b70853ad41a2f9e339"},"schema_version":"1.0","source":{"id":"2504.08842","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.08842","created_at":"2026-07-05T10:58:47Z"},{"alias_kind":"arxiv_version","alias_value":"2504.08842v2","created_at":"2026-07-05T10:58:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.08842","created_at":"2026-07-05T10:58:47Z"},{"alias_kind":"pith_short_12","alias_value":"E6SKQ53PXZAC","created_at":"2026-07-05T10:58:47Z"},{"alias_kind":"pith_short_16","alias_value":"E6SKQ53PXZAC3TXP","created_at":"2026-07-05T10:58:47Z"},{"alias_kind":"pith_short_8","alias_value":"E6SKQ53P","created_at":"2026-07-05T10:58:47Z"}],"graph_snapshots":[{"event_id":"sha256:74af4e1ae6234b7c15775a42876a80319642917b10161cb4b2da05c739599e69","target":"graph","created_at":"2026-07-05T10:58: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/2504.08842/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce combinatorial interpretability, a methodology for understanding neural computation by analyzing the combinatorial structures in the sign-based categorization of a network's weights and biases. We demonstrate its power through feature channel coding, a theory that explains how neural networks compute Boolean expressions and potentially underlies other categories of neural network computation. According to this theory, features are computed via feature channels: unique cross-neuron encodings shared among the inputs the feature operates on. Because different feature channels share ne","authors_text":"Dan Alistarh, Micah Adler, Nir Shavit","cross_cats":["cs.NE"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-04-10T21:28:16Z","title":"Towards Combinatorial Interpretability of Neural Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.08842","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:1e9f394182f4eb9d00d57cff7655c8b0500b4729a75750ba75639775dd228f29","target":"record","created_at":"2026-07-05T10:58: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":"a2f508cf6ad6c835daa104f2fbbad8c772546bdb1d97e113158245c46d14c8d9","cross_cats_sorted":["cs.NE"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-04-10T21:28:16Z","title_canon_sha256":"2d0d5c3efd7e27952f180c8f3d7195ade807dc8e660ae7b70853ad41a2f9e339"},"schema_version":"1.0","source":{"id":"2504.08842","kind":"arxiv","version":2}},"canonical_sha256":"27a4a8776fbe402dceeff383dc4297698f9360529457b4c753f244449ce30133","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27a4a8776fbe402dceeff383dc4297698f9360529457b4c753f244449ce30133","first_computed_at":"2026-07-05T10:58:47.378668Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:58:47.378668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BKEVoh433IJGGJQKWBh/+wxiEvL85XfdGDxYFoMUtgr7EeHreD4rk7NHojR/O/6jxJqNkEHIxUkCEv8sqFTfAw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:58:47.379187Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.08842","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e9f394182f4eb9d00d57cff7655c8b0500b4729a75750ba75639775dd228f29","sha256:74af4e1ae6234b7c15775a42876a80319642917b10161cb4b2da05c739599e69"],"state_sha256":"249aca91756438f526a1641d1b2c88babe9889c728d59f5e63cbb7604e154021"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dmfqYWh7MuHlVn9tu0kxyyUQOr+vYr6iyUdhEeBQJQ4uFnyXYVJq8+FBZEQ1me+rvLz9Lxlu3TB+uFvH/nFhAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T02:05:08.857500Z","bundle_sha256":"981c59fec3cdb2c399866dcfe2e50e9fded88cb6a039d27e4efe1f66a7d9cf2f"}}