{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:QYFGAHGF3MMZP6VDCOTWXBXVBV","short_pith_number":"pith:QYFGAHGF","schema_version":"1.0","canonical_sha256":"860a601cc5db1997faa313a76b86f50d5d5a5b6aadaa3a6e64ea43b5202d8d23","source":{"kind":"arxiv","id":"2206.03465","version":3},"attestation_state":"computed","paper":{"title":"On entropic and almost multilinear representability of matroids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Geva Yashfe, Lukas K\\\"uhne","submitted_at":"2022-06-07T17:37:16Z","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"},"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":"2206.03465","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-06-07T17:37:16Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"dc0b544cbfc0f0dc80d14e12245dd7ba1d8d605e78748feaa7ad07d76f7d47d7","abstract_canon_sha256":"f003c32443152a80ddfc519c99c4a45eb5412f0a1dc42f29524fed7988903084"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T01:05:09.784728Z","signature_b64":"K5nX9tpLbnb4n+Zb9xQrpYRrNIjQNuNjzLE6LbFAf6CNtfJ/WOWDjz+J3zBY4pl6pYtHzX3hs5hPUS1xwKpJBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"860a601cc5db1997faa313a76b86f50d5d5a5b6aadaa3a6e64ea43b5202d8d23","last_reissued_at":"2026-05-28T01:05:09.784289Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T01:05:09.784289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On entropic and almost multilinear representability of matroids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Geva Yashfe, Lukas K\\\"uhne","submitted_at":"2022-06-07T17:37:16Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.03465","kind":"arxiv","version":3},"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/2206.03465/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":"2206.03465","created_at":"2026-05-28T01:05:09.784356+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.03465v3","created_at":"2026-05-28T01:05:09.784356+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.03465","created_at":"2026-05-28T01:05:09.784356+00:00"},{"alias_kind":"pith_short_12","alias_value":"QYFGAHGF3MMZ","created_at":"2026-05-28T01:05:09.784356+00:00"},{"alias_kind":"pith_short_16","alias_value":"QYFGAHGF3MMZP6VD","created_at":"2026-05-28T01:05:09.784356+00:00"},{"alias_kind":"pith_short_8","alias_value":"QYFGAHGF","created_at":"2026-05-28T01:05:09.784356+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QYFGAHGF3MMZP6VDCOTWXBXVBV","json":"https://pith.science/pith/QYFGAHGF3MMZP6VDCOTWXBXVBV.json","graph_json":"https://pith.science/api/pith-number/QYFGAHGF3MMZP6VDCOTWXBXVBV/graph.json","events_json":"https://pith.science/api/pith-number/QYFGAHGF3MMZP6VDCOTWXBXVBV/events.json","paper":"https://pith.science/paper/QYFGAHGF"},"agent_actions":{"view_html":"https://pith.science/pith/QYFGAHGF3MMZP6VDCOTWXBXVBV","download_json":"https://pith.science/pith/QYFGAHGF3MMZP6VDCOTWXBXVBV.json","view_paper":"https://pith.science/paper/QYFGAHGF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.03465&json=true","fetch_graph":"https://pith.science/api/pith-number/QYFGAHGF3MMZP6VDCOTWXBXVBV/graph.json","fetch_events":"https://pith.science/api/pith-number/QYFGAHGF3MMZP6VDCOTWXBXVBV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QYFGAHGF3MMZP6VDCOTWXBXVBV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QYFGAHGF3MMZP6VDCOTWXBXVBV/action/storage_attestation","attest_author":"https://pith.science/pith/QYFGAHGF3MMZP6VDCOTWXBXVBV/action/author_attestation","sign_citation":"https://pith.science/pith/QYFGAHGF3MMZP6VDCOTWXBXVBV/action/citation_signature","submit_replication":"https://pith.science/pith/QYFGAHGF3MMZP6VDCOTWXBXVBV/action/replication_record"}},"created_at":"2026-05-28T01:05:09.784356+00:00","updated_at":"2026-05-28T01:05:09.784356+00:00"}