{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:6DPM7ACSABAZQYAFXBQM7VAJZC","short_pith_number":"pith:6DPM7ACS","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"},"canonical_sha256":"f0decf80520041986005b860cfd409c8bcd612af422b5596076acb5e585aeaeb","source":{"kind":"arxiv","id":"1409.5154","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:6DPM7ACSABAZQYAFXBQM7VAJZC","target":"record","payload":{"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"},"canonical_sha256":"f0decf80520041986005b860cfd409c8bcd612af422b5596076acb5e585aeaeb","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"},"source_kind":"arxiv","source_id":"1409.5154","source_version":1,"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-18T02:42:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ki0IHEBSErEfwAOgrxX0Lfhwt4HOxzVfIvxjnPkgZTqhIiE/0JtGROfVhlkARyrBrBh44Do5lcOfeA+hltNCCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T00:51:03.106151Z"},"content_sha256":"849c8f34f0dbbd83c637d0323a1cd1debef077ce74b11e0b5ccdb6c67cacb5b5","schema_version":"1.0","event_id":"sha256:849c8f34f0dbbd83c637d0323a1cd1debef077ce74b11e0b5ccdb6c67cacb5b5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:6DPM7ACSABAZQYAFXBQM7VAJZC","target":"graph","payload":{"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"},"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-18T02:42:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o5/YHJWItDC2pPCAREfzxvKAHdsRrPooqqLRwq+CsT/lo8fwOEpbIpqx4cN7ty7GvnGxQpTnTehr9yLDOR8tDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T00:51:03.106521Z"},"content_sha256":"df2cf0557544c716707f3ed61fefa5fb07c5393c9bb6eceeb79fe5b01013491f","schema_version":"1.0","event_id":"sha256:df2cf0557544c716707f3ed61fefa5fb07c5393c9bb6eceeb79fe5b01013491f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6DPM7ACSABAZQYAFXBQM7VAJZC/bundle.json","state_url":"https://pith.science/pith/6DPM7ACSABAZQYAFXBQM7VAJZC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6DPM7ACSABAZQYAFXBQM7VAJZC/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-23T00:51:03Z","links":{"resolver":"https://pith.science/pith/6DPM7ACSABAZQYAFXBQM7VAJZC","bundle":"https://pith.science/pith/6DPM7ACSABAZQYAFXBQM7VAJZC/bundle.json","state":"https://pith.science/pith/6DPM7ACSABAZQYAFXBQM7VAJZC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6DPM7ACSABAZQYAFXBQM7VAJZC/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q4KUNuwVJtvu0qye3T1mmc/NrvOt+C5q+5nQLJizGazL9IaWdgBSGOAlDc6yXyFDhOWOjxuBQQzq6t1Ws9zYDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T00:51:03.108459Z","bundle_sha256":"c7c5dc51f0891a48a34967a1bbbb486c73cedd43d5f06c06b401b354e0b4a7ed"}}