{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NCCAI6AZ2VSKPRHZTSXIHTEZR3","short_pith_number":"pith:NCCAI6AZ","schema_version":"1.0","canonical_sha256":"6884047819d564a7c4f99cae83cc998eeaf504db6eba42e84241aadbe431e729","source":{"kind":"arxiv","id":"1706.03698","version":2},"attestation_state":"computed","paper":{"title":"Designing Deterministic Polynomial-Space Algorithms by Color-Coding Multivariate Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Felix Reidl, Gregory Gutin, Magnus Wahlstr\\\"om, Meirav Zehavi","submitted_at":"2017-06-12T15:47:38Z","abstract_excerpt":"In recent years, several powerful techniques have been developed to design {\\em randomized} polynomial-space parameterized algorithms. In this paper, we introduce an enhancement of color coding to design deterministic polynomial-space parameterized algorithms. Our approach aims at reducing the number of random choices by exploiting the special structure of a solution. Using our approach, we derive the following deterministic algorithms (see Introduction for problem definitions).\n  1. Polynomial-space $O^*(3.86^k)$-time (exponential-space $O^*(3.41^k)$-time) algorithm for {\\sc $k$-Internal Out-"},"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":"1706.03698","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-12T15:47:38Z","cross_cats_sorted":[],"title_canon_sha256":"fb36d6a177f60691dd714f20d98b5ae1343cb033a266259dc281694c70348257","abstract_canon_sha256":"41e9fb73e678166d94f22179b349daea756fab5c2262b5a33c0e99fce17d4db6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:46.463347Z","signature_b64":"Pqeb7TzZw/JKaW/8kWFwDrnWv91DAfuAaQATEBaJhRNy3uAc3bMFy5MW1oLf/IxrsEqIec0/6dH9PFVXPbgVBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6884047819d564a7c4f99cae83cc998eeaf504db6eba42e84241aadbe431e729","last_reissued_at":"2026-05-18T00:27:46.462883Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:46.462883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Designing Deterministic Polynomial-Space Algorithms by Color-Coding Multivariate Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Felix Reidl, Gregory Gutin, Magnus Wahlstr\\\"om, Meirav Zehavi","submitted_at":"2017-06-12T15:47:38Z","abstract_excerpt":"In recent years, several powerful techniques have been developed to design {\\em randomized} polynomial-space parameterized algorithms. In this paper, we introduce an enhancement of color coding to design deterministic polynomial-space parameterized algorithms. Our approach aims at reducing the number of random choices by exploiting the special structure of a solution. Using our approach, we derive the following deterministic algorithms (see Introduction for problem definitions).\n  1. Polynomial-space $O^*(3.86^k)$-time (exponential-space $O^*(3.41^k)$-time) algorithm for {\\sc $k$-Internal Out-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03698","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.03698","created_at":"2026-05-18T00:27:46.462951+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.03698v2","created_at":"2026-05-18T00:27:46.462951+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03698","created_at":"2026-05-18T00:27:46.462951+00:00"},{"alias_kind":"pith_short_12","alias_value":"NCCAI6AZ2VSK","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"NCCAI6AZ2VSKPRHZ","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"NCCAI6AZ","created_at":"2026-05-18T12:31:31.346846+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/NCCAI6AZ2VSKPRHZTSXIHTEZR3","json":"https://pith.science/pith/NCCAI6AZ2VSKPRHZTSXIHTEZR3.json","graph_json":"https://pith.science/api/pith-number/NCCAI6AZ2VSKPRHZTSXIHTEZR3/graph.json","events_json":"https://pith.science/api/pith-number/NCCAI6AZ2VSKPRHZTSXIHTEZR3/events.json","paper":"https://pith.science/paper/NCCAI6AZ"},"agent_actions":{"view_html":"https://pith.science/pith/NCCAI6AZ2VSKPRHZTSXIHTEZR3","download_json":"https://pith.science/pith/NCCAI6AZ2VSKPRHZTSXIHTEZR3.json","view_paper":"https://pith.science/paper/NCCAI6AZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.03698&json=true","fetch_graph":"https://pith.science/api/pith-number/NCCAI6AZ2VSKPRHZTSXIHTEZR3/graph.json","fetch_events":"https://pith.science/api/pith-number/NCCAI6AZ2VSKPRHZTSXIHTEZR3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NCCAI6AZ2VSKPRHZTSXIHTEZR3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NCCAI6AZ2VSKPRHZTSXIHTEZR3/action/storage_attestation","attest_author":"https://pith.science/pith/NCCAI6AZ2VSKPRHZTSXIHTEZR3/action/author_attestation","sign_citation":"https://pith.science/pith/NCCAI6AZ2VSKPRHZTSXIHTEZR3/action/citation_signature","submit_replication":"https://pith.science/pith/NCCAI6AZ2VSKPRHZTSXIHTEZR3/action/replication_record"}},"created_at":"2026-05-18T00:27:46.462951+00:00","updated_at":"2026-05-18T00:27:46.462951+00:00"}