{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:UF7Q3VIRXKL5W45QMTUSADWIJ3","short_pith_number":"pith:UF7Q3VIR","canonical_record":{"source":{"id":"1411.4364","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-17T05:16:20Z","cross_cats_sorted":[],"title_canon_sha256":"00775be9f73be597bd95e3301aa7f77dc291f522fd26823cdc63f5e50952bb3d","abstract_canon_sha256":"87961c679fe3afa5c8801ed5bdf0a5ea367aa8203c6153673094e2ecf4fc053d"},"schema_version":"1.0"},"canonical_sha256":"a17f0dd511ba97db73b064e9200ec84ed4c4950031d3bb4efa36acf56014c94c","source":{"kind":"arxiv","id":"1411.4364","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.4364","created_at":"2026-05-18T02:35:45Z"},{"alias_kind":"arxiv_version","alias_value":"1411.4364v1","created_at":"2026-05-18T02:35:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4364","created_at":"2026-05-18T02:35:45Z"},{"alias_kind":"pith_short_12","alias_value":"UF7Q3VIRXKL5","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UF7Q3VIRXKL5W45Q","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UF7Q3VIR","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:UF7Q3VIRXKL5W45QMTUSADWIJ3","target":"record","payload":{"canonical_record":{"source":{"id":"1411.4364","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-17T05:16:20Z","cross_cats_sorted":[],"title_canon_sha256":"00775be9f73be597bd95e3301aa7f77dc291f522fd26823cdc63f5e50952bb3d","abstract_canon_sha256":"87961c679fe3afa5c8801ed5bdf0a5ea367aa8203c6153673094e2ecf4fc053d"},"schema_version":"1.0"},"canonical_sha256":"a17f0dd511ba97db73b064e9200ec84ed4c4950031d3bb4efa36acf56014c94c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:35:45.858594Z","signature_b64":"n9HzN6L6KJrR4XnLUgh4lg++ALzNbHaI9r3AZRbWJZtT+KNWvl8yb1gY2yU0oquW4Qa63ziONFcFLtfNpjPXBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a17f0dd511ba97db73b064e9200ec84ed4c4950031d3bb4efa36acf56014c94c","last_reissued_at":"2026-05-18T02:35:45.858174Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:35:45.858174Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.4364","source_version":1,"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:35:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LykKEbPcf7xe4x9P8iAplN0yKIjBB0wXXhMh9l+KJphjMtzvrbuv1YpQOJR/DuQgLiBmQ5oswj1OKY/BSZXzCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T06:01:40.120544Z"},"content_sha256":"d16157593bd01b4e89270886184ecdcd36dadfe3b73532c080e27a0de1b83b79","schema_version":"1.0","event_id":"sha256:d16157593bd01b4e89270886184ecdcd36dadfe3b73532c080e27a0de1b83b79"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:UF7Q3VIRXKL5W45QMTUSADWIJ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximizing proper colorings on graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Humberto Naves, Jie Ma","submitted_at":"2014-11-17T05:16:20Z","abstract_excerpt":"The number of proper $q$-colorings of a graph $G$, denoted by $P_G(q)$, is an important graph parameter that plays fundamental role in graph theory, computational complexity theory and other related fields. We study an old problem of Linial and Wilf to find the graphs with $n$ vertices and $m$ edges which maximize this parameter. This problem has attracted much research interest in recent years, however little is known for general $m,n,q$. Using analytic and combinatorial methods, we characterize the asymptotic structure of extremal graphs for fixed edge density and $q$. Moreover, we disprove "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4364","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"},"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:35:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BwAdZMUr7E4RRT2J4xS8esDdevyHoGUTf/A5XX9scOC1t/xGYgUn5dcgAgfTqTXszy3gxvs1FVcJ1n3OFieYBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T06:01:40.121195Z"},"content_sha256":"a446c8051a6a06fd2449fdfee36275bc72e12aec7f83a7372dc3309bd0338cbf","schema_version":"1.0","event_id":"sha256:a446c8051a6a06fd2449fdfee36275bc72e12aec7f83a7372dc3309bd0338cbf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UF7Q3VIRXKL5W45QMTUSADWIJ3/bundle.json","state_url":"https://pith.science/pith/UF7Q3VIRXKL5W45QMTUSADWIJ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UF7Q3VIRXKL5W45QMTUSADWIJ3/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-06-07T06:01:40Z","links":{"resolver":"https://pith.science/pith/UF7Q3VIRXKL5W45QMTUSADWIJ3","bundle":"https://pith.science/pith/UF7Q3VIRXKL5W45QMTUSADWIJ3/bundle.json","state":"https://pith.science/pith/UF7Q3VIRXKL5W45QMTUSADWIJ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UF7Q3VIRXKL5W45QMTUSADWIJ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:UF7Q3VIRXKL5W45QMTUSADWIJ3","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":"87961c679fe3afa5c8801ed5bdf0a5ea367aa8203c6153673094e2ecf4fc053d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-17T05:16:20Z","title_canon_sha256":"00775be9f73be597bd95e3301aa7f77dc291f522fd26823cdc63f5e50952bb3d"},"schema_version":"1.0","source":{"id":"1411.4364","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.4364","created_at":"2026-05-18T02:35:45Z"},{"alias_kind":"arxiv_version","alias_value":"1411.4364v1","created_at":"2026-05-18T02:35:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4364","created_at":"2026-05-18T02:35:45Z"},{"alias_kind":"pith_short_12","alias_value":"UF7Q3VIRXKL5","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UF7Q3VIRXKL5W45Q","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UF7Q3VIR","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:a446c8051a6a06fd2449fdfee36275bc72e12aec7f83a7372dc3309bd0338cbf","target":"graph","created_at":"2026-05-18T02:35:45Z","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":"The number of proper $q$-colorings of a graph $G$, denoted by $P_G(q)$, is an important graph parameter that plays fundamental role in graph theory, computational complexity theory and other related fields. We study an old problem of Linial and Wilf to find the graphs with $n$ vertices and $m$ edges which maximize this parameter. This problem has attracted much research interest in recent years, however little is known for general $m,n,q$. Using analytic and combinatorial methods, we characterize the asymptotic structure of extremal graphs for fixed edge density and $q$. Moreover, we disprove ","authors_text":"Humberto Naves, Jie Ma","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-17T05:16:20Z","title":"Maximizing proper colorings on graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4364","kind":"arxiv","version":1},"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:d16157593bd01b4e89270886184ecdcd36dadfe3b73532c080e27a0de1b83b79","target":"record","created_at":"2026-05-18T02:35:45Z","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":"87961c679fe3afa5c8801ed5bdf0a5ea367aa8203c6153673094e2ecf4fc053d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-17T05:16:20Z","title_canon_sha256":"00775be9f73be597bd95e3301aa7f77dc291f522fd26823cdc63f5e50952bb3d"},"schema_version":"1.0","source":{"id":"1411.4364","kind":"arxiv","version":1}},"canonical_sha256":"a17f0dd511ba97db73b064e9200ec84ed4c4950031d3bb4efa36acf56014c94c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a17f0dd511ba97db73b064e9200ec84ed4c4950031d3bb4efa36acf56014c94c","first_computed_at":"2026-05-18T02:35:45.858174Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:35:45.858174Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n9HzN6L6KJrR4XnLUgh4lg++ALzNbHaI9r3AZRbWJZtT+KNWvl8yb1gY2yU0oquW4Qa63ziONFcFLtfNpjPXBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:35:45.858594Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.4364","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d16157593bd01b4e89270886184ecdcd36dadfe3b73532c080e27a0de1b83b79","sha256:a446c8051a6a06fd2449fdfee36275bc72e12aec7f83a7372dc3309bd0338cbf"],"state_sha256":"b91afc96951c3d54f0d3f8b73999ffd41f65f9208089f7e5468149112a18c56f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6K9xJq0VVGvhLXyNIRnpW5/KXtteW/3qdfTCYUBoOS3r3UAQhQidGuRlqCHCCTlne2T3tG4Su16vJ9RCSd7gDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T06:01:40.124887Z","bundle_sha256":"e28b63c5bb851cd1b8dae404a504327eeff40d7561c0265a0763b54094e45c2d"}}