{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:FVV3G2UST2PK6B3GZOZXR25YZA","short_pith_number":"pith:FVV3G2US","canonical_record":{"source":{"id":"1502.06032","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-20T23:05:24Z","cross_cats_sorted":[],"title_canon_sha256":"03436538de961779dced5ab140f1ba8613111a31481d95e186d83ae2042f49e8","abstract_canon_sha256":"8716227c22b64bfbde355ff9dd02acd40ab3b35223b3b70fbd62068ff6cf46cc"},"schema_version":"1.0"},"canonical_sha256":"2d6bb36a929e9eaf0766cbb378ebb8c82cb707c526d2592e486ac138ab55b8b9","source":{"kind":"arxiv","id":"1502.06032","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.06032","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"arxiv_version","alias_value":"1502.06032v1","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.06032","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"pith_short_12","alias_value":"FVV3G2UST2PK","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"FVV3G2UST2PK6B3G","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"FVV3G2US","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:FVV3G2UST2PK6B3GZOZXR25YZA","target":"record","payload":{"canonical_record":{"source":{"id":"1502.06032","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-20T23:05:24Z","cross_cats_sorted":[],"title_canon_sha256":"03436538de961779dced5ab140f1ba8613111a31481d95e186d83ae2042f49e8","abstract_canon_sha256":"8716227c22b64bfbde355ff9dd02acd40ab3b35223b3b70fbd62068ff6cf46cc"},"schema_version":"1.0"},"canonical_sha256":"2d6bb36a929e9eaf0766cbb378ebb8c82cb707c526d2592e486ac138ab55b8b9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:38.231492Z","signature_b64":"+Wuwf/DGqF6hC99TTUtuahmqqAIUFMAi/HxoNm5k8VRHJ2WvvCHJLc10/CQeKw3zU0/33I59Yt4/aDxGqspPCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d6bb36a929e9eaf0766cbb378ebb8c82cb707c526d2592e486ac138ab55b8b9","last_reissued_at":"2026-05-18T02:26:38.231089Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:38.231089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.06032","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:26:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qPOgoBhj5u6ANyI+Asr+qMNY442jOM4jx+nsCElWgcAGKMvoFT6nMGLnxrI71yJZ9VgnpevbVQ+Q0hEuMIWXCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:05:39.083479Z"},"content_sha256":"43061598a3b2c5fedade6db6607c6be7c1b3403c32800726e0f23449d7ec6622","schema_version":"1.0","event_id":"sha256:43061598a3b2c5fedade6db6607c6be7c1b3403c32800726e0f23449d7ec6622"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:FVV3G2UST2PK6B3GZOZXR25YZA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A note on the shameful conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sukhada Fadnavis","submitted_at":"2015-02-20T23:05:24Z","abstract_excerpt":"Let $P_G(q)$ denote the chromatic polynomial of a graph $G$ on $n$ vertices. The `shameful conjecture' due to Bartels and Welsh states that, $$\\frac{P_G(n)}{P_G(n-1)} \\geq \\frac{n^n}{(n-1)^n}.$$ Let $\\mu(G)$ denote the expected number of colors used in a uniformly random proper $n$-coloring of $G$. The above inequality can be interpreted as saying that $\\mu(G) \\geq \\mu(O_n)$, where $O_n$ is the empty graph on $n$ nodes. This conjecture was proved by F. M. Dong, who in fact showed that, $$\\frac{P_G(q)}{P_G(q-1)} \\geq \\frac{q^n}{(q-1)^n}$$ for all $q \\geq n$. There are examples showing that this"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.06032","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:26:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ikP0UabUMm0CIo2ooMGGgNK27t8i5BORwk0tcakhyMPwo2bvDp0utnMwDnPxJfR4yI50Fl1s9v/dmPDQ6cZYBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:05:39.083891Z"},"content_sha256":"08af25b9adb0660ad3aa84562a93289847b31f5af3297753ae1b13f9b03ee7e6","schema_version":"1.0","event_id":"sha256:08af25b9adb0660ad3aa84562a93289847b31f5af3297753ae1b13f9b03ee7e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FVV3G2UST2PK6B3GZOZXR25YZA/bundle.json","state_url":"https://pith.science/pith/FVV3G2UST2PK6B3GZOZXR25YZA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FVV3G2UST2PK6B3GZOZXR25YZA/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-02T21:05:39Z","links":{"resolver":"https://pith.science/pith/FVV3G2UST2PK6B3GZOZXR25YZA","bundle":"https://pith.science/pith/FVV3G2UST2PK6B3GZOZXR25YZA/bundle.json","state":"https://pith.science/pith/FVV3G2UST2PK6B3GZOZXR25YZA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FVV3G2UST2PK6B3GZOZXR25YZA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FVV3G2UST2PK6B3GZOZXR25YZA","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":"8716227c22b64bfbde355ff9dd02acd40ab3b35223b3b70fbd62068ff6cf46cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-20T23:05:24Z","title_canon_sha256":"03436538de961779dced5ab140f1ba8613111a31481d95e186d83ae2042f49e8"},"schema_version":"1.0","source":{"id":"1502.06032","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.06032","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"arxiv_version","alias_value":"1502.06032v1","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.06032","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"pith_short_12","alias_value":"FVV3G2UST2PK","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"FVV3G2UST2PK6B3G","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"FVV3G2US","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:08af25b9adb0660ad3aa84562a93289847b31f5af3297753ae1b13f9b03ee7e6","target":"graph","created_at":"2026-05-18T02:26:38Z","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 chromatic polynomial of a graph $G$ on $n$ vertices. The `shameful conjecture' due to Bartels and Welsh states that, $$\\frac{P_G(n)}{P_G(n-1)} \\geq \\frac{n^n}{(n-1)^n}.$$ Let $\\mu(G)$ denote the expected number of colors used in a uniformly random proper $n$-coloring of $G$. The above inequality can be interpreted as saying that $\\mu(G) \\geq \\mu(O_n)$, where $O_n$ is the empty graph on $n$ nodes. This conjecture was proved by F. M. Dong, who in fact showed that, $$\\frac{P_G(q)}{P_G(q-1)} \\geq \\frac{q^n}{(q-1)^n}$$ for all $q \\geq n$. There are examples showing that this","authors_text":"Sukhada Fadnavis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-20T23:05:24Z","title":"A note on the shameful conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.06032","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:43061598a3b2c5fedade6db6607c6be7c1b3403c32800726e0f23449d7ec6622","target":"record","created_at":"2026-05-18T02:26:38Z","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":"8716227c22b64bfbde355ff9dd02acd40ab3b35223b3b70fbd62068ff6cf46cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-20T23:05:24Z","title_canon_sha256":"03436538de961779dced5ab140f1ba8613111a31481d95e186d83ae2042f49e8"},"schema_version":"1.0","source":{"id":"1502.06032","kind":"arxiv","version":1}},"canonical_sha256":"2d6bb36a929e9eaf0766cbb378ebb8c82cb707c526d2592e486ac138ab55b8b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d6bb36a929e9eaf0766cbb378ebb8c82cb707c526d2592e486ac138ab55b8b9","first_computed_at":"2026-05-18T02:26:38.231089Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:38.231089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+Wuwf/DGqF6hC99TTUtuahmqqAIUFMAi/HxoNm5k8VRHJ2WvvCHJLc10/CQeKw3zU0/33I59Yt4/aDxGqspPCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:38.231492Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.06032","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:43061598a3b2c5fedade6db6607c6be7c1b3403c32800726e0f23449d7ec6622","sha256:08af25b9adb0660ad3aa84562a93289847b31f5af3297753ae1b13f9b03ee7e6"],"state_sha256":"289e3e6c31b8ad84d319f2096cfaca03e962313d4eeca64549a5fd97ee00785a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gq/vxVNKiXgOgf6yzmnHowsdNqQCDYwMeYQkGm/kHOChVMxdCbewqTUSR48HwNGWwiY+KOtXUPPcW4pLG01+AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:05:39.086099Z","bundle_sha256":"4cf86056ef56bb9ef42e3c26357b5b9432983906aca8b726f1fe7a435deb7ce6"}}