{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:43N3IT6MEJRO4HX34IHENZATS6","short_pith_number":"pith:43N3IT6M","schema_version":"1.0","canonical_sha256":"e6dbb44fcc2262ee1efbe20e46e4139782bdcc053fb4de1365806d8d5d4a10f6","source":{"kind":"arxiv","id":"1206.3160","version":1},"attestation_state":"computed","paper":{"title":"On weighted graph homomorphisms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Galvin, Prasad Tetali","submitted_at":"2012-06-14T16:09:22Z","abstract_excerpt":"For given graphs $G$ and $H$, let $|Hom(G,H)|$ denote the set of graph homomorphisms from $G$ to $H$. We show that for any finite, $n$-regular, bipartite graph $G$ and any finite graph $H$ (perhaps with loops), $|Hom(G,H)|$ is maximum when $G$ is a disjoint union of $K_{n,n}$'s. This generalizes a result of J. Kahn on the number of independent sets in a regular bipartite graph. We also give the asymptotics of the logarithm of $|Hom(G,H)|$ in terms of a simply expressed parameter of $H$.\n  We also consider weighted versions of these results which may be viewed as statements about the partition "},"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":"1206.3160","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-14T16:09:22Z","cross_cats_sorted":[],"title_canon_sha256":"eaf981c235650ccdd84fec7ed766d5e9b3a332fe0be067ccd0cd8110b7652d5a","abstract_canon_sha256":"a90b8c351cbca61fdd3faad66a0c374c166e675a9a854c73a3a4ea56e12a5667"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:32.445450Z","signature_b64":"Nssx43YFfMLuhyLQcEbtjQ8F4u6r60XIJk1MsH22v3AuuXAMd3MlYQ+SwXkW3NyUqHbKT+jqoFeZFr3zeI2rDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6dbb44fcc2262ee1efbe20e46e4139782bdcc053fb4de1365806d8d5d4a10f6","last_reissued_at":"2026-05-18T03:53:32.444590Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:32.444590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On weighted graph homomorphisms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Galvin, Prasad Tetali","submitted_at":"2012-06-14T16:09:22Z","abstract_excerpt":"For given graphs $G$ and $H$, let $|Hom(G,H)|$ denote the set of graph homomorphisms from $G$ to $H$. We show that for any finite, $n$-regular, bipartite graph $G$ and any finite graph $H$ (perhaps with loops), $|Hom(G,H)|$ is maximum when $G$ is a disjoint union of $K_{n,n}$'s. This generalizes a result of J. Kahn on the number of independent sets in a regular bipartite graph. We also give the asymptotics of the logarithm of $|Hom(G,H)|$ in terms of a simply expressed parameter of $H$.\n  We also consider weighted versions of these results which may be viewed as statements about the partition "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3160","kind":"arxiv","version":1},"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":"1206.3160","created_at":"2026-05-18T03:53:32.444750+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.3160v1","created_at":"2026-05-18T03:53:32.444750+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3160","created_at":"2026-05-18T03:53:32.444750+00:00"},{"alias_kind":"pith_short_12","alias_value":"43N3IT6MEJRO","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"43N3IT6MEJRO4HX3","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"43N3IT6M","created_at":"2026-05-18T12:26:53.410803+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/43N3IT6MEJRO4HX34IHENZATS6","json":"https://pith.science/pith/43N3IT6MEJRO4HX34IHENZATS6.json","graph_json":"https://pith.science/api/pith-number/43N3IT6MEJRO4HX34IHENZATS6/graph.json","events_json":"https://pith.science/api/pith-number/43N3IT6MEJRO4HX34IHENZATS6/events.json","paper":"https://pith.science/paper/43N3IT6M"},"agent_actions":{"view_html":"https://pith.science/pith/43N3IT6MEJRO4HX34IHENZATS6","download_json":"https://pith.science/pith/43N3IT6MEJRO4HX34IHENZATS6.json","view_paper":"https://pith.science/paper/43N3IT6M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.3160&json=true","fetch_graph":"https://pith.science/api/pith-number/43N3IT6MEJRO4HX34IHENZATS6/graph.json","fetch_events":"https://pith.science/api/pith-number/43N3IT6MEJRO4HX34IHENZATS6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/43N3IT6MEJRO4HX34IHENZATS6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/43N3IT6MEJRO4HX34IHENZATS6/action/storage_attestation","attest_author":"https://pith.science/pith/43N3IT6MEJRO4HX34IHENZATS6/action/author_attestation","sign_citation":"https://pith.science/pith/43N3IT6MEJRO4HX34IHENZATS6/action/citation_signature","submit_replication":"https://pith.science/pith/43N3IT6MEJRO4HX34IHENZATS6/action/replication_record"}},"created_at":"2026-05-18T03:53:32.444750+00:00","updated_at":"2026-05-18T03:53:32.444750+00:00"}