{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HHL3EBUCZQWR6YHCDVAYH2V42R","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":"be1c44b24cc06931e1d82148240e038407aab50a38e6ce4af1199a47fa995f84","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-19T19:24:18Z","title_canon_sha256":"2b52477b5e7dfb4257790b485936ddb9d871557dbfe1cbd54b82978e0506bf60"},"schema_version":"1.0","source":{"id":"1601.05040","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.05040","created_at":"2026-05-18T01:01:44Z"},{"alias_kind":"arxiv_version","alias_value":"1601.05040v2","created_at":"2026-05-18T01:01:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05040","created_at":"2026-05-18T01:01:44Z"},{"alias_kind":"pith_short_12","alias_value":"HHL3EBUCZQWR","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HHL3EBUCZQWR6YHC","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HHL3EBUC","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:641c645ad3259a97a87bb146fac2dbc9e174a255c336c2b806bb3a79966cf2bb","target":"graph","created_at":"2026-05-18T01:01:44Z","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":"For graphs $G$ and $H$, an $H$-coloring of $G$ is a map from the vertices of $G$ to the vertices of $H$ that preserves edge adjacency. We consider the following extremal enumerative question: for a given $H$, which connected $n$-vertex graph with minimum degree $\\delta$ maximizes the number of $H$-colorings? We show that for non-regular $H$ and sufficiently large $n$, the complete bipartite graph $K_{\\delta,n-\\delta}$ is the unique maximizer. As a corollary, for non-regular $H$ and sufficiently large $n$ the graph $K_{k,n-k}$ is the unique $k$-connected graph that maximizes the number of $H$-c","authors_text":"John Engbers","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-19T19:24:18Z","title":"Maximizing $H$-colorings of connected graphs with fixed minimum degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05040","kind":"arxiv","version":2},"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:a231fe297ba9fe6c00258cedc9631ab081e884b19aaf0a342e8fbf02421da5c8","target":"record","created_at":"2026-05-18T01:01:44Z","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":"be1c44b24cc06931e1d82148240e038407aab50a38e6ce4af1199a47fa995f84","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-19T19:24:18Z","title_canon_sha256":"2b52477b5e7dfb4257790b485936ddb9d871557dbfe1cbd54b82978e0506bf60"},"schema_version":"1.0","source":{"id":"1601.05040","kind":"arxiv","version":2}},"canonical_sha256":"39d7b20682cc2d1f60e21d4183eabcd47d0da9a64b0c42de694285a1f201d91d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"39d7b20682cc2d1f60e21d4183eabcd47d0da9a64b0c42de694285a1f201d91d","first_computed_at":"2026-05-18T01:01:44.698476Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:44.698476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Zrpt+vuj2E9hwzcd3jlphGnyKgOprQZOGpYa9tcmdCjFvOLJGui6mEH5NE5nAxg5Qj2TvsE5Y07XBWYYkjpKAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:44.699274Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.05040","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a231fe297ba9fe6c00258cedc9631ab081e884b19aaf0a342e8fbf02421da5c8","sha256:641c645ad3259a97a87bb146fac2dbc9e174a255c336c2b806bb3a79966cf2bb"],"state_sha256":"01f28daa14d29f4263d75ea94f6624148e6d41f44e61740a47c194cc8273fd3a"}