{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:F7RKDBI47WFMTI7HZEYMKGZNJB","short_pith_number":"pith:F7RKDBI4","schema_version":"1.0","canonical_sha256":"2fe2a1851cfd8ac9a3e7c930c51b2d4853377339f755f08b2f09bf1f5bef3b25","source":{"kind":"arxiv","id":"1410.5062","version":3},"attestation_state":"computed","paper":{"title":"Mixing Color Coding-Related Techniques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Meirav Zehavi","submitted_at":"2014-10-19T11:54:00Z","abstract_excerpt":"Narrow sieves, representative sets and divide-and-color are three breakthrough color coding-related techniques, which led to the design of extremely fast parameterized algorithms. We present a novel family of strategies for applying mixtures of them. This includes: (a) a mix of representative sets and narrow sieves; (b) a faster computation of representative sets under certain separateness conditions, mixed with divide-and-color and a new technique, \"balanced cutting\"; (c) two mixtures of representative sets, iterative compression and a new technique, \"unbalanced cutting\". We demonstrate our s"},"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":"1410.5062","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-19T11:54:00Z","cross_cats_sorted":[],"title_canon_sha256":"c5329abd11a77e225a67a52f5529e6ab2356d80254064526765b42228f387c5f","abstract_canon_sha256":"ac2ab3516ad96126114839149845c8abd52c83def0a21a7472bbc9912da3ef43"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:23.622372Z","signature_b64":"5PxkQ6DwaUA/UZeIXaig5gL1P6egqjiUg8CEv5xg/hosTj6Y7xjaQNKMQ06vj5ZHlHyxNBDstuisFkng732kAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fe2a1851cfd8ac9a3e7c930c51b2d4853377339f755f08b2f09bf1f5bef3b25","last_reissued_at":"2026-05-18T02:18:23.620937Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:23.620937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mixing Color Coding-Related Techniques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Meirav Zehavi","submitted_at":"2014-10-19T11:54:00Z","abstract_excerpt":"Narrow sieves, representative sets and divide-and-color are three breakthrough color coding-related techniques, which led to the design of extremely fast parameterized algorithms. We present a novel family of strategies for applying mixtures of them. This includes: (a) a mix of representative sets and narrow sieves; (b) a faster computation of representative sets under certain separateness conditions, mixed with divide-and-color and a new technique, \"balanced cutting\"; (c) two mixtures of representative sets, iterative compression and a new technique, \"unbalanced cutting\". We demonstrate our s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5062","kind":"arxiv","version":3},"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":"1410.5062","created_at":"2026-05-18T02:18:23.621015+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.5062v3","created_at":"2026-05-18T02:18:23.621015+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5062","created_at":"2026-05-18T02:18:23.621015+00:00"},{"alias_kind":"pith_short_12","alias_value":"F7RKDBI47WFM","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"F7RKDBI47WFMTI7H","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"F7RKDBI4","created_at":"2026-05-18T12:28:28.263976+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/F7RKDBI47WFMTI7HZEYMKGZNJB","json":"https://pith.science/pith/F7RKDBI47WFMTI7HZEYMKGZNJB.json","graph_json":"https://pith.science/api/pith-number/F7RKDBI47WFMTI7HZEYMKGZNJB/graph.json","events_json":"https://pith.science/api/pith-number/F7RKDBI47WFMTI7HZEYMKGZNJB/events.json","paper":"https://pith.science/paper/F7RKDBI4"},"agent_actions":{"view_html":"https://pith.science/pith/F7RKDBI47WFMTI7HZEYMKGZNJB","download_json":"https://pith.science/pith/F7RKDBI47WFMTI7HZEYMKGZNJB.json","view_paper":"https://pith.science/paper/F7RKDBI4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.5062&json=true","fetch_graph":"https://pith.science/api/pith-number/F7RKDBI47WFMTI7HZEYMKGZNJB/graph.json","fetch_events":"https://pith.science/api/pith-number/F7RKDBI47WFMTI7HZEYMKGZNJB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F7RKDBI47WFMTI7HZEYMKGZNJB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F7RKDBI47WFMTI7HZEYMKGZNJB/action/storage_attestation","attest_author":"https://pith.science/pith/F7RKDBI47WFMTI7HZEYMKGZNJB/action/author_attestation","sign_citation":"https://pith.science/pith/F7RKDBI47WFMTI7HZEYMKGZNJB/action/citation_signature","submit_replication":"https://pith.science/pith/F7RKDBI47WFMTI7HZEYMKGZNJB/action/replication_record"}},"created_at":"2026-05-18T02:18:23.621015+00:00","updated_at":"2026-05-18T02:18:23.621015+00:00"}