{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:4OZOIXZT7LDA5PPEW4UU2OXBX4","short_pith_number":"pith:4OZOIXZT","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"},"canonical_sha256":"e3b2e45f33fac60ebde4b7294d3ae1bf3ef5b79d89564f9407ebe27cd310e113","source":{"kind":"arxiv","id":"1901.03364","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.03364","created_at":"2026-05-17T23:56:31Z"},{"alias_kind":"arxiv_version","alias_value":"1901.03364v1","created_at":"2026-05-17T23:56:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03364","created_at":"2026-05-17T23:56:31Z"},{"alias_kind":"pith_short_12","alias_value":"4OZOIXZT7LDA","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4OZOIXZT7LDA5PPE","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4OZOIXZT","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:4OZOIXZT7LDA5PPEW4UU2OXBX4","target":"record","payload":{"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"},"canonical_sha256":"e3b2e45f33fac60ebde4b7294d3ae1bf3ef5b79d89564f9407ebe27cd310e113","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"},"source_kind":"arxiv","source_id":"1901.03364","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-17T23:56:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m0sbv9N4JXGAl6oeqc/3tjgzWMg86aKdF+XRqGq74IxB1is91H85O+nseojbZGtBiLJvrgFoQNsyXAYci2joCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T07:34:43.247915Z"},"content_sha256":"27af5875a9c156561bdfe89f17a0c41b5670c9995795d02bf875048b69e15b2e","schema_version":"1.0","event_id":"sha256:27af5875a9c156561bdfe89f17a0c41b5670c9995795d02bf875048b69e15b2e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:4OZOIXZT7LDA5PPEW4UU2OXBX4","target":"graph","payload":{"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"},"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-17T23:56:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tKOqH2ZZF5hkrx32+2WHVpIctpL9rNLkkr0af8xrZSlx6jgLbg1TWT9g9z4mLt1KFbaPwyAFd8gnF1IG16daCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T07:34:43.248285Z"},"content_sha256":"f9b000dd9c713472cdfb25c14a40ab5905a657b923a77b954391dc27180691bd","schema_version":"1.0","event_id":"sha256:f9b000dd9c713472cdfb25c14a40ab5905a657b923a77b954391dc27180691bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4OZOIXZT7LDA5PPEW4UU2OXBX4/bundle.json","state_url":"https://pith.science/pith/4OZOIXZT7LDA5PPEW4UU2OXBX4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4OZOIXZT7LDA5PPEW4UU2OXBX4/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-07T07:34:43Z","links":{"resolver":"https://pith.science/pith/4OZOIXZT7LDA5PPEW4UU2OXBX4","bundle":"https://pith.science/pith/4OZOIXZT7LDA5PPEW4UU2OXBX4/bundle.json","state":"https://pith.science/pith/4OZOIXZT7LDA5PPEW4UU2OXBX4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4OZOIXZT7LDA5PPEW4UU2OXBX4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4OZOIXZT7LDA5PPEW4UU2OXBX4","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":"aa7c47754656ee249dd404062295c166d85e0db9b15db349247589ae63b90c1a","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-01-10T20:04:39Z","title_canon_sha256":"d22d066734cdd48b86f29ecde6f2bf79d0afc5b1690bd95385cc06d0bd67b58e"},"schema_version":"1.0","source":{"id":"1901.03364","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.03364","created_at":"2026-05-17T23:56:31Z"},{"alias_kind":"arxiv_version","alias_value":"1901.03364v1","created_at":"2026-05-17T23:56:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03364","created_at":"2026-05-17T23:56:31Z"},{"alias_kind":"pith_short_12","alias_value":"4OZOIXZT7LDA","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4OZOIXZT7LDA5PPE","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4OZOIXZT","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:f9b000dd9c713472cdfb25c14a40ab5905a657b923a77b954391dc27180691bd","target":"graph","created_at":"2026-05-17T23:56:31Z","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":"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","authors_text":"Max Bannach, Till Tantau","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-01-10T20:04:39Z","title":"On the Descriptive Complexity of Color Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03364","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:27af5875a9c156561bdfe89f17a0c41b5670c9995795d02bf875048b69e15b2e","target":"record","created_at":"2026-05-17T23:56:31Z","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":"aa7c47754656ee249dd404062295c166d85e0db9b15db349247589ae63b90c1a","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-01-10T20:04:39Z","title_canon_sha256":"d22d066734cdd48b86f29ecde6f2bf79d0afc5b1690bd95385cc06d0bd67b58e"},"schema_version":"1.0","source":{"id":"1901.03364","kind":"arxiv","version":1}},"canonical_sha256":"e3b2e45f33fac60ebde4b7294d3ae1bf3ef5b79d89564f9407ebe27cd310e113","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3b2e45f33fac60ebde4b7294d3ae1bf3ef5b79d89564f9407ebe27cd310e113","first_computed_at":"2026-05-17T23:56:31.446667Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:31.446667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Jl1Gdt54BzZ6udBAanDiAtyboKeDFTt7Q9+oHQJexLY6SMygs6OtG3vrcpcAHkAPnuiW4l3J3Sk6W49OljfODA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:31.447275Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.03364","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27af5875a9c156561bdfe89f17a0c41b5670c9995795d02bf875048b69e15b2e","sha256:f9b000dd9c713472cdfb25c14a40ab5905a657b923a77b954391dc27180691bd"],"state_sha256":"ba5959241d4e1c3577abb3b1ea20df8644662ebeae5acac61926c74ac1d5160d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A3pJcmzfb8FJMQERqbRxfaa04DKQE8ur/+0SKtVSxJNyyx3PxhIe9f3W44NP+7tGFxwSQ5CNhz1yhykGARXvDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T07:34:43.251277Z","bundle_sha256":"eecbe51695ae191a7498ae5cdaeca9e37ccdfa45f2671d52880746f0abfc3ec5"}}