{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CEP66HGO7CTFWZHCCODE4FTPIK","short_pith_number":"pith:CEP66HGO","schema_version":"1.0","canonical_sha256":"111fef1ccef8a65b64e213864e166f428b81a0af6911b6f4ae1ddc143755f3e7","source":{"kind":"arxiv","id":"2404.07140","version":1},"attestation_state":"computed","paper":{"title":"Characterising directed and undirected metrics of high-order interdependence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fernando E. Rosas, Michael Gastpar, Pedro A.M. Mediano","submitted_at":"2024-04-10T16:17:41Z","abstract_excerpt":"Systems of interest for theoretical or experimental work often exhibit high-order interactions, corresponding to statistical interdependencies in groups of variables that cannot be reduced to dependencies in subsets of them. While still under active development, the framework of partial information decomposition (PID) has emerged as the dominant approach to conceptualise and calculate high-order interdependencies. PID approaches can be grouped in two types: directed approaches that divide variables into sources and targets, and undirected approaches that treat all variables equally. Directed a"},"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":"2404.07140","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-04-10T16:17:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fe535ab82fc0df8578f9210b46fae0b1560fbb89066103a7afa0e0f1d985d6a7","abstract_canon_sha256":"7ee666e7200c0072b7400d13a370de310a37d268233b69fd637cfc8e6e84a559"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:06:35.830800Z","signature_b64":"CTDdWNBsASVE9n/FrT9bdEpFA7AI+fFsili4lDnp+sZmbRoDOVzGeuSBVlWxMmLhBt/tlccH5tbT1fEN+dWjAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"111fef1ccef8a65b64e213864e166f428b81a0af6911b6f4ae1ddc143755f3e7","last_reissued_at":"2026-07-05T08:06:35.830275Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:06:35.830275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Characterising directed and undirected metrics of high-order interdependence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fernando E. Rosas, Michael Gastpar, Pedro A.M. Mediano","submitted_at":"2024-04-10T16:17:41Z","abstract_excerpt":"Systems of interest for theoretical or experimental work often exhibit high-order interactions, corresponding to statistical interdependencies in groups of variables that cannot be reduced to dependencies in subsets of them. While still under active development, the framework of partial information decomposition (PID) has emerged as the dominant approach to conceptualise and calculate high-order interdependencies. PID approaches can be grouped in two types: directed approaches that divide variables into sources and targets, and undirected approaches that treat all variables equally. Directed a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.07140","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/2404.07140/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":"2404.07140","created_at":"2026-07-05T08:06:35.830345+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.07140v1","created_at":"2026-07-05T08:06:35.830345+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.07140","created_at":"2026-07-05T08:06:35.830345+00:00"},{"alias_kind":"pith_short_12","alias_value":"CEP66HGO7CTF","created_at":"2026-07-05T08:06:35.830345+00:00"},{"alias_kind":"pith_short_16","alias_value":"CEP66HGO7CTFWZHC","created_at":"2026-07-05T08:06:35.830345+00:00"},{"alias_kind":"pith_short_8","alias_value":"CEP66HGO","created_at":"2026-07-05T08:06:35.830345+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.15779","citing_title":"Shannon invariants: A scalable approach to information decomposition","ref_index":53,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CEP66HGO7CTFWZHCCODE4FTPIK","json":"https://pith.science/pith/CEP66HGO7CTFWZHCCODE4FTPIK.json","graph_json":"https://pith.science/api/pith-number/CEP66HGO7CTFWZHCCODE4FTPIK/graph.json","events_json":"https://pith.science/api/pith-number/CEP66HGO7CTFWZHCCODE4FTPIK/events.json","paper":"https://pith.science/paper/CEP66HGO"},"agent_actions":{"view_html":"https://pith.science/pith/CEP66HGO7CTFWZHCCODE4FTPIK","download_json":"https://pith.science/pith/CEP66HGO7CTFWZHCCODE4FTPIK.json","view_paper":"https://pith.science/paper/CEP66HGO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.07140&json=true","fetch_graph":"https://pith.science/api/pith-number/CEP66HGO7CTFWZHCCODE4FTPIK/graph.json","fetch_events":"https://pith.science/api/pith-number/CEP66HGO7CTFWZHCCODE4FTPIK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CEP66HGO7CTFWZHCCODE4FTPIK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CEP66HGO7CTFWZHCCODE4FTPIK/action/storage_attestation","attest_author":"https://pith.science/pith/CEP66HGO7CTFWZHCCODE4FTPIK/action/author_attestation","sign_citation":"https://pith.science/pith/CEP66HGO7CTFWZHCCODE4FTPIK/action/citation_signature","submit_replication":"https://pith.science/pith/CEP66HGO7CTFWZHCCODE4FTPIK/action/replication_record"}},"created_at":"2026-07-05T08:06:35.830345+00:00","updated_at":"2026-07-05T08:06:35.830345+00:00"}