{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:2TKQJVTD2Z6U33YQPIFD3YDOQN","short_pith_number":"pith:2TKQJVTD","schema_version":"1.0","canonical_sha256":"d4d504d663d67d4def107a0a3de06e834fda357ac909cfb57ced20a4c3a98f9b","source":{"kind":"arxiv","id":"2606.02492","version":1},"attestation_state":"computed","paper":{"title":"$O(n +f(k))$: Truly Linear FPT","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.CC","authors_text":"Barnaby Martin, Benjamin Merlin Bumpus, David C. Kutner, Ella Yates, Frances Rosamond, Jessica Enright, Laura Larios-Jones, Michael R. Fellows, Rod Downey, Tala Eagling-Vose","submitted_at":"2026-06-01T17:01:31Z","abstract_excerpt":"Parameterized complexity has always been concerned with practical computing: by confining combinatorial explosion to a secondary parameter $k$, one can uncover why and how many NP-hard problems are effectively tackled in practice. Today, however, the scale of data has changed: scientists study Big Data, which is so large that even quadratic dependence in the total input size $n$ is unaffordable. Therefore, what constitutes a practical algorithm has also changed. Classically, parameterized complexity is blind to the difference between defining fixed parameter tractability multiplicatively (i.e."},"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":"2606.02492","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-06-01T17:01:31Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"005c3100245f51682d51b11730608abf523ae3d6a47e128458d5953ec5e92c48","abstract_canon_sha256":"9531af286a70323324adfe86bbc5f5f2959c6e4e1698b66cbd5fced09fe7bd3f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T03:05:07.736499Z","signature_b64":"6M43BckwqYOpL3D+qp/uC841/S0706rrsm/POtSTKFuvEdYh3wIJPptJXzNfFaS7yzdpFbqy3ce8gq699eTzCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4d504d663d67d4def107a0a3de06e834fda357ac909cfb57ced20a4c3a98f9b","last_reissued_at":"2026-06-02T03:05:07.736089Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T03:05:07.736089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$O(n +f(k))$: Truly Linear FPT","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.CC","authors_text":"Barnaby Martin, Benjamin Merlin Bumpus, David C. Kutner, Ella Yates, Frances Rosamond, Jessica Enright, Laura Larios-Jones, Michael R. Fellows, Rod Downey, Tala Eagling-Vose","submitted_at":"2026-06-01T17:01:31Z","abstract_excerpt":"Parameterized complexity has always been concerned with practical computing: by confining combinatorial explosion to a secondary parameter $k$, one can uncover why and how many NP-hard problems are effectively tackled in practice. Today, however, the scale of data has changed: scientists study Big Data, which is so large that even quadratic dependence in the total input size $n$ is unaffordable. Therefore, what constitutes a practical algorithm has also changed. Classically, parameterized complexity is blind to the difference between defining fixed parameter tractability multiplicatively (i.e."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.02492","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/2606.02492/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":"2606.02492","created_at":"2026-06-02T03:05:07.736146+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.02492v1","created_at":"2026-06-02T03:05:07.736146+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02492","created_at":"2026-06-02T03:05:07.736146+00:00"},{"alias_kind":"pith_short_12","alias_value":"2TKQJVTD2Z6U","created_at":"2026-06-02T03:05:07.736146+00:00"},{"alias_kind":"pith_short_16","alias_value":"2TKQJVTD2Z6U33YQ","created_at":"2026-06-02T03:05:07.736146+00:00"},{"alias_kind":"pith_short_8","alias_value":"2TKQJVTD","created_at":"2026-06-02T03:05:07.736146+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/2TKQJVTD2Z6U33YQPIFD3YDOQN","json":"https://pith.science/pith/2TKQJVTD2Z6U33YQPIFD3YDOQN.json","graph_json":"https://pith.science/api/pith-number/2TKQJVTD2Z6U33YQPIFD3YDOQN/graph.json","events_json":"https://pith.science/api/pith-number/2TKQJVTD2Z6U33YQPIFD3YDOQN/events.json","paper":"https://pith.science/paper/2TKQJVTD"},"agent_actions":{"view_html":"https://pith.science/pith/2TKQJVTD2Z6U33YQPIFD3YDOQN","download_json":"https://pith.science/pith/2TKQJVTD2Z6U33YQPIFD3YDOQN.json","view_paper":"https://pith.science/paper/2TKQJVTD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.02492&json=true","fetch_graph":"https://pith.science/api/pith-number/2TKQJVTD2Z6U33YQPIFD3YDOQN/graph.json","fetch_events":"https://pith.science/api/pith-number/2TKQJVTD2Z6U33YQPIFD3YDOQN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2TKQJVTD2Z6U33YQPIFD3YDOQN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2TKQJVTD2Z6U33YQPIFD3YDOQN/action/storage_attestation","attest_author":"https://pith.science/pith/2TKQJVTD2Z6U33YQPIFD3YDOQN/action/author_attestation","sign_citation":"https://pith.science/pith/2TKQJVTD2Z6U33YQPIFD3YDOQN/action/citation_signature","submit_replication":"https://pith.science/pith/2TKQJVTD2Z6U33YQPIFD3YDOQN/action/replication_record"}},"created_at":"2026-06-02T03:05:07.736146+00:00","updated_at":"2026-06-02T03:05:07.736146+00:00"}