{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:3IO5WFKOFGKY4LOJM46WGK4C2M","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":"a3943048e28e3796cc486bf72b23c6c822cdf2089f3478c9773d2bad1633f585","cross_cats_sorted":[],"license":"","primary_cat":"cs.DM","submitted_at":"2006-07-03T06:38:48Z","title_canon_sha256":"d7cc01aa072c98fd39ee061eeadd9417ea41dd49dd5660f19cc04d66e712d4e2"},"schema_version":"1.0","source":{"id":"cs/0607008","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0607008","created_at":"2026-05-18T01:08:54Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0607008v1","created_at":"2026-05-18T01:08:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0607008","created_at":"2026-05-18T01:08:54Z"},{"alias_kind":"pith_short_12","alias_value":"3IO5WFKOFGKY","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"3IO5WFKOFGKY4LOJ","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"3IO5WFKO","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:892e2a939dc4741390e3eb77e0b707aab4ffd572e152bf91cbf8af5616e3e52e","target":"graph","created_at":"2026-05-18T01:08:54Z","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 plane graph is l-facially k-colourable if its vertices can be coloured with k colours such that any two distinct vertices on a facial segment of length at most l are coloured differently. We prove that every plane graph is 3-facially 11-colourable. As a consequence, we derive that every 2-connected plane graph with maximum face-size at most 7 is cyclically 11-colourable. These two bounds are for one off from those that are proposed by the (3l+1)-Conjecture and the Cyclic Conjecture.","authors_text":"F\\'ed\\'eric Havet (INRIA Sophia Antipolis), Jean-S\\'ebastien Sereni (INRIA Sophia Antipolis), Riste Skrekovski","cross_cats":[],"headline":"","license":"","primary_cat":"cs.DM","submitted_at":"2006-07-03T06:38:48Z","title":"3-facial colouring of plane graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0607008","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:f3adea03053c1b182a4af6c77b17564163bd3284a90e851c0d6f92bd82e1a97f","target":"record","created_at":"2026-05-18T01:08:54Z","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":"a3943048e28e3796cc486bf72b23c6c822cdf2089f3478c9773d2bad1633f585","cross_cats_sorted":[],"license":"","primary_cat":"cs.DM","submitted_at":"2006-07-03T06:38:48Z","title_canon_sha256":"d7cc01aa072c98fd39ee061eeadd9417ea41dd49dd5660f19cc04d66e712d4e2"},"schema_version":"1.0","source":{"id":"cs/0607008","kind":"arxiv","version":1}},"canonical_sha256":"da1ddb154e29958e2dc9673d632b82d3272cf7d8b6ba281af6fc8815abac045f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da1ddb154e29958e2dc9673d632b82d3272cf7d8b6ba281af6fc8815abac045f","first_computed_at":"2026-05-18T01:08:54.600248Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:54.600248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CnjxGzIswByyNdfElaUvKFD9I6JLJvB7hInBeqyQ0XNfvfrhXhJQ5QsLXE2BqUCS9g1+FIWDlITguSTdjfdqCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:54.600781Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0607008","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3adea03053c1b182a4af6c77b17564163bd3284a90e851c0d6f92bd82e1a97f","sha256:892e2a939dc4741390e3eb77e0b707aab4ffd572e152bf91cbf8af5616e3e52e"],"state_sha256":"f6af16a0274c90054adc72416a8ff0eca856f0416898e5b755cc558beb0958fe"}