{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:6DPM7ACSABAZQYAFXBQM7VAJZC","short_pith_number":"pith:6DPM7ACS","schema_version":"1.0","canonical_sha256":"f0decf80520041986005b860cfd409c8bcd612af422b5596076acb5e585aeaeb","source":{"kind":"arxiv","id":"1409.5154","version":1},"attestation_state":"computed","paper":{"title":"A note on the Thue chromatic number of lexicographic products of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrej Taranenko, Erika \\v{S}krabu\\v{l}\\'akov\\'a, Iztok Peterin, Jens Schreyer","submitted_at":"2014-09-17T21:42:09Z","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 "},"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":"1409.5154","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-17T21:42:09Z","cross_cats_sorted":[],"title_canon_sha256":"20137f722b7a6d32004c4a12b5125e680a4dce583237b5e351201a69da667519","abstract_canon_sha256":"4631133774b3f2cdea409f278d3af00cdf620fe44d678e3dc827b916ad745e04"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:30.814091Z","signature_b64":"xPSkWl7OKUYhT6diJKaIpeUlBkpU/s2ZWP9XXgd33ER08HfYrEDt8cGTdQpTUQ8movQLBinvd6M5095gwSHfAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0decf80520041986005b860cfd409c8bcd612af422b5596076acb5e585aeaeb","last_reissued_at":"2026-05-18T02:42:30.813273Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:30.813273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on the Thue chromatic number of lexicographic products of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrej Taranenko, Erika \\v{S}krabu\\v{l}\\'akov\\'a, Iztok Peterin, Jens Schreyer","submitted_at":"2014-09-17T21:42:09Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.5154","kind":"arxiv","version":1},"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":"1409.5154","created_at":"2026-05-18T02:42:30.813424+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.5154v1","created_at":"2026-05-18T02:42:30.813424+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.5154","created_at":"2026-05-18T02:42:30.813424+00:00"},{"alias_kind":"pith_short_12","alias_value":"6DPM7ACSABAZ","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"6DPM7ACSABAZQYAF","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"6DPM7ACS","created_at":"2026-05-18T12:28:16.859392+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/6DPM7ACSABAZQYAFXBQM7VAJZC","json":"https://pith.science/pith/6DPM7ACSABAZQYAFXBQM7VAJZC.json","graph_json":"https://pith.science/api/pith-number/6DPM7ACSABAZQYAFXBQM7VAJZC/graph.json","events_json":"https://pith.science/api/pith-number/6DPM7ACSABAZQYAFXBQM7VAJZC/events.json","paper":"https://pith.science/paper/6DPM7ACS"},"agent_actions":{"view_html":"https://pith.science/pith/6DPM7ACSABAZQYAFXBQM7VAJZC","download_json":"https://pith.science/pith/6DPM7ACSABAZQYAFXBQM7VAJZC.json","view_paper":"https://pith.science/paper/6DPM7ACS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.5154&json=true","fetch_graph":"https://pith.science/api/pith-number/6DPM7ACSABAZQYAFXBQM7VAJZC/graph.json","fetch_events":"https://pith.science/api/pith-number/6DPM7ACSABAZQYAFXBQM7VAJZC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6DPM7ACSABAZQYAFXBQM7VAJZC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6DPM7ACSABAZQYAFXBQM7VAJZC/action/storage_attestation","attest_author":"https://pith.science/pith/6DPM7ACSABAZQYAFXBQM7VAJZC/action/author_attestation","sign_citation":"https://pith.science/pith/6DPM7ACSABAZQYAFXBQM7VAJZC/action/citation_signature","submit_replication":"https://pith.science/pith/6DPM7ACSABAZQYAFXBQM7VAJZC/action/replication_record"}},"created_at":"2026-05-18T02:42:30.813424+00:00","updated_at":"2026-05-18T02:42:30.813424+00:00"}