{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4OZOIXZT7LDA5PPEW4UU2OXBX4","short_pith_number":"pith:4OZOIXZT","schema_version":"1.0","canonical_sha256":"e3b2e45f33fac60ebde4b7294d3ae1bf3ef5b79d89564f9407ebe27cd310e113","source":{"kind":"arxiv","id":"1901.03364","version":1},"attestation_state":"computed","paper":{"title":"On the Descriptive Complexity of Color Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.CC","authors_text":"Max Bannach, Till Tantau","submitted_at":"2019-01-10T20:04:39Z","abstract_excerpt":"Color coding is an algorithmic technique used in parameterized complexity theory to detect \"small\" structures inside graphs. The idea is to derandomize algorithms that first randomly color a graph and then search for an easily-detectable, small color pattern. We transfer color coding to the world of descriptive complexity theory by characterizing -- purely in terms of the syntactic structure of describing formulas -- when the powerful second-order quantifiers representing a random coloring can be replaced by equivalent, simple first-order formulas. Building on this result, we identify syntacti"},"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":"1901.03364","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-01-10T20:04:39Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"d22d066734cdd48b86f29ecde6f2bf79d0afc5b1690bd95385cc06d0bd67b58e","abstract_canon_sha256":"aa7c47754656ee249dd404062295c166d85e0db9b15db349247589ae63b90c1a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:31.447275Z","signature_b64":"Jl1Gdt54BzZ6udBAanDiAtyboKeDFTt7Q9+oHQJexLY6SMygs6OtG3vrcpcAHkAPnuiW4l3J3Sk6W49OljfODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3b2e45f33fac60ebde4b7294d3ae1bf3ef5b79d89564f9407ebe27cd310e113","last_reissued_at":"2026-05-17T23:56:31.446667Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:31.446667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Descriptive Complexity of Color Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.CC","authors_text":"Max Bannach, Till Tantau","submitted_at":"2019-01-10T20:04:39Z","abstract_excerpt":"Color coding is an algorithmic technique used in parameterized complexity theory to detect \"small\" structures inside graphs. The idea is to derandomize algorithms that first randomly color a graph and then search for an easily-detectable, small color pattern. We transfer color coding to the world of descriptive complexity theory by characterizing -- purely in terms of the syntactic structure of describing formulas -- when the powerful second-order quantifiers representing a random coloring can be replaced by equivalent, simple first-order formulas. Building on this result, we identify syntacti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03364","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":"1901.03364","created_at":"2026-05-17T23:56:31.446756+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.03364v1","created_at":"2026-05-17T23:56:31.446756+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03364","created_at":"2026-05-17T23:56:31.446756+00:00"},{"alias_kind":"pith_short_12","alias_value":"4OZOIXZT7LDA","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"4OZOIXZT7LDA5PPE","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"4OZOIXZT","created_at":"2026-05-18T12:33:10.108867+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/4OZOIXZT7LDA5PPEW4UU2OXBX4","json":"https://pith.science/pith/4OZOIXZT7LDA5PPEW4UU2OXBX4.json","graph_json":"https://pith.science/api/pith-number/4OZOIXZT7LDA5PPEW4UU2OXBX4/graph.json","events_json":"https://pith.science/api/pith-number/4OZOIXZT7LDA5PPEW4UU2OXBX4/events.json","paper":"https://pith.science/paper/4OZOIXZT"},"agent_actions":{"view_html":"https://pith.science/pith/4OZOIXZT7LDA5PPEW4UU2OXBX4","download_json":"https://pith.science/pith/4OZOIXZT7LDA5PPEW4UU2OXBX4.json","view_paper":"https://pith.science/paper/4OZOIXZT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.03364&json=true","fetch_graph":"https://pith.science/api/pith-number/4OZOIXZT7LDA5PPEW4UU2OXBX4/graph.json","fetch_events":"https://pith.science/api/pith-number/4OZOIXZT7LDA5PPEW4UU2OXBX4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4OZOIXZT7LDA5PPEW4UU2OXBX4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4OZOIXZT7LDA5PPEW4UU2OXBX4/action/storage_attestation","attest_author":"https://pith.science/pith/4OZOIXZT7LDA5PPEW4UU2OXBX4/action/author_attestation","sign_citation":"https://pith.science/pith/4OZOIXZT7LDA5PPEW4UU2OXBX4/action/citation_signature","submit_replication":"https://pith.science/pith/4OZOIXZT7LDA5PPEW4UU2OXBX4/action/replication_record"}},"created_at":"2026-05-17T23:56:31.446756+00:00","updated_at":"2026-05-17T23:56:31.446756+00:00"}