{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:PQY5JYW3MOSK3ZZSQO4X45RYS5","short_pith_number":"pith:PQY5JYW3","canonical_record":{"source":{"id":"1909.02612","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-09-05T19:38:29Z","cross_cats_sorted":[],"title_canon_sha256":"c93df77c7b11a7bf1ac52710e13aabcc11bb735301b81e76b297886aa8ca3afb","abstract_canon_sha256":"1eacecd6d09959c0af3f7486c1faefd548e9394723dcf5db3d2eab74de20a89d"},"schema_version":"1.0"},"canonical_sha256":"7c31d4e2db63a4ade73283b97e7638977dc052902849c87bb28b2d5640517744","source":{"kind":"arxiv","id":"1909.02612","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.02612","created_at":"2026-07-05T00:02:41Z"},{"alias_kind":"arxiv_version","alias_value":"1909.02612v1","created_at":"2026-07-05T00:02:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.02612","created_at":"2026-07-05T00:02:41Z"},{"alias_kind":"pith_short_12","alias_value":"PQY5JYW3MOSK","created_at":"2026-07-05T00:02:41Z"},{"alias_kind":"pith_short_16","alias_value":"PQY5JYW3MOSK3ZZS","created_at":"2026-07-05T00:02:41Z"},{"alias_kind":"pith_short_8","alias_value":"PQY5JYW3","created_at":"2026-07-05T00:02:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:PQY5JYW3MOSK3ZZSQO4X45RYS5","target":"record","payload":{"canonical_record":{"source":{"id":"1909.02612","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-09-05T19:38:29Z","cross_cats_sorted":[],"title_canon_sha256":"c93df77c7b11a7bf1ac52710e13aabcc11bb735301b81e76b297886aa8ca3afb","abstract_canon_sha256":"1eacecd6d09959c0af3f7486c1faefd548e9394723dcf5db3d2eab74de20a89d"},"schema_version":"1.0"},"canonical_sha256":"7c31d4e2db63a4ade73283b97e7638977dc052902849c87bb28b2d5640517744","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:02:41.085583Z","signature_b64":"abHN1iT9hqxjA2d/nWhvm9QC3wZYjJm3URA+p7wXOGrXNKxe4L905LAQMqnEW9+6gXQHztkv2gcgnUPUIs/fBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c31d4e2db63a4ade73283b97e7638977dc052902849c87bb28b2d5640517744","last_reissued_at":"2026-07-05T00:02:41.085098Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:02:41.085098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1909.02612","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-07-05T00:02:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AERTsno1TLFO5oXq0XMsxbzg6EQfUGx2Zw1dfbsM7XFy0sJADpYi4ZPh0M+tWAtsXE+vREHoOI2mXKvV3k8JAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T06:18:56.450008Z"},"content_sha256":"27100143a56ee4d0f6239b84fe10cd24a33bbb41a58f79e333a7a02b67b08ec5","schema_version":"1.0","event_id":"sha256:27100143a56ee4d0f6239b84fe10cd24a33bbb41a58f79e333a7a02b67b08ec5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:PQY5JYW3MOSK3ZZSQO4X45RYS5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A note about online nonrepetitive coloring $k$-trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bal\\'azs Keszegh, Xuding Zhu","submitted_at":"2019-09-05T19:38:29Z","abstract_excerpt":"We prove that it is always possible to color online nonrepetitively any (partial) $k$-tree (that is, graphs with tree-width at most $k$) with $4^k$ colors. This implies that it is always possible to color online nonrepetitively cycles, trees and series-parallel graphs with $16$ colors. Our results generalize the respective (offline) nonrepetitive coloring results."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.02612","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1909.02612/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:02:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IuQzqvNcygB6zavLIXbtkbIvhx1dbFp0NwjOSPe0H2cyXV6jDDRiSA+RPEUuanphXR1DlovFV6oAWzznczTTBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T06:18:56.450511Z"},"content_sha256":"5dcff3eb804e59062ae3840980f32611dbe8061649a943dffad6d09b25241c06","schema_version":"1.0","event_id":"sha256:5dcff3eb804e59062ae3840980f32611dbe8061649a943dffad6d09b25241c06"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PQY5JYW3MOSK3ZZSQO4X45RYS5/bundle.json","state_url":"https://pith.science/pith/PQY5JYW3MOSK3ZZSQO4X45RYS5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PQY5JYW3MOSK3ZZSQO4X45RYS5/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-08-17T06:18:56Z","links":{"resolver":"https://pith.science/pith/PQY5JYW3MOSK3ZZSQO4X45RYS5","bundle":"https://pith.science/pith/PQY5JYW3MOSK3ZZSQO4X45RYS5/bundle.json","state":"https://pith.science/pith/PQY5JYW3MOSK3ZZSQO4X45RYS5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PQY5JYW3MOSK3ZZSQO4X45RYS5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:PQY5JYW3MOSK3ZZSQO4X45RYS5","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":"1eacecd6d09959c0af3f7486c1faefd548e9394723dcf5db3d2eab74de20a89d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-09-05T19:38:29Z","title_canon_sha256":"c93df77c7b11a7bf1ac52710e13aabcc11bb735301b81e76b297886aa8ca3afb"},"schema_version":"1.0","source":{"id":"1909.02612","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.02612","created_at":"2026-07-05T00:02:41Z"},{"alias_kind":"arxiv_version","alias_value":"1909.02612v1","created_at":"2026-07-05T00:02:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.02612","created_at":"2026-07-05T00:02:41Z"},{"alias_kind":"pith_short_12","alias_value":"PQY5JYW3MOSK","created_at":"2026-07-05T00:02:41Z"},{"alias_kind":"pith_short_16","alias_value":"PQY5JYW3MOSK3ZZS","created_at":"2026-07-05T00:02:41Z"},{"alias_kind":"pith_short_8","alias_value":"PQY5JYW3","created_at":"2026-07-05T00:02:41Z"}],"graph_snapshots":[{"event_id":"sha256:5dcff3eb804e59062ae3840980f32611dbe8061649a943dffad6d09b25241c06","target":"graph","created_at":"2026-07-05T00:02:41Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1909.02612/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove that it is always possible to color online nonrepetitively any (partial) $k$-tree (that is, graphs with tree-width at most $k$) with $4^k$ colors. This implies that it is always possible to color online nonrepetitively cycles, trees and series-parallel graphs with $16$ colors. Our results generalize the respective (offline) nonrepetitive coloring results.","authors_text":"Bal\\'azs Keszegh, Xuding Zhu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-09-05T19:38:29Z","title":"A note about online nonrepetitive coloring $k$-trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.02612","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:27100143a56ee4d0f6239b84fe10cd24a33bbb41a58f79e333a7a02b67b08ec5","target":"record","created_at":"2026-07-05T00:02:41Z","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":"1eacecd6d09959c0af3f7486c1faefd548e9394723dcf5db3d2eab74de20a89d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-09-05T19:38:29Z","title_canon_sha256":"c93df77c7b11a7bf1ac52710e13aabcc11bb735301b81e76b297886aa8ca3afb"},"schema_version":"1.0","source":{"id":"1909.02612","kind":"arxiv","version":1}},"canonical_sha256":"7c31d4e2db63a4ade73283b97e7638977dc052902849c87bb28b2d5640517744","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7c31d4e2db63a4ade73283b97e7638977dc052902849c87bb28b2d5640517744","first_computed_at":"2026-07-05T00:02:41.085098Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:02:41.085098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"abHN1iT9hqxjA2d/nWhvm9QC3wZYjJm3URA+p7wXOGrXNKxe4L905LAQMqnEW9+6gXQHztkv2gcgnUPUIs/fBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:02:41.085583Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.02612","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27100143a56ee4d0f6239b84fe10cd24a33bbb41a58f79e333a7a02b67b08ec5","sha256:5dcff3eb804e59062ae3840980f32611dbe8061649a943dffad6d09b25241c06"],"state_sha256":"0eb1e335c9d392d45bc5b4ee59f7c43752f7133fd6a21c1764754991451b0531"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"abmKTqAYs68vZYDWbmwChoqYGZ3h5NEyMezsiVC45KP4nK7INl5OD4isAzK6zsblJOgPqerhy3XIRzCYGxb4AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T06:18:56.454769Z","bundle_sha256":"71954b1f178b8c6bde81cbd6688026fbd9b5d31e88ad90f40765943c5a8e7e89"}}