{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4J5HCBSJXKL62Y3MUUYGE5RX6U","short_pith_number":"pith:4J5HCBSJ","schema_version":"1.0","canonical_sha256":"e27a710649ba97ed636ca530627637f52a7f94b1fa27ca13dd5c2eb3cffa1d50","source":{"kind":"arxiv","id":"1807.03604","version":1},"attestation_state":"computed","paper":{"title":"Computing Kernels in Parallel: Lower and Upper Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Max Bannach, Till Tantau","submitted_at":"2018-07-10T13:07:37Z","abstract_excerpt":"Parallel fixed-parameter tractability studies how parameterized problems can be solved in parallel. A surprisingly large number of parameterized problems admit a high level of parallelization, but this does not mean that we can also efficiently compute small problem kernels in parallel: known kernelization algorithms are typically highly sequential. In the present paper, we establish a number of upper and lower bounds concerning the sizes of kernels that can be computed in parallel. An intriguing finding is that there are complex trade-offs between kernel size and the depth of the circuits nee"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1807.03604","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-07-10T13:07:37Z","cross_cats_sorted":[],"title_canon_sha256":"89a189242721ee79fb45a8f8cb47c0e8ee16713c65592cb797a786c60087d01b","abstract_canon_sha256":"fd206ad7027be2eb181a5b60999798c22cdd239cc05c11a5225a776a5816542f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:09.878967Z","signature_b64":"FDy+GzyRKA2i3XmEmshzPBPhMY0OYFmItkg8zFNmAOS5cNFyi97WkgdWWpxEtMO6H6d1T5+61jEEHAzWxgK4Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e27a710649ba97ed636ca530627637f52a7f94b1fa27ca13dd5c2eb3cffa1d50","last_reissued_at":"2026-05-18T00:11:09.878149Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:09.878149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing Kernels in Parallel: Lower and Upper Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Max Bannach, Till Tantau","submitted_at":"2018-07-10T13:07:37Z","abstract_excerpt":"Parallel fixed-parameter tractability studies how parameterized problems can be solved in parallel. A surprisingly large number of parameterized problems admit a high level of parallelization, but this does not mean that we can also efficiently compute small problem kernels in parallel: known kernelization algorithms are typically highly sequential. In the present paper, we establish a number of upper and lower bounds concerning the sizes of kernels that can be computed in parallel. An intriguing finding is that there are complex trade-offs between kernel size and the depth of the circuits nee"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03604","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.03604","created_at":"2026-05-18T00:11:09.878282+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.03604v1","created_at":"2026-05-18T00:11:09.878282+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03604","created_at":"2026-05-18T00:11:09.878282+00:00"},{"alias_kind":"pith_short_12","alias_value":"4J5HCBSJXKL6","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4J5HCBSJXKL62Y3M","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4J5HCBSJ","created_at":"2026-05-18T12:32:05.422762+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4J5HCBSJXKL62Y3MUUYGE5RX6U","json":"https://pith.science/pith/4J5HCBSJXKL62Y3MUUYGE5RX6U.json","graph_json":"https://pith.science/api/pith-number/4J5HCBSJXKL62Y3MUUYGE5RX6U/graph.json","events_json":"https://pith.science/api/pith-number/4J5HCBSJXKL62Y3MUUYGE5RX6U/events.json","paper":"https://pith.science/paper/4J5HCBSJ"},"agent_actions":{"view_html":"https://pith.science/pith/4J5HCBSJXKL62Y3MUUYGE5RX6U","download_json":"https://pith.science/pith/4J5HCBSJXKL62Y3MUUYGE5RX6U.json","view_paper":"https://pith.science/paper/4J5HCBSJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.03604&json=true","fetch_graph":"https://pith.science/api/pith-number/4J5HCBSJXKL62Y3MUUYGE5RX6U/graph.json","fetch_events":"https://pith.science/api/pith-number/4J5HCBSJXKL62Y3MUUYGE5RX6U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4J5HCBSJXKL62Y3MUUYGE5RX6U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4J5HCBSJXKL62Y3MUUYGE5RX6U/action/storage_attestation","attest_author":"https://pith.science/pith/4J5HCBSJXKL62Y3MUUYGE5RX6U/action/author_attestation","sign_citation":"https://pith.science/pith/4J5HCBSJXKL62Y3MUUYGE5RX6U/action/citation_signature","submit_replication":"https://pith.science/pith/4J5HCBSJXKL62Y3MUUYGE5RX6U/action/replication_record"}},"created_at":"2026-05-18T00:11:09.878282+00:00","updated_at":"2026-05-18T00:11:09.878282+00:00"}