{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BYX2TZ5UPF7BLC7GYPWT6Z3KN6","short_pith_number":"pith:BYX2TZ5U","canonical_record":{"source":{"id":"1611.02911","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-09T13:11:06Z","cross_cats_sorted":[],"title_canon_sha256":"a9303f64f14a8af369a17429319aecc485cb20490cafdd34830efa5fd3362242","abstract_canon_sha256":"6bd8975bac38a766b7f85a6d8f3799fd39192df6c85b8f23baa9b7107882e2cc"},"schema_version":"1.0"},"canonical_sha256":"0e2fa9e7b4797e158be6c3ed3f676a6fa9bbab37f2012e2efc1d5c9df67692ff","source":{"kind":"arxiv","id":"1611.02911","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.02911","created_at":"2026-05-17T23:58:31Z"},{"alias_kind":"arxiv_version","alias_value":"1611.02911v2","created_at":"2026-05-17T23:58:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02911","created_at":"2026-05-17T23:58:31Z"},{"alias_kind":"pith_short_12","alias_value":"BYX2TZ5UPF7B","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BYX2TZ5UPF7BLC7G","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BYX2TZ5U","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BYX2TZ5UPF7BLC7GYPWT6Z3KN6","target":"record","payload":{"canonical_record":{"source":{"id":"1611.02911","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-09T13:11:06Z","cross_cats_sorted":[],"title_canon_sha256":"a9303f64f14a8af369a17429319aecc485cb20490cafdd34830efa5fd3362242","abstract_canon_sha256":"6bd8975bac38a766b7f85a6d8f3799fd39192df6c85b8f23baa9b7107882e2cc"},"schema_version":"1.0"},"canonical_sha256":"0e2fa9e7b4797e158be6c3ed3f676a6fa9bbab37f2012e2efc1d5c9df67692ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:31.340513Z","signature_b64":"M7uQeqyNob7Kmskhfsmc0PschjcBQVeeDYUrSEpyBZIOqd4dsXJ9+XNZL3Y4XLrPUsqszvRxzfOFd1M/S6YcAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e2fa9e7b4797e158be6c3ed3f676a6fa9bbab37f2012e2efc1d5c9df67692ff","last_reissued_at":"2026-05-17T23:58:31.339851Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:31.339851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.02911","source_version":2,"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-17T23:58:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yHzfBWB9L8/yGk7BpYSi4zsaa5HbyhNqz2AH4PY9q5MzQe89E5ubr+I0ExkAqOHEcO9RrduDE9RgEw4P5D2kDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T23:36:36.667827Z"},"content_sha256":"2cb6b437446280051982163b05859ebe90cc7e7537acc591051ca305a89d78df","schema_version":"1.0","event_id":"sha256:2cb6b437446280051982163b05859ebe90cc7e7537acc591051ca305a89d78df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BYX2TZ5UPF7BLC7GYPWT6Z3KN6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximising $H$-Colourings of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, Hannah Guggiari","submitted_at":"2016-11-09T13:11:06Z","abstract_excerpt":"For graphs $G$ and $H$, an $H$-colouring of $G$ is a map $\\psi:V(G)\\rightarrow V(H)$ such that $ij\\in E(G)\\Rightarrow\\psi(i)\\psi(j)\\in E(H)$. The number of $H$-colourings of $G$ is denoted by $\\hom(G,H)$.\n  We prove the following: for all graphs $H$ and $\\delta\\geq3$, there is a constant $\\kappa(\\delta,H)$ such that, if $n\\geq\\kappa(\\delta,H)$, the graph $K_{\\delta,n-\\delta}$ maximises the number of $H$-colourings among all connected graphs with $n$ vertices and minimum degree $\\delta$. This answers a question of Engbers.\n  We also disprove a conjecture of Engbers on the graph $G$ that maximis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02911","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"},"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-17T23:58:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rSaKQ5xouIuxweuAlViDx6fuHF9QajhVcsYIc6FPSQxrLaWU1V+1hrOt7M7ff7pdb9S+jQ42oFlYRzf1wEF7BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T23:36:36.668158Z"},"content_sha256":"351ce9191d912956183882fc3a77e41d0b84dcdac39f8ca5bb316424de9823e1","schema_version":"1.0","event_id":"sha256:351ce9191d912956183882fc3a77e41d0b84dcdac39f8ca5bb316424de9823e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BYX2TZ5UPF7BLC7GYPWT6Z3KN6/bundle.json","state_url":"https://pith.science/pith/BYX2TZ5UPF7BLC7GYPWT6Z3KN6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BYX2TZ5UPF7BLC7GYPWT6Z3KN6/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-20T23:36:36Z","links":{"resolver":"https://pith.science/pith/BYX2TZ5UPF7BLC7GYPWT6Z3KN6","bundle":"https://pith.science/pith/BYX2TZ5UPF7BLC7GYPWT6Z3KN6/bundle.json","state":"https://pith.science/pith/BYX2TZ5UPF7BLC7GYPWT6Z3KN6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BYX2TZ5UPF7BLC7GYPWT6Z3KN6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BYX2TZ5UPF7BLC7GYPWT6Z3KN6","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":"6bd8975bac38a766b7f85a6d8f3799fd39192df6c85b8f23baa9b7107882e2cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-09T13:11:06Z","title_canon_sha256":"a9303f64f14a8af369a17429319aecc485cb20490cafdd34830efa5fd3362242"},"schema_version":"1.0","source":{"id":"1611.02911","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.02911","created_at":"2026-05-17T23:58:31Z"},{"alias_kind":"arxiv_version","alias_value":"1611.02911v2","created_at":"2026-05-17T23:58:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02911","created_at":"2026-05-17T23:58:31Z"},{"alias_kind":"pith_short_12","alias_value":"BYX2TZ5UPF7B","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BYX2TZ5UPF7BLC7G","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BYX2TZ5U","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:351ce9191d912956183882fc3a77e41d0b84dcdac39f8ca5bb316424de9823e1","target":"graph","created_at":"2026-05-17T23:58:31Z","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$-colouring of $G$ is a map $\\psi:V(G)\\rightarrow V(H)$ such that $ij\\in E(G)\\Rightarrow\\psi(i)\\psi(j)\\in E(H)$. The number of $H$-colourings of $G$ is denoted by $\\hom(G,H)$.\n  We prove the following: for all graphs $H$ and $\\delta\\geq3$, there is a constant $\\kappa(\\delta,H)$ such that, if $n\\geq\\kappa(\\delta,H)$, the graph $K_{\\delta,n-\\delta}$ maximises the number of $H$-colourings among all connected graphs with $n$ vertices and minimum degree $\\delta$. This answers a question of Engbers.\n  We also disprove a conjecture of Engbers on the graph $G$ that maximis","authors_text":"Alex Scott, Hannah Guggiari","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-09T13:11:06Z","title":"Maximising $H$-Colourings of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02911","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:2cb6b437446280051982163b05859ebe90cc7e7537acc591051ca305a89d78df","target":"record","created_at":"2026-05-17T23:58:31Z","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":"6bd8975bac38a766b7f85a6d8f3799fd39192df6c85b8f23baa9b7107882e2cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-09T13:11:06Z","title_canon_sha256":"a9303f64f14a8af369a17429319aecc485cb20490cafdd34830efa5fd3362242"},"schema_version":"1.0","source":{"id":"1611.02911","kind":"arxiv","version":2}},"canonical_sha256":"0e2fa9e7b4797e158be6c3ed3f676a6fa9bbab37f2012e2efc1d5c9df67692ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e2fa9e7b4797e158be6c3ed3f676a6fa9bbab37f2012e2efc1d5c9df67692ff","first_computed_at":"2026-05-17T23:58:31.339851Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:31.339851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M7uQeqyNob7Kmskhfsmc0PschjcBQVeeDYUrSEpyBZIOqd4dsXJ9+XNZL3Y4XLrPUsqszvRxzfOFd1M/S6YcAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:31.340513Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.02911","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2cb6b437446280051982163b05859ebe90cc7e7537acc591051ca305a89d78df","sha256:351ce9191d912956183882fc3a77e41d0b84dcdac39f8ca5bb316424de9823e1"],"state_sha256":"e2389924c1f72475458b40e603645484752baae78d9c7c2e743e780b191caf72"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CQDlfZZ23hRb5xlSASBMZD9xV0KC04Sq7ri94dFOin7sLXeUh9UoMDp/8BKiJ3TQxWzH27drUqtp5rJ+pVwEBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T23:36:36.669957Z","bundle_sha256":"fa1e1ebcc948f5aa1e8e877af623855db9a7a12878d9496ba3fee8c5b39790a8"}}