{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:WF5IACI6ZLROAHHMFAYS5F4B3P","short_pith_number":"pith:WF5IACI6","schema_version":"1.0","canonical_sha256":"b17a80091ecae2e01cec28312e9781dbedd8ac1559ff4b4332bf6af7c00ec141","source":{"kind":"arxiv","id":"1411.0935","version":2},"attestation_state":"computed","paper":{"title":"On the number of matroids compared to the number of sparse paving matroids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jorn van der Pol, Rudi Pendavingh","submitted_at":"2014-11-04T15:14:26Z","abstract_excerpt":"It has been conjectured that sparse paving matroids will eventually predominate in any asymptotic enumeration of matroids, i.e. that $\\lim_{n\\rightarrow\\infty} s_n/m_n = 1$, where $m_n$ denotes the number of matroids on $n$ elements, and $s_n$ the number of sparse paving matroids. In this paper, we show that $$\\lim_{n\\rightarrow \\infty}\\frac{\\log s_n}{\\log m_n}=1.$$ We prove this by arguing that each matroid on $n$ elements has a faithful description consisting of a stable set of a Johnson graph together with a (by comparison) vanishing amount of other information, and using that stable sets i"},"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":"1411.0935","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-04T15:14:26Z","cross_cats_sorted":[],"title_canon_sha256":"af7496cb961c931af26aa274c0d4d65c0a3c9dae8f510c0aa6c0ea2a1a14d211","abstract_canon_sha256":"a8b3b2af50d4e3281d4018d07144d7de0048647e4d0379b67db5bc04cbc1f2d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:37.705777Z","signature_b64":"XNALCoUQfYJSGksha0ZOom8gscFVwaRiAe9RYAMMwhbBdQ4ALm3f9hCtzqD9E/h47hU2QuUOWFY5JgD2tkUCDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b17a80091ecae2e01cec28312e9781dbedd8ac1559ff4b4332bf6af7c00ec141","last_reissued_at":"2026-05-18T02:31:37.705258Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:37.705258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the number of matroids compared to the number of sparse paving matroids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jorn van der Pol, Rudi Pendavingh","submitted_at":"2014-11-04T15:14:26Z","abstract_excerpt":"It has been conjectured that sparse paving matroids will eventually predominate in any asymptotic enumeration of matroids, i.e. that $\\lim_{n\\rightarrow\\infty} s_n/m_n = 1$, where $m_n$ denotes the number of matroids on $n$ elements, and $s_n$ the number of sparse paving matroids. In this paper, we show that $$\\lim_{n\\rightarrow \\infty}\\frac{\\log s_n}{\\log m_n}=1.$$ We prove this by arguing that each matroid on $n$ elements has a faithful description consisting of a stable set of a Johnson graph together with a (by comparison) vanishing amount of other information, and using that stable sets i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0935","kind":"arxiv","version":2},"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":"1411.0935","created_at":"2026-05-18T02:31:37.705333+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.0935v2","created_at":"2026-05-18T02:31:37.705333+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0935","created_at":"2026-05-18T02:31:37.705333+00:00"},{"alias_kind":"pith_short_12","alias_value":"WF5IACI6ZLRO","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"WF5IACI6ZLROAHHM","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"WF5IACI6","created_at":"2026-05-18T12:28:54.890064+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/WF5IACI6ZLROAHHMFAYS5F4B3P","json":"https://pith.science/pith/WF5IACI6ZLROAHHMFAYS5F4B3P.json","graph_json":"https://pith.science/api/pith-number/WF5IACI6ZLROAHHMFAYS5F4B3P/graph.json","events_json":"https://pith.science/api/pith-number/WF5IACI6ZLROAHHMFAYS5F4B3P/events.json","paper":"https://pith.science/paper/WF5IACI6"},"agent_actions":{"view_html":"https://pith.science/pith/WF5IACI6ZLROAHHMFAYS5F4B3P","download_json":"https://pith.science/pith/WF5IACI6ZLROAHHMFAYS5F4B3P.json","view_paper":"https://pith.science/paper/WF5IACI6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.0935&json=true","fetch_graph":"https://pith.science/api/pith-number/WF5IACI6ZLROAHHMFAYS5F4B3P/graph.json","fetch_events":"https://pith.science/api/pith-number/WF5IACI6ZLROAHHMFAYS5F4B3P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WF5IACI6ZLROAHHMFAYS5F4B3P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WF5IACI6ZLROAHHMFAYS5F4B3P/action/storage_attestation","attest_author":"https://pith.science/pith/WF5IACI6ZLROAHHMFAYS5F4B3P/action/author_attestation","sign_citation":"https://pith.science/pith/WF5IACI6ZLROAHHMFAYS5F4B3P/action/citation_signature","submit_replication":"https://pith.science/pith/WF5IACI6ZLROAHHMFAYS5F4B3P/action/replication_record"}},"created_at":"2026-05-18T02:31:37.705333+00:00","updated_at":"2026-05-18T02:31:37.705333+00:00"}