{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:5F2YSWIL5JOO7GJICG6WC7GG4C","short_pith_number":"pith:5F2YSWIL","schema_version":"1.0","canonical_sha256":"e97589590bea5cef992811bd617cc6e0b4c8e1ae6071dcdc594d454249dd66fe","source":{"kind":"arxiv","id":"2606.20348","version":1},"attestation_state":"computed","paper":{"title":"Counting q-Matroids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benjamin Jany, Relinde Jurrius, Rudi Pendavingh","submitted_at":"2026-06-18T15:16:20Z","abstract_excerpt":"$q$-Matroids, a $q$-analogue of classical matroids have attracted a lot of attention over the last decade, yet their enumeration remains largely unexplored. In this paper, we study the number of $q$-matroids, paving and sparse-paving $q$-matroids defined on a fixed ground space and with prescribed rank. We derive new lower bounds using constructions from constant-dimension codes and improve existing estimates. On the upper bound side, we develop two approaches: a combinatorial method based on controlling the number of dependent hyperplanes for paving $q$-matroids, and an entropy-based counting"},"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":"2606.20348","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-18T15:16:20Z","cross_cats_sorted":[],"title_canon_sha256":"7f9bf6da8290c2246952c3e933b42d352e050c0607ee9f507f0636e02b10d0fe","abstract_canon_sha256":"26c8101f2cdc5effe839292ec0900b836d802957c875b6a581a47223ea5ebf50"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:13:09.540512Z","signature_b64":"1a+4zeI3YvB5OWrKe9g+xDhlh2usxjpeqxVyB6PcogKS7WZj9LQS0VKoa5qVZffuwJzZUS0vuKQtztATRWjvCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e97589590bea5cef992811bd617cc6e0b4c8e1ae6071dcdc594d454249dd66fe","last_reissued_at":"2026-06-19T16:13:09.540148Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:13:09.540148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting q-Matroids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benjamin Jany, Relinde Jurrius, Rudi Pendavingh","submitted_at":"2026-06-18T15:16:20Z","abstract_excerpt":"$q$-Matroids, a $q$-analogue of classical matroids have attracted a lot of attention over the last decade, yet their enumeration remains largely unexplored. In this paper, we study the number of $q$-matroids, paving and sparse-paving $q$-matroids defined on a fixed ground space and with prescribed rank. We derive new lower bounds using constructions from constant-dimension codes and improve existing estimates. On the upper bound side, we develop two approaches: a combinatorial method based on controlling the number of dependent hyperplanes for paving $q$-matroids, and an entropy-based counting"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.20348","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.20348/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":"2606.20348","created_at":"2026-06-19T16:13:09.540214+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.20348v1","created_at":"2026-06-19T16:13:09.540214+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.20348","created_at":"2026-06-19T16:13:09.540214+00:00"},{"alias_kind":"pith_short_12","alias_value":"5F2YSWIL5JOO","created_at":"2026-06-19T16:13:09.540214+00:00"},{"alias_kind":"pith_short_16","alias_value":"5F2YSWIL5JOO7GJI","created_at":"2026-06-19T16:13:09.540214+00:00"},{"alias_kind":"pith_short_8","alias_value":"5F2YSWIL","created_at":"2026-06-19T16:13:09.540214+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/5F2YSWIL5JOO7GJICG6WC7GG4C","json":"https://pith.science/pith/5F2YSWIL5JOO7GJICG6WC7GG4C.json","graph_json":"https://pith.science/api/pith-number/5F2YSWIL5JOO7GJICG6WC7GG4C/graph.json","events_json":"https://pith.science/api/pith-number/5F2YSWIL5JOO7GJICG6WC7GG4C/events.json","paper":"https://pith.science/paper/5F2YSWIL"},"agent_actions":{"view_html":"https://pith.science/pith/5F2YSWIL5JOO7GJICG6WC7GG4C","download_json":"https://pith.science/pith/5F2YSWIL5JOO7GJICG6WC7GG4C.json","view_paper":"https://pith.science/paper/5F2YSWIL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.20348&json=true","fetch_graph":"https://pith.science/api/pith-number/5F2YSWIL5JOO7GJICG6WC7GG4C/graph.json","fetch_events":"https://pith.science/api/pith-number/5F2YSWIL5JOO7GJICG6WC7GG4C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5F2YSWIL5JOO7GJICG6WC7GG4C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5F2YSWIL5JOO7GJICG6WC7GG4C/action/storage_attestation","attest_author":"https://pith.science/pith/5F2YSWIL5JOO7GJICG6WC7GG4C/action/author_attestation","sign_citation":"https://pith.science/pith/5F2YSWIL5JOO7GJICG6WC7GG4C/action/citation_signature","submit_replication":"https://pith.science/pith/5F2YSWIL5JOO7GJICG6WC7GG4C/action/replication_record"}},"created_at":"2026-06-19T16:13:09.540214+00:00","updated_at":"2026-06-19T16:13:09.540214+00:00"}