{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:FV3GDSIWER45SUHBSOVWJNRRM5","short_pith_number":"pith:FV3GDSIW","schema_version":"1.0","canonical_sha256":"2d7661c9162479d950e193ab64b63167787b26205f9be03453ee20170d2e3327","source":{"kind":"arxiv","id":"math/0611416","version":2},"attestation_state":"computed","paper":{"title":"Random Graph-Homomorphisms and Logarithmic Degree","license":"","headline":"","cross_cats":["math-ph","math.CO","math.MP"],"primary_cat":"math.PR","authors_text":"Amir Yehudayoff, Ariel Yadin, Itai Benjamini","submitted_at":"2006-11-14T13:46:48Z","abstract_excerpt":"A graph homomorphism between two graphs is a map from the vertex set of one graph to the vertex set of the other graph, that maps edges to edges. In this note we study the range of a uniformly chosen homomorphism from a graph G to the infinite line Z. It is shown that if the maximal degree of G is `sub-logarithmic', then the range of such a homomorphism is super-constant.\n  Furthermore, some examples are provided, suggesting that perhaps for graphs with super-logarithmic degree, the range of a typical homomorphism is bounded. In particular, a sharp transition is shown for a specific family of "},"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":"math/0611416","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.PR","submitted_at":"2006-11-14T13:46:48Z","cross_cats_sorted":["math-ph","math.CO","math.MP"],"title_canon_sha256":"9f6bd9c744458a92303a650e2346bc417ff01fb7ff46a37ca81d970f41ef43ba","abstract_canon_sha256":"152156ddd8fdb1723b672e58b8216a5eab1cd7c2b1ba824627bf7bbb64c10b61"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:02:21.216608Z","signature_b64":"fZuSKLmoSSbzJjQ1ONOikeQSJgZsrS07JVwijI7GYAcgTyDul3b7YEQz1bCaFOYdoN9JyVI+bvzqVXNOFD3BAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d7661c9162479d950e193ab64b63167787b26205f9be03453ee20170d2e3327","last_reissued_at":"2026-07-04T15:02:21.216244Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:02:21.216244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random Graph-Homomorphisms and Logarithmic Degree","license":"","headline":"","cross_cats":["math-ph","math.CO","math.MP"],"primary_cat":"math.PR","authors_text":"Amir Yehudayoff, Ariel Yadin, Itai Benjamini","submitted_at":"2006-11-14T13:46:48Z","abstract_excerpt":"A graph homomorphism between two graphs is a map from the vertex set of one graph to the vertex set of the other graph, that maps edges to edges. In this note we study the range of a uniformly chosen homomorphism from a graph G to the infinite line Z. It is shown that if the maximal degree of G is `sub-logarithmic', then the range of such a homomorphism is super-constant.\n  Furthermore, some examples are provided, suggesting that perhaps for graphs with super-logarithmic degree, the range of a typical homomorphism is bounded. In particular, a sharp transition is shown for a specific family of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0611416","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/math/0611416/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"math/0611416","created_at":"2026-07-04T15:02:21.216308+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0611416v2","created_at":"2026-07-04T15:02:21.216308+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0611416","created_at":"2026-07-04T15:02:21.216308+00:00"},{"alias_kind":"pith_short_12","alias_value":"FV3GDSIWER45","created_at":"2026-07-04T15:02:21.216308+00:00"},{"alias_kind":"pith_short_16","alias_value":"FV3GDSIWER45SUHB","created_at":"2026-07-04T15:02:21.216308+00:00"},{"alias_kind":"pith_short_8","alias_value":"FV3GDSIW","created_at":"2026-07-04T15:02:21.216308+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/FV3GDSIWER45SUHBSOVWJNRRM5","json":"https://pith.science/pith/FV3GDSIWER45SUHBSOVWJNRRM5.json","graph_json":"https://pith.science/api/pith-number/FV3GDSIWER45SUHBSOVWJNRRM5/graph.json","events_json":"https://pith.science/api/pith-number/FV3GDSIWER45SUHBSOVWJNRRM5/events.json","paper":"https://pith.science/paper/FV3GDSIW"},"agent_actions":{"view_html":"https://pith.science/pith/FV3GDSIWER45SUHBSOVWJNRRM5","download_json":"https://pith.science/pith/FV3GDSIWER45SUHBSOVWJNRRM5.json","view_paper":"https://pith.science/paper/FV3GDSIW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0611416&json=true","fetch_graph":"https://pith.science/api/pith-number/FV3GDSIWER45SUHBSOVWJNRRM5/graph.json","fetch_events":"https://pith.science/api/pith-number/FV3GDSIWER45SUHBSOVWJNRRM5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FV3GDSIWER45SUHBSOVWJNRRM5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FV3GDSIWER45SUHBSOVWJNRRM5/action/storage_attestation","attest_author":"https://pith.science/pith/FV3GDSIWER45SUHBSOVWJNRRM5/action/author_attestation","sign_citation":"https://pith.science/pith/FV3GDSIWER45SUHBSOVWJNRRM5/action/citation_signature","submit_replication":"https://pith.science/pith/FV3GDSIWER45SUHBSOVWJNRRM5/action/replication_record"}},"created_at":"2026-07-04T15:02:21.216308+00:00","updated_at":"2026-07-04T15:02:21.216308+00:00"}