{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:U6NNUNFHWBRSNJ5IDDHUOBJXXI","short_pith_number":"pith:U6NNUNFH","schema_version":"1.0","canonical_sha256":"a79ada34a7b06326a7a818cf470537ba0124c8d061880f9c227b1f3becf14426","source":{"kind":"arxiv","id":"1805.04544","version":1},"attestation_state":"computed","paper":{"title":"Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Konrad, Viktor Zamaraev","submitted_at":"2018-05-11T18:21:02Z","abstract_excerpt":"We give deterministic distributed $(1+\\epsilon)$-approximation algorithms for Minimum Vertex Coloring and Maximum Independent Set on chordal graphs in the LOCAL model. Our coloring algorithm runs in $O(\\frac{1}{\\epsilon} \\log n)$ rounds, and our independent set algorithm has a runtime of $O(\\frac{1}{\\epsilon}\\log(\\frac{1}{\\epsilon})\\log^* n)$ rounds. For coloring, existing lower bounds imply that the dependencies on $\\frac{1}{\\epsilon}$ and $\\log n$ are best possible. For independent set, we prove that $O(\\frac{1}{\\epsilon})$ rounds are necessary.\n  Both our algorithms make use of a tree decom"},"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":"1805.04544","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-11T18:21:02Z","cross_cats_sorted":[],"title_canon_sha256":"4d93cf290e8472e27753d961bf0f0fbce8e44103339663a96290cf4673f626dc","abstract_canon_sha256":"fd3187d44fbee7a77ea622924a41447f8c4ddc74740459ea2d0bf4b7ceb7c58e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:07.143149Z","signature_b64":"EvqAyJsXnw7yvjmmKCPoLNguWxgBxH30pRqbprh+WuoLQT32HaZRc/eXg5rArYxVjhzJ6j2KpXuwgP5Zhov8AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a79ada34a7b06326a7a818cf470537ba0124c8d061880f9c227b1f3becf14426","last_reissued_at":"2026-05-18T00:16:07.142488Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:07.142488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Konrad, Viktor Zamaraev","submitted_at":"2018-05-11T18:21:02Z","abstract_excerpt":"We give deterministic distributed $(1+\\epsilon)$-approximation algorithms for Minimum Vertex Coloring and Maximum Independent Set on chordal graphs in the LOCAL model. Our coloring algorithm runs in $O(\\frac{1}{\\epsilon} \\log n)$ rounds, and our independent set algorithm has a runtime of $O(\\frac{1}{\\epsilon}\\log(\\frac{1}{\\epsilon})\\log^* n)$ rounds. For coloring, existing lower bounds imply that the dependencies on $\\frac{1}{\\epsilon}$ and $\\log n$ are best possible. For independent set, we prove that $O(\\frac{1}{\\epsilon})$ rounds are necessary.\n  Both our algorithms make use of a tree decom"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04544","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":"1805.04544","created_at":"2026-05-18T00:16:07.142579+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.04544v1","created_at":"2026-05-18T00:16:07.142579+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04544","created_at":"2026-05-18T00:16:07.142579+00:00"},{"alias_kind":"pith_short_12","alias_value":"U6NNUNFHWBRS","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"U6NNUNFHWBRSNJ5I","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"U6NNUNFH","created_at":"2026-05-18T12:32:56.356000+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.06979","citing_title":"Word-representability and comparability: Minimal forbidden induced subgraphs and cover number bounds","ref_index":24,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U6NNUNFHWBRSNJ5IDDHUOBJXXI","json":"https://pith.science/pith/U6NNUNFHWBRSNJ5IDDHUOBJXXI.json","graph_json":"https://pith.science/api/pith-number/U6NNUNFHWBRSNJ5IDDHUOBJXXI/graph.json","events_json":"https://pith.science/api/pith-number/U6NNUNFHWBRSNJ5IDDHUOBJXXI/events.json","paper":"https://pith.science/paper/U6NNUNFH"},"agent_actions":{"view_html":"https://pith.science/pith/U6NNUNFHWBRSNJ5IDDHUOBJXXI","download_json":"https://pith.science/pith/U6NNUNFHWBRSNJ5IDDHUOBJXXI.json","view_paper":"https://pith.science/paper/U6NNUNFH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.04544&json=true","fetch_graph":"https://pith.science/api/pith-number/U6NNUNFHWBRSNJ5IDDHUOBJXXI/graph.json","fetch_events":"https://pith.science/api/pith-number/U6NNUNFHWBRSNJ5IDDHUOBJXXI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U6NNUNFHWBRSNJ5IDDHUOBJXXI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U6NNUNFHWBRSNJ5IDDHUOBJXXI/action/storage_attestation","attest_author":"https://pith.science/pith/U6NNUNFHWBRSNJ5IDDHUOBJXXI/action/author_attestation","sign_citation":"https://pith.science/pith/U6NNUNFHWBRSNJ5IDDHUOBJXXI/action/citation_signature","submit_replication":"https://pith.science/pith/U6NNUNFHWBRSNJ5IDDHUOBJXXI/action/replication_record"}},"created_at":"2026-05-18T00:16:07.142579+00:00","updated_at":"2026-05-18T00:16:07.142579+00:00"}