{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:BLEG2P2RNP2XCU637RO3NE3LJO","short_pith_number":"pith:BLEG2P2R","schema_version":"1.0","canonical_sha256":"0ac86d3f516bf57153dbfc5db6936b4b951ddc4641f108d21e6864429194fbc9","source":{"kind":"arxiv","id":"1506.05388","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1506.05388","created_at":"2026-05-18T01:01:45.081647+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.05388v2","created_at":"2026-05-18T01:01:45.081647+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.05388","created_at":"2026-05-18T01:01:45.081647+00:00"},{"alias_kind":"pith_short_12","alias_value":"BLEG2P2RNP2X","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BLEG2P2RNP2XCU63","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BLEG2P2R","created_at":"2026-05-18T12:29:14.074870+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BLEG2P2RNP2XCU637RO3NE3LJO","json":"https://pith.science/pith/BLEG2P2RNP2XCU637RO3NE3LJO.json","graph_json":"https://pith.science/api/pith-number/BLEG2P2RNP2XCU637RO3NE3LJO/graph.json","events_json":"https://pith.science/api/pith-number/BLEG2P2RNP2XCU637RO3NE3LJO/events.json","paper":"https://pith.science/paper/BLEG2P2R"},"agent_actions":{"view_html":"https://pith.science/pith/BLEG2P2RNP2XCU637RO3NE3LJO","download_json":"https://pith.science/pith/BLEG2P2RNP2XCU637RO3NE3LJO.json","view_paper":"https://pith.science/paper/BLEG2P2R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.05388&json=true","fetch_graph":"https://pith.science/api/pith-number/BLEG2P2RNP2XCU637RO3NE3LJO/graph.json","fetch_events":"https://pith.science/api/pith-number/BLEG2P2RNP2XCU637RO3NE3LJO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BLEG2P2RNP2XCU637RO3NE3LJO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BLEG2P2RNP2XCU637RO3NE3LJO/action/storage_attestation","attest_author":"https://pith.science/pith/BLEG2P2RNP2XCU637RO3NE3LJO/action/author_attestation","sign_citation":"https://pith.science/pith/BLEG2P2RNP2XCU637RO3NE3LJO/action/citation_signature","submit_replication":"https://pith.science/pith/BLEG2P2RNP2XCU637RO3NE3LJO/action/replication_record"}},"created_at":"2026-05-18T01:01:45.081647+00:00","updated_at":"2026-05-18T01:01:45.081647+00:00"}