{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:UOJLNV37GNSZ6BBYITTW4FA557","short_pith_number":"pith:UOJLNV37","schema_version":"1.0","canonical_sha256":"a392b6d77f33659f043844e76e141deff9a6e3f6d3af9948f241d76318b05fca","source":{"kind":"arxiv","id":"1207.5155","version":1},"attestation_state":"computed","paper":{"title":"Nonrepetitive choice number of trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jakub Kozik, Piotr Micek","submitted_at":"2012-07-21T15:19:16Z","abstract_excerpt":"A nonrepetitive coloring of a path is a coloring of its vertices such that the sequence of colors along the path does not contain two identical, consecutive blocks. The remarkable construction of Thue asserts that 3 colors are enough to color nonrepetitively paths of any length. A nonrepetitive coloring of a graph is a coloring of its vertices such that all simple paths are nonrepetitively colored. Assume that each vertex $v$ of a graph $G$ has assigned a set (list) of colors $L_v$. A coloring is chosen from $\\{L_v\\}_{v\\in V(G)}$ if the color of each $v$ belongs to $L_v$. The Thue choice numbe"},"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":"1207.5155","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-21T15:19:16Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d9799613d3a6b855cc2d4945f9828e8203c694b8834876e6e174a507f0aa600a","abstract_canon_sha256":"67996ab67fc3dbbf1c2d17df1e014a67b02c8eca833c67c800d6b77fffd16149"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:24.388369Z","signature_b64":"lvRjD9a1cqT95xtpPdrxHw/zfOEmlZI8TPIl8H3s01W8n/hVVrsFNq/O/HdBhiB8GCy9nM3Jv9iAssxUsyvBDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a392b6d77f33659f043844e76e141deff9a6e3f6d3af9948f241d76318b05fca","last_reissued_at":"2026-05-18T03:50:24.387569Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:24.387569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nonrepetitive choice number of trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jakub Kozik, Piotr Micek","submitted_at":"2012-07-21T15:19:16Z","abstract_excerpt":"A nonrepetitive coloring of a path is a coloring of its vertices such that the sequence of colors along the path does not contain two identical, consecutive blocks. The remarkable construction of Thue asserts that 3 colors are enough to color nonrepetitively paths of any length. A nonrepetitive coloring of a graph is a coloring of its vertices such that all simple paths are nonrepetitively colored. Assume that each vertex $v$ of a graph $G$ has assigned a set (list) of colors $L_v$. A coloring is chosen from $\\{L_v\\}_{v\\in V(G)}$ if the color of each $v$ belongs to $L_v$. The Thue choice numbe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5155","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":"1207.5155","created_at":"2026-05-18T03:50:24.387688+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.5155v1","created_at":"2026-05-18T03:50:24.387688+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5155","created_at":"2026-05-18T03:50:24.387688+00:00"},{"alias_kind":"pith_short_12","alias_value":"UOJLNV37GNSZ","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"UOJLNV37GNSZ6BBY","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"UOJLNV37","created_at":"2026-05-18T12:27:23.164592+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/UOJLNV37GNSZ6BBYITTW4FA557","json":"https://pith.science/pith/UOJLNV37GNSZ6BBYITTW4FA557.json","graph_json":"https://pith.science/api/pith-number/UOJLNV37GNSZ6BBYITTW4FA557/graph.json","events_json":"https://pith.science/api/pith-number/UOJLNV37GNSZ6BBYITTW4FA557/events.json","paper":"https://pith.science/paper/UOJLNV37"},"agent_actions":{"view_html":"https://pith.science/pith/UOJLNV37GNSZ6BBYITTW4FA557","download_json":"https://pith.science/pith/UOJLNV37GNSZ6BBYITTW4FA557.json","view_paper":"https://pith.science/paper/UOJLNV37","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.5155&json=true","fetch_graph":"https://pith.science/api/pith-number/UOJLNV37GNSZ6BBYITTW4FA557/graph.json","fetch_events":"https://pith.science/api/pith-number/UOJLNV37GNSZ6BBYITTW4FA557/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UOJLNV37GNSZ6BBYITTW4FA557/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UOJLNV37GNSZ6BBYITTW4FA557/action/storage_attestation","attest_author":"https://pith.science/pith/UOJLNV37GNSZ6BBYITTW4FA557/action/author_attestation","sign_citation":"https://pith.science/pith/UOJLNV37GNSZ6BBYITTW4FA557/action/citation_signature","submit_replication":"https://pith.science/pith/UOJLNV37GNSZ6BBYITTW4FA557/action/replication_record"}},"created_at":"2026-05-18T03:50:24.387688+00:00","updated_at":"2026-05-18T03:50:24.387688+00:00"}