{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:TBQ36J3X5TOT3JP7JEIIWADO6Y","short_pith_number":"pith:TBQ36J3X","canonical_record":{"source":{"id":"1512.06655","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-21T15:11:32Z","cross_cats_sorted":[],"title_canon_sha256":"27466f4141fee85a4fc422c1232b921f8b9c483e1558313da72209aec4c32bd5","abstract_canon_sha256":"3a4ad79c186331dd843b00f9f8ec22619e120f81c7ab2d59938837ccbd5c3fb5"},"schema_version":"1.0"},"canonical_sha256":"9861bf2777ecdd3da5ff49108b006ef61d6777c7c226097e82783e47f973705d","source":{"kind":"arxiv","id":"1512.06655","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.06655","created_at":"2026-05-18T01:22:05Z"},{"alias_kind":"arxiv_version","alias_value":"1512.06655v2","created_at":"2026-05-18T01:22:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06655","created_at":"2026-05-18T01:22:05Z"},{"alias_kind":"pith_short_12","alias_value":"TBQ36J3X5TOT","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TBQ36J3X5TOT3JP7","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TBQ36J3X","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:TBQ36J3X5TOT3JP7JEIIWADO6Y","target":"record","payload":{"canonical_record":{"source":{"id":"1512.06655","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-21T15:11:32Z","cross_cats_sorted":[],"title_canon_sha256":"27466f4141fee85a4fc422c1232b921f8b9c483e1558313da72209aec4c32bd5","abstract_canon_sha256":"3a4ad79c186331dd843b00f9f8ec22619e120f81c7ab2d59938837ccbd5c3fb5"},"schema_version":"1.0"},"canonical_sha256":"9861bf2777ecdd3da5ff49108b006ef61d6777c7c226097e82783e47f973705d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:05.578085Z","signature_b64":"kS7B+BJSRaIWUWmM5ls55893zw99wGKEtEswzGziBsfZHY2CcX8K/wH/JsKPyC6asmjfkfsGtQq1xiAUy9rkBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9861bf2777ecdd3da5ff49108b006ef61d6777c7c226097e82783e47f973705d","last_reissued_at":"2026-05-18T01:22:05.577540Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:05.577540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.06655","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:22:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I2R4zhPTpGni6Vnzzn+oVWJAa7UFtdO3QI6KiIwzafDxTAzMde5e04WG/uyIR3d82putvqVx87juZARNjsU7BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T23:52:47.963250Z"},"content_sha256":"e903996eda45a9e4cb9cc5ccee50d89cdc6bfc30dd4063e674b06ccb3f74bf83","schema_version":"1.0","event_id":"sha256:e903996eda45a9e4cb9cc5ccee50d89cdc6bfc30dd4063e674b06ccb3f74bf83"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:TBQ36J3X5TOT3JP7JEIIWADO6Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Enumerating matroids of fixed rank","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":"2015-12-21T15:11:32Z","abstract_excerpt":"It has been conjectured that asymptotically almost all matroids are sparse paving, i.e. that $s(n) \\sim m(n)$, where $m(n)$ denotes the number of matroids on a fixed groundset of size $n$, and $s(n)$ the number of sparse paving matroids. In an earlier paper, we showed that $\\log s(n) \\sim \\log m(n)$. The bounds that we used for that result were dominated by matroids of rank $r\\approx n/2$. In this paper we consider the relation between the number of sparse paving matroids $s(n,r)$ and the number of matroids $m(n,r)$ on a fixed groundset of size $n$ of fixed rank $r$. In particular, we show tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.06655","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:22:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BVJO5pmSjcomVFpOPxjqERQgA4rq552sflRYXID3axtVNC9Lk1hQpFTJMzb2QmeDi5dNWO/rbgiPuvV2e33eAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T23:52:47.963602Z"},"content_sha256":"4c063e1caf49a9cb13374a14eb52dbece6ecf5869b3bb9f3e75345ec61111521","schema_version":"1.0","event_id":"sha256:4c063e1caf49a9cb13374a14eb52dbece6ecf5869b3bb9f3e75345ec61111521"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TBQ36J3X5TOT3JP7JEIIWADO6Y/bundle.json","state_url":"https://pith.science/pith/TBQ36J3X5TOT3JP7JEIIWADO6Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TBQ36J3X5TOT3JP7JEIIWADO6Y/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-26T23:52:47Z","links":{"resolver":"https://pith.science/pith/TBQ36J3X5TOT3JP7JEIIWADO6Y","bundle":"https://pith.science/pith/TBQ36J3X5TOT3JP7JEIIWADO6Y/bundle.json","state":"https://pith.science/pith/TBQ36J3X5TOT3JP7JEIIWADO6Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TBQ36J3X5TOT3JP7JEIIWADO6Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:TBQ36J3X5TOT3JP7JEIIWADO6Y","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":"3a4ad79c186331dd843b00f9f8ec22619e120f81c7ab2d59938837ccbd5c3fb5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-21T15:11:32Z","title_canon_sha256":"27466f4141fee85a4fc422c1232b921f8b9c483e1558313da72209aec4c32bd5"},"schema_version":"1.0","source":{"id":"1512.06655","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.06655","created_at":"2026-05-18T01:22:05Z"},{"alias_kind":"arxiv_version","alias_value":"1512.06655v2","created_at":"2026-05-18T01:22:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06655","created_at":"2026-05-18T01:22:05Z"},{"alias_kind":"pith_short_12","alias_value":"TBQ36J3X5TOT","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TBQ36J3X5TOT3JP7","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TBQ36J3X","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:4c063e1caf49a9cb13374a14eb52dbece6ecf5869b3bb9f3e75345ec61111521","target":"graph","created_at":"2026-05-18T01:22:05Z","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"},"paper":{"abstract_excerpt":"It has been conjectured that asymptotically almost all matroids are sparse paving, i.e. that $s(n) \\sim m(n)$, where $m(n)$ denotes the number of matroids on a fixed groundset of size $n$, and $s(n)$ the number of sparse paving matroids. In an earlier paper, we showed that $\\log s(n) \\sim \\log m(n)$. The bounds that we used for that result were dominated by matroids of rank $r\\approx n/2$. In this paper we consider the relation between the number of sparse paving matroids $s(n,r)$ and the number of matroids $m(n,r)$ on a fixed groundset of size $n$ of fixed rank $r$. In particular, we show tha","authors_text":"Jorn van der Pol, Rudi Pendavingh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-21T15:11:32Z","title":"Enumerating matroids of fixed rank"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.06655","kind":"arxiv","version":2},"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:e903996eda45a9e4cb9cc5ccee50d89cdc6bfc30dd4063e674b06ccb3f74bf83","target":"record","created_at":"2026-05-18T01:22:05Z","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":"3a4ad79c186331dd843b00f9f8ec22619e120f81c7ab2d59938837ccbd5c3fb5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-21T15:11:32Z","title_canon_sha256":"27466f4141fee85a4fc422c1232b921f8b9c483e1558313da72209aec4c32bd5"},"schema_version":"1.0","source":{"id":"1512.06655","kind":"arxiv","version":2}},"canonical_sha256":"9861bf2777ecdd3da5ff49108b006ef61d6777c7c226097e82783e47f973705d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9861bf2777ecdd3da5ff49108b006ef61d6777c7c226097e82783e47f973705d","first_computed_at":"2026-05-18T01:22:05.577540Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:05.577540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kS7B+BJSRaIWUWmM5ls55893zw99wGKEtEswzGziBsfZHY2CcX8K/wH/JsKPyC6asmjfkfsGtQq1xiAUy9rkBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:05.578085Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.06655","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e903996eda45a9e4cb9cc5ccee50d89cdc6bfc30dd4063e674b06ccb3f74bf83","sha256:4c063e1caf49a9cb13374a14eb52dbece6ecf5869b3bb9f3e75345ec61111521"],"state_sha256":"719c29b929680753826948247fa569d08075ca2258a2f2cca41bfb8ba5261a92"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ICWB4ecDFhxKCCN+WWY5k82LU1pnhHQ2NgOgg+fpNA7RdkVuciSgQB3/2gqNZDEcPVjl5POFgcqDYoprvCqfCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T23:52:47.965371Z","bundle_sha256":"39148efa615b37b6d35bd7489919fe4c784fbd7fd529ab0717049690d9561d3c"}}