{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:MPDCMAK2CISMDVAWM7IE23ORHW","short_pith_number":"pith:MPDCMAK2","canonical_record":{"source":{"id":"0811.2625","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-11-17T04:57:04Z","cross_cats_sorted":[],"title_canon_sha256":"ee85510c6059a1f4a25eeb83d5f46527c19b262bb1b954fec4c90b4d02d20ad3","abstract_canon_sha256":"ed4cae991a339fed30c6f890a3f1625860547b96a7a021ab8e5163d69b1f590b"},"schema_version":"1.0"},"canonical_sha256":"63c626015a1224c1d41667d04d6dd13da138fe644c96618ee17be04c84b1aaf1","source":{"kind":"arxiv","id":"0811.2625","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0811.2625","created_at":"2026-05-18T02:24:56Z"},{"alias_kind":"arxiv_version","alias_value":"0811.2625v3","created_at":"2026-05-18T02:24:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.2625","created_at":"2026-05-18T02:24:56Z"},{"alias_kind":"pith_short_12","alias_value":"MPDCMAK2CISM","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"MPDCMAK2CISMDVAW","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"MPDCMAK2","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:MPDCMAK2CISMDVAWM7IE23ORHW","target":"record","payload":{"canonical_record":{"source":{"id":"0811.2625","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-11-17T04:57:04Z","cross_cats_sorted":[],"title_canon_sha256":"ee85510c6059a1f4a25eeb83d5f46527c19b262bb1b954fec4c90b4d02d20ad3","abstract_canon_sha256":"ed4cae991a339fed30c6f890a3f1625860547b96a7a021ab8e5163d69b1f590b"},"schema_version":"1.0"},"canonical_sha256":"63c626015a1224c1d41667d04d6dd13da138fe644c96618ee17be04c84b1aaf1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:56.809781Z","signature_b64":"ldWECK3qL9iNliR5BvwJce1GbM0JRtONev127dXhi1SLyex6QtIF63sI9W7ngKkFRPrf40p3sQTgRZKgi9nWCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63c626015a1224c1d41667d04d6dd13da138fe644c96618ee17be04c84b1aaf1","last_reissued_at":"2026-05-18T02:24:56.809096Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:56.809096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0811.2625","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:24:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TVELRTTrtSty/iYIoQTwNFt33BX/Zg/4rJxEXhCGU6NCRBXo9lgNwMdk6KSj75K3v2IoJ/J+2BzdrG+GdZVIDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:50:18.298783Z"},"content_sha256":"7e3a2fd2c3e98cfec49d785373c5324deed0164f8a4804db88d9cc0827fd26ab","schema_version":"1.0","event_id":"sha256:7e3a2fd2c3e98cfec49d785373c5324deed0164f8a4804db88d9cc0827fd26ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:MPDCMAK2CISMDVAWM7IE23ORHW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximizing the number of q-colorings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Oleg Pikhurko, Po-Shen Loh","submitted_at":"2008-11-17T04:57:04Z","abstract_excerpt":"Let P_G(q) denote the number of proper q-colorings of a graph G. This function, called the chromatic polynomial of G, was introduced by Birkhoff in 1912, who sought to attack the famous four-color problem by minimizing P_G(4) over all planar graphs G. Since then, motivated by a variety of applications, much research was done on minimizing or maximizing P_G(q) over various families of graphs.\n  In this paper, we study an old problem of Linial and Wilf, to find the graphs with n vertices and m edges which maximize the number of q-colorings. We provide the first approach which enables one to solv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0811.2625","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:24:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w3Lk5x+R6DoHx/Tt+SZS5JrwNCp/TZWYJe3Ak0yaoL1+QQYBBi2vWdPfL5hTdW0kC4Yi/pWp8E7QtvnJQOyjAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:50:18.299160Z"},"content_sha256":"f677e32fd56ff197328eba1fe93c0874400c8da3bfbcb4f6c69aa8206dd1566a","schema_version":"1.0","event_id":"sha256:f677e32fd56ff197328eba1fe93c0874400c8da3bfbcb4f6c69aa8206dd1566a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MPDCMAK2CISMDVAWM7IE23ORHW/bundle.json","state_url":"https://pith.science/pith/MPDCMAK2CISMDVAWM7IE23ORHW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MPDCMAK2CISMDVAWM7IE23ORHW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-29T22:50:18Z","links":{"resolver":"https://pith.science/pith/MPDCMAK2CISMDVAWM7IE23ORHW","bundle":"https://pith.science/pith/MPDCMAK2CISMDVAWM7IE23ORHW/bundle.json","state":"https://pith.science/pith/MPDCMAK2CISMDVAWM7IE23ORHW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MPDCMAK2CISMDVAWM7IE23ORHW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:MPDCMAK2CISMDVAWM7IE23ORHW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ed4cae991a339fed30c6f890a3f1625860547b96a7a021ab8e5163d69b1f590b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-11-17T04:57:04Z","title_canon_sha256":"ee85510c6059a1f4a25eeb83d5f46527c19b262bb1b954fec4c90b4d02d20ad3"},"schema_version":"1.0","source":{"id":"0811.2625","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0811.2625","created_at":"2026-05-18T02:24:56Z"},{"alias_kind":"arxiv_version","alias_value":"0811.2625v3","created_at":"2026-05-18T02:24:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.2625","created_at":"2026-05-18T02:24:56Z"},{"alias_kind":"pith_short_12","alias_value":"MPDCMAK2CISM","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"MPDCMAK2CISMDVAW","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"MPDCMAK2","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:f677e32fd56ff197328eba1fe93c0874400c8da3bfbcb4f6c69aa8206dd1566a","target":"graph","created_at":"2026-05-18T02:24:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Let P_G(q) denote the number of proper q-colorings of a graph G. This function, called the chromatic polynomial of G, was introduced by Birkhoff in 1912, who sought to attack the famous four-color problem by minimizing P_G(4) over all planar graphs G. Since then, motivated by a variety of applications, much research was done on minimizing or maximizing P_G(q) over various families of graphs.\n  In this paper, we study an old problem of Linial and Wilf, to find the graphs with n vertices and m edges which maximize the number of q-colorings. We provide the first approach which enables one to solv","authors_text":"Benny Sudakov, Oleg Pikhurko, Po-Shen Loh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-11-17T04:57:04Z","title":"Maximizing the number of q-colorings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0811.2625","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7e3a2fd2c3e98cfec49d785373c5324deed0164f8a4804db88d9cc0827fd26ab","target":"record","created_at":"2026-05-18T02:24:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ed4cae991a339fed30c6f890a3f1625860547b96a7a021ab8e5163d69b1f590b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-11-17T04:57:04Z","title_canon_sha256":"ee85510c6059a1f4a25eeb83d5f46527c19b262bb1b954fec4c90b4d02d20ad3"},"schema_version":"1.0","source":{"id":"0811.2625","kind":"arxiv","version":3}},"canonical_sha256":"63c626015a1224c1d41667d04d6dd13da138fe644c96618ee17be04c84b1aaf1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"63c626015a1224c1d41667d04d6dd13da138fe644c96618ee17be04c84b1aaf1","first_computed_at":"2026-05-18T02:24:56.809096Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:24:56.809096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ldWECK3qL9iNliR5BvwJce1GbM0JRtONev127dXhi1SLyex6QtIF63sI9W7ngKkFRPrf40p3sQTgRZKgi9nWCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:24:56.809781Z","signed_message":"canonical_sha256_bytes"},"source_id":"0811.2625","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e3a2fd2c3e98cfec49d785373c5324deed0164f8a4804db88d9cc0827fd26ab","sha256:f677e32fd56ff197328eba1fe93c0874400c8da3bfbcb4f6c69aa8206dd1566a"],"state_sha256":"1df7793aac94175459da7312a580370b0d5800c9c4530309e988c5797d8b89f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lXj+zCvnv3j4ow5tx2Qim+a2EEIdFfI6/FGWVdP1i74G0CRMtxPIgs1URzQvUBf9TEy3in/xOdwPwhC4kJHICg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T22:50:18.301607Z","bundle_sha256":"d615182d971797709943c106b9a04e217386f52fb5b3698764c80776ef459903"}}