{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VPFYEGIBMXF24BABLAKQNBMZOD","short_pith_number":"pith:VPFYEGIB","schema_version":"1.0","canonical_sha256":"abcb82190165cbae0401581506859970c2bf27adcc721632f13a33e7304da0a4","source":{"kind":"arxiv","id":"1502.03977","version":2},"attestation_state":"computed","paper":{"title":"Choosability and paintability of the lexicographic product of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bal\\'azs Keszegh, Xuding Zhu","submitted_at":"2015-02-13T13:13:11Z","abstract_excerpt":"This paper studies the choice number and paint number of the lexicographic product of graphs. We prove that if $G$ has maximum degree $\\Delta$, then for any graph $H$ on $n$ vertices $ch(G[H]) \\le (4\\Delta+2)(ch(H) +\\log_2 n)$ and $\\chi_P(G[H]) \\le (4\\Delta+2) (\\chi_P(H)+ \\log_2 n)$."},"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":"1502.03977","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-13T13:13:11Z","cross_cats_sorted":[],"title_canon_sha256":"c25669f3ba001f13a84575b8f2d8feab46756b1fbed90396d603c3cfb3af4386","abstract_canon_sha256":"c5273873e9e9cd97dfdff64da32b061e39084e0a1ee840966aac85366f16ea36"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:15.909897Z","signature_b64":"At71VQf0eK17gSmdmy1K0rYnaZEkxKcdhYf2kDLuAyt6ZC+WE30nw3xdE7z47NI3mIDADBeaCbBQptK+4TsfCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abcb82190165cbae0401581506859970c2bf27adcc721632f13a33e7304da0a4","last_reissued_at":"2026-05-18T01:25:15.909312Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:15.909312Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Choosability and paintability of the lexicographic product of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bal\\'azs Keszegh, Xuding Zhu","submitted_at":"2015-02-13T13:13:11Z","abstract_excerpt":"This paper studies the choice number and paint number of the lexicographic product of graphs. We prove that if $G$ has maximum degree $\\Delta$, then for any graph $H$ on $n$ vertices $ch(G[H]) \\le (4\\Delta+2)(ch(H) +\\log_2 n)$ and $\\chi_P(G[H]) \\le (4\\Delta+2) (\\chi_P(H)+ \\log_2 n)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03977","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":""},"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":"1502.03977","created_at":"2026-05-18T01:25:15.909422+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.03977v2","created_at":"2026-05-18T01:25:15.909422+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03977","created_at":"2026-05-18T01:25:15.909422+00:00"},{"alias_kind":"pith_short_12","alias_value":"VPFYEGIBMXF2","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"VPFYEGIBMXF24BAB","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"VPFYEGIB","created_at":"2026-05-18T12:29:47.479230+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/VPFYEGIBMXF24BABLAKQNBMZOD","json":"https://pith.science/pith/VPFYEGIBMXF24BABLAKQNBMZOD.json","graph_json":"https://pith.science/api/pith-number/VPFYEGIBMXF24BABLAKQNBMZOD/graph.json","events_json":"https://pith.science/api/pith-number/VPFYEGIBMXF24BABLAKQNBMZOD/events.json","paper":"https://pith.science/paper/VPFYEGIB"},"agent_actions":{"view_html":"https://pith.science/pith/VPFYEGIBMXF24BABLAKQNBMZOD","download_json":"https://pith.science/pith/VPFYEGIBMXF24BABLAKQNBMZOD.json","view_paper":"https://pith.science/paper/VPFYEGIB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.03977&json=true","fetch_graph":"https://pith.science/api/pith-number/VPFYEGIBMXF24BABLAKQNBMZOD/graph.json","fetch_events":"https://pith.science/api/pith-number/VPFYEGIBMXF24BABLAKQNBMZOD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VPFYEGIBMXF24BABLAKQNBMZOD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VPFYEGIBMXF24BABLAKQNBMZOD/action/storage_attestation","attest_author":"https://pith.science/pith/VPFYEGIBMXF24BABLAKQNBMZOD/action/author_attestation","sign_citation":"https://pith.science/pith/VPFYEGIBMXF24BABLAKQNBMZOD/action/citation_signature","submit_replication":"https://pith.science/pith/VPFYEGIBMXF24BABLAKQNBMZOD/action/replication_record"}},"created_at":"2026-05-18T01:25:15.909422+00:00","updated_at":"2026-05-18T01:25:15.909422+00:00"}