{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SDYU2DE32VUQDK6CWENYHEZSLL","short_pith_number":"pith:SDYU2DE3","canonical_record":{"source":{"id":"1802.06026","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-02-16T16:53:44Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d9bd41196cff49f57908e2f3931e09142e78081a585dba56c1870aea0d0e0489","abstract_canon_sha256":"e524fbad1cffa92e883b6821b3159c3a837ab20238daa6c6fc3d51c7a4207155"},"schema_version":"1.0"},"canonical_sha256":"90f14d0c9bd56901abc2b11b8393325ad5c0176239ce50fc3cfe3d706d12e141","source":{"kind":"arxiv","id":"1802.06026","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06026","created_at":"2026-05-18T00:23:10Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06026v1","created_at":"2026-05-18T00:23:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06026","created_at":"2026-05-18T00:23:10Z"},{"alias_kind":"pith_short_12","alias_value":"SDYU2DE32VUQ","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SDYU2DE32VUQDK6C","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SDYU2DE3","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SDYU2DE32VUQDK6CWENYHEZSLL","target":"record","payload":{"canonical_record":{"source":{"id":"1802.06026","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-02-16T16:53:44Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d9bd41196cff49f57908e2f3931e09142e78081a585dba56c1870aea0d0e0489","abstract_canon_sha256":"e524fbad1cffa92e883b6821b3159c3a837ab20238daa6c6fc3d51c7a4207155"},"schema_version":"1.0"},"canonical_sha256":"90f14d0c9bd56901abc2b11b8393325ad5c0176239ce50fc3cfe3d706d12e141","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:10.114159Z","signature_b64":"vnVVKrqylOhRa7qA4h70B2T0z5uvvxXLYt2w/fWs5+FKs1JQJEaiYgghXmVnTEiEi9yBLhqKVZknTO8wkFDDAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90f14d0c9bd56901abc2b11b8393325ad5c0176239ce50fc3cfe3d706d12e141","last_reissued_at":"2026-05-18T00:23:10.113485Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:10.113485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.06026","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:23:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mNkAXCLrrGRRHrVMpu0dvsHshfKIJzzBFj/K+EZ5y/ZNiWYWDwfQOn5SVkG1YgczBpwMVOu4+0CB6/Qmn5yHCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:45:09.703470Z"},"content_sha256":"0da72a409332a795552a5c9535f3da74b91cff0791925fba73daf3991bf64196","schema_version":"1.0","event_id":"sha256:0da72a409332a795552a5c9535f3da74b91cff0791925fba73daf3991bf64196"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SDYU2DE32VUQDK6CWENYHEZSLL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized Algorithms for Zero Extension and Metric Labelling Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Felix Reidl, Magnus Wahlstr\\\"om","submitted_at":"2018-02-16T16:53:44Z","abstract_excerpt":"We consider the problems ZERO EXTENSION and METRIC LABELLING under the paradigm of parameterized complexity. These are natural, well-studied problems with important applications, but have previously not received much attention from parameterized complexity.\n  Depending on the chosen cost function $\\mu$, we find that different algorithmic approaches can be applied to design FPT-algorithms: for arbitrary $\\mu$ we parameterized by the number of edges that cross the cut (not the cost) and show how to solve ZERO EXTENSION in time $O(|D|^{O(k^2)} n^4 \\log n)$ using randomized contractions. We improv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06026","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:23:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RKKa/FzGETzYK2kfIYdcI1A68YULAzd4Yb8cAw0heukeC7v4B++x8yEoQOKLHs6NiKpiWFSIvWWxAxEcbq3AAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:45:09.703995Z"},"content_sha256":"86f31c8566368a3814e0a749fa399417d8deb02045ccac778526473d2bc83886","schema_version":"1.0","event_id":"sha256:86f31c8566368a3814e0a749fa399417d8deb02045ccac778526473d2bc83886"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SDYU2DE32VUQDK6CWENYHEZSLL/bundle.json","state_url":"https://pith.science/pith/SDYU2DE32VUQDK6CWENYHEZSLL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SDYU2DE32VUQDK6CWENYHEZSLL/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-31T04:45:09Z","links":{"resolver":"https://pith.science/pith/SDYU2DE32VUQDK6CWENYHEZSLL","bundle":"https://pith.science/pith/SDYU2DE32VUQDK6CWENYHEZSLL/bundle.json","state":"https://pith.science/pith/SDYU2DE32VUQDK6CWENYHEZSLL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SDYU2DE32VUQDK6CWENYHEZSLL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SDYU2DE32VUQDK6CWENYHEZSLL","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":"e524fbad1cffa92e883b6821b3159c3a837ab20238daa6c6fc3d51c7a4207155","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-02-16T16:53:44Z","title_canon_sha256":"d9bd41196cff49f57908e2f3931e09142e78081a585dba56c1870aea0d0e0489"},"schema_version":"1.0","source":{"id":"1802.06026","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06026","created_at":"2026-05-18T00:23:10Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06026v1","created_at":"2026-05-18T00:23:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06026","created_at":"2026-05-18T00:23:10Z"},{"alias_kind":"pith_short_12","alias_value":"SDYU2DE32VUQ","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SDYU2DE32VUQDK6C","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SDYU2DE3","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:86f31c8566368a3814e0a749fa399417d8deb02045ccac778526473d2bc83886","target":"graph","created_at":"2026-05-18T00:23:10Z","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 consider the problems ZERO EXTENSION and METRIC LABELLING under the paradigm of parameterized complexity. These are natural, well-studied problems with important applications, but have previously not received much attention from parameterized complexity.\n  Depending on the chosen cost function $\\mu$, we find that different algorithmic approaches can be applied to design FPT-algorithms: for arbitrary $\\mu$ we parameterized by the number of edges that cross the cut (not the cost) and show how to solve ZERO EXTENSION in time $O(|D|^{O(k^2)} n^4 \\log n)$ using randomized contractions. We improv","authors_text":"Felix Reidl, Magnus Wahlstr\\\"om","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-02-16T16:53:44Z","title":"Parameterized Algorithms for Zero Extension and Metric Labelling Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06026","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:0da72a409332a795552a5c9535f3da74b91cff0791925fba73daf3991bf64196","target":"record","created_at":"2026-05-18T00:23:10Z","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":"e524fbad1cffa92e883b6821b3159c3a837ab20238daa6c6fc3d51c7a4207155","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-02-16T16:53:44Z","title_canon_sha256":"d9bd41196cff49f57908e2f3931e09142e78081a585dba56c1870aea0d0e0489"},"schema_version":"1.0","source":{"id":"1802.06026","kind":"arxiv","version":1}},"canonical_sha256":"90f14d0c9bd56901abc2b11b8393325ad5c0176239ce50fc3cfe3d706d12e141","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90f14d0c9bd56901abc2b11b8393325ad5c0176239ce50fc3cfe3d706d12e141","first_computed_at":"2026-05-18T00:23:10.113485Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:10.113485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vnVVKrqylOhRa7qA4h70B2T0z5uvvxXLYt2w/fWs5+FKs1JQJEaiYgghXmVnTEiEi9yBLhqKVZknTO8wkFDDAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:10.114159Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.06026","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0da72a409332a795552a5c9535f3da74b91cff0791925fba73daf3991bf64196","sha256:86f31c8566368a3814e0a749fa399417d8deb02045ccac778526473d2bc83886"],"state_sha256":"e99a1d9fcb958f79fa48d5a0204ef8d989d00e5b94f01a00486bd77ed4c94d0e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lx0ehXBeAucoPDX2cnoOMAYF6ug3wt4X95eVgGfpsN7WfxHo5u+9e5poN1Brc2ilvYaM+qmF4QSsvAecu6meDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T04:45:09.707581Z","bundle_sha256":"d3501ef61f7f5e998dd2fd96f17a310888705dbd117db37cbedbaa5ca2ae516d"}}