{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SFJ3EGXFK4SPUIXMNYZZ4V2ALF","short_pith_number":"pith:SFJ3EGXF","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"},"canonical_sha256":"9153b21ae55724fa22ec6e339e5740594a28e85c4f7485d4664fa4d20f7147ab","source":{"kind":"arxiv","id":"1907.12287","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.12287","created_at":"2026-07-05T00:21:14Z"},{"alias_kind":"arxiv_version","alias_value":"1907.12287v2","created_at":"2026-07-05T00:21:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.12287","created_at":"2026-07-05T00:21:14Z"},{"alias_kind":"pith_short_12","alias_value":"SFJ3EGXFK4SP","created_at":"2026-07-05T00:21:14Z"},{"alias_kind":"pith_short_16","alias_value":"SFJ3EGXFK4SPUIXM","created_at":"2026-07-05T00:21:14Z"},{"alias_kind":"pith_short_8","alias_value":"SFJ3EGXF","created_at":"2026-07-05T00:21:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SFJ3EGXFK4SPUIXMNYZZ4V2ALF","target":"record","payload":{"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"},"canonical_sha256":"9153b21ae55724fa22ec6e339e5740594a28e85c4f7485d4664fa4d20f7147ab","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"},"source_kind":"arxiv","source_id":"1907.12287","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:21:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G46BJtPFAWcOmEopOhzdCNY+MK7zf0jN3AKniBd2sLToOmWMQW0tz8sir6MvT3bOY8UhaFdwUxRXZjk8a1MfDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-02T23:02:11.690594Z"},"content_sha256":"22197d9c969b6d16aa283636607f55082b8526775bf7fac47653fdc80ca3be99","schema_version":"1.0","event_id":"sha256:22197d9c969b6d16aa283636607f55082b8526775bf7fac47653fdc80ca3be99"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SFJ3EGXFK4SPUIXMNYZZ4V2ALF","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:21:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"93RDEIRn7dh4YfEQBfSitvy7kjzDbgJMAfuMvwc3ZIZdAuazm31Dye9yMcy0hRTcg/hCJWYEXxiGxBqfs6spBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-02T23:02:11.691705Z"},"content_sha256":"55f28c66f9afdbe5ccc2a7c2d3bb106a0bb9a2ac4fa76a789423e4d2bb00f189","schema_version":"1.0","event_id":"sha256:55f28c66f9afdbe5ccc2a7c2d3bb106a0bb9a2ac4fa76a789423e4d2bb00f189"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SFJ3EGXFK4SPUIXMNYZZ4V2ALF/bundle.json","state_url":"https://pith.science/pith/SFJ3EGXFK4SPUIXMNYZZ4V2ALF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SFJ3EGXFK4SPUIXMNYZZ4V2ALF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-02T23:02:11Z","links":{"resolver":"https://pith.science/pith/SFJ3EGXFK4SPUIXMNYZZ4V2ALF","bundle":"https://pith.science/pith/SFJ3EGXFK4SPUIXMNYZZ4V2ALF/bundle.json","state":"https://pith.science/pith/SFJ3EGXFK4SPUIXMNYZZ4V2ALF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SFJ3EGXFK4SPUIXMNYZZ4V2ALF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SFJ3EGXFK4SPUIXMNYZZ4V2ALF","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":"a2160760aeeb86d1e92ef00af228ae85fb6722ea72b324ddcc4f29bbc8ffc7b7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2019-07-29T09:03:31Z","title_canon_sha256":"2a218f8b1431ad6e7a4c754128bdbe3f7050bbadb6dfa1773419daddc02bdba5"},"schema_version":"1.0","source":{"id":"1907.12287","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.12287","created_at":"2026-07-05T00:21:14Z"},{"alias_kind":"arxiv_version","alias_value":"1907.12287v2","created_at":"2026-07-05T00:21:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.12287","created_at":"2026-07-05T00:21:14Z"},{"alias_kind":"pith_short_12","alias_value":"SFJ3EGXFK4SP","created_at":"2026-07-05T00:21:14Z"},{"alias_kind":"pith_short_16","alias_value":"SFJ3EGXFK4SPUIXM","created_at":"2026-07-05T00:21:14Z"},{"alias_kind":"pith_short_8","alias_value":"SFJ3EGXF","created_at":"2026-07-05T00:21:14Z"}],"graph_snapshots":[{"event_id":"sha256:55f28c66f9afdbe5ccc2a7c2d3bb106a0bb9a2ac4fa76a789423e4d2bb00f189","target":"graph","created_at":"2026-07-05T00:21:14Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1907.12287/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Christian Engels, Markus Blaeser","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2019-07-29T09:03:31Z","title":"Parameterized Valiant's Classes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.12287","kind":"arxiv","version":2},"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:22197d9c969b6d16aa283636607f55082b8526775bf7fac47653fdc80ca3be99","target":"record","created_at":"2026-07-05T00:21:14Z","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":"a2160760aeeb86d1e92ef00af228ae85fb6722ea72b324ddcc4f29bbc8ffc7b7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2019-07-29T09:03:31Z","title_canon_sha256":"2a218f8b1431ad6e7a4c754128bdbe3f7050bbadb6dfa1773419daddc02bdba5"},"schema_version":"1.0","source":{"id":"1907.12287","kind":"arxiv","version":2}},"canonical_sha256":"9153b21ae55724fa22ec6e339e5740594a28e85c4f7485d4664fa4d20f7147ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9153b21ae55724fa22ec6e339e5740594a28e85c4f7485d4664fa4d20f7147ab","first_computed_at":"2026-07-05T00:21:14.382121Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:21:14.382121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YW1wIykr0y52dtWsw+cRQYsG8daC01AMvlA3aWdP5yeKkNOPaq4AhTKzt3zM1sjjU5MookSUsr96AeQjdKuqAw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:21:14.382609Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.12287","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:22197d9c969b6d16aa283636607f55082b8526775bf7fac47653fdc80ca3be99","sha256:55f28c66f9afdbe5ccc2a7c2d3bb106a0bb9a2ac4fa76a789423e4d2bb00f189"],"state_sha256":"e2b39646e40cbdb2852f824719cafc7d3032bd1a3d9170078305e918f00b10e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k5zhPJP1iha2f+oryZi3D6Idjh4cYMUX6uAS+F5MZAq1p6Dli4vePoaMazm4uFMOPLGwW7T6BaV3oiEQfRfMCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-02T23:02:11.700802Z","bundle_sha256":"1626d6d7ef2266e6f50cc8a613757d74dc3523737a4bdd00e9c0135bf10eaee8"}}