{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:DTEHZ3JGJKTHORF3DNK2H4QKMT","short_pith_number":"pith:DTEHZ3JG","canonical_record":{"source":{"id":"1207.0964","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-04T12:56:27Z","cross_cats_sorted":[],"title_canon_sha256":"fc6c8b157cee117ced968ee21588a65a06aad843c9385447c341f5d0caf78a41","abstract_canon_sha256":"1a11eaed5304fd2ef8fc8a203b8f91e621b483bad54293b7436c67f8e4376baa"},"schema_version":"1.0"},"canonical_sha256":"1cc87ced264aa67744bb1b55a3f20a64fcffd68b63f455c16e071204fc7e7767","source":{"kind":"arxiv","id":"1207.0964","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0964","created_at":"2026-05-18T02:43:24Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0964v1","created_at":"2026-05-18T02:43:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0964","created_at":"2026-05-18T02:43:24Z"},{"alias_kind":"pith_short_12","alias_value":"DTEHZ3JGJKTH","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"DTEHZ3JGJKTHORF3","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"DTEHZ3JG","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:DTEHZ3JGJKTHORF3DNK2H4QKMT","target":"record","payload":{"canonical_record":{"source":{"id":"1207.0964","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-04T12:56:27Z","cross_cats_sorted":[],"title_canon_sha256":"fc6c8b157cee117ced968ee21588a65a06aad843c9385447c341f5d0caf78a41","abstract_canon_sha256":"1a11eaed5304fd2ef8fc8a203b8f91e621b483bad54293b7436c67f8e4376baa"},"schema_version":"1.0"},"canonical_sha256":"1cc87ced264aa67744bb1b55a3f20a64fcffd68b63f455c16e071204fc7e7767","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:24.603601Z","signature_b64":"ozer44c53WLlkFFUPwqPPVaE0yGlYUzXKEFYRKJShry8Qv+7+sUWrCDz1j7uE+P/ppwlSj2oV57R2+YSQ9PUBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cc87ced264aa67744bb1b55a3f20a64fcffd68b63f455c16e071204fc7e7767","last_reissued_at":"2026-05-18T02:43:24.603071Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:24.603071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.0964","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:43:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fDL8ajPOufcSFG73CMH+Cc9RxRQavEBdDH6iGzS8AHa8kQufRqYgfN8F9KG5oUpl97kqLoBjcaGP+cU+0SdrCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:58:25.143406Z"},"content_sha256":"31def6bcb32b41f80f16067d22883d5c5d84b3534ded5f9e8a85d87f8dbe008c","schema_version":"1.0","event_id":"sha256:31def6bcb32b41f80f16067d22883d5c5d84b3534ded5f9e8a85d87f8dbe008c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:DTEHZ3JGJKTHORF3DNK2H4QKMT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the facial Thue choice index via entropy compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jakub Przyby{\\l}o","submitted_at":"2012-07-04T12:56:27Z","abstract_excerpt":"A sequence is nonrepetitive if it contains no identical consecutive subsequences. An edge colouring of a path is nonrepetitive if the sequence of colours of its consecutive edges is nonrepetitive. By the celebrated construction of Thue, it is possible to generate nonrepetitive edge colourings for arbitrarily long paths using only three colours. A recent generalization of this concept implies that we may obtain such colourings even if we are forced to choose edge colours from any sequence of lists of size 4 (while sufficiency of lists of size 3 remains an open problem). As an extension of these"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0964","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:43:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MyEs3/O/Fba8oBh27fZ+1pyVCu2vHTLFTmhRnRfSjvsKZ6GFHkhYf7nFh6ZmA/tPkmvHBTZYNVeOiEbkYz4EDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:58:25.144063Z"},"content_sha256":"4bbae6509a7dcaa45017f4ab9a9c218c7d0459ee222b6e4fe6fedc5403b94d5a","schema_version":"1.0","event_id":"sha256:4bbae6509a7dcaa45017f4ab9a9c218c7d0459ee222b6e4fe6fedc5403b94d5a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DTEHZ3JGJKTHORF3DNK2H4QKMT/bundle.json","state_url":"https://pith.science/pith/DTEHZ3JGJKTHORF3DNK2H4QKMT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DTEHZ3JGJKTHORF3DNK2H4QKMT/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-05-31T00:58:25Z","links":{"resolver":"https://pith.science/pith/DTEHZ3JGJKTHORF3DNK2H4QKMT","bundle":"https://pith.science/pith/DTEHZ3JGJKTHORF3DNK2H4QKMT/bundle.json","state":"https://pith.science/pith/DTEHZ3JGJKTHORF3DNK2H4QKMT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DTEHZ3JGJKTHORF3DNK2H4QKMT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:DTEHZ3JGJKTHORF3DNK2H4QKMT","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":"1a11eaed5304fd2ef8fc8a203b8f91e621b483bad54293b7436c67f8e4376baa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-04T12:56:27Z","title_canon_sha256":"fc6c8b157cee117ced968ee21588a65a06aad843c9385447c341f5d0caf78a41"},"schema_version":"1.0","source":{"id":"1207.0964","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0964","created_at":"2026-05-18T02:43:24Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0964v1","created_at":"2026-05-18T02:43:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0964","created_at":"2026-05-18T02:43:24Z"},{"alias_kind":"pith_short_12","alias_value":"DTEHZ3JGJKTH","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"DTEHZ3JGJKTHORF3","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"DTEHZ3JG","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:4bbae6509a7dcaa45017f4ab9a9c218c7d0459ee222b6e4fe6fedc5403b94d5a","target":"graph","created_at":"2026-05-18T02:43:24Z","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 nonrepetitive if it contains no identical consecutive subsequences. An edge colouring of a path is nonrepetitive if the sequence of colours of its consecutive edges is nonrepetitive. By the celebrated construction of Thue, it is possible to generate nonrepetitive edge colourings for arbitrarily long paths using only three colours. A recent generalization of this concept implies that we may obtain such colourings even if we are forced to choose edge colours from any sequence of lists of size 4 (while sufficiency of lists of size 3 remains an open problem). As an extension of these","authors_text":"Jakub Przyby{\\l}o","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-04T12:56:27Z","title":"On the facial Thue choice index via entropy compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0964","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:31def6bcb32b41f80f16067d22883d5c5d84b3534ded5f9e8a85d87f8dbe008c","target":"record","created_at":"2026-05-18T02:43:24Z","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":"1a11eaed5304fd2ef8fc8a203b8f91e621b483bad54293b7436c67f8e4376baa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-04T12:56:27Z","title_canon_sha256":"fc6c8b157cee117ced968ee21588a65a06aad843c9385447c341f5d0caf78a41"},"schema_version":"1.0","source":{"id":"1207.0964","kind":"arxiv","version":1}},"canonical_sha256":"1cc87ced264aa67744bb1b55a3f20a64fcffd68b63f455c16e071204fc7e7767","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1cc87ced264aa67744bb1b55a3f20a64fcffd68b63f455c16e071204fc7e7767","first_computed_at":"2026-05-18T02:43:24.603071Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:24.603071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ozer44c53WLlkFFUPwqPPVaE0yGlYUzXKEFYRKJShry8Qv+7+sUWrCDz1j7uE+P/ppwlSj2oV57R2+YSQ9PUBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:24.603601Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.0964","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:31def6bcb32b41f80f16067d22883d5c5d84b3534ded5f9e8a85d87f8dbe008c","sha256:4bbae6509a7dcaa45017f4ab9a9c218c7d0459ee222b6e4fe6fedc5403b94d5a"],"state_sha256":"505755be1a728f7d961fb39d18d8dab29905a29fb051f9fc957b33faaa1ec4f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4qZ61KMEwf5lk0N8xSNXAerO0+OxwEecQsJvO8cXLxFO6T5+Hm4I6OfE4eH0Yp0Ke+WVzBPTuxe/tkuuenjXCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T00:58:25.147642Z","bundle_sha256":"8dfff72ef245f033dfc125afd5aa8b22a851aaf63e987fbe3a129a239c103a25"}}