{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KXFLG3G2OTG4VXD7SQDA4352V5","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":"4a58e72cf0215ef79a6bcc5bb54446f46004eec816d92d42ef5063ca32ad6d3d","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-08T11:15:35Z","title_canon_sha256":"b51ed4e41a3664daaa0c3e11bf2379d82e29c3b225bdc76eb39d0a53e33dec60"},"schema_version":"1.0","source":{"id":"1805.02947","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02947","created_at":"2026-05-17T23:39:37Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02947v3","created_at":"2026-05-17T23:39:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02947","created_at":"2026-05-17T23:39:37Z"},{"alias_kind":"pith_short_12","alias_value":"KXFLG3G2OTG4","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KXFLG3G2OTG4VXD7","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KXFLG3G2","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:55c7ca1538604857b18b896782c01d2ee7d5aae30cd3aa8fc1521530af3451c6","target":"graph","created_at":"2026-05-17T23:39:37Z","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":"The interval number of a graph $G$ is the minimum $k$ such that one can assign to each vertex of $G$ a union of $k$ intervals on the real line, such that $G$ is the intersection graph of these sets, i.e., two vertices are adjacent in $G$ if and only if the corresponding sets of intervals have non-empty intersection. In 1983 Scheinerman and West [The interval number of a planar graph: Three intervals suffice. \\textit{J.~Comb.~Theory, Ser.~B}, 35:224--239, 1983] proved that the interval number of any planar graph is at most $3$. However the original proof has a flaw. We give a different and shor","authors_text":"Guillaume Gu\\'egan, Jonathan Rollin, Kolja Knauer, Torsten Ueckerdt","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-08T11:15:35Z","title":"The interval number of a planar graph is at most three"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02947","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:86e7044d40b0609d85420f63a92b08a496df381db7f81d7dd82531682811711c","target":"record","created_at":"2026-05-17T23:39:37Z","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":"4a58e72cf0215ef79a6bcc5bb54446f46004eec816d92d42ef5063ca32ad6d3d","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-08T11:15:35Z","title_canon_sha256":"b51ed4e41a3664daaa0c3e11bf2379d82e29c3b225bdc76eb39d0a53e33dec60"},"schema_version":"1.0","source":{"id":"1805.02947","kind":"arxiv","version":3}},"canonical_sha256":"55cab36cda74cdcadc7f94060e6fbaaf70ede5bf40be6c554b6bf4c1a8535338","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"55cab36cda74cdcadc7f94060e6fbaaf70ede5bf40be6c554b6bf4c1a8535338","first_computed_at":"2026-05-17T23:39:37.184404Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:37.184404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FqRhNwvhYOy8nETljSkyTmzlLaXZn/715cirWc56gfSqO55IfC9YEeF+sTSDYyMDmovrbNFMzCun/5ZXzSi/AA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:37.185056Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.02947","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:86e7044d40b0609d85420f63a92b08a496df381db7f81d7dd82531682811711c","sha256:55c7ca1538604857b18b896782c01d2ee7d5aae30cd3aa8fc1521530af3451c6"],"state_sha256":"75c6c0ce2ed27ca2706984f7192387aec95641a6346acce4c06ffde13a9e2c7c"}