{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:L55QEFR32N6JOC3J6ANWHAB4ZG","short_pith_number":"pith:L55QEFR3","canonical_record":{"source":{"id":"1210.5607","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-20T11:48:03Z","cross_cats_sorted":[],"title_canon_sha256":"fb2bcbb118a3e71bf9bb0c6aa150838c7ce53a98f7ae21cd3b847c482b213f9f","abstract_canon_sha256":"21b1c5a34778dff3c4aa7afa63d55aea84cccf6c25082a15333fd7ab9705e522"},"schema_version":"1.0"},"canonical_sha256":"5f7b02163bd37c970b69f01b63803cc98ee7d5a13d9b141190e5650a129437cb","source":{"kind":"arxiv","id":"1210.5607","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.5607","created_at":"2026-05-18T03:13:20Z"},{"alias_kind":"arxiv_version","alias_value":"1210.5607v2","created_at":"2026-05-18T03:13:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.5607","created_at":"2026-05-18T03:13:20Z"},{"alias_kind":"pith_short_12","alias_value":"L55QEFR32N6J","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"L55QEFR32N6JOC3J","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"L55QEFR3","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:L55QEFR32N6JOC3J6ANWHAB4ZG","target":"record","payload":{"canonical_record":{"source":{"id":"1210.5607","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-20T11:48:03Z","cross_cats_sorted":[],"title_canon_sha256":"fb2bcbb118a3e71bf9bb0c6aa150838c7ce53a98f7ae21cd3b847c482b213f9f","abstract_canon_sha256":"21b1c5a34778dff3c4aa7afa63d55aea84cccf6c25082a15333fd7ab9705e522"},"schema_version":"1.0"},"canonical_sha256":"5f7b02163bd37c970b69f01b63803cc98ee7d5a13d9b141190e5650a129437cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:20.293053Z","signature_b64":"vPJNzDbVenLQETwttIRnwPku/NeY8TpUhop39FvtEkQXaydZxef9/4zSn1sX3iElJXumNkBJWFyWN3+pGn+cAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f7b02163bd37c970b69f01b63803cc98ee7d5a13d9b141190e5650a129437cb","last_reissued_at":"2026-05-18T03:13:20.292567Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:20.292567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.5607","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-18T03:13:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YSubV6BAJZTOFXKFACHpak9y9df2CkWwbfuKeob8TAhHlfAqHoDUDgcm06yaFeB+GVqgt3GzZWUIUbjfE8j+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:43:02.421666Z"},"content_sha256":"39630bad1e8e79b578ec433cf81592246956d8b20b83424ebaa2b351d436fabf","schema_version":"1.0","event_id":"sha256:39630bad1e8e79b578ec433cf81592246956d8b20b83424ebaa2b351d436fabf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:L55QEFR32N6JOC3J6ANWHAB4ZG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nonrepetitive colorings of lexicographic product of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bal\\'azs Keszegh, Bal\\'azs Patk\\'os, Xuding Zhu","submitted_at":"2012-10-20T11:48:03Z","abstract_excerpt":"A coloring $c$ of the vertices of a graph $G$ is nonrepetitive if there exists no path $v_1v_2\\ldots v_{2l}$ for which $c(v_i)=c(v_{l+i})$ for all $1\\le i\\le l$. Given graphs $G$ and $H$ with $|V(H)|=k$, the lexicographic product $G[H]$ is the graph obtained by substituting every vertex of $G$ by a copy of $H$, and every edge of $G$ by a copy of $K_{k,k}$. %Our main results are the following. We prove that for a sufficiently long path $P$, a nonrepetitive coloring of $P[K_k]$ needs at least $3k+\\lfloor k/2\\rfloor$ colors. If $k>2$ then we need exactly $2k+1$ colors to nonrepetitively color $P["},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.5607","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-18T03:13:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"56AvVDFUql4wMt7iz+HAimMkU2G76RWmswOFQS+XsCtIki1/hmHlmbX5zWDLbfW4s1mCXz6xR7YoOWQVle/NDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:43:02.422393Z"},"content_sha256":"630348f73ce926b5cf9677e9ed82430b13de6dc7c26fcb7c8b5646bfa2e07c4a","schema_version":"1.0","event_id":"sha256:630348f73ce926b5cf9677e9ed82430b13de6dc7c26fcb7c8b5646bfa2e07c4a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L55QEFR32N6JOC3J6ANWHAB4ZG/bundle.json","state_url":"https://pith.science/pith/L55QEFR32N6JOC3J6ANWHAB4ZG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L55QEFR32N6JOC3J6ANWHAB4ZG/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-05-27T09:43:02Z","links":{"resolver":"https://pith.science/pith/L55QEFR32N6JOC3J6ANWHAB4ZG","bundle":"https://pith.science/pith/L55QEFR32N6JOC3J6ANWHAB4ZG/bundle.json","state":"https://pith.science/pith/L55QEFR32N6JOC3J6ANWHAB4ZG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L55QEFR32N6JOC3J6ANWHAB4ZG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:L55QEFR32N6JOC3J6ANWHAB4ZG","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":"21b1c5a34778dff3c4aa7afa63d55aea84cccf6c25082a15333fd7ab9705e522","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-20T11:48:03Z","title_canon_sha256":"fb2bcbb118a3e71bf9bb0c6aa150838c7ce53a98f7ae21cd3b847c482b213f9f"},"schema_version":"1.0","source":{"id":"1210.5607","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.5607","created_at":"2026-05-18T03:13:20Z"},{"alias_kind":"arxiv_version","alias_value":"1210.5607v2","created_at":"2026-05-18T03:13:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.5607","created_at":"2026-05-18T03:13:20Z"},{"alias_kind":"pith_short_12","alias_value":"L55QEFR32N6J","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"L55QEFR32N6JOC3J","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"L55QEFR3","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:630348f73ce926b5cf9677e9ed82430b13de6dc7c26fcb7c8b5646bfa2e07c4a","target":"graph","created_at":"2026-05-18T03:13:20Z","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":"A coloring $c$ of the vertices of a graph $G$ is nonrepetitive if there exists no path $v_1v_2\\ldots v_{2l}$ for which $c(v_i)=c(v_{l+i})$ for all $1\\le i\\le l$. Given graphs $G$ and $H$ with $|V(H)|=k$, the lexicographic product $G[H]$ is the graph obtained by substituting every vertex of $G$ by a copy of $H$, and every edge of $G$ by a copy of $K_{k,k}$. %Our main results are the following. We prove that for a sufficiently long path $P$, a nonrepetitive coloring of $P[K_k]$ needs at least $3k+\\lfloor k/2\\rfloor$ colors. If $k>2$ then we need exactly $2k+1$ colors to nonrepetitively color $P[","authors_text":"Bal\\'azs Keszegh, Bal\\'azs Patk\\'os, Xuding Zhu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-20T11:48:03Z","title":"Nonrepetitive colorings of lexicographic product of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.5607","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:39630bad1e8e79b578ec433cf81592246956d8b20b83424ebaa2b351d436fabf","target":"record","created_at":"2026-05-18T03:13:20Z","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":"21b1c5a34778dff3c4aa7afa63d55aea84cccf6c25082a15333fd7ab9705e522","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-20T11:48:03Z","title_canon_sha256":"fb2bcbb118a3e71bf9bb0c6aa150838c7ce53a98f7ae21cd3b847c482b213f9f"},"schema_version":"1.0","source":{"id":"1210.5607","kind":"arxiv","version":2}},"canonical_sha256":"5f7b02163bd37c970b69f01b63803cc98ee7d5a13d9b141190e5650a129437cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f7b02163bd37c970b69f01b63803cc98ee7d5a13d9b141190e5650a129437cb","first_computed_at":"2026-05-18T03:13:20.292567Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:13:20.292567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vPJNzDbVenLQETwttIRnwPku/NeY8TpUhop39FvtEkQXaydZxef9/4zSn1sX3iElJXumNkBJWFyWN3+pGn+cAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:13:20.293053Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.5607","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:39630bad1e8e79b578ec433cf81592246956d8b20b83424ebaa2b351d436fabf","sha256:630348f73ce926b5cf9677e9ed82430b13de6dc7c26fcb7c8b5646bfa2e07c4a"],"state_sha256":"ac0497ffca7106265e37fe8951bf9c41dbf5a713dec65fe0146c66e5b8405abf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lwhPNhyttNkCE3oM8nTHAoXO4cvSep3/j48aJlzukJm7+vWfWTZ12SVDcLyrGKEwYb7eeBBtsXf9olm33k8iAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T09:43:02.427478Z","bundle_sha256":"206c86f2dcca8308dd5c390c4b4d25cf8659b084719c114a5f71761d4cc7025c"}}