{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VOOC4NNUGLXKZJUQYSMT5PTBWV","short_pith_number":"pith:VOOC4NNU","schema_version":"1.0","canonical_sha256":"ab9c2e35b432eeaca690c4993ebe61b550d85029a6092ef295a6ed89eec86840","source":{"kind":"arxiv","id":"2504.15779","version":1},"attestation_state":"computed","paper":{"title":"Shannon invariants: A scalable approach to information decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","math.IT","nlin.AO","physics.data-an"],"primary_cat":"cs.IT","authors_text":"Aaron J. Gutknecht, Abdullah Makkeh, David A. Ehrlich, Fernando E. Rosas, Michael Wibral, Pedro A. M. Mediano","submitted_at":"2025-04-22T10:41:38Z","abstract_excerpt":"Distributed systems, such as biological and artificial neural networks, process information via complex interactions engaging multiple subsystems, resulting in high-order patterns with distinct properties across scales. Investigating how these systems process information remains challenging due to difficulties in defining appropriate multivariate metrics and ensuring their scalability to large systems. To address these challenges, we introduce a novel framework based on what we call \"Shannon invariants\" -- quantities that capture essential properties of high-order information processing in a w"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2504.15779","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-04-22T10:41:38Z","cross_cats_sorted":["cs.AI","cs.LG","math.IT","nlin.AO","physics.data-an"],"title_canon_sha256":"011147d54480f7c8c67e1936fcfe06c575331ee51d959712bd6a9e18e1bc4b3a","abstract_canon_sha256":"e90798db8a0450bbfb61567a942121d3dde09648280e4a4ad007dc585f56df87"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:52:29.819018Z","signature_b64":"88xtqBNPSE5LHFMODkIQQoqDfxW8Eq17G9SRqEQlt+lLvayt0FN4mkk8hiVbDp+cUr2GMjJPfGKVdT+JrnGKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab9c2e35b432eeaca690c4993ebe61b550d85029a6092ef295a6ed89eec86840","last_reissued_at":"2026-07-05T10:52:29.818549Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:52:29.818549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Shannon invariants: A scalable approach to information decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","math.IT","nlin.AO","physics.data-an"],"primary_cat":"cs.IT","authors_text":"Aaron J. Gutknecht, Abdullah Makkeh, David A. Ehrlich, Fernando E. Rosas, Michael Wibral, Pedro A. M. Mediano","submitted_at":"2025-04-22T10:41:38Z","abstract_excerpt":"Distributed systems, such as biological and artificial neural networks, process information via complex interactions engaging multiple subsystems, resulting in high-order patterns with distinct properties across scales. Investigating how these systems process information remains challenging due to difficulties in defining appropriate multivariate metrics and ensuring their scalability to large systems. To address these challenges, we introduce a novel framework based on what we call \"Shannon invariants\" -- quantities that capture essential properties of high-order information processing in a w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.15779","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/2504.15779/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2504.15779","created_at":"2026-07-05T10:52:29.818607+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.15779v1","created_at":"2026-07-05T10:52:29.818607+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.15779","created_at":"2026-07-05T10:52:29.818607+00:00"},{"alias_kind":"pith_short_12","alias_value":"VOOC4NNUGLXK","created_at":"2026-07-05T10:52:29.818607+00:00"},{"alias_kind":"pith_short_16","alias_value":"VOOC4NNUGLXKZJUQ","created_at":"2026-07-05T10:52:29.818607+00:00"},{"alias_kind":"pith_short_8","alias_value":"VOOC4NNU","created_at":"2026-07-05T10:52:29.818607+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.30096","citing_title":"Information Dynamics of Language Communication","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2506.18498","citing_title":"A scalable estimator of higher-order information in complex dynamical systems","ref_index":31,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VOOC4NNUGLXKZJUQYSMT5PTBWV","json":"https://pith.science/pith/VOOC4NNUGLXKZJUQYSMT5PTBWV.json","graph_json":"https://pith.science/api/pith-number/VOOC4NNUGLXKZJUQYSMT5PTBWV/graph.json","events_json":"https://pith.science/api/pith-number/VOOC4NNUGLXKZJUQYSMT5PTBWV/events.json","paper":"https://pith.science/paper/VOOC4NNU"},"agent_actions":{"view_html":"https://pith.science/pith/VOOC4NNUGLXKZJUQYSMT5PTBWV","download_json":"https://pith.science/pith/VOOC4NNUGLXKZJUQYSMT5PTBWV.json","view_paper":"https://pith.science/paper/VOOC4NNU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.15779&json=true","fetch_graph":"https://pith.science/api/pith-number/VOOC4NNUGLXKZJUQYSMT5PTBWV/graph.json","fetch_events":"https://pith.science/api/pith-number/VOOC4NNUGLXKZJUQYSMT5PTBWV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VOOC4NNUGLXKZJUQYSMT5PTBWV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VOOC4NNUGLXKZJUQYSMT5PTBWV/action/storage_attestation","attest_author":"https://pith.science/pith/VOOC4NNUGLXKZJUQYSMT5PTBWV/action/author_attestation","sign_citation":"https://pith.science/pith/VOOC4NNUGLXKZJUQYSMT5PTBWV/action/citation_signature","submit_replication":"https://pith.science/pith/VOOC4NNUGLXKZJUQYSMT5PTBWV/action/replication_record"}},"created_at":"2026-07-05T10:52:29.818607+00:00","updated_at":"2026-07-05T10:52:29.818607+00:00"}