{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:QYFGAHGF3MMZP6VDCOTWXBXVBV","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":"f003c32443152a80ddfc519c99c4a45eb5412f0a1dc42f29524fed7988903084","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-06-07T17:37:16Z","title_canon_sha256":"dc0b544cbfc0f0dc80d14e12245dd7ba1d8d605e78748feaa7ad07d76f7d47d7"},"schema_version":"1.0","source":{"id":"2206.03465","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.03465","created_at":"2026-05-28T01:05:09Z"},{"alias_kind":"arxiv_version","alias_value":"2206.03465v3","created_at":"2026-05-28T01:05:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.03465","created_at":"2026-05-28T01:05:09Z"},{"alias_kind":"pith_short_12","alias_value":"QYFGAHGF3MMZ","created_at":"2026-05-28T01:05:09Z"},{"alias_kind":"pith_short_16","alias_value":"QYFGAHGF3MMZP6VD","created_at":"2026-05-28T01:05:09Z"},{"alias_kind":"pith_short_8","alias_value":"QYFGAHGF","created_at":"2026-05-28T01:05:09Z"}],"graph_snapshots":[{"event_id":"sha256:e2c071e567aef006a85bda5499b0f36f2249de3e77b33ac5c934073a4f613d9c","target":"graph","created_at":"2026-05-28T01:05:09Z","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/2206.03465/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This article studies two notions of generalized matroid representations motivated by algorithmic information theory and cryptographic secret sharing. The first (entropic representability) involves discrete random variables, while the second (almost-multilinear representability) deals with approximate subspace arrangements. In both cases, we prove that determining whether an input matroid has such a representation is undecidable. Consequently, the conditional independence implication problem is also undecidable, providing an independent answer to a question posed by Geiger and Pearl, recently r","authors_text":"Geva Yashfe, Lukas K\\\"uhne","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-06-07T17:37:16Z","title":"On entropic and almost multilinear representability of matroids"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.03465","kind":"arxiv","version":3},"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:ae767d5fd70bee6544cdd41f6084f67bb629fec2921dceb4d9722253d1d5b392","target":"record","created_at":"2026-05-28T01:05:09Z","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":"f003c32443152a80ddfc519c99c4a45eb5412f0a1dc42f29524fed7988903084","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-06-07T17:37:16Z","title_canon_sha256":"dc0b544cbfc0f0dc80d14e12245dd7ba1d8d605e78748feaa7ad07d76f7d47d7"},"schema_version":"1.0","source":{"id":"2206.03465","kind":"arxiv","version":3}},"canonical_sha256":"860a601cc5db1997faa313a76b86f50d5d5a5b6aadaa3a6e64ea43b5202d8d23","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"860a601cc5db1997faa313a76b86f50d5d5a5b6aadaa3a6e64ea43b5202d8d23","first_computed_at":"2026-05-28T01:05:09.784289Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-28T01:05:09.784289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K5nX9tpLbnb4n+Zb9xQrpYRrNIjQNuNjzLE6LbFAf6CNtfJ/WOWDjz+J3zBY4pl6pYtHzX3hs5hPUS1xwKpJBg==","signature_status":"signed_v1","signed_at":"2026-05-28T01:05:09.784728Z","signed_message":"canonical_sha256_bytes"},"source_id":"2206.03465","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae767d5fd70bee6544cdd41f6084f67bb629fec2921dceb4d9722253d1d5b392","sha256:e2c071e567aef006a85bda5499b0f36f2249de3e77b33ac5c934073a4f613d9c"],"state_sha256":"fd803fcc30a8e52ce0ad0c2629d574dcd7e70c26697f6cdf01824358918136f4"}