{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6D2ELPJSFAHPUUBJEEQVM5SQGP","short_pith_number":"pith:6D2ELPJS","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"},"canonical_sha256":"f0f445bd32280efa5029212156765033e454fe581b545c285c00b109e233e930","source":{"kind":"arxiv","id":"1307.6721","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.6721","created_at":"2026-05-18T03:17:34Z"},{"alias_kind":"arxiv_version","alias_value":"1307.6721v1","created_at":"2026-05-18T03:17:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6721","created_at":"2026-05-18T03:17:34Z"},{"alias_kind":"pith_short_12","alias_value":"6D2ELPJSFAHP","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6D2ELPJSFAHPUUBJ","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6D2ELPJS","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6D2ELPJSFAHPUUBJEEQVM5SQGP","target":"record","payload":{"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"},"canonical_sha256":"f0f445bd32280efa5029212156765033e454fe581b545c285c00b109e233e930","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"},"source_kind":"arxiv","source_id":"1307.6721","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:17:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V0QdzMZU/H/D4ery6r4KbOAC+LybTKZzafHbIb4U/FkwWc1kZ97fL2MESxFzDy0uBOvuCF89DFTbZh9EJkKgDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:16:40.912901Z"},"content_sha256":"0bdce7b2eb2bbd88fda96a4fd46c5731235c2dd31fd78feb2890a3b1bedf2f7d","schema_version":"1.0","event_id":"sha256:0bdce7b2eb2bbd88fda96a4fd46c5731235c2dd31fd78feb2890a3b1bedf2f7d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6D2ELPJSFAHPUUBJEEQVM5SQGP","target":"graph","payload":{"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"},"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:17:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LXUAcUC0p7mNCe/3nHBPz9AmT7LZkLC4Kf/+fW6ZMdwr809qFO3rp0xNe7fTLPwjcdz6EQLHaLopvcnPlGPQAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:16:40.913264Z"},"content_sha256":"08c2d3f5e45f08c4e7854f5841a28a3a74965e2809a16a4df9c9a491a3bd1b4c","schema_version":"1.0","event_id":"sha256:08c2d3f5e45f08c4e7854f5841a28a3a74965e2809a16a4df9c9a491a3bd1b4c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6D2ELPJSFAHPUUBJEEQVM5SQGP/bundle.json","state_url":"https://pith.science/pith/6D2ELPJSFAHPUUBJEEQVM5SQGP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6D2ELPJSFAHPUUBJEEQVM5SQGP/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-02T00:16:40Z","links":{"resolver":"https://pith.science/pith/6D2ELPJSFAHPUUBJEEQVM5SQGP","bundle":"https://pith.science/pith/6D2ELPJSFAHPUUBJEEQVM5SQGP/bundle.json","state":"https://pith.science/pith/6D2ELPJSFAHPUUBJEEQVM5SQGP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6D2ELPJSFAHPUUBJEEQVM5SQGP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6D2ELPJSFAHPUUBJEEQVM5SQGP","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":"0fbbf74e7a7522b29d6d04215a91061aaf528b7056a6eaa2b02ce26e81df2726","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-25T12:41:57Z","title_canon_sha256":"32f64ef4482ad9ff29dd3451af59c191d2f1806652a8abc0e63591a1b0b8c834"},"schema_version":"1.0","source":{"id":"1307.6721","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.6721","created_at":"2026-05-18T03:17:34Z"},{"alias_kind":"arxiv_version","alias_value":"1307.6721v1","created_at":"2026-05-18T03:17:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6721","created_at":"2026-05-18T03:17:34Z"},{"alias_kind":"pith_short_12","alias_value":"6D2ELPJSFAHP","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6D2ELPJSFAHPUUBJ","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6D2ELPJS","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:08c2d3f5e45f08c4e7854f5841a28a3a74965e2809a16a4df9c9a491a3bd1b4c","target":"graph","created_at":"2026-05-18T03:17:34Z","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":"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","authors_text":"P\\'eter Csikv\\'ari, Zhicong Lin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-25T12:41:57Z","title":"Graph homomorphisms between trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.6721","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:0bdce7b2eb2bbd88fda96a4fd46c5731235c2dd31fd78feb2890a3b1bedf2f7d","target":"record","created_at":"2026-05-18T03:17:34Z","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":"0fbbf74e7a7522b29d6d04215a91061aaf528b7056a6eaa2b02ce26e81df2726","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-25T12:41:57Z","title_canon_sha256":"32f64ef4482ad9ff29dd3451af59c191d2f1806652a8abc0e63591a1b0b8c834"},"schema_version":"1.0","source":{"id":"1307.6721","kind":"arxiv","version":1}},"canonical_sha256":"f0f445bd32280efa5029212156765033e454fe581b545c285c00b109e233e930","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0f445bd32280efa5029212156765033e454fe581b545c285c00b109e233e930","first_computed_at":"2026-05-18T03:17:34.873153Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:34.873153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZX2ylJH/iiQ2e7b4EziP4SjpuiiZ4dn/gqc03htlcq6k6NakM8vyud5ZnRta2sV8t3XNkPhUMl4GrprZGLyHDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:34.873805Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.6721","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0bdce7b2eb2bbd88fda96a4fd46c5731235c2dd31fd78feb2890a3b1bedf2f7d","sha256:08c2d3f5e45f08c4e7854f5841a28a3a74965e2809a16a4df9c9a491a3bd1b4c"],"state_sha256":"fc13a34fe3733d641b895576311f5552dd65c97665143096d505a311b8d831f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ps/Qlns1lvpe2O7Enl8tZ46OM90p/taUNL21Fz2K6dEnjsJj+3S31p3oxw/V/m1IdQv8jEXsTkvV9Z7gsdoWBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T00:16:40.915303Z","bundle_sha256":"589addb36b57f9dfed4c260ece56db2e559e7bd0c2e415adfc72fcdd1b179d5f"}}