{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IWNYZHSPEMMT4MWSA47OJ6WDLQ","short_pith_number":"pith:IWNYZHSP","canonical_record":{"source":{"id":"1707.00362","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-02T22:34:51Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"e90502c8f5466f36d3bf016cfbb701542324f4ae796cf06e1986af69db29f5cd","abstract_canon_sha256":"8f5ec83c4b80375547bd692e24cf598b1125ce28c70ef6c026a6ef3a8d4b8837"},"schema_version":"1.0"},"canonical_sha256":"459b8c9e4f23193e32d2073ee4fac35c1867552a8957dbf9118669f4fed693ea","source":{"kind":"arxiv","id":"1707.00362","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.00362","created_at":"2026-05-18T00:41:03Z"},{"alias_kind":"arxiv_version","alias_value":"1707.00362v1","created_at":"2026-05-18T00:41:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00362","created_at":"2026-05-18T00:41:03Z"},{"alias_kind":"pith_short_12","alias_value":"IWNYZHSPEMMT","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IWNYZHSPEMMT4MWS","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IWNYZHSP","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IWNYZHSPEMMT4MWSA47OJ6WDLQ","target":"record","payload":{"canonical_record":{"source":{"id":"1707.00362","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-02T22:34:51Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"e90502c8f5466f36d3bf016cfbb701542324f4ae796cf06e1986af69db29f5cd","abstract_canon_sha256":"8f5ec83c4b80375547bd692e24cf598b1125ce28c70ef6c026a6ef3a8d4b8837"},"schema_version":"1.0"},"canonical_sha256":"459b8c9e4f23193e32d2073ee4fac35c1867552a8957dbf9118669f4fed693ea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:03.637354Z","signature_b64":"tvuTTtW28wXrvyj1hSQGvJq8duUeyFXk9oqcZNifxLEZK+kr08UYBhM9wRW5wntUs3IWKsud+89yPs63iLUWDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"459b8c9e4f23193e32d2073ee4fac35c1867552a8957dbf9118669f4fed693ea","last_reissued_at":"2026-05-18T00:41:03.636749Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:03.636749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.00362","source_version":1,"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-05-18T00:41:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"THLzR2hU/tm9DC7CA90SLZV1tzwwl5Xaf8mCnr0bfZQ/7XF7l76lSdiBu9g352uMbSp7Bpvz48uNGVO0cCveCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:43:11.395024Z"},"content_sha256":"b17edb51b3f553f8b94f998aac2d4c9ea495552abc01e3d8007e0647dbdba711","schema_version":"1.0","event_id":"sha256:b17edb51b3f553f8b94f998aac2d4c9ea495552abc01e3d8007e0647dbdba711"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IWNYZHSPEMMT4MWSA47OJ6WDLQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Parameterized Problems and Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Josh Alman, Matthias Mnich, Virginia Vassilevska Williams","submitted_at":"2017-07-02T22:34:51Z","abstract_excerpt":"Fixed-parameter algorithms and kernelization are two powerful methods to solve $\\mathsf{NP}$-hard problems. Yet, so far those algorithms have been largely restricted to static inputs.\n  In this paper we provide fixed-parameter algorithms and kernelizations for fundamental $\\mathsf{NP}$-hard problems with dynamic inputs. We consider a variety of parameterized graph and hitting set problems which are known to have $f(k)n^{1+o(1)}$ time algorithms on inputs of size $n$, and we consider the question of whether there is a data structure that supports small updates (such as edge/vertex/set/element i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00362","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"},"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-05-18T00:41:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UhGqwUukSwrQV63lAE8Ha+AAEoN8H46rBYyqxx4zrBkb/zlz6H0wVjNzD4P4Q29T9mFccHw4qNOukWsmmqLgDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:43:11.395417Z"},"content_sha256":"d03a102ec13ad30246d54f9cf4814a12659fc908795e1c554c43bb497f642a81","schema_version":"1.0","event_id":"sha256:d03a102ec13ad30246d54f9cf4814a12659fc908795e1c554c43bb497f642a81"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IWNYZHSPEMMT4MWSA47OJ6WDLQ/bundle.json","state_url":"https://pith.science/pith/IWNYZHSPEMMT4MWSA47OJ6WDLQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IWNYZHSPEMMT4MWSA47OJ6WDLQ/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-05-30T16:43:11Z","links":{"resolver":"https://pith.science/pith/IWNYZHSPEMMT4MWSA47OJ6WDLQ","bundle":"https://pith.science/pith/IWNYZHSPEMMT4MWSA47OJ6WDLQ/bundle.json","state":"https://pith.science/pith/IWNYZHSPEMMT4MWSA47OJ6WDLQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IWNYZHSPEMMT4MWSA47OJ6WDLQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IWNYZHSPEMMT4MWSA47OJ6WDLQ","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":"8f5ec83c4b80375547bd692e24cf598b1125ce28c70ef6c026a6ef3a8d4b8837","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-02T22:34:51Z","title_canon_sha256":"e90502c8f5466f36d3bf016cfbb701542324f4ae796cf06e1986af69db29f5cd"},"schema_version":"1.0","source":{"id":"1707.00362","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.00362","created_at":"2026-05-18T00:41:03Z"},{"alias_kind":"arxiv_version","alias_value":"1707.00362v1","created_at":"2026-05-18T00:41:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00362","created_at":"2026-05-18T00:41:03Z"},{"alias_kind":"pith_short_12","alias_value":"IWNYZHSPEMMT","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IWNYZHSPEMMT4MWS","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IWNYZHSP","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:d03a102ec13ad30246d54f9cf4814a12659fc908795e1c554c43bb497f642a81","target":"graph","created_at":"2026-05-18T00:41:03Z","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":"Fixed-parameter algorithms and kernelization are two powerful methods to solve $\\mathsf{NP}$-hard problems. Yet, so far those algorithms have been largely restricted to static inputs.\n  In this paper we provide fixed-parameter algorithms and kernelizations for fundamental $\\mathsf{NP}$-hard problems with dynamic inputs. We consider a variety of parameterized graph and hitting set problems which are known to have $f(k)n^{1+o(1)}$ time algorithms on inputs of size $n$, and we consider the question of whether there is a data structure that supports small updates (such as edge/vertex/set/element i","authors_text":"Josh Alman, Matthias Mnich, Virginia Vassilevska Williams","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-02T22:34:51Z","title":"Dynamic Parameterized Problems and Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00362","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:b17edb51b3f553f8b94f998aac2d4c9ea495552abc01e3d8007e0647dbdba711","target":"record","created_at":"2026-05-18T00:41:03Z","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":"8f5ec83c4b80375547bd692e24cf598b1125ce28c70ef6c026a6ef3a8d4b8837","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-02T22:34:51Z","title_canon_sha256":"e90502c8f5466f36d3bf016cfbb701542324f4ae796cf06e1986af69db29f5cd"},"schema_version":"1.0","source":{"id":"1707.00362","kind":"arxiv","version":1}},"canonical_sha256":"459b8c9e4f23193e32d2073ee4fac35c1867552a8957dbf9118669f4fed693ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"459b8c9e4f23193e32d2073ee4fac35c1867552a8957dbf9118669f4fed693ea","first_computed_at":"2026-05-18T00:41:03.636749Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:03.636749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tvuTTtW28wXrvyj1hSQGvJq8duUeyFXk9oqcZNifxLEZK+kr08UYBhM9wRW5wntUs3IWKsud+89yPs63iLUWDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:03.637354Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.00362","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b17edb51b3f553f8b94f998aac2d4c9ea495552abc01e3d8007e0647dbdba711","sha256:d03a102ec13ad30246d54f9cf4814a12659fc908795e1c554c43bb497f642a81"],"state_sha256":"615a7caa230c0f6bf86bc28007f928eeb4341c2608e0fba4597de3508713a997"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2gFjyMHsKf/zrvLBXJQIhPuXtmZk4G7GTr7Qv5oKIBnQm5CakF5gJs+Bpzdfh5BSUBnzM1c82p0292TM7WWwAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T16:43:11.398660Z","bundle_sha256":"8145d4d95b5d34ba0a2d1f6c2ed90df297c68881cd782be9e587188c63700f61"}}