{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TYMRMUDDTWTNLNQEN3NWVGWVYX","short_pith_number":"pith:TYMRMUDD","schema_version":"1.0","canonical_sha256":"9e191650639da6d5b6046edb6a9ad5c5ca71bd1785db868eb9400d1b23c2f507","source":{"kind":"arxiv","id":"1611.01823","version":1},"attestation_state":"computed","paper":{"title":"Parameterized counting of trees, forests and matroid bases","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Cornelius Brand, Marc Roth","submitted_at":"2016-11-06T18:53:56Z","abstract_excerpt":"We investigate the complexity of counting trees, forests and bases of matroids from a parameterized point of view. It turns out that the problems of computing the number of trees and forests with $k$ edges are $\\# W[1]$-hard when parameterized by $k$. Together with the recent algorithm for deterministic matrix truncation by Lokshtanov et al. (ICALP 2015), the hardness result for $k$-forests implies $\\# W[1]$-hardness of the problem of counting bases of a matroid when parameterized by rank or nullity, even if the matroid is restricted to be representable over a field of characteristic $2$. We c"},"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":"1611.01823","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2016-11-06T18:53:56Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d6ce5ca430c3a361df2bdf1facc815cf884771861c517e522da260190489b3ac","abstract_canon_sha256":"83a62d55958a342a05d303ce16639a019fc6c11109667e1ac21118233e22dfc2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:34.080571Z","signature_b64":"RX1EGYhZ9I1Mh/efk9fFQz921jqtIeJES55wC6t8rT7sf9hP1+mjVSsDOx4lvalyqCIWfZ4UgoETrHUrC8pDBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e191650639da6d5b6046edb6a9ad5c5ca71bd1785db868eb9400d1b23c2f507","last_reissued_at":"2026-05-18T00:59:34.079919Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:34.079919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized counting of trees, forests and matroid bases","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Cornelius Brand, Marc Roth","submitted_at":"2016-11-06T18:53:56Z","abstract_excerpt":"We investigate the complexity of counting trees, forests and bases of matroids from a parameterized point of view. It turns out that the problems of computing the number of trees and forests with $k$ edges are $\\# W[1]$-hard when parameterized by $k$. Together with the recent algorithm for deterministic matrix truncation by Lokshtanov et al. (ICALP 2015), the hardness result for $k$-forests implies $\\# W[1]$-hardness of the problem of counting bases of a matroid when parameterized by rank or nullity, even if the matroid is restricted to be representable over a field of characteristic $2$. We c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01823","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":""},"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":"1611.01823","created_at":"2026-05-18T00:59:34.080047+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.01823v1","created_at":"2026-05-18T00:59:34.080047+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01823","created_at":"2026-05-18T00:59:34.080047+00:00"},{"alias_kind":"pith_short_12","alias_value":"TYMRMUDDTWTN","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"TYMRMUDDTWTNLNQE","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"TYMRMUDD","created_at":"2026-05-18T12:30:46.583412+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/TYMRMUDDTWTNLNQEN3NWVGWVYX","json":"https://pith.science/pith/TYMRMUDDTWTNLNQEN3NWVGWVYX.json","graph_json":"https://pith.science/api/pith-number/TYMRMUDDTWTNLNQEN3NWVGWVYX/graph.json","events_json":"https://pith.science/api/pith-number/TYMRMUDDTWTNLNQEN3NWVGWVYX/events.json","paper":"https://pith.science/paper/TYMRMUDD"},"agent_actions":{"view_html":"https://pith.science/pith/TYMRMUDDTWTNLNQEN3NWVGWVYX","download_json":"https://pith.science/pith/TYMRMUDDTWTNLNQEN3NWVGWVYX.json","view_paper":"https://pith.science/paper/TYMRMUDD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.01823&json=true","fetch_graph":"https://pith.science/api/pith-number/TYMRMUDDTWTNLNQEN3NWVGWVYX/graph.json","fetch_events":"https://pith.science/api/pith-number/TYMRMUDDTWTNLNQEN3NWVGWVYX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TYMRMUDDTWTNLNQEN3NWVGWVYX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TYMRMUDDTWTNLNQEN3NWVGWVYX/action/storage_attestation","attest_author":"https://pith.science/pith/TYMRMUDDTWTNLNQEN3NWVGWVYX/action/author_attestation","sign_citation":"https://pith.science/pith/TYMRMUDDTWTNLNQEN3NWVGWVYX/action/citation_signature","submit_replication":"https://pith.science/pith/TYMRMUDDTWTNLNQEN3NWVGWVYX/action/replication_record"}},"created_at":"2026-05-18T00:59:34.080047+00:00","updated_at":"2026-05-18T00:59:34.080047+00:00"}