{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:M25I6G5HGSHS2R4ORH5LYBC42U","short_pith_number":"pith:M25I6G5H","schema_version":"1.0","canonical_sha256":"66ba8f1ba7348f2d478e89fabc045cd526f5b30fcebdb9bd1a4a04c579b13a89","source":{"kind":"arxiv","id":"1710.01924","version":1},"attestation_state":"computed","paper":{"title":"Doubly exponentially many Ingleton matroids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jorn van der Pol, Peter Nelson","submitted_at":"2017-10-05T09:05:36Z","abstract_excerpt":"A matroid is Ingleton if all quadruples of subsets of its ground set satisfy Ingleton's inequality. In particular, representable matroids are Ingleton. We show that the number of Ingleton matroids on ground set $[n]$ is doubly exponential in $n$; it follows that almost all Ingleton matroids are non-representable."},"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":"1710.01924","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-05T09:05:36Z","cross_cats_sorted":[],"title_canon_sha256":"8a95d717b9e064ae3fcb406827895c5b540d4b53d8af8a3998da93badfe5f978","abstract_canon_sha256":"c91af4a7414af7a874d839849adc858473589edb66ff5930091b956c5dfa5193"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:38.040366Z","signature_b64":"18v4erBrhSFA28iZeeqradHC+q5AU+wUaxGNIXGuILU6kojs1GB7tUuKcnE7bQgCLD4kID/aZUumNIyFWACxCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66ba8f1ba7348f2d478e89fabc045cd526f5b30fcebdb9bd1a4a04c579b13a89","last_reissued_at":"2026-05-18T00:33:38.039773Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:38.039773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Doubly exponentially many Ingleton matroids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jorn van der Pol, Peter Nelson","submitted_at":"2017-10-05T09:05:36Z","abstract_excerpt":"A matroid is Ingleton if all quadruples of subsets of its ground set satisfy Ingleton's inequality. In particular, representable matroids are Ingleton. We show that the number of Ingleton matroids on ground set $[n]$ is doubly exponential in $n$; it follows that almost all Ingleton matroids are non-representable."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01924","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":""},"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":"1710.01924","created_at":"2026-05-18T00:33:38.039847+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.01924v1","created_at":"2026-05-18T00:33:38.039847+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01924","created_at":"2026-05-18T00:33:38.039847+00:00"},{"alias_kind":"pith_short_12","alias_value":"M25I6G5HGSHS","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"M25I6G5HGSHS2R4O","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"M25I6G5H","created_at":"2026-05-18T12:31:28.150371+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/M25I6G5HGSHS2R4ORH5LYBC42U","json":"https://pith.science/pith/M25I6G5HGSHS2R4ORH5LYBC42U.json","graph_json":"https://pith.science/api/pith-number/M25I6G5HGSHS2R4ORH5LYBC42U/graph.json","events_json":"https://pith.science/api/pith-number/M25I6G5HGSHS2R4ORH5LYBC42U/events.json","paper":"https://pith.science/paper/M25I6G5H"},"agent_actions":{"view_html":"https://pith.science/pith/M25I6G5HGSHS2R4ORH5LYBC42U","download_json":"https://pith.science/pith/M25I6G5HGSHS2R4ORH5LYBC42U.json","view_paper":"https://pith.science/paper/M25I6G5H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.01924&json=true","fetch_graph":"https://pith.science/api/pith-number/M25I6G5HGSHS2R4ORH5LYBC42U/graph.json","fetch_events":"https://pith.science/api/pith-number/M25I6G5HGSHS2R4ORH5LYBC42U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M25I6G5HGSHS2R4ORH5LYBC42U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M25I6G5HGSHS2R4ORH5LYBC42U/action/storage_attestation","attest_author":"https://pith.science/pith/M25I6G5HGSHS2R4ORH5LYBC42U/action/author_attestation","sign_citation":"https://pith.science/pith/M25I6G5HGSHS2R4ORH5LYBC42U/action/citation_signature","submit_replication":"https://pith.science/pith/M25I6G5HGSHS2R4ORH5LYBC42U/action/replication_record"}},"created_at":"2026-05-18T00:33:38.039847+00:00","updated_at":"2026-05-18T00:33:38.039847+00:00"}