{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:X5URLFTDYR6UOHIZ7S7J2P5QSW","short_pith_number":"pith:X5URLFTD","canonical_record":{"source":{"id":"1206.6270","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-27T14:09:16Z","cross_cats_sorted":[],"title_canon_sha256":"570d698f9fc80e645d8d013131a3f584c284d9aaa5c2e57e9c702d124ea0b729","abstract_canon_sha256":"937290c11c4c2fd9f4f70c390fa564553c597c21ab8ddd4fe0576248bbb8cc30"},"schema_version":"1.0"},"canonical_sha256":"bf69159663c47d471d19fcbe9d3fb095883563118082bfadbd4eec5d6f9e6d81","source":{"kind":"arxiv","id":"1206.6270","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6270","created_at":"2026-05-18T03:12:33Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6270v5","created_at":"2026-05-18T03:12:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6270","created_at":"2026-05-18T03:12:33Z"},{"alias_kind":"pith_short_12","alias_value":"X5URLFTDYR6U","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"X5URLFTDYR6UOHIZ","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"X5URLFTD","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:X5URLFTDYR6UOHIZ7S7J2P5QSW","target":"record","payload":{"canonical_record":{"source":{"id":"1206.6270","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-27T14:09:16Z","cross_cats_sorted":[],"title_canon_sha256":"570d698f9fc80e645d8d013131a3f584c284d9aaa5c2e57e9c702d124ea0b729","abstract_canon_sha256":"937290c11c4c2fd9f4f70c390fa564553c597c21ab8ddd4fe0576248bbb8cc30"},"schema_version":"1.0"},"canonical_sha256":"bf69159663c47d471d19fcbe9d3fb095883563118082bfadbd4eec5d6f9e6d81","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:33.354673Z","signature_b64":"9p+RW0oJY+HfYhD1aItQYO4bGWECfKGH3fgtmrtLWYnyNn7YkECDCj+T5kFJhwmMKKdEFJ/APi/rnV1yMhUTBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf69159663c47d471d19fcbe9d3fb095883563118082bfadbd4eec5d6f9e6d81","last_reissued_at":"2026-05-18T03:12:33.353975Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:33.353975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.6270","source_version":5,"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-18T03:12:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TENXlVfenDV32bhJq5ZRBZAgECNFYbsn5fBbrb0sl6RrzagDLqJi59ylyDMlbtaKiSM+d74XlRsWJvWbII5cCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:59:10.113858Z"},"content_sha256":"716d2730caedd7a06e8a9612895c644216f8b5c301263b0410878ed3121a514f","schema_version":"1.0","event_id":"sha256:716d2730caedd7a06e8a9612895c644216f8b5c301263b0410878ed3121a514f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:X5URLFTDYR6UOHIZ7S7J2P5QSW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the number of matroids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"J.G. van der Pol, N. Bansal, R.A. Pendavingh","submitted_at":"2012-06-27T14:09:16Z","abstract_excerpt":"We consider the problem of determining $m_n$, the number of matroids on $n$ elements. The best known lower bound on $m_n$ is due to Knuth (1974) who showed that $\\log \\log m_n$ is at least $n-3/2\\log n-1$. On the other hand, Piff (1973) showed that $\\log\\log m_n\\leq n-\\log n+\\log\\log n +O(1)$, and it has been conjectured since that the right answer is perhaps closer to Knuth's bound.\n  We show that this is indeed the case, and prove an upper bound on $\\log\\log m_n$ that is within an additive $1+o(1)$ term of Knuth's lower bound. Our proof is based on using some structural properties of non-bas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6270","kind":"arxiv","version":5},"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-18T03:12:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y909WPb8hWSuosjDTDRbXGgo5vKp6oiqHqZZ439o7TTamw1PSsENoZ9xETsQUTA00axA/25O/Uh4KuYn/81IAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:59:10.114495Z"},"content_sha256":"cb848de4372464371516e300281408d41e530dc85d6f573fb0b027b3a73a77f5","schema_version":"1.0","event_id":"sha256:cb848de4372464371516e300281408d41e530dc85d6f573fb0b027b3a73a77f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X5URLFTDYR6UOHIZ7S7J2P5QSW/bundle.json","state_url":"https://pith.science/pith/X5URLFTDYR6UOHIZ7S7J2P5QSW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X5URLFTDYR6UOHIZ7S7J2P5QSW/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-06T15:59:10Z","links":{"resolver":"https://pith.science/pith/X5URLFTDYR6UOHIZ7S7J2P5QSW","bundle":"https://pith.science/pith/X5URLFTDYR6UOHIZ7S7J2P5QSW/bundle.json","state":"https://pith.science/pith/X5URLFTDYR6UOHIZ7S7J2P5QSW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X5URLFTDYR6UOHIZ7S7J2P5QSW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:X5URLFTDYR6UOHIZ7S7J2P5QSW","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":"937290c11c4c2fd9f4f70c390fa564553c597c21ab8ddd4fe0576248bbb8cc30","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-27T14:09:16Z","title_canon_sha256":"570d698f9fc80e645d8d013131a3f584c284d9aaa5c2e57e9c702d124ea0b729"},"schema_version":"1.0","source":{"id":"1206.6270","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6270","created_at":"2026-05-18T03:12:33Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6270v5","created_at":"2026-05-18T03:12:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6270","created_at":"2026-05-18T03:12:33Z"},{"alias_kind":"pith_short_12","alias_value":"X5URLFTDYR6U","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"X5URLFTDYR6UOHIZ","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"X5URLFTD","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:cb848de4372464371516e300281408d41e530dc85d6f573fb0b027b3a73a77f5","target":"graph","created_at":"2026-05-18T03:12:33Z","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":"We consider the problem of determining $m_n$, the number of matroids on $n$ elements. The best known lower bound on $m_n$ is due to Knuth (1974) who showed that $\\log \\log m_n$ is at least $n-3/2\\log n-1$. On the other hand, Piff (1973) showed that $\\log\\log m_n\\leq n-\\log n+\\log\\log n +O(1)$, and it has been conjectured since that the right answer is perhaps closer to Knuth's bound.\n  We show that this is indeed the case, and prove an upper bound on $\\log\\log m_n$ that is within an additive $1+o(1)$ term of Knuth's lower bound. Our proof is based on using some structural properties of non-bas","authors_text":"J.G. van der Pol, N. Bansal, R.A. Pendavingh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-27T14:09:16Z","title":"On the number of matroids"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6270","kind":"arxiv","version":5},"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:716d2730caedd7a06e8a9612895c644216f8b5c301263b0410878ed3121a514f","target":"record","created_at":"2026-05-18T03:12:33Z","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":"937290c11c4c2fd9f4f70c390fa564553c597c21ab8ddd4fe0576248bbb8cc30","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-27T14:09:16Z","title_canon_sha256":"570d698f9fc80e645d8d013131a3f584c284d9aaa5c2e57e9c702d124ea0b729"},"schema_version":"1.0","source":{"id":"1206.6270","kind":"arxiv","version":5}},"canonical_sha256":"bf69159663c47d471d19fcbe9d3fb095883563118082bfadbd4eec5d6f9e6d81","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf69159663c47d471d19fcbe9d3fb095883563118082bfadbd4eec5d6f9e6d81","first_computed_at":"2026-05-18T03:12:33.353975Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:33.353975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9p+RW0oJY+HfYhD1aItQYO4bGWECfKGH3fgtmrtLWYnyNn7YkECDCj+T5kFJhwmMKKdEFJ/APi/rnV1yMhUTBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:33.354673Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.6270","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:716d2730caedd7a06e8a9612895c644216f8b5c301263b0410878ed3121a514f","sha256:cb848de4372464371516e300281408d41e530dc85d6f573fb0b027b3a73a77f5"],"state_sha256":"4f44196d3b276480d4f089fd314f36f903988b4a1a8b69f4d5d690b776358ea5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0hrZtdmi4cIhkxboB2kqTMlfsl4C7p9E0y1i8+gzo5V8nlIBtwasZJ6T2L7aqGpGuBLPyyih5O5EKlCVXiF4Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T15:59:10.117483Z","bundle_sha256":"9b276f5454affb9134a86fe49160a9fd33d7a1920103891ab2af049166fef8e7"}}