{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:4S7KWV2SDT7GDR4LUQ7UJQJV3X","short_pith_number":"pith:4S7KWV2S","canonical_record":{"source":{"id":"1308.5128","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-23T14:06:30Z","cross_cats_sorted":[],"title_canon_sha256":"4764cb37f717875695b45d2c32982f48fd39d15adcf7582aa4636e40ff3e52de","abstract_canon_sha256":"50db12c4147b287cf3f657fcb7731522dbf2f9997222629bc235d7f49d4ee441"},"schema_version":"1.0"},"canonical_sha256":"e4beab57521cfe61c78ba43f44c135ddcaba8fd60d75ab20637555fd3389cf46","source":{"kind":"arxiv","id":"1308.5128","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.5128","created_at":"2026-05-18T03:12:59Z"},{"alias_kind":"arxiv_version","alias_value":"1308.5128v3","created_at":"2026-05-18T03:12:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.5128","created_at":"2026-05-18T03:12:59Z"},{"alias_kind":"pith_short_12","alias_value":"4S7KWV2SDT7G","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4S7KWV2SDT7GDR4L","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4S7KWV2S","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:4S7KWV2SDT7GDR4LUQ7UJQJV3X","target":"record","payload":{"canonical_record":{"source":{"id":"1308.5128","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-23T14:06:30Z","cross_cats_sorted":[],"title_canon_sha256":"4764cb37f717875695b45d2c32982f48fd39d15adcf7582aa4636e40ff3e52de","abstract_canon_sha256":"50db12c4147b287cf3f657fcb7731522dbf2f9997222629bc235d7f49d4ee441"},"schema_version":"1.0"},"canonical_sha256":"e4beab57521cfe61c78ba43f44c135ddcaba8fd60d75ab20637555fd3389cf46","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:59.573200Z","signature_b64":"+7O2NAUdRvI7FOZ6GMibTMSmB069V3UOtLW/q6s9S30rBiJgfTQn5kzFtqOBEF7NI0ViBfQZVc6Pd4vM4NWFCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4beab57521cfe61c78ba43f44c135ddcaba8fd60d75ab20637555fd3389cf46","last_reissued_at":"2026-05-18T03:12:59.572429Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:59.572429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.5128","source_version":3,"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-18T03:12:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2h1/H9Uu4sk8/7UCRzw7RXRMWJEPbjn9AGyNlwRGHGzsoGk4TXU3lio6l1JHFErLfP8ce26YaWldZGLGvnwjAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:48:14.914264Z"},"content_sha256":"6f85229010de105fac6e9d333b9e817aebfe393a2cb77c4733851b93497605b2","schema_version":"1.0","event_id":"sha256:6f85229010de105fac6e9d333b9e817aebfe393a2cb77c4733851b93497605b2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:4S7KWV2SDT7GDR4LUQ7UJQJV3X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the facial Thue choice number of plane graphs via entropy compression method","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, Jakub Przyby{\\l}o, Jens Schreyer","submitted_at":"2013-08-23T14:06:30Z","abstract_excerpt":"Let $G$ be a plane graph. A vertex-colouring $\\varphi$ of $G$ is called {\\em facial non-repetitive} if for no sequence $r_1 r_2 \\dots r_{2n}$, $n\\geq 1$, of consecutive vertex colours of any facial path it holds $r_i=r_{n+i}$ for all $i=1,2,\\dots,n$. A plane graph $G$ is {\\em facial non-repetitively $l$-choosable} if for every list assignment $L:V\\rightarrow 2\\sp{\\mathbb{N}}$ with minimum list size at least $l$ there is a facial non-repetitive vertex-colouring $\\varphi$ with colours from the associated lists. The {\\em facial Thue choice number}, $\\pi_{fl}(G)$, of a plane graph $G$ is the minim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.5128","kind":"arxiv","version":3},"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-18T03:12:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ji+8Ob+eBsOcnB5MNrltGQ+z7eR2pH475Hfo/tG19t/mHc45rm3DuaqzadR/vdYarzYydmWlIxut2hk8SqFWDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:48:14.914619Z"},"content_sha256":"a1b513c1da58cbe4dcd1705f4748db3a9d322ca0144643d401bc6a7d617fef62","schema_version":"1.0","event_id":"sha256:a1b513c1da58cbe4dcd1705f4748db3a9d322ca0144643d401bc6a7d617fef62"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4S7KWV2SDT7GDR4LUQ7UJQJV3X/bundle.json","state_url":"https://pith.science/pith/4S7KWV2SDT7GDR4LUQ7UJQJV3X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4S7KWV2SDT7GDR4LUQ7UJQJV3X/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-30T17:48:14Z","links":{"resolver":"https://pith.science/pith/4S7KWV2SDT7GDR4LUQ7UJQJV3X","bundle":"https://pith.science/pith/4S7KWV2SDT7GDR4LUQ7UJQJV3X/bundle.json","state":"https://pith.science/pith/4S7KWV2SDT7GDR4LUQ7UJQJV3X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4S7KWV2SDT7GDR4LUQ7UJQJV3X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:4S7KWV2SDT7GDR4LUQ7UJQJV3X","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":"50db12c4147b287cf3f657fcb7731522dbf2f9997222629bc235d7f49d4ee441","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-23T14:06:30Z","title_canon_sha256":"4764cb37f717875695b45d2c32982f48fd39d15adcf7582aa4636e40ff3e52de"},"schema_version":"1.0","source":{"id":"1308.5128","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.5128","created_at":"2026-05-18T03:12:59Z"},{"alias_kind":"arxiv_version","alias_value":"1308.5128v3","created_at":"2026-05-18T03:12:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.5128","created_at":"2026-05-18T03:12:59Z"},{"alias_kind":"pith_short_12","alias_value":"4S7KWV2SDT7G","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4S7KWV2SDT7GDR4L","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4S7KWV2S","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:a1b513c1da58cbe4dcd1705f4748db3a9d322ca0144643d401bc6a7d617fef62","target":"graph","created_at":"2026-05-18T03:12:59Z","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":"Let $G$ be a plane graph. A vertex-colouring $\\varphi$ of $G$ is called {\\em facial non-repetitive} if for no sequence $r_1 r_2 \\dots r_{2n}$, $n\\geq 1$, of consecutive vertex colours of any facial path it holds $r_i=r_{n+i}$ for all $i=1,2,\\dots,n$. A plane graph $G$ is {\\em facial non-repetitively $l$-choosable} if for every list assignment $L:V\\rightarrow 2\\sp{\\mathbb{N}}$ with minimum list size at least $l$ there is a facial non-repetitive vertex-colouring $\\varphi$ with colours from the associated lists. The {\\em facial Thue choice number}, $\\pi_{fl}(G)$, of a plane graph $G$ is the minim","authors_text":"Erika \\v{S}krabu\\v{l}\\'akov\\'a, Jakub Przyby{\\l}o, Jens Schreyer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-23T14:06:30Z","title":"On the facial Thue choice number of plane graphs via entropy compression method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.5128","kind":"arxiv","version":3},"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:6f85229010de105fac6e9d333b9e817aebfe393a2cb77c4733851b93497605b2","target":"record","created_at":"2026-05-18T03:12:59Z","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":"50db12c4147b287cf3f657fcb7731522dbf2f9997222629bc235d7f49d4ee441","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-23T14:06:30Z","title_canon_sha256":"4764cb37f717875695b45d2c32982f48fd39d15adcf7582aa4636e40ff3e52de"},"schema_version":"1.0","source":{"id":"1308.5128","kind":"arxiv","version":3}},"canonical_sha256":"e4beab57521cfe61c78ba43f44c135ddcaba8fd60d75ab20637555fd3389cf46","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4beab57521cfe61c78ba43f44c135ddcaba8fd60d75ab20637555fd3389cf46","first_computed_at":"2026-05-18T03:12:59.572429Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:59.572429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+7O2NAUdRvI7FOZ6GMibTMSmB069V3UOtLW/q6s9S30rBiJgfTQn5kzFtqOBEF7NI0ViBfQZVc6Pd4vM4NWFCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:59.573200Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.5128","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f85229010de105fac6e9d333b9e817aebfe393a2cb77c4733851b93497605b2","sha256:a1b513c1da58cbe4dcd1705f4748db3a9d322ca0144643d401bc6a7d617fef62"],"state_sha256":"a039f90f3c3567f61774da4af701cd303bdf99d88cccb2b5461fe394d3272c18"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KaPwjDGT5ErWFVfuwcQebUf2JjW+TY+VJVbyZFGEMOkx6RoOeCBIAWiSyG79i89kGIcxa9/TTHkSe3MQzaBbBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T17:48:14.917217Z","bundle_sha256":"3da2abf996ab9c8a85647800d2cd6c5431e620098bb04efa3f4537510e5d0d19"}}