{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:GNTOZSKDTNGJYJRVJITPZBI5LB","short_pith_number":"pith:GNTOZSKD","schema_version":"1.0","canonical_sha256":"3366ecc9439b4c9c26354a26fc851d58579211c6788cb1caa2446ea8d4bf6026","source":{"kind":"arxiv","id":"2008.06045","version":1},"attestation_state":"computed","paper":{"title":"Rota's Basis Conjecture holds asymptotically","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexey Pokrovskiy","submitted_at":"2020-08-13T17:59:02Z","abstract_excerpt":"Rota's Basis Conjecture is a well known problem from matroid theory, that states that for any collection of $n$ bases in a rank $n$ matroid, it is possible to decompose all the elements into $n$ disjoint rainbow bases. Here an asymptotic version of this is proved. We show that it is possible to find $n-o(n)$ disjoint rainbow independent sets of size $n-o(n)$."},"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":"2008.06045","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-08-13T17:59:02Z","cross_cats_sorted":[],"title_canon_sha256":"7201b7c0e467ad3d74baef46f8c52228af4246e2b6420ee932626c91cdfdfba5","abstract_canon_sha256":"4cea7ce9ad7f5022fe301df1ffcc8687d63c6063eef01f49027dd9c1233b99d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:26:59.633798Z","signature_b64":"qxN/4skcpxPAcynhqIHUkekdNxKWomlEFAtQUDUQPVzeGJ6XxpQuDuHh2H8S2QHSFqtfm8q5kYZ5r/VEKXT3Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3366ecc9439b4c9c26354a26fc851d58579211c6788cb1caa2446ea8d4bf6026","last_reissued_at":"2026-07-05T01:26:59.633437Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:26:59.633437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rota's Basis Conjecture holds asymptotically","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexey Pokrovskiy","submitted_at":"2020-08-13T17:59:02Z","abstract_excerpt":"Rota's Basis Conjecture is a well known problem from matroid theory, that states that for any collection of $n$ bases in a rank $n$ matroid, it is possible to decompose all the elements into $n$ disjoint rainbow bases. Here an asymptotic version of this is proved. We show that it is possible to find $n-o(n)$ disjoint rainbow independent sets of size $n-o(n)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.06045","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/2008.06045/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":"2008.06045","created_at":"2026-07-05T01:26:59.633493+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.06045v1","created_at":"2026-07-05T01:26:59.633493+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.06045","created_at":"2026-07-05T01:26:59.633493+00:00"},{"alias_kind":"pith_short_12","alias_value":"GNTOZSKDTNGJ","created_at":"2026-07-05T01:26:59.633493+00:00"},{"alias_kind":"pith_short_16","alias_value":"GNTOZSKDTNGJYJRV","created_at":"2026-07-05T01:26:59.633493+00:00"},{"alias_kind":"pith_short_8","alias_value":"GNTOZSKD","created_at":"2026-07-05T01:26:59.633493+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2309.12607","citing_title":"Robust Hamiltonicity in families of Dirac graphs","ref_index":46,"is_internal_anchor":false},{"citing_arxiv_id":"2412.01121","citing_title":"Transversal Structures in Graph Systems: A Survey","ref_index":118,"is_internal_anchor":false},{"citing_arxiv_id":"2501.00998","citing_title":"Transversal Hamilton cycles in digraph collections","ref_index":24,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GNTOZSKDTNGJYJRVJITPZBI5LB","json":"https://pith.science/pith/GNTOZSKDTNGJYJRVJITPZBI5LB.json","graph_json":"https://pith.science/api/pith-number/GNTOZSKDTNGJYJRVJITPZBI5LB/graph.json","events_json":"https://pith.science/api/pith-number/GNTOZSKDTNGJYJRVJITPZBI5LB/events.json","paper":"https://pith.science/paper/GNTOZSKD"},"agent_actions":{"view_html":"https://pith.science/pith/GNTOZSKDTNGJYJRVJITPZBI5LB","download_json":"https://pith.science/pith/GNTOZSKDTNGJYJRVJITPZBI5LB.json","view_paper":"https://pith.science/paper/GNTOZSKD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.06045&json=true","fetch_graph":"https://pith.science/api/pith-number/GNTOZSKDTNGJYJRVJITPZBI5LB/graph.json","fetch_events":"https://pith.science/api/pith-number/GNTOZSKDTNGJYJRVJITPZBI5LB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GNTOZSKDTNGJYJRVJITPZBI5LB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GNTOZSKDTNGJYJRVJITPZBI5LB/action/storage_attestation","attest_author":"https://pith.science/pith/GNTOZSKDTNGJYJRVJITPZBI5LB/action/author_attestation","sign_citation":"https://pith.science/pith/GNTOZSKDTNGJYJRVJITPZBI5LB/action/citation_signature","submit_replication":"https://pith.science/pith/GNTOZSKDTNGJYJRVJITPZBI5LB/action/replication_record"}},"created_at":"2026-07-05T01:26:59.633493+00:00","updated_at":"2026-07-05T01:26:59.633493+00:00"}