{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:EDZBAIOTLKTVD44VHRRCCBN3D2","short_pith_number":"pith:EDZBAIOT","schema_version":"1.0","canonical_sha256":"20f21021d35aa751f3953c622105bb1eafb04a29aec7bc3cf3992d943184d84f","source":{"kind":"arxiv","id":"1607.03432","version":3},"attestation_state":"computed","paper":{"title":"Tight lower bounds for the complexity of multicoloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Arkadiusz Soca{\\l}a, {\\L}ukasz Kowalik, Marcin Wrochna, Marthe Bonamy, Micha{\\l} Pilipczuk","submitted_at":"2016-07-12T16:38:13Z","abstract_excerpt":"In the multicoloring problem, also known as ($a$:$b$)-coloring or $b$-fold coloring, we are given a graph G and a set of $a$ colors, and the task is to assign a subset of $b$ colors to each vertex of G so that adjacent vertices receive disjoint color subsets. This natural generalization of the classic coloring problem (the $b=1$ case) is equivalent to finding a homomorphism to the Kneser graph $KG_{a,b}$, and gives relaxations approaching the fractional chromatic number.\n  We study the complexity of determining whether a graph has an ($a$:$b$)-coloring. Our main result is that this problem doe"},"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":"1607.03432","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-12T16:38:13Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"252ee49036c14314eeb87c2cd2f07fbf48e3c620439fb73eceacce7f8b10266b","abstract_canon_sha256":"a400e6552bc626ce67962620eb685e3f2334ea73fb1314763b1c98f02721c70a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:35.549519Z","signature_b64":"YseHM8KTHNqZy0oNxAmzkg/+wLUiDYW2Mb36ea6yFs0+1EwbTfdt9Nd7I2GfjiCrT4RtKaO8zmk/nobaZis1DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20f21021d35aa751f3953c622105bb1eafb04a29aec7bc3cf3992d943184d84f","last_reissued_at":"2026-05-18T00:50:35.548832Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:35.548832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight lower bounds for the complexity of multicoloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Arkadiusz Soca{\\l}a, {\\L}ukasz Kowalik, Marcin Wrochna, Marthe Bonamy, Micha{\\l} Pilipczuk","submitted_at":"2016-07-12T16:38:13Z","abstract_excerpt":"In the multicoloring problem, also known as ($a$:$b$)-coloring or $b$-fold coloring, we are given a graph G and a set of $a$ colors, and the task is to assign a subset of $b$ colors to each vertex of G so that adjacent vertices receive disjoint color subsets. This natural generalization of the classic coloring problem (the $b=1$ case) is equivalent to finding a homomorphism to the Kneser graph $KG_{a,b}$, and gives relaxations approaching the fractional chromatic number.\n  We study the complexity of determining whether a graph has an ($a$:$b$)-coloring. Our main result is that this problem doe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.03432","kind":"arxiv","version":3},"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":"1607.03432","created_at":"2026-05-18T00:50:35.548919+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.03432v3","created_at":"2026-05-18T00:50:35.548919+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.03432","created_at":"2026-05-18T00:50:35.548919+00:00"},{"alias_kind":"pith_short_12","alias_value":"EDZBAIOTLKTV","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"EDZBAIOTLKTVD44V","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"EDZBAIOT","created_at":"2026-05-18T12:30:12.583610+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/EDZBAIOTLKTVD44VHRRCCBN3D2","json":"https://pith.science/pith/EDZBAIOTLKTVD44VHRRCCBN3D2.json","graph_json":"https://pith.science/api/pith-number/EDZBAIOTLKTVD44VHRRCCBN3D2/graph.json","events_json":"https://pith.science/api/pith-number/EDZBAIOTLKTVD44VHRRCCBN3D2/events.json","paper":"https://pith.science/paper/EDZBAIOT"},"agent_actions":{"view_html":"https://pith.science/pith/EDZBAIOTLKTVD44VHRRCCBN3D2","download_json":"https://pith.science/pith/EDZBAIOTLKTVD44VHRRCCBN3D2.json","view_paper":"https://pith.science/paper/EDZBAIOT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.03432&json=true","fetch_graph":"https://pith.science/api/pith-number/EDZBAIOTLKTVD44VHRRCCBN3D2/graph.json","fetch_events":"https://pith.science/api/pith-number/EDZBAIOTLKTVD44VHRRCCBN3D2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EDZBAIOTLKTVD44VHRRCCBN3D2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EDZBAIOTLKTVD44VHRRCCBN3D2/action/storage_attestation","attest_author":"https://pith.science/pith/EDZBAIOTLKTVD44VHRRCCBN3D2/action/author_attestation","sign_citation":"https://pith.science/pith/EDZBAIOTLKTVD44VHRRCCBN3D2/action/citation_signature","submit_replication":"https://pith.science/pith/EDZBAIOTLKTVD44VHRRCCBN3D2/action/replication_record"}},"created_at":"2026-05-18T00:50:35.548919+00:00","updated_at":"2026-05-18T00:50:35.548919+00:00"}