{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:APMX3HQUARQJPNZB2IWVZWNZSB","short_pith_number":"pith:APMX3HQU","canonical_record":{"source":{"id":"1307.5919","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-23T01:17:52Z","cross_cats_sorted":[],"title_canon_sha256":"c724b214d8004c9fdef37200c380d853f9d82210e26f9445ee02d9e718420511","abstract_canon_sha256":"8db19fdf51d7a27e8d0ad1eae8af7a944101eb1ec36b97795d98ed8bd5a7aae0"},"schema_version":"1.0"},"canonical_sha256":"03d97d9e14046097b721d22d5cd9b990590346a568aa47703b594f1c278a7ca5","source":{"kind":"arxiv","id":"1307.5919","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.5919","created_at":"2026-05-18T01:01:49Z"},{"alias_kind":"arxiv_version","alias_value":"1307.5919v2","created_at":"2026-05-18T01:01:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5919","created_at":"2026-05-18T01:01:49Z"},{"alias_kind":"pith_short_12","alias_value":"APMX3HQUARQJ","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"APMX3HQUARQJPNZB","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"APMX3HQU","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:APMX3HQUARQJPNZB2IWVZWNZSB","target":"record","payload":{"canonical_record":{"source":{"id":"1307.5919","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-23T01:17:52Z","cross_cats_sorted":[],"title_canon_sha256":"c724b214d8004c9fdef37200c380d853f9d82210e26f9445ee02d9e718420511","abstract_canon_sha256":"8db19fdf51d7a27e8d0ad1eae8af7a944101eb1ec36b97795d98ed8bd5a7aae0"},"schema_version":"1.0"},"canonical_sha256":"03d97d9e14046097b721d22d5cd9b990590346a568aa47703b594f1c278a7ca5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:49.708764Z","signature_b64":"3OZ+n6qjN6O71BnUtxuRv1UQA7peTYR21zh7bQNYDKajkhk41ftv8VUjwCU9/tmonWaGSJRAbZuIgMB/BdwsBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03d97d9e14046097b721d22d5cd9b990590346a568aa47703b594f1c278a7ca5","last_reissued_at":"2026-05-18T01:01:49.707819Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:49.707819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.5919","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-18T01:01:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uoYC7RePB9L764KpAPE2ZzGEfgLCB6olt43PIQjW5g51g2rZRDzkt/bDKotdv4Te3xVDphpo72R3jvqdTJdtDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T02:03:12.551933Z"},"content_sha256":"2abe9db0c51d7be42312a6ba578922548817749ed5271403de63c88216c3e060","schema_version":"1.0","event_id":"sha256:2abe9db0c51d7be42312a6ba578922548817749ed5271403de63c88216c3e060"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:APMX3HQUARQJPNZB2IWVZWNZSB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extremal H-colorings of graphs with fixed minimum degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"John Engbers","submitted_at":"2013-07-23T01:17:52Z","abstract_excerpt":"For graphs $G$ and $H$, a homomorphism from $G$ to $H$, or $H$-coloring of $G$, is a map from the vertices of $G$ to the vertices of $H$ that preserves adjacency. When $H$ is composed of an edge with one looped endvertex, an $H$-coloring of $G$ corresponds to an independent set in $G$. Galvin showed that, for sufficiently large $n$, the complete bipartite graph $K_{\\delta,n-\\delta}$ is the $n$-vertex graph with minimum degree $\\delta$ that has the largest number of independent sets.\n  In this paper, we begin the project of generalizing this result to arbitrary $H$. Writing $\\hom(G,H)$ for the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5919","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-18T01:01:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3VLBCx6y4YXjEP2dqi3NEeFiWiTGDv2eSbi4AYia+lLmVNbof5gZ1lGDsp9rISeNrTtDuqdBwCchiFkpEoKdCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T02:03:12.552307Z"},"content_sha256":"4505d1e20f4864b99d1c229c188d117133a7ca2c6070663df7b9adab8f14b962","schema_version":"1.0","event_id":"sha256:4505d1e20f4864b99d1c229c188d117133a7ca2c6070663df7b9adab8f14b962"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/APMX3HQUARQJPNZB2IWVZWNZSB/bundle.json","state_url":"https://pith.science/pith/APMX3HQUARQJPNZB2IWVZWNZSB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/APMX3HQUARQJPNZB2IWVZWNZSB/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-29T02:03:12Z","links":{"resolver":"https://pith.science/pith/APMX3HQUARQJPNZB2IWVZWNZSB","bundle":"https://pith.science/pith/APMX3HQUARQJPNZB2IWVZWNZSB/bundle.json","state":"https://pith.science/pith/APMX3HQUARQJPNZB2IWVZWNZSB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/APMX3HQUARQJPNZB2IWVZWNZSB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:APMX3HQUARQJPNZB2IWVZWNZSB","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":"8db19fdf51d7a27e8d0ad1eae8af7a944101eb1ec36b97795d98ed8bd5a7aae0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-23T01:17:52Z","title_canon_sha256":"c724b214d8004c9fdef37200c380d853f9d82210e26f9445ee02d9e718420511"},"schema_version":"1.0","source":{"id":"1307.5919","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.5919","created_at":"2026-05-18T01:01:49Z"},{"alias_kind":"arxiv_version","alias_value":"1307.5919v2","created_at":"2026-05-18T01:01:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5919","created_at":"2026-05-18T01:01:49Z"},{"alias_kind":"pith_short_12","alias_value":"APMX3HQUARQJ","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"APMX3HQUARQJPNZB","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"APMX3HQU","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:4505d1e20f4864b99d1c229c188d117133a7ca2c6070663df7b9adab8f14b962","target":"graph","created_at":"2026-05-18T01:01:49Z","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$, a homomorphism from $G$ to $H$, or $H$-coloring of $G$, is a map from the vertices of $G$ to the vertices of $H$ that preserves adjacency. When $H$ is composed of an edge with one looped endvertex, an $H$-coloring of $G$ corresponds to an independent set in $G$. Galvin showed that, for sufficiently large $n$, the complete bipartite graph $K_{\\delta,n-\\delta}$ is the $n$-vertex graph with minimum degree $\\delta$ that has the largest number of independent sets.\n  In this paper, we begin the project of generalizing this result to arbitrary $H$. Writing $\\hom(G,H)$ for the ","authors_text":"John Engbers","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-23T01:17:52Z","title":"Extremal H-colorings of graphs with fixed minimum degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5919","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:2abe9db0c51d7be42312a6ba578922548817749ed5271403de63c88216c3e060","target":"record","created_at":"2026-05-18T01:01:49Z","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":"8db19fdf51d7a27e8d0ad1eae8af7a944101eb1ec36b97795d98ed8bd5a7aae0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-23T01:17:52Z","title_canon_sha256":"c724b214d8004c9fdef37200c380d853f9d82210e26f9445ee02d9e718420511"},"schema_version":"1.0","source":{"id":"1307.5919","kind":"arxiv","version":2}},"canonical_sha256":"03d97d9e14046097b721d22d5cd9b990590346a568aa47703b594f1c278a7ca5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03d97d9e14046097b721d22d5cd9b990590346a568aa47703b594f1c278a7ca5","first_computed_at":"2026-05-18T01:01:49.707819Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:49.707819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3OZ+n6qjN6O71BnUtxuRv1UQA7peTYR21zh7bQNYDKajkhk41ftv8VUjwCU9/tmonWaGSJRAbZuIgMB/BdwsBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:49.708764Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.5919","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2abe9db0c51d7be42312a6ba578922548817749ed5271403de63c88216c3e060","sha256:4505d1e20f4864b99d1c229c188d117133a7ca2c6070663df7b9adab8f14b962"],"state_sha256":"19970488fbae15c549d6ed4fb40583742a27d73033d8742690311b03890d7e83"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YeWN/SypHI6X/MeuQRvcSiTSY8YwoKej0xncj/H59gpp4LTzy2luU8lVUCrbMsNSBgk24mdrNzw7RaPcb/zqDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T02:03:12.554847Z","bundle_sha256":"432b377f8521fd1ef3688eab17afe92c8e2ea89d90a38d3b58eb5940b737dcd9"}}