{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:6PB3BF7YQU5R6CPPCQQHG4VSLL","short_pith_number":"pith:6PB3BF7Y","schema_version":"1.0","canonical_sha256":"f3c3b097f8853b1f09ef14207372b25acefc6afa2a12b7e1e043d405289b3c57","source":{"kind":"arxiv","id":"2007.15251","version":1},"attestation_state":"computed","paper":{"title":"Local Conflict Coloring Revisited: Linial for Lists","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Tigran Tonoyan, Yannic Maus","submitted_at":"2020-07-30T06:18:23Z","abstract_excerpt":"Linial's famous color reduction algorithm reduces a given $m$-coloring of a graph with maximum degree $\\Delta$ to a $O(\\Delta^2\\log m)$-coloring, in a single round in the LOCAL model. We show a similar result when nodes are restricted to choose their color from a list of allowed colors: given an $m$-coloring in a directed graph of maximum outdegree $\\beta$, if every node has a list of size $\\Omega(\\beta^2 (\\log \\beta+\\log\\log m + \\log \\log |\\mathcal{C}|))$ from a color space $\\mathcal{C}$ then they can select a color in two rounds in the LOCAL model. Moreover, the communication of a node essen"},"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":"2007.15251","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-07-30T06:18:23Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"f065d8dbfd2f6eae3630fc46508840d2f1e0b6e7c64291ccd5bfb93e93bd17aa","abstract_canon_sha256":"476a4239ed0ace5028e18821a62930b5f748be1a83873fdbe1249d05e805f4b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:23:28.879698Z","signature_b64":"hcp6pDaC8locpw8lyIzYD0HGju9whM+qBMUF8e5mr/Vn6pqWdf1te2cusbyTW0gIOCu55SLdsWKyFNbfnVcEDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3c3b097f8853b1f09ef14207372b25acefc6afa2a12b7e1e043d405289b3c57","last_reissued_at":"2026-07-05T01:23:28.879271Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:23:28.879271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local Conflict Coloring Revisited: Linial for Lists","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Tigran Tonoyan, Yannic Maus","submitted_at":"2020-07-30T06:18:23Z","abstract_excerpt":"Linial's famous color reduction algorithm reduces a given $m$-coloring of a graph with maximum degree $\\Delta$ to a $O(\\Delta^2\\log m)$-coloring, in a single round in the LOCAL model. We show a similar result when nodes are restricted to choose their color from a list of allowed colors: given an $m$-coloring in a directed graph of maximum outdegree $\\beta$, if every node has a list of size $\\Omega(\\beta^2 (\\log \\beta+\\log\\log m + \\log \\log |\\mathcal{C}|))$ from a color space $\\mathcal{C}$ then they can select a color in two rounds in the LOCAL model. Moreover, the communication of a node essen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.15251","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.15251/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":"2007.15251","created_at":"2026-07-05T01:23:28.879341+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.15251v1","created_at":"2026-07-05T01:23:28.879341+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.15251","created_at":"2026-07-05T01:23:28.879341+00:00"},{"alias_kind":"pith_short_12","alias_value":"6PB3BF7YQU5R","created_at":"2026-07-05T01:23:28.879341+00:00"},{"alias_kind":"pith_short_16","alias_value":"6PB3BF7YQU5R6CPP","created_at":"2026-07-05T01:23:28.879341+00:00"},{"alias_kind":"pith_short_8","alias_value":"6PB3BF7Y","created_at":"2026-07-05T01:23:28.879341+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.13377","citing_title":"Distributed weak independent sets in hypergraphs: Upper and lower bounds","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6PB3BF7YQU5R6CPPCQQHG4VSLL","json":"https://pith.science/pith/6PB3BF7YQU5R6CPPCQQHG4VSLL.json","graph_json":"https://pith.science/api/pith-number/6PB3BF7YQU5R6CPPCQQHG4VSLL/graph.json","events_json":"https://pith.science/api/pith-number/6PB3BF7YQU5R6CPPCQQHG4VSLL/events.json","paper":"https://pith.science/paper/6PB3BF7Y"},"agent_actions":{"view_html":"https://pith.science/pith/6PB3BF7YQU5R6CPPCQQHG4VSLL","download_json":"https://pith.science/pith/6PB3BF7YQU5R6CPPCQQHG4VSLL.json","view_paper":"https://pith.science/paper/6PB3BF7Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.15251&json=true","fetch_graph":"https://pith.science/api/pith-number/6PB3BF7YQU5R6CPPCQQHG4VSLL/graph.json","fetch_events":"https://pith.science/api/pith-number/6PB3BF7YQU5R6CPPCQQHG4VSLL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6PB3BF7YQU5R6CPPCQQHG4VSLL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6PB3BF7YQU5R6CPPCQQHG4VSLL/action/storage_attestation","attest_author":"https://pith.science/pith/6PB3BF7YQU5R6CPPCQQHG4VSLL/action/author_attestation","sign_citation":"https://pith.science/pith/6PB3BF7YQU5R6CPPCQQHG4VSLL/action/citation_signature","submit_replication":"https://pith.science/pith/6PB3BF7YQU5R6CPPCQQHG4VSLL/action/replication_record"}},"created_at":"2026-07-05T01:23:28.879341+00:00","updated_at":"2026-07-05T01:23:28.879341+00:00"}