{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:Q7QTLXCWYATIYWAJBTNIJT7OR5","short_pith_number":"pith:Q7QTLXCW","schema_version":"1.0","canonical_sha256":"87e135dc56c0268c58090cda84cfee8f7aead90aa1a1dc5fc5fbf58511431ebd","source":{"kind":"arxiv","id":"1612.01295","version":2},"attestation_state":"computed","paper":{"title":"Extremal regular graphs: the case of the infinite regular tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"P\\'eter Csikv\\'ari","submitted_at":"2016-12-05T10:10:43Z","abstract_excerpt":"In this paper we study the following problem. Let $A$ be a fixed graph, and let $\\hom(G,A)$ denote the number of homomorphisms from a graph $G$ to $A$. Furthermore, let $v(G)$ denote the number of vertices of $G$, and let $\\mathcal{G}_d$ denote the family of $d$--regular graphs. The general problem studied in this paper is to determine $$\\inf_{G\\in \\mathcal{G}_d}\\hom(G,A)^{1/v(G)}.$$ It turns out that in many instances the infimum is not achieved by a finite graph, but a sequence of graphs with girth (i. e., length of the shortest cycle) tending to infinity. In other words, the optimization pr"},"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":"1612.01295","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-05T10:10:43Z","cross_cats_sorted":[],"title_canon_sha256":"873374dafff2ec6aabe8027a621e48454c624c6e008a4a8624cf1302d0f9384a","abstract_canon_sha256":"ffa33003e1498d1dff75e97169584619ae6eaaba8b1e983b766ee890d995900c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:01.393642Z","signature_b64":"ZVJDwCCsYaNLAQCLEMn0Z2cPk1Lk+kjMU62dmaQDjLKmbXveU/L6dsLZc9dBhw7msr7WOmTCzM1QBQlE3sJhBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87e135dc56c0268c58090cda84cfee8f7aead90aa1a1dc5fc5fbf58511431ebd","last_reissued_at":"2026-05-18T00:45:01.393180Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:01.393180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extremal regular graphs: the case of the infinite regular tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"P\\'eter Csikv\\'ari","submitted_at":"2016-12-05T10:10:43Z","abstract_excerpt":"In this paper we study the following problem. Let $A$ be a fixed graph, and let $\\hom(G,A)$ denote the number of homomorphisms from a graph $G$ to $A$. Furthermore, let $v(G)$ denote the number of vertices of $G$, and let $\\mathcal{G}_d$ denote the family of $d$--regular graphs. The general problem studied in this paper is to determine $$\\inf_{G\\in \\mathcal{G}_d}\\hom(G,A)^{1/v(G)}.$$ It turns out that in many instances the infimum is not achieved by a finite graph, but a sequence of graphs with girth (i. e., length of the shortest cycle) tending to infinity. In other words, the optimization pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01295","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":""},"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":"1612.01295","created_at":"2026-05-18T00:45:01.393254+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.01295v2","created_at":"2026-05-18T00:45:01.393254+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01295","created_at":"2026-05-18T00:45:01.393254+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q7QTLXCWYATI","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q7QTLXCWYATIYWAJ","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q7QTLXCW","created_at":"2026-05-18T12:30:39.010887+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/Q7QTLXCWYATIYWAJBTNIJT7OR5","json":"https://pith.science/pith/Q7QTLXCWYATIYWAJBTNIJT7OR5.json","graph_json":"https://pith.science/api/pith-number/Q7QTLXCWYATIYWAJBTNIJT7OR5/graph.json","events_json":"https://pith.science/api/pith-number/Q7QTLXCWYATIYWAJBTNIJT7OR5/events.json","paper":"https://pith.science/paper/Q7QTLXCW"},"agent_actions":{"view_html":"https://pith.science/pith/Q7QTLXCWYATIYWAJBTNIJT7OR5","download_json":"https://pith.science/pith/Q7QTLXCWYATIYWAJBTNIJT7OR5.json","view_paper":"https://pith.science/paper/Q7QTLXCW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.01295&json=true","fetch_graph":"https://pith.science/api/pith-number/Q7QTLXCWYATIYWAJBTNIJT7OR5/graph.json","fetch_events":"https://pith.science/api/pith-number/Q7QTLXCWYATIYWAJBTNIJT7OR5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q7QTLXCWYATIYWAJBTNIJT7OR5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q7QTLXCWYATIYWAJBTNIJT7OR5/action/storage_attestation","attest_author":"https://pith.science/pith/Q7QTLXCWYATIYWAJBTNIJT7OR5/action/author_attestation","sign_citation":"https://pith.science/pith/Q7QTLXCWYATIYWAJBTNIJT7OR5/action/citation_signature","submit_replication":"https://pith.science/pith/Q7QTLXCWYATIYWAJBTNIJT7OR5/action/replication_record"}},"created_at":"2026-05-18T00:45:01.393254+00:00","updated_at":"2026-05-18T00:45:01.393254+00:00"}