{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:43N3IT6MEJRO4HX34IHENZATS6","short_pith_number":"pith:43N3IT6M","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"},"canonical_sha256":"e6dbb44fcc2262ee1efbe20e46e4139782bdcc053fb4de1365806d8d5d4a10f6","source":{"kind":"arxiv","id":"1206.3160","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.3160","created_at":"2026-05-18T03:53:32Z"},{"alias_kind":"arxiv_version","alias_value":"1206.3160v1","created_at":"2026-05-18T03:53:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3160","created_at":"2026-05-18T03:53:32Z"},{"alias_kind":"pith_short_12","alias_value":"43N3IT6MEJRO","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"43N3IT6MEJRO4HX3","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"43N3IT6M","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:43N3IT6MEJRO4HX34IHENZATS6","target":"record","payload":{"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"},"canonical_sha256":"e6dbb44fcc2262ee1efbe20e46e4139782bdcc053fb4de1365806d8d5d4a10f6","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"},"source_kind":"arxiv","source_id":"1206.3160","source_version":1,"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-18T03:53:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4T8/m2XUIOp5dNTuWzEioM7bbdAsn0hdFPNm9FcPGrzP1fQdxjXtDDwyDBDQu+sHVo2gNd3HCr+Rb0By+4OaCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:35:37.666405Z"},"content_sha256":"5e8029921b7c65766fa3a34b53df0864175b6847fbab042247e080f7b64095f9","schema_version":"1.0","event_id":"sha256:5e8029921b7c65766fa3a34b53df0864175b6847fbab042247e080f7b64095f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:43N3IT6MEJRO4HX34IHENZATS6","target":"graph","payload":{"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"},"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-18T03:53:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bU6IuNmxvuo0u439pGIDBZtft/ET73Ys/xURaT++KBkyZ4Y5kfPIOQbEJdAEOjqLaNkrX8oOHhlLjZLC7tPTCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:35:37.666765Z"},"content_sha256":"b00d85afe990557aa5eb2af2516eaa2d08a604f4079ed79853ab90cb3004d6bb","schema_version":"1.0","event_id":"sha256:b00d85afe990557aa5eb2af2516eaa2d08a604f4079ed79853ab90cb3004d6bb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/43N3IT6MEJRO4HX34IHENZATS6/bundle.json","state_url":"https://pith.science/pith/43N3IT6MEJRO4HX34IHENZATS6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/43N3IT6MEJRO4HX34IHENZATS6/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-09T14:35:37Z","links":{"resolver":"https://pith.science/pith/43N3IT6MEJRO4HX34IHENZATS6","bundle":"https://pith.science/pith/43N3IT6MEJRO4HX34IHENZATS6/bundle.json","state":"https://pith.science/pith/43N3IT6MEJRO4HX34IHENZATS6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/43N3IT6MEJRO4HX34IHENZATS6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:43N3IT6MEJRO4HX34IHENZATS6","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":"a90b8c351cbca61fdd3faad66a0c374c166e675a9a854c73a3a4ea56e12a5667","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-14T16:09:22Z","title_canon_sha256":"eaf981c235650ccdd84fec7ed766d5e9b3a332fe0be067ccd0cd8110b7652d5a"},"schema_version":"1.0","source":{"id":"1206.3160","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.3160","created_at":"2026-05-18T03:53:32Z"},{"alias_kind":"arxiv_version","alias_value":"1206.3160v1","created_at":"2026-05-18T03:53:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3160","created_at":"2026-05-18T03:53:32Z"},{"alias_kind":"pith_short_12","alias_value":"43N3IT6MEJRO","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"43N3IT6MEJRO4HX3","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"43N3IT6M","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:b00d85afe990557aa5eb2af2516eaa2d08a604f4079ed79853ab90cb3004d6bb","target":"graph","created_at":"2026-05-18T03:53:32Z","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 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 ","authors_text":"David Galvin, Prasad Tetali","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-14T16:09:22Z","title":"On weighted graph homomorphisms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3160","kind":"arxiv","version":1},"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:5e8029921b7c65766fa3a34b53df0864175b6847fbab042247e080f7b64095f9","target":"record","created_at":"2026-05-18T03:53:32Z","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":"a90b8c351cbca61fdd3faad66a0c374c166e675a9a854c73a3a4ea56e12a5667","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-14T16:09:22Z","title_canon_sha256":"eaf981c235650ccdd84fec7ed766d5e9b3a332fe0be067ccd0cd8110b7652d5a"},"schema_version":"1.0","source":{"id":"1206.3160","kind":"arxiv","version":1}},"canonical_sha256":"e6dbb44fcc2262ee1efbe20e46e4139782bdcc053fb4de1365806d8d5d4a10f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6dbb44fcc2262ee1efbe20e46e4139782bdcc053fb4de1365806d8d5d4a10f6","first_computed_at":"2026-05-18T03:53:32.444590Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:53:32.444590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Nssx43YFfMLuhyLQcEbtjQ8F4u6r60XIJk1MsH22v3AuuXAMd3MlYQ+SwXkW3NyUqHbKT+jqoFeZFr3zeI2rDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:53:32.445450Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.3160","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e8029921b7c65766fa3a34b53df0864175b6847fbab042247e080f7b64095f9","sha256:b00d85afe990557aa5eb2af2516eaa2d08a604f4079ed79853ab90cb3004d6bb"],"state_sha256":"6b2676ccecba0bb46a6abeec5773eb23e97101f99777def6d22207101ffd17db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5bqQPjErDpcXCtQeciQgijpoHm51LPkZ25czls/lCBDPQJwsb3EtzleN0X8XJsm8o3TaLbLokXo0KYt9lmWzCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T14:35:37.668950Z","bundle_sha256":"e683a3d572d5dfb4a12c4bd16470006346324136a5ba070e969110f036d4f42a"}}