{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:6D2ELPJSFAHPUUBJEEQVM5SQGP","short_pith_number":"pith:6D2ELPJS","schema_version":"1.0","canonical_sha256":"f0f445bd32280efa5029212156765033e454fe581b545c285c00b109e233e930","source":{"kind":"arxiv","id":"1307.6721","version":1},"attestation_state":"computed","paper":{"title":"Graph homomorphisms between trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"P\\'eter Csikv\\'ari, Zhicong Lin","submitted_at":"2013-07-25T12:41:57Z","abstract_excerpt":"In this paper we study several problems concerning the number of homomorphisms of trees. We give an algorithm for the number of homomorphisms from a tree to any graph by the Transfer-matrix method. By using this algorithm and some transformations on trees, we study various extremal problems about the number of homomorphisms of trees. These applications include a far reaching generalization of Bollob\\'as and Tyomkyn's result concerning the number of walks in trees.\n  Some other highlights of the paper are the following. Denote by $\\hom(H,G)$ the number of homomorphisms from a graph $H$ to a gra"},"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":"1307.6721","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-25T12:41:57Z","cross_cats_sorted":[],"title_canon_sha256":"32f64ef4482ad9ff29dd3451af59c191d2f1806652a8abc0e63591a1b0b8c834","abstract_canon_sha256":"0fbbf74e7a7522b29d6d04215a91061aaf528b7056a6eaa2b02ce26e81df2726"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:34.873805Z","signature_b64":"ZX2ylJH/iiQ2e7b4EziP4SjpuiiZ4dn/gqc03htlcq6k6NakM8vyud5ZnRta2sV8t3XNkPhUMl4GrprZGLyHDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0f445bd32280efa5029212156765033e454fe581b545c285c00b109e233e930","last_reissued_at":"2026-05-18T03:17:34.873153Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:34.873153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph homomorphisms between trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"P\\'eter Csikv\\'ari, Zhicong Lin","submitted_at":"2013-07-25T12:41:57Z","abstract_excerpt":"In this paper we study several problems concerning the number of homomorphisms of trees. We give an algorithm for the number of homomorphisms from a tree to any graph by the Transfer-matrix method. By using this algorithm and some transformations on trees, we study various extremal problems about the number of homomorphisms of trees. These applications include a far reaching generalization of Bollob\\'as and Tyomkyn's result concerning the number of walks in trees.\n  Some other highlights of the paper are the following. Denote by $\\hom(H,G)$ the number of homomorphisms from a graph $H$ to a gra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.6721","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":"1307.6721","created_at":"2026-05-18T03:17:34.873273+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.6721v1","created_at":"2026-05-18T03:17:34.873273+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6721","created_at":"2026-05-18T03:17:34.873273+00:00"},{"alias_kind":"pith_short_12","alias_value":"6D2ELPJSFAHP","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"6D2ELPJSFAHPUUBJ","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"6D2ELPJS","created_at":"2026-05-18T12:27:36.564083+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/6D2ELPJSFAHPUUBJEEQVM5SQGP","json":"https://pith.science/pith/6D2ELPJSFAHPUUBJEEQVM5SQGP.json","graph_json":"https://pith.science/api/pith-number/6D2ELPJSFAHPUUBJEEQVM5SQGP/graph.json","events_json":"https://pith.science/api/pith-number/6D2ELPJSFAHPUUBJEEQVM5SQGP/events.json","paper":"https://pith.science/paper/6D2ELPJS"},"agent_actions":{"view_html":"https://pith.science/pith/6D2ELPJSFAHPUUBJEEQVM5SQGP","download_json":"https://pith.science/pith/6D2ELPJSFAHPUUBJEEQVM5SQGP.json","view_paper":"https://pith.science/paper/6D2ELPJS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.6721&json=true","fetch_graph":"https://pith.science/api/pith-number/6D2ELPJSFAHPUUBJEEQVM5SQGP/graph.json","fetch_events":"https://pith.science/api/pith-number/6D2ELPJSFAHPUUBJEEQVM5SQGP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6D2ELPJSFAHPUUBJEEQVM5SQGP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6D2ELPJSFAHPUUBJEEQVM5SQGP/action/storage_attestation","attest_author":"https://pith.science/pith/6D2ELPJSFAHPUUBJEEQVM5SQGP/action/author_attestation","sign_citation":"https://pith.science/pith/6D2ELPJSFAHPUUBJEEQVM5SQGP/action/citation_signature","submit_replication":"https://pith.science/pith/6D2ELPJSFAHPUUBJEEQVM5SQGP/action/replication_record"}},"created_at":"2026-05-18T03:17:34.873273+00:00","updated_at":"2026-05-18T03:17:34.873273+00:00"}