{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:KKCA2PBC6LWD6XMDV564EZ6H2S","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":"1651993e21c214a998984bf8a377bfd80475fa8b0f65f5a1439290351d5e7414","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-24T12:17:55Z","title_canon_sha256":"2d414ab466ce26e3de8517189c6820271d658767f31b712fe1030834ab2c4be2"},"schema_version":"1.0","source":{"id":"1409.6921","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.6921","created_at":"2026-05-18T02:42:00Z"},{"alias_kind":"arxiv_version","alias_value":"1409.6921v1","created_at":"2026-05-18T02:42:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.6921","created_at":"2026-05-18T02:42:00Z"},{"alias_kind":"pith_short_12","alias_value":"KKCA2PBC6LWD","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KKCA2PBC6LWD6XMD","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KKCA2PBC","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:463619ea5345217283d45a947c93b6d7c7c1e6e47ffab95a97eec5f64b2c79cb","target":"graph","created_at":"2026-05-18T02:42:00Z","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":"The paper deals with extremal problems concerning colorings of hypergraphs. By using a random recoloring algorithm we show that any $n$-uniform simple (i.e. every two distinct edges share at most one vertex) hypergraph $H$ with maximum edge degree at most \\[\n  \\Delta(H)\\leq c\\cdot nr^{n-1}, \\] is $r$-colorable, where $c>0$ is an absolute constant. %We prove also that similar result holds for $b$-simple hypergraphs.\n  As an application of our proof technique we establish a new lower bound for Van der Waerden number $W(n,r)$, the minimum $N$ such that in any $r$-coloring of the set $\\{1,...,N\\}$","authors_text":"Dmitry Shabanov, Jakub Kozik","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-24T12:17:55Z","title":"Improved algorithms for colorings of simple hypergraphs and applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.6921","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:1011a04bee4944618a48a6a1f870e4354789942fd23045a8c964888857e23fae","target":"record","created_at":"2026-05-18T02:42:00Z","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":"1651993e21c214a998984bf8a377bfd80475fa8b0f65f5a1439290351d5e7414","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-24T12:17:55Z","title_canon_sha256":"2d414ab466ce26e3de8517189c6820271d658767f31b712fe1030834ab2c4be2"},"schema_version":"1.0","source":{"id":"1409.6921","kind":"arxiv","version":1}},"canonical_sha256":"52840d3c22f2ec3f5d83af7dc267c7d4b117368dd1ab143fe27d426a8abe24a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52840d3c22f2ec3f5d83af7dc267c7d4b117368dd1ab143fe27d426a8abe24a4","first_computed_at":"2026-05-18T02:42:00.209994Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:00.209994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YLrlo/AC9GDTlJJOceLyDGFHds02o9G6mzS7Ek0UtnMAwrhIIMXVIzID1Y0rxD0gIZUUbMUt0EREAvVEJMHRDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:00.210362Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.6921","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1011a04bee4944618a48a6a1f870e4354789942fd23045a8c964888857e23fae","sha256:463619ea5345217283d45a947c93b6d7c7c1e6e47ffab95a97eec5f64b2c79cb"],"state_sha256":"2b1c0db533f4c86427bdac9c7ddd7e27f857c82fe5d937c2b7591a017c084a04"}