{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:ZS6GLG66P3XDBZY5TZROIG7LQF","short_pith_number":"pith:ZS6GLG66","schema_version":"1.0","canonical_sha256":"ccbc659bde7eee30e71d9e62e41beb81796bc4a897d8a58b576bbd0fe0e0d252","source":{"kind":"arxiv","id":"2101.04633","version":1},"attestation_state":"computed","paper":{"title":"Diverse Collections in Matroids and Graphs","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fahad Panolan, Fedor V. Fomin, Geevarghese Philip, Petr A. Golovach, Saket Saurabh","submitted_at":"2021-01-12T17:41:40Z","abstract_excerpt":"We investigate the parameterized complexity of finding diverse sets of solutions to three fundamental combinatorial problems, two from the theory of matroids and the third from graph theory. The input to the Weighted Diverse Bases problem consists of a matroid $M$, a weight function $\\omega:E(M)\\to\\mathbb{N}$, and integers $k\\geq 1, d\\geq 0$. The task is to decide if there is a collection of $k$ bases $B_{1}, \\dotsc, B_{k}$ of $M$ such that the weight of the symmetric difference of any pair of these bases is at least $d$. This is a diverse variant of the classical matroid base packing problem."},"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":"2101.04633","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2021-01-12T17:41:40Z","cross_cats_sorted":[],"title_canon_sha256":"f61635c42d937a0b695bdb0f8ec5ae26214c9b6fa921080e3fe5e81112ada70b","abstract_canon_sha256":"b91c6937a573e6ad2c4cc9ad15dd1451f39423ad7ce956345446b7c775d0804a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:06:27.094491Z","signature_b64":"NtuMTH4huvYlpbMIlR8iWv+WLsCRNHylpOdBYDa+Of/ieER1IE/s4e61Tni5BJxxl7xa2pKzYyTx/Y2SFT/uDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccbc659bde7eee30e71d9e62e41beb81796bc4a897d8a58b576bbd0fe0e0d252","last_reissued_at":"2026-07-05T02:06:27.094090Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:06:27.094090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Diverse Collections in Matroids and Graphs","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fahad Panolan, Fedor V. Fomin, Geevarghese Philip, Petr A. Golovach, Saket Saurabh","submitted_at":"2021-01-12T17:41:40Z","abstract_excerpt":"We investigate the parameterized complexity of finding diverse sets of solutions to three fundamental combinatorial problems, two from the theory of matroids and the third from graph theory. The input to the Weighted Diverse Bases problem consists of a matroid $M$, a weight function $\\omega:E(M)\\to\\mathbb{N}$, and integers $k\\geq 1, d\\geq 0$. The task is to decide if there is a collection of $k$ bases $B_{1}, \\dotsc, B_{k}$ of $M$ such that the weight of the symmetric difference of any pair of these bases is at least $d$. This is a diverse variant of the classical matroid base packing problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.04633","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/2101.04633/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":"2101.04633","created_at":"2026-07-05T02:06:27.094153+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.04633v1","created_at":"2026-07-05T02:06:27.094153+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.04633","created_at":"2026-07-05T02:06:27.094153+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZS6GLG66P3XD","created_at":"2026-07-05T02:06:27.094153+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZS6GLG66P3XDBZY5","created_at":"2026-07-05T02:06:27.094153+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZS6GLG66","created_at":"2026-07-05T02:06:27.094153+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/ZS6GLG66P3XDBZY5TZROIG7LQF","json":"https://pith.science/pith/ZS6GLG66P3XDBZY5TZROIG7LQF.json","graph_json":"https://pith.science/api/pith-number/ZS6GLG66P3XDBZY5TZROIG7LQF/graph.json","events_json":"https://pith.science/api/pith-number/ZS6GLG66P3XDBZY5TZROIG7LQF/events.json","paper":"https://pith.science/paper/ZS6GLG66"},"agent_actions":{"view_html":"https://pith.science/pith/ZS6GLG66P3XDBZY5TZROIG7LQF","download_json":"https://pith.science/pith/ZS6GLG66P3XDBZY5TZROIG7LQF.json","view_paper":"https://pith.science/paper/ZS6GLG66","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.04633&json=true","fetch_graph":"https://pith.science/api/pith-number/ZS6GLG66P3XDBZY5TZROIG7LQF/graph.json","fetch_events":"https://pith.science/api/pith-number/ZS6GLG66P3XDBZY5TZROIG7LQF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZS6GLG66P3XDBZY5TZROIG7LQF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZS6GLG66P3XDBZY5TZROIG7LQF/action/storage_attestation","attest_author":"https://pith.science/pith/ZS6GLG66P3XDBZY5TZROIG7LQF/action/author_attestation","sign_citation":"https://pith.science/pith/ZS6GLG66P3XDBZY5TZROIG7LQF/action/citation_signature","submit_replication":"https://pith.science/pith/ZS6GLG66P3XDBZY5TZROIG7LQF/action/replication_record"}},"created_at":"2026-07-05T02:06:27.094153+00:00","updated_at":"2026-07-05T02:06:27.094153+00:00"}