{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:K3JTIFZBWKTXRKSO4ICNALUXSM","short_pith_number":"pith:K3JTIFZB","schema_version":"1.0","canonical_sha256":"56d3341721b2a778aa4ee204d02e97933856563378474e0a6560435e9dd4a4ee","source":{"kind":"arxiv","id":"1101.0840","version":2},"attestation_state":"computed","paper":{"title":"H-coloring tori","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Galvin, John Engbers","submitted_at":"2011-01-04T22:28:36Z","abstract_excerpt":"For graphs $G$ and $H$, an $H$-coloring of $G$ is a function from the vertices of $G$ to the vertices of $H$ that preserves adjacency. $H$-colorings encode graph theory notions such as independent sets and proper colorings, and are a natural setting for the study of hard-constraint models in statistical physics.\n  We study the set of $H$-colorings of the even discrete torus ${\\mathbb Z}^d_m$, the graph on vertex set ${0, ..., m-1}^d$ ($m$ even) with two strings adjacent if they differ by 1 (mod $m$) on one coordinate and agree on all others. This is a bipartite graph, with bipartition classes "},"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":"1101.0840","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-04T22:28:36Z","cross_cats_sorted":[],"title_canon_sha256":"4e9d2ca02b4f89b7376b1b14e7c6ba039493109f5117b7f93f0d85898d7b31e0","abstract_canon_sha256":"65f07c8dc0296b254355887e66914d3fac90ae01d663659d0c69fc28b3f723c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:42.583779Z","signature_b64":"jf7AN8u/VS8Q4qj2P1ICc6OkvEGeAOWi+6tLRUfjt0xNPN8or6X0l+nLH/lxTODtaDZ8Xu59/sWd3D1A0FpQAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56d3341721b2a778aa4ee204d02e97933856563378474e0a6560435e9dd4a4ee","last_reissued_at":"2026-05-18T03:53:42.583013Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:42.583013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"H-coloring tori","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Galvin, John Engbers","submitted_at":"2011-01-04T22:28:36Z","abstract_excerpt":"For graphs $G$ and $H$, an $H$-coloring of $G$ is a function from the vertices of $G$ to the vertices of $H$ that preserves adjacency. $H$-colorings encode graph theory notions such as independent sets and proper colorings, and are a natural setting for the study of hard-constraint models in statistical physics.\n  We study the set of $H$-colorings of the even discrete torus ${\\mathbb Z}^d_m$, the graph on vertex set ${0, ..., m-1}^d$ ($m$ even) with two strings adjacent if they differ by 1 (mod $m$) on one coordinate and agree on all others. This is a bipartite graph, with bipartition classes "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.0840","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":"1101.0840","created_at":"2026-05-18T03:53:42.583163+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.0840v2","created_at":"2026-05-18T03:53:42.583163+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.0840","created_at":"2026-05-18T03:53:42.583163+00:00"},{"alias_kind":"pith_short_12","alias_value":"K3JTIFZBWKTX","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"K3JTIFZBWKTXRKSO","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"K3JTIFZB","created_at":"2026-05-18T12:26:32.869790+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/K3JTIFZBWKTXRKSO4ICNALUXSM","json":"https://pith.science/pith/K3JTIFZBWKTXRKSO4ICNALUXSM.json","graph_json":"https://pith.science/api/pith-number/K3JTIFZBWKTXRKSO4ICNALUXSM/graph.json","events_json":"https://pith.science/api/pith-number/K3JTIFZBWKTXRKSO4ICNALUXSM/events.json","paper":"https://pith.science/paper/K3JTIFZB"},"agent_actions":{"view_html":"https://pith.science/pith/K3JTIFZBWKTXRKSO4ICNALUXSM","download_json":"https://pith.science/pith/K3JTIFZBWKTXRKSO4ICNALUXSM.json","view_paper":"https://pith.science/paper/K3JTIFZB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.0840&json=true","fetch_graph":"https://pith.science/api/pith-number/K3JTIFZBWKTXRKSO4ICNALUXSM/graph.json","fetch_events":"https://pith.science/api/pith-number/K3JTIFZBWKTXRKSO4ICNALUXSM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K3JTIFZBWKTXRKSO4ICNALUXSM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K3JTIFZBWKTXRKSO4ICNALUXSM/action/storage_attestation","attest_author":"https://pith.science/pith/K3JTIFZBWKTXRKSO4ICNALUXSM/action/author_attestation","sign_citation":"https://pith.science/pith/K3JTIFZBWKTXRKSO4ICNALUXSM/action/citation_signature","submit_replication":"https://pith.science/pith/K3JTIFZBWKTXRKSO4ICNALUXSM/action/replication_record"}},"created_at":"2026-05-18T03:53:42.583163+00:00","updated_at":"2026-05-18T03:53:42.583163+00:00"}