{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YZGJ7EOPWX6Q3XILC7NB6KG2MU","short_pith_number":"pith:YZGJ7EOP","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"},"canonical_sha256":"c64c9f91cfb5fd0ddd0b17da1f28da651179a2aaefb3b81383b4a4ea96182451","source":{"kind":"arxiv","id":"1808.08691","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.08691","created_at":"2026-05-17T23:51:19Z"},{"alias_kind":"arxiv_version","alias_value":"1808.08691v2","created_at":"2026-05-17T23:51:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.08691","created_at":"2026-05-17T23:51:19Z"},{"alias_kind":"pith_short_12","alias_value":"YZGJ7EOPWX6Q","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YZGJ7EOPWX6Q3XIL","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YZGJ7EOP","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YZGJ7EOPWX6Q3XILC7NB6KG2MU","target":"record","payload":{"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"},"canonical_sha256":"c64c9f91cfb5fd0ddd0b17da1f28da651179a2aaefb3b81383b4a4ea96182451","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"},"source_kind":"arxiv","source_id":"1808.08691","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-17T23:51:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4UH+8SXOgZtCieKfrLekzML7Do0aTXzKbSuXgKfQvac6kIDOYrA4RJkx1QbrbqKqJ7301IKREPLEtJmnFG1GAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:27:46.381934Z"},"content_sha256":"6f361c85575b2d1a8c62173b2bdc98ebcd64c8e6c58e994d6e782226d9ec0ee2","schema_version":"1.0","event_id":"sha256:6f361c85575b2d1a8c62173b2bdc98ebcd64c8e6c58e994d6e782226d9ec0ee2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YZGJ7EOPWX6Q3XILC7NB6KG2MU","target":"graph","payload":{"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"},"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-17T23:51:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wj2GvRHZJpcwcMnfnD6Z4DP0d6glqhhS+sY/DBcnJx6z6Il9HSEiH+f1DjbH8oBX0BQWcMQkRxQMrn/Ete5ZDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:27:46.382309Z"},"content_sha256":"69c8208024dcf57e7c469423632e63abb59ade23f2f526155cd1e81f006069e1","schema_version":"1.0","event_id":"sha256:69c8208024dcf57e7c469423632e63abb59ade23f2f526155cd1e81f006069e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YZGJ7EOPWX6Q3XILC7NB6KG2MU/bundle.json","state_url":"https://pith.science/pith/YZGJ7EOPWX6Q3XILC7NB6KG2MU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YZGJ7EOPWX6Q3XILC7NB6KG2MU/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-05T09:27:46Z","links":{"resolver":"https://pith.science/pith/YZGJ7EOPWX6Q3XILC7NB6KG2MU","bundle":"https://pith.science/pith/YZGJ7EOPWX6Q3XILC7NB6KG2MU/bundle.json","state":"https://pith.science/pith/YZGJ7EOPWX6Q3XILC7NB6KG2MU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YZGJ7EOPWX6Q3XILC7NB6KG2MU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YZGJ7EOPWX6Q3XILC7NB6KG2MU","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":"320e132ffd52fe6ed733b1c457d85a2f1d897e0abc01c86e630b5d7e3d0ed4a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-27T05:40:01Z","title_canon_sha256":"1ce12a9c95e3f77807354b5fc1be3b22e280d56bd2ed5760f2264d6783cc853d"},"schema_version":"1.0","source":{"id":"1808.08691","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.08691","created_at":"2026-05-17T23:51:19Z"},{"alias_kind":"arxiv_version","alias_value":"1808.08691v2","created_at":"2026-05-17T23:51:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.08691","created_at":"2026-05-17T23:51:19Z"},{"alias_kind":"pith_short_12","alias_value":"YZGJ7EOPWX6Q","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YZGJ7EOPWX6Q3XIL","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YZGJ7EOP","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:69c8208024dcf57e7c469423632e63abb59ade23f2f526155cd1e81f006069e1","target":"graph","created_at":"2026-05-17T23:51:19Z","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":"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","authors_text":"Adrien Argento, Alantha Newman, Pierre Charbit","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-27T05:40:01Z","title":"Explicit 3-colorings for exponential graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.08691","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:6f361c85575b2d1a8c62173b2bdc98ebcd64c8e6c58e994d6e782226d9ec0ee2","target":"record","created_at":"2026-05-17T23:51:19Z","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":"320e132ffd52fe6ed733b1c457d85a2f1d897e0abc01c86e630b5d7e3d0ed4a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-27T05:40:01Z","title_canon_sha256":"1ce12a9c95e3f77807354b5fc1be3b22e280d56bd2ed5760f2264d6783cc853d"},"schema_version":"1.0","source":{"id":"1808.08691","kind":"arxiv","version":2}},"canonical_sha256":"c64c9f91cfb5fd0ddd0b17da1f28da651179a2aaefb3b81383b4a4ea96182451","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c64c9f91cfb5fd0ddd0b17da1f28da651179a2aaefb3b81383b4a4ea96182451","first_computed_at":"2026-05-17T23:51:19.576098Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:19.576098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o1RAGsO+Owa53Cl7IBo+bxkqvQnlcYGO4SqDdNv0wkHvLcTMhbcIl9RCFpwu2FoGYhGdcf6Ngx4GcEYMi5/eCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:19.576599Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.08691","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f361c85575b2d1a8c62173b2bdc98ebcd64c8e6c58e994d6e782226d9ec0ee2","sha256:69c8208024dcf57e7c469423632e63abb59ade23f2f526155cd1e81f006069e1"],"state_sha256":"22934fd35c2e582934b7f653ec62e65a2a45579b6c304900e279604f975bf528"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GoadSpvXEaQsA3u3xFpRCKThfkid73sLD7XYyJVXPW+EQFVigJB6SKUJOIOC08QC+jXEbDI4tYHvHpO1G5lBCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T09:27:46.387020Z","bundle_sha256":"582db09d097a3a23b2ca1ff8ea66d8b8ada0cdc5ccc372c27d33e3ef83c47452"}}