{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WDMEU5OZAC7EGYLVTDDHIC5EEE","short_pith_number":"pith:WDMEU5OZ","canonical_record":{"source":{"id":"1509.06984","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2015-09-23T13:55:36Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b57852dbbcc2f2b2754d0c690e616c0466cfd3c563728e57de9f020c5d3a572f","abstract_canon_sha256":"1a10880c7c4ded5c78ba8869b248d72f799ae1ef2546892003156c704b2b5dc1"},"schema_version":"1.0"},"canonical_sha256":"b0d84a75d900be43617598c6740ba42133d4dead676aef000bf82e03e58a49e5","source":{"kind":"arxiv","id":"1509.06984","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.06984","created_at":"2026-05-18T01:32:17Z"},{"alias_kind":"arxiv_version","alias_value":"1509.06984v1","created_at":"2026-05-18T01:32:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06984","created_at":"2026-05-18T01:32:17Z"},{"alias_kind":"pith_short_12","alias_value":"WDMEU5OZAC7E","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WDMEU5OZAC7EGYLV","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WDMEU5OZ","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WDMEU5OZAC7EGYLVTDDHIC5EEE","target":"record","payload":{"canonical_record":{"source":{"id":"1509.06984","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2015-09-23T13:55:36Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b57852dbbcc2f2b2754d0c690e616c0466cfd3c563728e57de9f020c5d3a572f","abstract_canon_sha256":"1a10880c7c4ded5c78ba8869b248d72f799ae1ef2546892003156c704b2b5dc1"},"schema_version":"1.0"},"canonical_sha256":"b0d84a75d900be43617598c6740ba42133d4dead676aef000bf82e03e58a49e5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:17.321697Z","signature_b64":"iPstxtylmkiduNT07ORydtPaxyDUUMKbMPS6f7XIlPfJ9bML/qkuSPPxq75RbL13gSu7QrTgZHITWhbloUpjBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0d84a75d900be43617598c6740ba42133d4dead676aef000bf82e03e58a49e5","last_reissued_at":"2026-05-18T01:32:17.321018Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:17.321018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.06984","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-18T01:32:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2FoURjiFLXPM7jUtfQ/69F92ouHBPWKnr3J6ROUOC1rS/pDUOo7ZyZFt5qQ6+gtqv7iGhXLDIIJQcDfi3vN4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:03:52.014384Z"},"content_sha256":"3fdfa7bc0957f8358ffd5d46647efe4a75b1e3a09e976247a9c0e6135a868f1e","schema_version":"1.0","event_id":"sha256:3fdfa7bc0957f8358ffd5d46647efe4a75b1e3a09e976247a9c0e6135a868f1e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WDMEU5OZAC7EGYLVTDDHIC5EEE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Parallel Fixed-Parameter Algorithms via Color Coding","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Christoph Stockhusen, Max Bannach, Till Tantau","submitted_at":"2015-09-23T13:55:36Z","abstract_excerpt":"Fixed-parameter algorithms have been successfully applied to solve numerous difficult problems within acceptable time bounds on large inputs. However, most fixed-parameter algorithms are inherently \\emph{sequential} and, thus, make no use of the parallel hardware present in modern computers. We show that parallel fixed-parameter algorithms do not only exist for numerous parameterized problems from the literature -- including vertex cover, packing problems, cluster editing, cutting vertices, finding embeddings, or finding matchings -- but that there are parallel algorithms working in \\emph{cons"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.06984","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-18T01:32:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nfk0GL3+71ohi35rf0MRfuxNuCHL6Oyv4hrGjh6vWOMZHTgYUOPFM6flpkyZ+LKWIQdLE4yX1oum8T44OWLyAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:03:52.015088Z"},"content_sha256":"60a9d3deda921f1a8e5dbca3b6c6a41cce3c656476031396e6fcd7a4ffb80265","schema_version":"1.0","event_id":"sha256:60a9d3deda921f1a8e5dbca3b6c6a41cce3c656476031396e6fcd7a4ffb80265"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WDMEU5OZAC7EGYLVTDDHIC5EEE/bundle.json","state_url":"https://pith.science/pith/WDMEU5OZAC7EGYLVTDDHIC5EEE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WDMEU5OZAC7EGYLVTDDHIC5EEE/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-07T09:03:52Z","links":{"resolver":"https://pith.science/pith/WDMEU5OZAC7EGYLVTDDHIC5EEE","bundle":"https://pith.science/pith/WDMEU5OZAC7EGYLVTDDHIC5EEE/bundle.json","state":"https://pith.science/pith/WDMEU5OZAC7EGYLVTDDHIC5EEE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WDMEU5OZAC7EGYLVTDDHIC5EEE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WDMEU5OZAC7EGYLVTDDHIC5EEE","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":"1a10880c7c4ded5c78ba8869b248d72f799ae1ef2546892003156c704b2b5dc1","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2015-09-23T13:55:36Z","title_canon_sha256":"b57852dbbcc2f2b2754d0c690e616c0466cfd3c563728e57de9f020c5d3a572f"},"schema_version":"1.0","source":{"id":"1509.06984","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.06984","created_at":"2026-05-18T01:32:17Z"},{"alias_kind":"arxiv_version","alias_value":"1509.06984v1","created_at":"2026-05-18T01:32:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06984","created_at":"2026-05-18T01:32:17Z"},{"alias_kind":"pith_short_12","alias_value":"WDMEU5OZAC7E","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WDMEU5OZAC7EGYLV","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WDMEU5OZ","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:60a9d3deda921f1a8e5dbca3b6c6a41cce3c656476031396e6fcd7a4ffb80265","target":"graph","created_at":"2026-05-18T01:32:17Z","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 have been successfully applied to solve numerous difficult problems within acceptable time bounds on large inputs. However, most fixed-parameter algorithms are inherently \\emph{sequential} and, thus, make no use of the parallel hardware present in modern computers. We show that parallel fixed-parameter algorithms do not only exist for numerous parameterized problems from the literature -- including vertex cover, packing problems, cluster editing, cutting vertices, finding embeddings, or finding matchings -- but that there are parallel algorithms working in \\emph{cons","authors_text":"Christoph Stockhusen, Max Bannach, Till Tantau","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2015-09-23T13:55:36Z","title":"Fast Parallel Fixed-Parameter Algorithms via Color Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.06984","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:3fdfa7bc0957f8358ffd5d46647efe4a75b1e3a09e976247a9c0e6135a868f1e","target":"record","created_at":"2026-05-18T01:32:17Z","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":"1a10880c7c4ded5c78ba8869b248d72f799ae1ef2546892003156c704b2b5dc1","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2015-09-23T13:55:36Z","title_canon_sha256":"b57852dbbcc2f2b2754d0c690e616c0466cfd3c563728e57de9f020c5d3a572f"},"schema_version":"1.0","source":{"id":"1509.06984","kind":"arxiv","version":1}},"canonical_sha256":"b0d84a75d900be43617598c6740ba42133d4dead676aef000bf82e03e58a49e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0d84a75d900be43617598c6740ba42133d4dead676aef000bf82e03e58a49e5","first_computed_at":"2026-05-18T01:32:17.321018Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:17.321018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iPstxtylmkiduNT07ORydtPaxyDUUMKbMPS6f7XIlPfJ9bML/qkuSPPxq75RbL13gSu7QrTgZHITWhbloUpjBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:17.321697Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.06984","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3fdfa7bc0957f8358ffd5d46647efe4a75b1e3a09e976247a9c0e6135a868f1e","sha256:60a9d3deda921f1a8e5dbca3b6c6a41cce3c656476031396e6fcd7a4ffb80265"],"state_sha256":"97ed52f3950e2c40a045ae058a35453d0ff71cc9a7163ed24e872b424b813b56"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OMn+qJXNMWY3VRUYfwnqN9C3uIPtt330MEjN6cwMUJctoEB9+FNNPgQtRssrrx6zQhvBv0PMWE6UrFTrIMyfBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T09:03:52.018555Z","bundle_sha256":"a52264c9c597a884b6efc84fbc0bdd9bdbb87d48ef7d7bfcaf5169b2a3610030"}}