{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TYMRMUDDTWTNLNQEN3NWVGWVYX","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"83a62d55958a342a05d303ce16639a019fc6c11109667e1ac21118233e22dfc2","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2016-11-06T18:53:56Z","title_canon_sha256":"d6ce5ca430c3a361df2bdf1facc815cf884771861c517e522da260190489b3ac"},"schema_version":"1.0","source":{"id":"1611.01823","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01823","created_at":"2026-05-18T00:59:34Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01823v1","created_at":"2026-05-18T00:59:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01823","created_at":"2026-05-18T00:59:34Z"},{"alias_kind":"pith_short_12","alias_value":"TYMRMUDDTWTN","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TYMRMUDDTWTNLNQE","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TYMRMUDD","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:d08d8422a0da2a24757fd71f058e0795302001cf8e0372171968387e905eb806","target":"graph","created_at":"2026-05-18T00:59:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Cornelius Brand, Marc Roth","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2016-11-06T18:53:56Z","title":"Parameterized counting of trees, forests and matroid bases"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01823","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e8daf72768b6b3667fec227203260cdf6f622d1ed8ffc3d8fbe0532d903392e6","target":"record","created_at":"2026-05-18T00:59:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"83a62d55958a342a05d303ce16639a019fc6c11109667e1ac21118233e22dfc2","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2016-11-06T18:53:56Z","title_canon_sha256":"d6ce5ca430c3a361df2bdf1facc815cf884771861c517e522da260190489b3ac"},"schema_version":"1.0","source":{"id":"1611.01823","kind":"arxiv","version":1}},"canonical_sha256":"9e191650639da6d5b6046edb6a9ad5c5ca71bd1785db868eb9400d1b23c2f507","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e191650639da6d5b6046edb6a9ad5c5ca71bd1785db868eb9400d1b23c2f507","first_computed_at":"2026-05-18T00:59:34.079919Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:34.079919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RX1EGYhZ9I1Mh/efk9fFQz921jqtIeJES55wC6t8rT7sf9hP1+mjVSsDOx4lvalyqCIWfZ4UgoETrHUrC8pDBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:34.080571Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.01823","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8daf72768b6b3667fec227203260cdf6f622d1ed8ffc3d8fbe0532d903392e6","sha256:d08d8422a0da2a24757fd71f058e0795302001cf8e0372171968387e905eb806"],"state_sha256":"92c14d7ba6ebce39001d2996f0c9391361190a1ade57098d3b7f49dfa6d7a1f4"}