{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GDWMKOGJTKQBU6YJG6TIAP4546","short_pith_number":"pith:GDWMKOGJ","schema_version":"1.0","canonical_sha256":"30ecc538c99aa01a7b0937a6803f9de7b164de6952cab92c3bc91cfa96e3ba7e","source":{"kind":"arxiv","id":"1807.00929","version":2},"attestation_state":"computed","paper":{"title":"Log-Concave Polynomials I: Entropy and a Deterministic Approximation Algorithm for Counting Bases of Matroids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.CO","math.IT","math.PR"],"primary_cat":"cs.DS","authors_text":"Cynthia Vinzant, Nima Anari, Shayan Oveis Gharan","submitted_at":"2018-07-02T23:50:07Z","abstract_excerpt":"We give a deterministic polynomial time $2^{O(r)}$-approximation algorithm for the number of bases of a given matroid of rank $r$ and the number of common bases of any two matroids of rank $r$. To the best of our knowledge, this is the first nontrivial deterministic approximation algorithm that works for arbitrary matroids. Based on a lower bound of Azar, Broder, and Frieze [ABF94] this is almost the best possible result assuming oracle access to independent sets of the matroid.\n  There are two main ingredients in our result: For the first, we build upon recent results of Adiprasito, Huh, and "},"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":"1807.00929","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-02T23:50:07Z","cross_cats_sorted":["cs.IT","math.CO","math.IT","math.PR"],"title_canon_sha256":"616e9654d3265a933ed15dbb5797949844cd401fea8c0c39d187b07c3960d17c","abstract_canon_sha256":"67810fecc4195a705c7638c860a0400597b06bf3dc8b282c2ed533c400709742"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:38.113606Z","signature_b64":"/yK0LQqIwTymi/PMYE49oX93z4bFfc/6TNMd7wg6YGvTlA2SfQEDRdqjW9WMvnvXAZcrvS8W8gY0ViR/DEfjBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30ecc538c99aa01a7b0937a6803f9de7b164de6952cab92c3bc91cfa96e3ba7e","last_reissued_at":"2026-05-18T00:01:38.113080Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:38.113080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Log-Concave Polynomials I: Entropy and a Deterministic Approximation Algorithm for Counting Bases of Matroids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.CO","math.IT","math.PR"],"primary_cat":"cs.DS","authors_text":"Cynthia Vinzant, Nima Anari, Shayan Oveis Gharan","submitted_at":"2018-07-02T23:50:07Z","abstract_excerpt":"We give a deterministic polynomial time $2^{O(r)}$-approximation algorithm for the number of bases of a given matroid of rank $r$ and the number of common bases of any two matroids of rank $r$. To the best of our knowledge, this is the first nontrivial deterministic approximation algorithm that works for arbitrary matroids. Based on a lower bound of Azar, Broder, and Frieze [ABF94] this is almost the best possible result assuming oracle access to independent sets of the matroid.\n  There are two main ingredients in our result: For the first, we build upon recent results of Adiprasito, Huh, and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.00929","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":"1807.00929","created_at":"2026-05-18T00:01:38.113167+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.00929v2","created_at":"2026-05-18T00:01:38.113167+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.00929","created_at":"2026-05-18T00:01:38.113167+00:00"},{"alias_kind":"pith_short_12","alias_value":"GDWMKOGJTKQB","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GDWMKOGJTKQBU6YJ","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GDWMKOGJ","created_at":"2026-05-18T12:32:25.280505+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/GDWMKOGJTKQBU6YJG6TIAP4546","json":"https://pith.science/pith/GDWMKOGJTKQBU6YJG6TIAP4546.json","graph_json":"https://pith.science/api/pith-number/GDWMKOGJTKQBU6YJG6TIAP4546/graph.json","events_json":"https://pith.science/api/pith-number/GDWMKOGJTKQBU6YJG6TIAP4546/events.json","paper":"https://pith.science/paper/GDWMKOGJ"},"agent_actions":{"view_html":"https://pith.science/pith/GDWMKOGJTKQBU6YJG6TIAP4546","download_json":"https://pith.science/pith/GDWMKOGJTKQBU6YJG6TIAP4546.json","view_paper":"https://pith.science/paper/GDWMKOGJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.00929&json=true","fetch_graph":"https://pith.science/api/pith-number/GDWMKOGJTKQBU6YJG6TIAP4546/graph.json","fetch_events":"https://pith.science/api/pith-number/GDWMKOGJTKQBU6YJG6TIAP4546/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GDWMKOGJTKQBU6YJG6TIAP4546/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GDWMKOGJTKQBU6YJG6TIAP4546/action/storage_attestation","attest_author":"https://pith.science/pith/GDWMKOGJTKQBU6YJG6TIAP4546/action/author_attestation","sign_citation":"https://pith.science/pith/GDWMKOGJTKQBU6YJG6TIAP4546/action/citation_signature","submit_replication":"https://pith.science/pith/GDWMKOGJTKQBU6YJG6TIAP4546/action/replication_record"}},"created_at":"2026-05-18T00:01:38.113167+00:00","updated_at":"2026-05-18T00:01:38.113167+00:00"}