{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4S7KWV2SDT7GDR4LUQ7UJQJV3X","short_pith_number":"pith:4S7KWV2S","schema_version":"1.0","canonical_sha256":"e4beab57521cfe61c78ba43f44c135ddcaba8fd60d75ab20637555fd3389cf46","source":{"kind":"arxiv","id":"1308.5128","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1308.5128","created_at":"2026-05-18T03:12:59.572562+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.5128v3","created_at":"2026-05-18T03:12:59.572562+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.5128","created_at":"2026-05-18T03:12:59.572562+00:00"},{"alias_kind":"pith_short_12","alias_value":"4S7KWV2SDT7G","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"4S7KWV2SDT7GDR4L","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"4S7KWV2S","created_at":"2026-05-18T12:27:34.582898+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/4S7KWV2SDT7GDR4LUQ7UJQJV3X","json":"https://pith.science/pith/4S7KWV2SDT7GDR4LUQ7UJQJV3X.json","graph_json":"https://pith.science/api/pith-number/4S7KWV2SDT7GDR4LUQ7UJQJV3X/graph.json","events_json":"https://pith.science/api/pith-number/4S7KWV2SDT7GDR4LUQ7UJQJV3X/events.json","paper":"https://pith.science/paper/4S7KWV2S"},"agent_actions":{"view_html":"https://pith.science/pith/4S7KWV2SDT7GDR4LUQ7UJQJV3X","download_json":"https://pith.science/pith/4S7KWV2SDT7GDR4LUQ7UJQJV3X.json","view_paper":"https://pith.science/paper/4S7KWV2S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.5128&json=true","fetch_graph":"https://pith.science/api/pith-number/4S7KWV2SDT7GDR4LUQ7UJQJV3X/graph.json","fetch_events":"https://pith.science/api/pith-number/4S7KWV2SDT7GDR4LUQ7UJQJV3X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4S7KWV2SDT7GDR4LUQ7UJQJV3X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4S7KWV2SDT7GDR4LUQ7UJQJV3X/action/storage_attestation","attest_author":"https://pith.science/pith/4S7KWV2SDT7GDR4LUQ7UJQJV3X/action/author_attestation","sign_citation":"https://pith.science/pith/4S7KWV2SDT7GDR4LUQ7UJQJV3X/action/citation_signature","submit_replication":"https://pith.science/pith/4S7KWV2SDT7GDR4LUQ7UJQJV3X/action/replication_record"}},"created_at":"2026-05-18T03:12:59.572562+00:00","updated_at":"2026-05-18T03:12:59.572562+00:00"}