{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:BLEG2P2RNP2XCU637RO3NE3LJO","short_pith_number":"pith:BLEG2P2R","canonical_record":{"source":{"id":"1506.05388","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-17T17:27:22Z","cross_cats_sorted":[],"title_canon_sha256":"ada67b6beced9692ac65e701ff3429a0c63503bbc487ff9a5ba5e1d68b0ed658","abstract_canon_sha256":"aab8650fdb954ecfdfc1576b6c14b7fc4f5e2b5716aadd3006135043d3b187c4"},"schema_version":"1.0"},"canonical_sha256":"0ac86d3f516bf57153dbfc5db6936b4b951ddc4641f108d21e6864429194fbc9","source":{"kind":"arxiv","id":"1506.05388","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.05388","created_at":"2026-05-18T01:01:45Z"},{"alias_kind":"arxiv_version","alias_value":"1506.05388v2","created_at":"2026-05-18T01:01:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.05388","created_at":"2026-05-18T01:01:45Z"},{"alias_kind":"pith_short_12","alias_value":"BLEG2P2RNP2X","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BLEG2P2RNP2XCU63","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BLEG2P2R","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:BLEG2P2RNP2XCU637RO3NE3LJO","target":"record","payload":{"canonical_record":{"source":{"id":"1506.05388","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-17T17:27:22Z","cross_cats_sorted":[],"title_canon_sha256":"ada67b6beced9692ac65e701ff3429a0c63503bbc487ff9a5ba5e1d68b0ed658","abstract_canon_sha256":"aab8650fdb954ecfdfc1576b6c14b7fc4f5e2b5716aadd3006135043d3b187c4"},"schema_version":"1.0"},"canonical_sha256":"0ac86d3f516bf57153dbfc5db6936b4b951ddc4641f108d21e6864429194fbc9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:45.082194Z","signature_b64":"nFkp1MvKLlfZ8R1J4xONqZKYJPhR8T/47Z/LaCVis6kBnjNNWzoJyTlL0tNXcCIIseaaj5hCAAWZmlXQ9IW2AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ac86d3f516bf57153dbfc5db6936b4b951ddc4641f108d21e6864429194fbc9","last_reissued_at":"2026-05-18T01:01:45.081553Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:45.081553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.05388","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:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DpNE/nfVdMv+VWLVi1P04iaAF+RoYZvFHDSMkk+KRM+nxdgHgmQoynqJrTWqEtSvHQS3bQuPEQNBZZHzPEvhDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T02:58:19.476875Z"},"content_sha256":"33ee063ad6ba72b954b1363c76ae6991622d75a41ed6e74a42810497f21ab48f","schema_version":"1.0","event_id":"sha256:33ee063ad6ba72b954b1363c76ae6991622d75a41ed6e74a42810497f21ab48f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:BLEG2P2RNP2XCU637RO3NE3LJO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extremal H-colorings of trees and 2-connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Galvin, John Engbers","submitted_at":"2015-06-17T17:27:22Z","abstract_excerpt":"For graphs $G$ and $H$, an $H$-coloring of $G$ is an adjacency preserving map from the vertices of $G$ to the vertices of $H$. $H$-colorings generalize such notions as independent sets and proper colorings in graphs. There has been much recent research on the extremal question of finding the graph(s) among a fixed family that maximize or minimize the number of $H$-colorings. In this paper, we prove several results in this area.\n  First, we find a class of graphs ${\\mathcal H}$ with the property that for each $H \\in {\\mathcal H}$, the $n$-vertex tree that minimizes the number of $H$-colorings i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.05388","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:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qgaYBw7Fs000TZOIciKGLlBR8cagUhA6AsQRKE/y4ZCFy72JoB/4wQAdnScrfVu3hGZFdrC1RrFkoiSiVHE7Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T02:58:19.477241Z"},"content_sha256":"7567e8ccaaa9b73fb7067fd48650be5a0c916221720363382582d359b1f87977","schema_version":"1.0","event_id":"sha256:7567e8ccaaa9b73fb7067fd48650be5a0c916221720363382582d359b1f87977"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BLEG2P2RNP2XCU637RO3NE3LJO/bundle.json","state_url":"https://pith.science/pith/BLEG2P2RNP2XCU637RO3NE3LJO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BLEG2P2RNP2XCU637RO3NE3LJO/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:58:19Z","links":{"resolver":"https://pith.science/pith/BLEG2P2RNP2XCU637RO3NE3LJO","bundle":"https://pith.science/pith/BLEG2P2RNP2XCU637RO3NE3LJO/bundle.json","state":"https://pith.science/pith/BLEG2P2RNP2XCU637RO3NE3LJO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BLEG2P2RNP2XCU637RO3NE3LJO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BLEG2P2RNP2XCU637RO3NE3LJO","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":"aab8650fdb954ecfdfc1576b6c14b7fc4f5e2b5716aadd3006135043d3b187c4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-17T17:27:22Z","title_canon_sha256":"ada67b6beced9692ac65e701ff3429a0c63503bbc487ff9a5ba5e1d68b0ed658"},"schema_version":"1.0","source":{"id":"1506.05388","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.05388","created_at":"2026-05-18T01:01:45Z"},{"alias_kind":"arxiv_version","alias_value":"1506.05388v2","created_at":"2026-05-18T01:01:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.05388","created_at":"2026-05-18T01:01:45Z"},{"alias_kind":"pith_short_12","alias_value":"BLEG2P2RNP2X","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BLEG2P2RNP2XCU63","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BLEG2P2R","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:7567e8ccaaa9b73fb7067fd48650be5a0c916221720363382582d359b1f87977","target":"graph","created_at":"2026-05-18T01:01: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":"For graphs $G$ and $H$, an $H$-coloring of $G$ is an adjacency preserving map from the vertices of $G$ to the vertices of $H$. $H$-colorings generalize such notions as independent sets and proper colorings in graphs. There has been much recent research on the extremal question of finding the graph(s) among a fixed family that maximize or minimize the number of $H$-colorings. In this paper, we prove several results in this area.\n  First, we find a class of graphs ${\\mathcal H}$ with the property that for each $H \\in {\\mathcal H}$, the $n$-vertex tree that minimizes the number of $H$-colorings i","authors_text":"David Galvin, John Engbers","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-17T17:27:22Z","title":"Extremal H-colorings of trees and 2-connected graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.05388","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:33ee063ad6ba72b954b1363c76ae6991622d75a41ed6e74a42810497f21ab48f","target":"record","created_at":"2026-05-18T01:01: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":"aab8650fdb954ecfdfc1576b6c14b7fc4f5e2b5716aadd3006135043d3b187c4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-17T17:27:22Z","title_canon_sha256":"ada67b6beced9692ac65e701ff3429a0c63503bbc487ff9a5ba5e1d68b0ed658"},"schema_version":"1.0","source":{"id":"1506.05388","kind":"arxiv","version":2}},"canonical_sha256":"0ac86d3f516bf57153dbfc5db6936b4b951ddc4641f108d21e6864429194fbc9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ac86d3f516bf57153dbfc5db6936b4b951ddc4641f108d21e6864429194fbc9","first_computed_at":"2026-05-18T01:01:45.081553Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:45.081553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nFkp1MvKLlfZ8R1J4xONqZKYJPhR8T/47Z/LaCVis6kBnjNNWzoJyTlL0tNXcCIIseaaj5hCAAWZmlXQ9IW2AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:45.082194Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.05388","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33ee063ad6ba72b954b1363c76ae6991622d75a41ed6e74a42810497f21ab48f","sha256:7567e8ccaaa9b73fb7067fd48650be5a0c916221720363382582d359b1f87977"],"state_sha256":"7c53229e372376df5a778587282a2dbfd9a366721ae6064219f58f777703f39b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mmgirugeUNXaqD2zEoXC10vS5bTJbPu0ZSw1HkdsA2fnOn6EAaobzmbPRIQOzqY0dCvR6+nN9rBpmHT08AqfBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T02:58:19.479188Z","bundle_sha256":"55fa3edca22da96de04738ab23f6e5fe393f1d47461fc7f49a0c902dfaac9dda"}}