{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SFJ3EGXFK4SPUIXMNYZZ4V2ALF","short_pith_number":"pith:SFJ3EGXF","schema_version":"1.0","canonical_sha256":"9153b21ae55724fa22ec6e339e5740594a28e85c4f7485d4664fa4d20f7147ab","source":{"kind":"arxiv","id":"1907.12287","version":2},"attestation_state":"computed","paper":{"title":"Parameterized Valiant's Classes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Christian Engels, Markus Blaeser","submitted_at":"2019-07-29T09:03:31Z","abstract_excerpt":"We define a theory of parameterized algebraic complexity classes in analogy to parameterized Boolean counting classes. We define the classes VFPT and VW[t], which mirror the Boolean counting classes #FPT and #W[t], and define appropriate reductions and completeness notions. Our main contribution is the VW[1]-completeness proof of the parameterized clique family. This proof is far more complicated than in the Boolean world. It requires some new concepts like composition theorems for bounded exponential sums and Boolean-arithmetic formulas. In addition, we also look at two polynomials linked to "},"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":"1907.12287","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2019-07-29T09:03:31Z","cross_cats_sorted":[],"title_canon_sha256":"2a218f8b1431ad6e7a4c754128bdbe3f7050bbadb6dfa1773419daddc02bdba5","abstract_canon_sha256":"a2160760aeeb86d1e92ef00af228ae85fb6722ea72b324ddcc4f29bbc8ffc7b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:21:14.382609Z","signature_b64":"YW1wIykr0y52dtWsw+cRQYsG8daC01AMvlA3aWdP5yeKkNOPaq4AhTKzt3zM1sjjU5MookSUsr96AeQjdKuqAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9153b21ae55724fa22ec6e339e5740594a28e85c4f7485d4664fa4d20f7147ab","last_reissued_at":"2026-07-05T00:21:14.382121Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:21:14.382121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized Valiant's Classes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Christian Engels, Markus Blaeser","submitted_at":"2019-07-29T09:03:31Z","abstract_excerpt":"We define a theory of parameterized algebraic complexity classes in analogy to parameterized Boolean counting classes. We define the classes VFPT and VW[t], which mirror the Boolean counting classes #FPT and #W[t], and define appropriate reductions and completeness notions. Our main contribution is the VW[1]-completeness proof of the parameterized clique family. This proof is far more complicated than in the Boolean world. It requires some new concepts like composition theorems for bounded exponential sums and Boolean-arithmetic formulas. In addition, we also look at two polynomials linked to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.12287","kind":"arxiv","version":2},"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/1907.12287/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":"1907.12287","created_at":"2026-07-05T00:21:14.382178+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.12287v2","created_at":"2026-07-05T00:21:14.382178+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.12287","created_at":"2026-07-05T00:21:14.382178+00:00"},{"alias_kind":"pith_short_12","alias_value":"SFJ3EGXFK4SP","created_at":"2026-07-05T00:21:14.382178+00:00"},{"alias_kind":"pith_short_16","alias_value":"SFJ3EGXFK4SPUIXM","created_at":"2026-07-05T00:21:14.382178+00:00"},{"alias_kind":"pith_short_8","alias_value":"SFJ3EGXF","created_at":"2026-07-05T00:21:14.382178+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.08363","citing_title":"Kronecker products and iterated matrix multiplication","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SFJ3EGXFK4SPUIXMNYZZ4V2ALF","json":"https://pith.science/pith/SFJ3EGXFK4SPUIXMNYZZ4V2ALF.json","graph_json":"https://pith.science/api/pith-number/SFJ3EGXFK4SPUIXMNYZZ4V2ALF/graph.json","events_json":"https://pith.science/api/pith-number/SFJ3EGXFK4SPUIXMNYZZ4V2ALF/events.json","paper":"https://pith.science/paper/SFJ3EGXF"},"agent_actions":{"view_html":"https://pith.science/pith/SFJ3EGXFK4SPUIXMNYZZ4V2ALF","download_json":"https://pith.science/pith/SFJ3EGXFK4SPUIXMNYZZ4V2ALF.json","view_paper":"https://pith.science/paper/SFJ3EGXF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.12287&json=true","fetch_graph":"https://pith.science/api/pith-number/SFJ3EGXFK4SPUIXMNYZZ4V2ALF/graph.json","fetch_events":"https://pith.science/api/pith-number/SFJ3EGXFK4SPUIXMNYZZ4V2ALF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SFJ3EGXFK4SPUIXMNYZZ4V2ALF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SFJ3EGXFK4SPUIXMNYZZ4V2ALF/action/storage_attestation","attest_author":"https://pith.science/pith/SFJ3EGXFK4SPUIXMNYZZ4V2ALF/action/author_attestation","sign_citation":"https://pith.science/pith/SFJ3EGXFK4SPUIXMNYZZ4V2ALF/action/citation_signature","submit_replication":"https://pith.science/pith/SFJ3EGXFK4SPUIXMNYZZ4V2ALF/action/replication_record"}},"created_at":"2026-07-05T00:21:14.382178+00:00","updated_at":"2026-07-05T00:21:14.382178+00:00"}