{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:6DPM7ACSABAZQYAFXBQM7VAJZC","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":"4631133774b3f2cdea409f278d3af00cdf620fe44d678e3dc827b916ad745e04","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-17T21:42:09Z","title_canon_sha256":"20137f722b7a6d32004c4a12b5125e680a4dce583237b5e351201a69da667519"},"schema_version":"1.0","source":{"id":"1409.5154","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.5154","created_at":"2026-05-18T02:42:30Z"},{"alias_kind":"arxiv_version","alias_value":"1409.5154v1","created_at":"2026-05-18T02:42:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.5154","created_at":"2026-05-18T02:42:30Z"},{"alias_kind":"pith_short_12","alias_value":"6DPM7ACSABAZ","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6DPM7ACSABAZQYAF","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6DPM7ACS","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:df2cf0557544c716707f3ed61fefa5fb07c5393c9bb6eceeb79fe5b01013491f","target":"graph","created_at":"2026-05-18T02:42:30Z","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 sequence is called non-repetitive if no of its subsequences forms a repetition (a sequence $r_1,r_2,\\dots,r_{2n}$ such that $r_i=r_{n+i}$ for all $1\\leq i \\leq n$). Let $G$ be a graph whose vertices are coloured. A colouring $\\varphi$ of the graph $G$ is non-repetitive if the sequence of colours on every path in $G$ is non-repetitive. The Thue chromatic number, denoted by $\\pi (G)$, is the minimum number of colours of a non-repetitive colouring of $G$. In this short note we present a general upper bound for the Thue chromatic number for the lexicographic product $G\\circ H$ of graphs $G$ and ","authors_text":"Andrej Taranenko, Erika \\v{S}krabu\\v{l}\\'akov\\'a, Iztok Peterin, Jens Schreyer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-17T21:42:09Z","title":"A note on the Thue chromatic number of lexicographic products of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.5154","kind":"arxiv","version":1},"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:849c8f34f0dbbd83c637d0323a1cd1debef077ce74b11e0b5ccdb6c67cacb5b5","target":"record","created_at":"2026-05-18T02:42:30Z","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":"4631133774b3f2cdea409f278d3af00cdf620fe44d678e3dc827b916ad745e04","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-17T21:42:09Z","title_canon_sha256":"20137f722b7a6d32004c4a12b5125e680a4dce583237b5e351201a69da667519"},"schema_version":"1.0","source":{"id":"1409.5154","kind":"arxiv","version":1}},"canonical_sha256":"f0decf80520041986005b860cfd409c8bcd612af422b5596076acb5e585aeaeb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0decf80520041986005b860cfd409c8bcd612af422b5596076acb5e585aeaeb","first_computed_at":"2026-05-18T02:42:30.813273Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:30.813273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xPSkWl7OKUYhT6diJKaIpeUlBkpU/s2ZWP9XXgd33ER08HfYrEDt8cGTdQpTUQ8movQLBinvd6M5095gwSHfAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:30.814091Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.5154","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:849c8f34f0dbbd83c637d0323a1cd1debef077ce74b11e0b5ccdb6c67cacb5b5","sha256:df2cf0557544c716707f3ed61fefa5fb07c5393c9bb6eceeb79fe5b01013491f"],"state_sha256":"a65c3bc1a437c27cf1d7ca10b56eebb364f4bb604ca9a9897eaa82ea363471ed"}