{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:JI6HGGGMOHZ2V6R7POFF7TO2FQ","short_pith_number":"pith:JI6HGGGM","canonical_record":{"source":{"id":"2207.07449","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-07-15T12:52:13Z","cross_cats_sorted":[],"title_canon_sha256":"b1975d3a3d52ff67fc9b494d6beed61fb17963d9f446a0333af2f1119893ffbe","abstract_canon_sha256":"0175b40d7b7279ea1bc41c491cfb9d7120005c1353b5ccfd175eb3c48aec2727"},"schema_version":"1.0"},"canonical_sha256":"4a3c7318cc71f3aafa3f7b8a5fcdda2c358e29b14c1711c755da93cbacdec874","source":{"kind":"arxiv","id":"2207.07449","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.07449","created_at":"2026-07-05T04:40:32Z"},{"alias_kind":"arxiv_version","alias_value":"2207.07449v1","created_at":"2026-07-05T04:40:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.07449","created_at":"2026-07-05T04:40:32Z"},{"alias_kind":"pith_short_12","alias_value":"JI6HGGGMOHZ2","created_at":"2026-07-05T04:40:32Z"},{"alias_kind":"pith_short_16","alias_value":"JI6HGGGMOHZ2V6R7","created_at":"2026-07-05T04:40:32Z"},{"alias_kind":"pith_short_8","alias_value":"JI6HGGGM","created_at":"2026-07-05T04:40:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:JI6HGGGMOHZ2V6R7POFF7TO2FQ","target":"record","payload":{"canonical_record":{"source":{"id":"2207.07449","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-07-15T12:52:13Z","cross_cats_sorted":[],"title_canon_sha256":"b1975d3a3d52ff67fc9b494d6beed61fb17963d9f446a0333af2f1119893ffbe","abstract_canon_sha256":"0175b40d7b7279ea1bc41c491cfb9d7120005c1353b5ccfd175eb3c48aec2727"},"schema_version":"1.0"},"canonical_sha256":"4a3c7318cc71f3aafa3f7b8a5fcdda2c358e29b14c1711c755da93cbacdec874","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:40:32.530977Z","signature_b64":"1jEeZQKEeZWPF88JBqqcjqNqGLDKMKax7F2OgcdJdizJeFh397qUatJVyx+oGqx08mYBOaIA39qph3lX210UCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a3c7318cc71f3aafa3f7b8a5fcdda2c358e29b14c1711c755da93cbacdec874","last_reissued_at":"2026-07-05T04:40:32.530618Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:40:32.530618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2207.07449","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-07-05T04:40:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"om9k/JiJuhuQf47WK4zBPcWXit48JCOd3FOAkVziCXkcMLP2UTVD5dnozkqwO/5tiBHKp1IhcNFzAErsNYlUBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T09:04:03.901117Z"},"content_sha256":"8348681b39f04715cef40b8cdbdd65d9f2204663ac32839f5ccef53d75d4f35c","schema_version":"1.0","event_id":"sha256:8348681b39f04715cef40b8cdbdd65d9f2204663ac32839f5ccef53d75d4f35c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:JI6HGGGMOHZ2V6R7POFF7TO2FQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fixed-Parameter Tractability of Maximum Colored Path and Beyond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fedor V. Fomin, Giannos Stamoulis, Kirill Simonov, Petr A. Golovach, Tuukka Korhonen","submitted_at":"2022-07-15T12:52:13Z","abstract_excerpt":"We introduce a general method for obtaining fixed-parameter algorithms for problems about finding paths in undirected graphs, where the length of the path could be unbounded in the parameter. The first application of our method is as follows.\n  We give a randomized algorithm, that given a colored $n$-vertex undirected graph, vertices $s$ and $t$, and an integer $k$, finds an $(s,t)$-path containing at least $k$ different colors in time $2^k n^{O(1)}$. This is the first FPT algorithm for this problem, and it generalizes the algorithm of Bj\\\"orklund, Husfeldt, and Taslaman [SODA 2012] on finding"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.07449","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2207.07449/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-05T04:40:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"juKVczevcblEz1Ry2VnkfcE8Z9mrf9pXuhhTYGGMmHsuyxnLKWlMAuCiFz395OBud0KwhBcfaB0QfRoRzzKaCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T09:04:03.901621Z"},"content_sha256":"46d8e25214d18e6b864cb330fcf9395428310407e6c9a06cc26c7e78dd9907bf","schema_version":"1.0","event_id":"sha256:46d8e25214d18e6b864cb330fcf9395428310407e6c9a06cc26c7e78dd9907bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JI6HGGGMOHZ2V6R7POFF7TO2FQ/bundle.json","state_url":"https://pith.science/pith/JI6HGGGMOHZ2V6R7POFF7TO2FQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JI6HGGGMOHZ2V6R7POFF7TO2FQ/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-14T09:04:03Z","links":{"resolver":"https://pith.science/pith/JI6HGGGMOHZ2V6R7POFF7TO2FQ","bundle":"https://pith.science/pith/JI6HGGGMOHZ2V6R7POFF7TO2FQ/bundle.json","state":"https://pith.science/pith/JI6HGGGMOHZ2V6R7POFF7TO2FQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JI6HGGGMOHZ2V6R7POFF7TO2FQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:JI6HGGGMOHZ2V6R7POFF7TO2FQ","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":"0175b40d7b7279ea1bc41c491cfb9d7120005c1353b5ccfd175eb3c48aec2727","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-07-15T12:52:13Z","title_canon_sha256":"b1975d3a3d52ff67fc9b494d6beed61fb17963d9f446a0333af2f1119893ffbe"},"schema_version":"1.0","source":{"id":"2207.07449","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.07449","created_at":"2026-07-05T04:40:32Z"},{"alias_kind":"arxiv_version","alias_value":"2207.07449v1","created_at":"2026-07-05T04:40:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.07449","created_at":"2026-07-05T04:40:32Z"},{"alias_kind":"pith_short_12","alias_value":"JI6HGGGMOHZ2","created_at":"2026-07-05T04:40:32Z"},{"alias_kind":"pith_short_16","alias_value":"JI6HGGGMOHZ2V6R7","created_at":"2026-07-05T04:40:32Z"},{"alias_kind":"pith_short_8","alias_value":"JI6HGGGM","created_at":"2026-07-05T04:40:32Z"}],"graph_snapshots":[{"event_id":"sha256:46d8e25214d18e6b864cb330fcf9395428310407e6c9a06cc26c7e78dd9907bf","target":"graph","created_at":"2026-07-05T04:40:32Z","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/2207.07449/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce a general method for obtaining fixed-parameter algorithms for problems about finding paths in undirected graphs, where the length of the path could be unbounded in the parameter. The first application of our method is as follows.\n  We give a randomized algorithm, that given a colored $n$-vertex undirected graph, vertices $s$ and $t$, and an integer $k$, finds an $(s,t)$-path containing at least $k$ different colors in time $2^k n^{O(1)}$. This is the first FPT algorithm for this problem, and it generalizes the algorithm of Bj\\\"orklund, Husfeldt, and Taslaman [SODA 2012] on finding","authors_text":"Fedor V. Fomin, Giannos Stamoulis, Kirill Simonov, Petr A. Golovach, Tuukka Korhonen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-07-15T12:52:13Z","title":"Fixed-Parameter Tractability of Maximum Colored Path and Beyond"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.07449","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:8348681b39f04715cef40b8cdbdd65d9f2204663ac32839f5ccef53d75d4f35c","target":"record","created_at":"2026-07-05T04:40:32Z","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":"0175b40d7b7279ea1bc41c491cfb9d7120005c1353b5ccfd175eb3c48aec2727","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-07-15T12:52:13Z","title_canon_sha256":"b1975d3a3d52ff67fc9b494d6beed61fb17963d9f446a0333af2f1119893ffbe"},"schema_version":"1.0","source":{"id":"2207.07449","kind":"arxiv","version":1}},"canonical_sha256":"4a3c7318cc71f3aafa3f7b8a5fcdda2c358e29b14c1711c755da93cbacdec874","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a3c7318cc71f3aafa3f7b8a5fcdda2c358e29b14c1711c755da93cbacdec874","first_computed_at":"2026-07-05T04:40:32.530618Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:40:32.530618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1jEeZQKEeZWPF88JBqqcjqNqGLDKMKax7F2OgcdJdizJeFh397qUatJVyx+oGqx08mYBOaIA39qph3lX210UCg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:40:32.530977Z","signed_message":"canonical_sha256_bytes"},"source_id":"2207.07449","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8348681b39f04715cef40b8cdbdd65d9f2204663ac32839f5ccef53d75d4f35c","sha256:46d8e25214d18e6b864cb330fcf9395428310407e6c9a06cc26c7e78dd9907bf"],"state_sha256":"3af886bd2d881e2e7b088b97cfe355a81f2f017ec470fd58f196e994a7ae3eed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kGk8bhAzybzFxHyRmr5MOuejV4gsCl3p6/WUJiZEkwcc0gIi+omAm4+ylYeX2NIsoOZmxeN9zW80ApPo4JauAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T09:04:03.907055Z","bundle_sha256":"3c60905986572afbeb39b50a9441ac5fd8de067da8c8a3937f6f22e12cb68be1"}}