{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BQXD3GCTZKVC2DYXHHINCEWRN2","short_pith_number":"pith:BQXD3GCT","schema_version":"1.0","canonical_sha256":"0c2e3d9853caaa2d0f1739d0d112d16eab609189c0c8e5ccfc5bd594604f6bd4","source":{"kind":"arxiv","id":"1907.12857","version":2},"attestation_state":"computed","paper":{"title":"Deterministic coloring algorithms in the LOCAL model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Dariusz R. Kowalski, Piotr Krysta","submitted_at":"2019-07-30T12:28:52Z","abstract_excerpt":"We study the problem of bi-chromatic coloring of hypergraphs in the LOCAL distributed model of computation. This problem can easily be solved by a randomized local algorithm with no communication. However, it is not known how to solve it deterministically with only a polylogarithmic number of communication rounds. In this paper we indeed design such a deterministic algorithm that solves this problem with polylogarithmic number of communication rounds. This is an almost exponential improvement on the previously known deterministic local algorithms for this problem. Because the bi-chromatic colo"},"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":"1907.12857","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-30T12:28:52Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"41d6101760f5c00be70d6c104078f98f90b456c7f99b65bea07673dbd8046d53","abstract_canon_sha256":"ea3abc8e4077efa3b1f3095551e12811f5052ca7a12aa0a70a5b4a9474354405"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:50:46.502541Z","signature_b64":"PRHmprOdI0HqQQ8n9cgAA9ssFIMTLIqbYDyT9n0F16P9fB2KpWcGME2FLJ7/1oxNCIQnI4D7SXIjhRkxjZa9Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c2e3d9853caaa2d0f1739d0d112d16eab609189c0c8e5ccfc5bd594604f6bd4","last_reissued_at":"2026-07-04T23:50:46.502165Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:50:46.502165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic coloring algorithms in the LOCAL model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Dariusz R. Kowalski, Piotr Krysta","submitted_at":"2019-07-30T12:28:52Z","abstract_excerpt":"We study the problem of bi-chromatic coloring of hypergraphs in the LOCAL distributed model of computation. This problem can easily be solved by a randomized local algorithm with no communication. However, it is not known how to solve it deterministically with only a polylogarithmic number of communication rounds. In this paper we indeed design such a deterministic algorithm that solves this problem with polylogarithmic number of communication rounds. This is an almost exponential improvement on the previously known deterministic local algorithms for this problem. Because the bi-chromatic colo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.12857","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1907.12857/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1907.12857","created_at":"2026-07-04T23:50:46.502221+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.12857v2","created_at":"2026-07-04T23:50:46.502221+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.12857","created_at":"2026-07-04T23:50:46.502221+00:00"},{"alias_kind":"pith_short_12","alias_value":"BQXD3GCTZKVC","created_at":"2026-07-04T23:50:46.502221+00:00"},{"alias_kind":"pith_short_16","alias_value":"BQXD3GCTZKVC2DYX","created_at":"2026-07-04T23:50:46.502221+00:00"},{"alias_kind":"pith_short_8","alias_value":"BQXD3GCT","created_at":"2026-07-04T23:50:46.502221+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/BQXD3GCTZKVC2DYXHHINCEWRN2","json":"https://pith.science/pith/BQXD3GCTZKVC2DYXHHINCEWRN2.json","graph_json":"https://pith.science/api/pith-number/BQXD3GCTZKVC2DYXHHINCEWRN2/graph.json","events_json":"https://pith.science/api/pith-number/BQXD3GCTZKVC2DYXHHINCEWRN2/events.json","paper":"https://pith.science/paper/BQXD3GCT"},"agent_actions":{"view_html":"https://pith.science/pith/BQXD3GCTZKVC2DYXHHINCEWRN2","download_json":"https://pith.science/pith/BQXD3GCTZKVC2DYXHHINCEWRN2.json","view_paper":"https://pith.science/paper/BQXD3GCT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.12857&json=true","fetch_graph":"https://pith.science/api/pith-number/BQXD3GCTZKVC2DYXHHINCEWRN2/graph.json","fetch_events":"https://pith.science/api/pith-number/BQXD3GCTZKVC2DYXHHINCEWRN2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BQXD3GCTZKVC2DYXHHINCEWRN2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BQXD3GCTZKVC2DYXHHINCEWRN2/action/storage_attestation","attest_author":"https://pith.science/pith/BQXD3GCTZKVC2DYXHHINCEWRN2/action/author_attestation","sign_citation":"https://pith.science/pith/BQXD3GCTZKVC2DYXHHINCEWRN2/action/citation_signature","submit_replication":"https://pith.science/pith/BQXD3GCTZKVC2DYXHHINCEWRN2/action/replication_record"}},"created_at":"2026-07-04T23:50:46.502221+00:00","updated_at":"2026-07-04T23:50:46.502221+00:00"}