{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YZGJ7EOPWX6Q3XILC7NB6KG2MU","short_pith_number":"pith:YZGJ7EOP","schema_version":"1.0","canonical_sha256":"c64c9f91cfb5fd0ddd0b17da1f28da651179a2aaefb3b81383b4a4ea96182451","source":{"kind":"arxiv","id":"1808.08691","version":2},"attestation_state":"computed","paper":{"title":"Explicit 3-colorings for exponential graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adrien Argento, Alantha Newman, Pierre Charbit","submitted_at":"2018-08-27T05:40:01Z","abstract_excerpt":"For a graph $H$ and integer $k \\geq 1$, two functions $f, g$ from $V(H)$ into $\\{1, \\dots, k\\}$ are adjacent if for all edges $uv$ of $H$, $f(u) \\neq g(v)$. The graph of all such functions is the exponential graph $K_k^H$. El-Zahar and Sauer proved that if $\\chi(H) \\geq 4$, then $K_3^H$ is 3-chromatic. Tardif showed that, implicit in their proof, is an algorithm for 3-coloring $K_3^H$ whose time complexity is polynomial in the size of $K_3^H$. Tardif then asked if there is an \"explicit\" algorithm for finding such a coloring: Essentially, given a function $f$ belonging to a 3-chromatic componen"},"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":"1808.08691","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-27T05:40:01Z","cross_cats_sorted":[],"title_canon_sha256":"1ce12a9c95e3f77807354b5fc1be3b22e280d56bd2ed5760f2264d6783cc853d","abstract_canon_sha256":"320e132ffd52fe6ed733b1c457d85a2f1d897e0abc01c86e630b5d7e3d0ed4a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:19.576599Z","signature_b64":"o1RAGsO+Owa53Cl7IBo+bxkqvQnlcYGO4SqDdNv0wkHvLcTMhbcIl9RCFpwu2FoGYhGdcf6Ngx4GcEYMi5/eCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c64c9f91cfb5fd0ddd0b17da1f28da651179a2aaefb3b81383b4a4ea96182451","last_reissued_at":"2026-05-17T23:51:19.576098Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:19.576098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Explicit 3-colorings for exponential graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adrien Argento, Alantha Newman, Pierre Charbit","submitted_at":"2018-08-27T05:40:01Z","abstract_excerpt":"For a graph $H$ and integer $k \\geq 1$, two functions $f, g$ from $V(H)$ into $\\{1, \\dots, k\\}$ are adjacent if for all edges $uv$ of $H$, $f(u) \\neq g(v)$. The graph of all such functions is the exponential graph $K_k^H$. El-Zahar and Sauer proved that if $\\chi(H) \\geq 4$, then $K_3^H$ is 3-chromatic. Tardif showed that, implicit in their proof, is an algorithm for 3-coloring $K_3^H$ whose time complexity is polynomial in the size of $K_3^H$. Tardif then asked if there is an \"explicit\" algorithm for finding such a coloring: Essentially, given a function $f$ belonging to a 3-chromatic componen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.08691","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":"1808.08691","created_at":"2026-05-17T23:51:19.576167+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.08691v2","created_at":"2026-05-17T23:51:19.576167+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.08691","created_at":"2026-05-17T23:51:19.576167+00:00"},{"alias_kind":"pith_short_12","alias_value":"YZGJ7EOPWX6Q","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YZGJ7EOPWX6Q3XIL","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YZGJ7EOP","created_at":"2026-05-18T12:33:04.347982+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/YZGJ7EOPWX6Q3XILC7NB6KG2MU","json":"https://pith.science/pith/YZGJ7EOPWX6Q3XILC7NB6KG2MU.json","graph_json":"https://pith.science/api/pith-number/YZGJ7EOPWX6Q3XILC7NB6KG2MU/graph.json","events_json":"https://pith.science/api/pith-number/YZGJ7EOPWX6Q3XILC7NB6KG2MU/events.json","paper":"https://pith.science/paper/YZGJ7EOP"},"agent_actions":{"view_html":"https://pith.science/pith/YZGJ7EOPWX6Q3XILC7NB6KG2MU","download_json":"https://pith.science/pith/YZGJ7EOPWX6Q3XILC7NB6KG2MU.json","view_paper":"https://pith.science/paper/YZGJ7EOP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.08691&json=true","fetch_graph":"https://pith.science/api/pith-number/YZGJ7EOPWX6Q3XILC7NB6KG2MU/graph.json","fetch_events":"https://pith.science/api/pith-number/YZGJ7EOPWX6Q3XILC7NB6KG2MU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YZGJ7EOPWX6Q3XILC7NB6KG2MU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YZGJ7EOPWX6Q3XILC7NB6KG2MU/action/storage_attestation","attest_author":"https://pith.science/pith/YZGJ7EOPWX6Q3XILC7NB6KG2MU/action/author_attestation","sign_citation":"https://pith.science/pith/YZGJ7EOPWX6Q3XILC7NB6KG2MU/action/citation_signature","submit_replication":"https://pith.science/pith/YZGJ7EOPWX6Q3XILC7NB6KG2MU/action/replication_record"}},"created_at":"2026-05-17T23:51:19.576167+00:00","updated_at":"2026-05-17T23:51:19.576167+00:00"}