{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:GSU4XTT3D6XFXIYCR3XPFHKYCX","short_pith_number":"pith:GSU4XTT3","canonical_record":{"source":{"id":"1407.2033","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-08T11:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"f9efcf1d1bf6bc3e6765982696d8d5d20b50f98f8e663c62a5e2ad0993f818b6","abstract_canon_sha256":"e1fc08a120f7bec2943d3845a5c01fe66708222d868115df721b828a82e47d54"},"schema_version":"1.0"},"canonical_sha256":"34a9cbce7b1fae5ba3028eeef29d5815f7ceb337093e6eac9b08b57b79af9fb7","source":{"kind":"arxiv","id":"1407.2033","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.2033","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"arxiv_version","alias_value":"1407.2033v2","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2033","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"pith_short_12","alias_value":"GSU4XTT3D6XF","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GSU4XTT3D6XFXIYC","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GSU4XTT3","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:GSU4XTT3D6XFXIYCR3XPFHKYCX","target":"record","payload":{"canonical_record":{"source":{"id":"1407.2033","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-08T11:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"f9efcf1d1bf6bc3e6765982696d8d5d20b50f98f8e663c62a5e2ad0993f818b6","abstract_canon_sha256":"e1fc08a120f7bec2943d3845a5c01fe66708222d868115df721b828a82e47d54"},"schema_version":"1.0"},"canonical_sha256":"34a9cbce7b1fae5ba3028eeef29d5815f7ceb337093e6eac9b08b57b79af9fb7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:38.988833Z","signature_b64":"c3heMMcYqAxoMcAsEqcjbi89OTKRIQe2b4ZXIjwlJqyDt3qPyE5Vce2WjYIID5EJHkh+grh0CilnTyAhIPjkAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34a9cbce7b1fae5ba3028eeef29d5815f7ceb337093e6eac9b08b57b79af9fb7","last_reissued_at":"2026-05-18T02:26:38.988252Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:38.988252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.2033","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-05-18T02:26:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZBZpWPnqbT8ExdTfLP4H+yBkR869icyaTuX0bw7xE+00V03yXbY8Ixc9e1OWdqIpzVnsHyJA+Od2Tt4HEDj5BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T03:00:53.886894Z"},"content_sha256":"9bd9724d9e94da1f9953ad4325e856a3fb71f0517e918e9690688fcd67b0a0fd","schema_version":"1.0","event_id":"sha256:9bd9724d9e94da1f9953ad4325e856a3fb71f0517e918e9690688fcd67b0a0fd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:GSU4XTT3D6XFXIYCR3XPFHKYCX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Multivariate Framework for Weighted FPT Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hadas Shachnai, Meirav Zehavi","submitted_at":"2014-07-08T11:00:00Z","abstract_excerpt":"We introduce a novel multivariate approach for solving weighted parameterized problems. In our model, given an instance of size $n$ of a minimization (maximization) problem, and a parameter $W \\geq 1$, we seek a solution of weight at most (or at least) $W$. We use our general framework to obtain efficient algorithms for such fundamental graph problems as Vertex Cover, 3-Hitting Set, Edge Dominating Set and Max Internal Out-Branching. The best known algorithms for these problems admit running times of the form $c^W n^{O(1)}$, for some constant $c>1$. We improve these running times to $c^s n^{O("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.2033","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":""},"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-18T02:26:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UlVg5YikAjOfdy9nVgiEbDuPszyIiZX/jn/vz5lewuHbqdTWa5DdjVRgzeSUxp9QQx4MtcROAQ6nXo3wPOXOBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T03:00:53.887597Z"},"content_sha256":"248c84f204b2c7802ed8f5ec6c8c03086f1345469e92177b840b7090a90eba7f","schema_version":"1.0","event_id":"sha256:248c84f204b2c7802ed8f5ec6c8c03086f1345469e92177b840b7090a90eba7f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GSU4XTT3D6XFXIYCR3XPFHKYCX/bundle.json","state_url":"https://pith.science/pith/GSU4XTT3D6XFXIYCR3XPFHKYCX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GSU4XTT3D6XFXIYCR3XPFHKYCX/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-06-08T03:00:53Z","links":{"resolver":"https://pith.science/pith/GSU4XTT3D6XFXIYCR3XPFHKYCX","bundle":"https://pith.science/pith/GSU4XTT3D6XFXIYCR3XPFHKYCX/bundle.json","state":"https://pith.science/pith/GSU4XTT3D6XFXIYCR3XPFHKYCX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GSU4XTT3D6XFXIYCR3XPFHKYCX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:GSU4XTT3D6XFXIYCR3XPFHKYCX","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":"e1fc08a120f7bec2943d3845a5c01fe66708222d868115df721b828a82e47d54","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-08T11:00:00Z","title_canon_sha256":"f9efcf1d1bf6bc3e6765982696d8d5d20b50f98f8e663c62a5e2ad0993f818b6"},"schema_version":"1.0","source":{"id":"1407.2033","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.2033","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"arxiv_version","alias_value":"1407.2033v2","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2033","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"pith_short_12","alias_value":"GSU4XTT3D6XF","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GSU4XTT3D6XFXIYC","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GSU4XTT3","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:248c84f204b2c7802ed8f5ec6c8c03086f1345469e92177b840b7090a90eba7f","target":"graph","created_at":"2026-05-18T02:26:38Z","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 introduce a novel multivariate approach for solving weighted parameterized problems. In our model, given an instance of size $n$ of a minimization (maximization) problem, and a parameter $W \\geq 1$, we seek a solution of weight at most (or at least) $W$. We use our general framework to obtain efficient algorithms for such fundamental graph problems as Vertex Cover, 3-Hitting Set, Edge Dominating Set and Max Internal Out-Branching. The best known algorithms for these problems admit running times of the form $c^W n^{O(1)}$, for some constant $c>1$. We improve these running times to $c^s n^{O(","authors_text":"Hadas Shachnai, Meirav Zehavi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-08T11:00:00Z","title":"A Multivariate Framework for Weighted FPT Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.2033","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:9bd9724d9e94da1f9953ad4325e856a3fb71f0517e918e9690688fcd67b0a0fd","target":"record","created_at":"2026-05-18T02:26:38Z","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":"e1fc08a120f7bec2943d3845a5c01fe66708222d868115df721b828a82e47d54","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-08T11:00:00Z","title_canon_sha256":"f9efcf1d1bf6bc3e6765982696d8d5d20b50f98f8e663c62a5e2ad0993f818b6"},"schema_version":"1.0","source":{"id":"1407.2033","kind":"arxiv","version":2}},"canonical_sha256":"34a9cbce7b1fae5ba3028eeef29d5815f7ceb337093e6eac9b08b57b79af9fb7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34a9cbce7b1fae5ba3028eeef29d5815f7ceb337093e6eac9b08b57b79af9fb7","first_computed_at":"2026-05-18T02:26:38.988252Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:38.988252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c3heMMcYqAxoMcAsEqcjbi89OTKRIQe2b4ZXIjwlJqyDt3qPyE5Vce2WjYIID5EJHkh+grh0CilnTyAhIPjkAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:38.988833Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.2033","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9bd9724d9e94da1f9953ad4325e856a3fb71f0517e918e9690688fcd67b0a0fd","sha256:248c84f204b2c7802ed8f5ec6c8c03086f1345469e92177b840b7090a90eba7f"],"state_sha256":"beb07dfe87dd3d77cf26d2a35edf3edca033319f571bf79ce7bf5981b2ddfa50"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GEptXXGth+bvUQkUpUbHDkjWFhpLnNNWoqXpcvuUbZr9xqUQxGwb5N9S/bGLF9hL9oQMuv4223egij2OfJJmDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T03:00:53.891440Z","bundle_sha256":"688afbac00f9de08783972192fb6265c539942a3286c04284f992e4b90d63786"}}