{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:Y2JVQ3HRF64XFDYXFHANZWARPA","short_pith_number":"pith:Y2JVQ3HR","canonical_record":{"source":{"id":"1508.02559","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-11T11:18:32Z","cross_cats_sorted":[],"title_canon_sha256":"faacf24e5ebeb2db2b00fd0faaed8ab5da39db03b0baa9b9ac6bd8a2870af6c5","abstract_canon_sha256":"ca9e01267911e71051cd210ae8e6fcefa10566b4c864654ae1d7b8fb34eacc10"},"schema_version":"1.0"},"canonical_sha256":"c693586cf12fb9728f1729c0dcd811783c56c8e7107c6b7290e24f78456f5985","source":{"kind":"arxiv","id":"1508.02559","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.02559","created_at":"2026-05-18T01:35:28Z"},{"alias_kind":"arxiv_version","alias_value":"1508.02559v1","created_at":"2026-05-18T01:35:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02559","created_at":"2026-05-18T01:35:28Z"},{"alias_kind":"pith_short_12","alias_value":"Y2JVQ3HRF64X","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"Y2JVQ3HRF64XFDYX","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"Y2JVQ3HR","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:Y2JVQ3HRF64XFDYXFHANZWARPA","target":"record","payload":{"canonical_record":{"source":{"id":"1508.02559","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-11T11:18:32Z","cross_cats_sorted":[],"title_canon_sha256":"faacf24e5ebeb2db2b00fd0faaed8ab5da39db03b0baa9b9ac6bd8a2870af6c5","abstract_canon_sha256":"ca9e01267911e71051cd210ae8e6fcefa10566b4c864654ae1d7b8fb34eacc10"},"schema_version":"1.0"},"canonical_sha256":"c693586cf12fb9728f1729c0dcd811783c56c8e7107c6b7290e24f78456f5985","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:28.852020Z","signature_b64":"yc+pquMA4NCkGXr9T0g0iJnAsWvFWRjlHdgPyPF2lYThWwuBsg522mLvfQx0+UafAm+4uHGyddRkeqqTRKrJDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c693586cf12fb9728f1729c0dcd811783c56c8e7107c6b7290e24f78456f5985","last_reissued_at":"2026-05-18T01:35:28.851421Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:28.851421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.02559","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-18T01:35:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X0Zu1R3EO4fHWGO4ISwQVjT4fkizjUyeMNgxda91nQIYZ3L903H0tKMnAcKF9Sy9gufspCbAqmrU2sjNbGOMBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T02:40:36.730808Z"},"content_sha256":"02a6e9c2f814cd9a4a1d08ee6d12aa4e67aa4f7cfacd30b2fdf1df6fbcdb87a4","schema_version":"1.0","event_id":"sha256:02a6e9c2f814cd9a4a1d08ee6d12aa4e67aa4f7cfacd30b2fdf1df6fbcdb87a4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:Y2JVQ3HRF64XFDYXFHANZWARPA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Thue choice number versus the Thue chromatic number of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Erika \\v{S}krabu\\v{l}\\'akov\\'a","submitted_at":"2015-08-11T11:18:32Z","abstract_excerpt":"We say that a vertex colouring $\\varphi$ of a graph $G$ is nonrepetitive if there is no positive integer $n$ and a path on $2n$ vertices $v_{1}\\ldots v_{2n}$ in $G$ such that the associated sequence of colours $\\varphi(v_{1})\\ldots\\varphi(v_{2n})$ satisfy $\\varphi(v_{i})=\\varphi(v_{i+n})$ for all $i=1,2,\\dots,n$. The minimum number of colours in a nonrepetitive vertex colouring of $G$ is the Thue chromatic number $\\pi (G)$. For the case of vertex list colourings the Thue choice number $\\pi_{l}(G)$ of $G$ denotes the smallest integer $k$ such that for every list assignment $L:V(G)\\rightarrow 2^"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02559","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-18T01:35:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SZ+QDxrHtlaJ+diBqLO1T+oWy4Mu8eOtzKwJd8kNA6AOiZWURus/YfE6rc1NSvQ/yB7y/UyvFqap1qiNMwvGCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T02:40:36.731291Z"},"content_sha256":"197682b84211b634236dde0a01dd5ecc387c977a1d4c9b059429f661adff56da","schema_version":"1.0","event_id":"sha256:197682b84211b634236dde0a01dd5ecc387c977a1d4c9b059429f661adff56da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y2JVQ3HRF64XFDYXFHANZWARPA/bundle.json","state_url":"https://pith.science/pith/Y2JVQ3HRF64XFDYXFHANZWARPA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y2JVQ3HRF64XFDYXFHANZWARPA/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-23T02:40:36Z","links":{"resolver":"https://pith.science/pith/Y2JVQ3HRF64XFDYXFHANZWARPA","bundle":"https://pith.science/pith/Y2JVQ3HRF64XFDYXFHANZWARPA/bundle.json","state":"https://pith.science/pith/Y2JVQ3HRF64XFDYXFHANZWARPA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y2JVQ3HRF64XFDYXFHANZWARPA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:Y2JVQ3HRF64XFDYXFHANZWARPA","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":"ca9e01267911e71051cd210ae8e6fcefa10566b4c864654ae1d7b8fb34eacc10","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-11T11:18:32Z","title_canon_sha256":"faacf24e5ebeb2db2b00fd0faaed8ab5da39db03b0baa9b9ac6bd8a2870af6c5"},"schema_version":"1.0","source":{"id":"1508.02559","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.02559","created_at":"2026-05-18T01:35:28Z"},{"alias_kind":"arxiv_version","alias_value":"1508.02559v1","created_at":"2026-05-18T01:35:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02559","created_at":"2026-05-18T01:35:28Z"},{"alias_kind":"pith_short_12","alias_value":"Y2JVQ3HRF64X","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"Y2JVQ3HRF64XFDYX","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"Y2JVQ3HR","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:197682b84211b634236dde0a01dd5ecc387c977a1d4c9b059429f661adff56da","target":"graph","created_at":"2026-05-18T01:35:28Z","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":"We say that a vertex colouring $\\varphi$ of a graph $G$ is nonrepetitive if there is no positive integer $n$ and a path on $2n$ vertices $v_{1}\\ldots v_{2n}$ in $G$ such that the associated sequence of colours $\\varphi(v_{1})\\ldots\\varphi(v_{2n})$ satisfy $\\varphi(v_{i})=\\varphi(v_{i+n})$ for all $i=1,2,\\dots,n$. The minimum number of colours in a nonrepetitive vertex colouring of $G$ is the Thue chromatic number $\\pi (G)$. For the case of vertex list colourings the Thue choice number $\\pi_{l}(G)$ of $G$ denotes the smallest integer $k$ such that for every list assignment $L:V(G)\\rightarrow 2^","authors_text":"Erika \\v{S}krabu\\v{l}\\'akov\\'a","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-11T11:18:32Z","title":"The Thue choice number versus the Thue chromatic number of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02559","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:02a6e9c2f814cd9a4a1d08ee6d12aa4e67aa4f7cfacd30b2fdf1df6fbcdb87a4","target":"record","created_at":"2026-05-18T01:35:28Z","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":"ca9e01267911e71051cd210ae8e6fcefa10566b4c864654ae1d7b8fb34eacc10","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-11T11:18:32Z","title_canon_sha256":"faacf24e5ebeb2db2b00fd0faaed8ab5da39db03b0baa9b9ac6bd8a2870af6c5"},"schema_version":"1.0","source":{"id":"1508.02559","kind":"arxiv","version":1}},"canonical_sha256":"c693586cf12fb9728f1729c0dcd811783c56c8e7107c6b7290e24f78456f5985","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c693586cf12fb9728f1729c0dcd811783c56c8e7107c6b7290e24f78456f5985","first_computed_at":"2026-05-18T01:35:28.851421Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:28.851421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yc+pquMA4NCkGXr9T0g0iJnAsWvFWRjlHdgPyPF2lYThWwuBsg522mLvfQx0+UafAm+4uHGyddRkeqqTRKrJDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:28.852020Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.02559","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02a6e9c2f814cd9a4a1d08ee6d12aa4e67aa4f7cfacd30b2fdf1df6fbcdb87a4","sha256:197682b84211b634236dde0a01dd5ecc387c977a1d4c9b059429f661adff56da"],"state_sha256":"be9b218bc884ab7957f90a7ccc7b13973911f68d457313b69ac195387b287720"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B3YRE4IdBg6goifucV7QfX7Y5jy1kHUsCL+MuALAA0LG7nlSnm5rZpd1VH7GXIzE73JsHxeCIPva0FWetEDKAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T02:40:36.733791Z","bundle_sha256":"65179c36cf6d4e4ca40a0e816b1b2471d62151de80701c210ba28da4e91f9405"}}