{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:Q7QTLXCWYATIYWAJBTNIJT7OR5","short_pith_number":"pith:Q7QTLXCW","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"},"canonical_sha256":"87e135dc56c0268c58090cda84cfee8f7aead90aa1a1dc5fc5fbf58511431ebd","source":{"kind":"arxiv","id":"1612.01295","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.01295","created_at":"2026-05-18T00:45:01Z"},{"alias_kind":"arxiv_version","alias_value":"1612.01295v2","created_at":"2026-05-18T00:45:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01295","created_at":"2026-05-18T00:45:01Z"},{"alias_kind":"pith_short_12","alias_value":"Q7QTLXCWYATI","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"Q7QTLXCWYATIYWAJ","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"Q7QTLXCW","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:Q7QTLXCWYATIYWAJBTNIJT7OR5","target":"record","payload":{"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"},"canonical_sha256":"87e135dc56c0268c58090cda84cfee8f7aead90aa1a1dc5fc5fbf58511431ebd","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"},"source_kind":"arxiv","source_id":"1612.01295","source_version":2,"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-18T00:45:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EYmTUeV6oiJOSD2Yj4sPGfPeje6UY4M2dL0APjuKIZXa0+hrpz9g1JRFGEJa4ccrAkXBlkLpHhEknAFDHJ1gCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:46:52.828967Z"},"content_sha256":"8b543786e94c02dedc562c59ba4877deb31bd1d2563a67cff42191856f8ed321","schema_version":"1.0","event_id":"sha256:8b543786e94c02dedc562c59ba4877deb31bd1d2563a67cff42191856f8ed321"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:Q7QTLXCWYATIYWAJBTNIJT7OR5","target":"graph","payload":{"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"},"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-18T00:45:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YUH73ZTY3sG/dem5OfN7Thwmz0ly2D411yOIAlXZJOuG71S6V3MrbSSdhY0yZhbXKoH8k3upfQs18y03JBnVBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:46:52.829303Z"},"content_sha256":"1301d4c904c3118f0206c3874be39bff5eb4730edfb395666dec9a1d7c2085de","schema_version":"1.0","event_id":"sha256:1301d4c904c3118f0206c3874be39bff5eb4730edfb395666dec9a1d7c2085de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q7QTLXCWYATIYWAJBTNIJT7OR5/bundle.json","state_url":"https://pith.science/pith/Q7QTLXCWYATIYWAJBTNIJT7OR5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q7QTLXCWYATIYWAJBTNIJT7OR5/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-01T18:46:52Z","links":{"resolver":"https://pith.science/pith/Q7QTLXCWYATIYWAJBTNIJT7OR5","bundle":"https://pith.science/pith/Q7QTLXCWYATIYWAJBTNIJT7OR5/bundle.json","state":"https://pith.science/pith/Q7QTLXCWYATIYWAJBTNIJT7OR5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q7QTLXCWYATIYWAJBTNIJT7OR5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:Q7QTLXCWYATIYWAJBTNIJT7OR5","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":"ffa33003e1498d1dff75e97169584619ae6eaaba8b1e983b766ee890d995900c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-05T10:10:43Z","title_canon_sha256":"873374dafff2ec6aabe8027a621e48454c624c6e008a4a8624cf1302d0f9384a"},"schema_version":"1.0","source":{"id":"1612.01295","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.01295","created_at":"2026-05-18T00:45:01Z"},{"alias_kind":"arxiv_version","alias_value":"1612.01295v2","created_at":"2026-05-18T00:45:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01295","created_at":"2026-05-18T00:45:01Z"},{"alias_kind":"pith_short_12","alias_value":"Q7QTLXCWYATI","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"Q7QTLXCWYATIYWAJ","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"Q7QTLXCW","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:1301d4c904c3118f0206c3874be39bff5eb4730edfb395666dec9a1d7c2085de","target":"graph","created_at":"2026-05-18T00:45:01Z","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 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","authors_text":"P\\'eter Csikv\\'ari","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-05T10:10:43Z","title":"Extremal regular graphs: the case of the infinite regular tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01295","kind":"arxiv","version":2},"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:8b543786e94c02dedc562c59ba4877deb31bd1d2563a67cff42191856f8ed321","target":"record","created_at":"2026-05-18T00:45:01Z","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":"ffa33003e1498d1dff75e97169584619ae6eaaba8b1e983b766ee890d995900c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-05T10:10:43Z","title_canon_sha256":"873374dafff2ec6aabe8027a621e48454c624c6e008a4a8624cf1302d0f9384a"},"schema_version":"1.0","source":{"id":"1612.01295","kind":"arxiv","version":2}},"canonical_sha256":"87e135dc56c0268c58090cda84cfee8f7aead90aa1a1dc5fc5fbf58511431ebd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"87e135dc56c0268c58090cda84cfee8f7aead90aa1a1dc5fc5fbf58511431ebd","first_computed_at":"2026-05-18T00:45:01.393180Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:01.393180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZVJDwCCsYaNLAQCLEMn0Z2cPk1Lk+kjMU62dmaQDjLKmbXveU/L6dsLZc9dBhw7msr7WOmTCzM1QBQlE3sJhBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:01.393642Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.01295","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b543786e94c02dedc562c59ba4877deb31bd1d2563a67cff42191856f8ed321","sha256:1301d4c904c3118f0206c3874be39bff5eb4730edfb395666dec9a1d7c2085de"],"state_sha256":"16c1e8e1c0ab9cbc31a907c031e023e0d454eb1a1ed00ba22a9d43d74fc69f91"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6QhZzB0ec5Uz9L+HzPkFRW0AOJXALUfw/FfdjYejIiw8misTztm79U/6eFwc+N9O8ilPR9JuBwIf9aBrgjRDDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T18:46:52.831210Z","bundle_sha256":"f14be38718d981a3be4dc029d2ab036764ed3246b35acdd0f124b4b39d48fcb1"}}