{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CT4VEK5YU4CREUS3VALNYABCDZ","short_pith_number":"pith:CT4VEK5Y","schema_version":"1.0","canonical_sha256":"14f9522bb8a70512525ba816dc00221e58e5f862034980ffe0ce261bf7876568","source":{"kind":"arxiv","id":"2506.22010","version":1},"attestation_state":"computed","paper":{"title":"Fault-Tolerant Matroid Bases","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Fedor V. Fomin, Laure Morelle, Matthias Bentert, Petr A. Golovach","submitted_at":"2025-06-27T08:24:27Z","abstract_excerpt":"We investigate the problem of constructing fault-tolerant bases in matroids. Given a matroid M and a redundancy parameter k, a k-fault-tolerant basis is a minimum-size set of elements such that, even after the removal of any k elements, the remaining subset still spans the entire ground set. Since matroids generalize linear independence across structures such as vector spaces, graphs, and set systems, this problem unifies and extends several fault-tolerant concepts appearing in prior research.\n  Our main contribution is a fixed-parameter tractable (FPT) algorithm for the k-fault-tolerant basis"},"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":"2506.22010","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-27T08:24:27Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0c801a123522fb5f2fe08ecf3fa90a0f5e9d2bf6f1fbfe70e5965e7b958e28d8","abstract_canon_sha256":"402e1b38796afb66d3cdf8bb9eb597f86074e8ba4a4c85331aa2ca6f0abdaa43"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:28:20.369727Z","signature_b64":"118cQp9hK+XI1kmOESccth6Jw2zHt5IhoB7JlMofS/eIEQxxF0bXBFOYodclSlT+g+YHxugxCL4zV4zdSeW2DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14f9522bb8a70512525ba816dc00221e58e5f862034980ffe0ce261bf7876568","last_reissued_at":"2026-07-05T11:28:20.369215Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:28:20.369215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fault-Tolerant Matroid Bases","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Fedor V. Fomin, Laure Morelle, Matthias Bentert, Petr A. Golovach","submitted_at":"2025-06-27T08:24:27Z","abstract_excerpt":"We investigate the problem of constructing fault-tolerant bases in matroids. Given a matroid M and a redundancy parameter k, a k-fault-tolerant basis is a minimum-size set of elements such that, even after the removal of any k elements, the remaining subset still spans the entire ground set. Since matroids generalize linear independence across structures such as vector spaces, graphs, and set systems, this problem unifies and extends several fault-tolerant concepts appearing in prior research.\n  Our main contribution is a fixed-parameter tractable (FPT) algorithm for the k-fault-tolerant basis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.22010","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/2506.22010/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":"2506.22010","created_at":"2026-07-05T11:28:20.369273+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.22010v1","created_at":"2026-07-05T11:28:20.369273+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.22010","created_at":"2026-07-05T11:28:20.369273+00:00"},{"alias_kind":"pith_short_12","alias_value":"CT4VEK5YU4CR","created_at":"2026-07-05T11:28:20.369273+00:00"},{"alias_kind":"pith_short_16","alias_value":"CT4VEK5YU4CREUS3","created_at":"2026-07-05T11:28:20.369273+00:00"},{"alias_kind":"pith_short_8","alias_value":"CT4VEK5Y","created_at":"2026-07-05T11:28:20.369273+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/CT4VEK5YU4CREUS3VALNYABCDZ","json":"https://pith.science/pith/CT4VEK5YU4CREUS3VALNYABCDZ.json","graph_json":"https://pith.science/api/pith-number/CT4VEK5YU4CREUS3VALNYABCDZ/graph.json","events_json":"https://pith.science/api/pith-number/CT4VEK5YU4CREUS3VALNYABCDZ/events.json","paper":"https://pith.science/paper/CT4VEK5Y"},"agent_actions":{"view_html":"https://pith.science/pith/CT4VEK5YU4CREUS3VALNYABCDZ","download_json":"https://pith.science/pith/CT4VEK5YU4CREUS3VALNYABCDZ.json","view_paper":"https://pith.science/paper/CT4VEK5Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.22010&json=true","fetch_graph":"https://pith.science/api/pith-number/CT4VEK5YU4CREUS3VALNYABCDZ/graph.json","fetch_events":"https://pith.science/api/pith-number/CT4VEK5YU4CREUS3VALNYABCDZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CT4VEK5YU4CREUS3VALNYABCDZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CT4VEK5YU4CREUS3VALNYABCDZ/action/storage_attestation","attest_author":"https://pith.science/pith/CT4VEK5YU4CREUS3VALNYABCDZ/action/author_attestation","sign_citation":"https://pith.science/pith/CT4VEK5YU4CREUS3VALNYABCDZ/action/citation_signature","submit_replication":"https://pith.science/pith/CT4VEK5YU4CREUS3VALNYABCDZ/action/replication_record"}},"created_at":"2026-07-05T11:28:20.369273+00:00","updated_at":"2026-07-05T11:28:20.369273+00:00"}