{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KXFLG3G2OTG4VXD7SQDA4352V5","short_pith_number":"pith:KXFLG3G2","schema_version":"1.0","canonical_sha256":"55cab36cda74cdcadc7f94060e6fbaaf70ede5bf40be6c554b6bf4c1a8535338","source":{"kind":"arxiv","id":"1805.02947","version":3},"attestation_state":"computed","paper":{"title":"The interval number of a planar graph is at most three","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Guillaume Gu\\'egan, Jonathan Rollin, Kolja Knauer, Torsten Ueckerdt","submitted_at":"2018-05-08T11:15:35Z","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"},"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":"1805.02947","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-08T11:15:35Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b51ed4e41a3664daaa0c3e11bf2379d82e29c3b225bdc76eb39d0a53e33dec60","abstract_canon_sha256":"4a58e72cf0215ef79a6bcc5bb54446f46004eec816d92d42ef5063ca32ad6d3d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:37.185056Z","signature_b64":"FqRhNwvhYOy8nETljSkyTmzlLaXZn/715cirWc56gfSqO55IfC9YEeF+sTSDYyMDmovrbNFMzCun/5ZXzSi/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55cab36cda74cdcadc7f94060e6fbaaf70ede5bf40be6c554b6bf4c1a8535338","last_reissued_at":"2026-05-17T23:39:37.184404Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:37.184404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The interval number of a planar graph is at most three","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Guillaume Gu\\'egan, Jonathan Rollin, Kolja Knauer, Torsten Ueckerdt","submitted_at":"2018-05-08T11:15:35Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02947","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":"1805.02947","created_at":"2026-05-17T23:39:37.184512+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.02947v3","created_at":"2026-05-17T23:39:37.184512+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02947","created_at":"2026-05-17T23:39:37.184512+00:00"},{"alias_kind":"pith_short_12","alias_value":"KXFLG3G2OTG4","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KXFLG3G2OTG4VXD7","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KXFLG3G2","created_at":"2026-05-18T12:32:33.847187+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/KXFLG3G2OTG4VXD7SQDA4352V5","json":"https://pith.science/pith/KXFLG3G2OTG4VXD7SQDA4352V5.json","graph_json":"https://pith.science/api/pith-number/KXFLG3G2OTG4VXD7SQDA4352V5/graph.json","events_json":"https://pith.science/api/pith-number/KXFLG3G2OTG4VXD7SQDA4352V5/events.json","paper":"https://pith.science/paper/KXFLG3G2"},"agent_actions":{"view_html":"https://pith.science/pith/KXFLG3G2OTG4VXD7SQDA4352V5","download_json":"https://pith.science/pith/KXFLG3G2OTG4VXD7SQDA4352V5.json","view_paper":"https://pith.science/paper/KXFLG3G2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.02947&json=true","fetch_graph":"https://pith.science/api/pith-number/KXFLG3G2OTG4VXD7SQDA4352V5/graph.json","fetch_events":"https://pith.science/api/pith-number/KXFLG3G2OTG4VXD7SQDA4352V5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KXFLG3G2OTG4VXD7SQDA4352V5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KXFLG3G2OTG4VXD7SQDA4352V5/action/storage_attestation","attest_author":"https://pith.science/pith/KXFLG3G2OTG4VXD7SQDA4352V5/action/author_attestation","sign_citation":"https://pith.science/pith/KXFLG3G2OTG4VXD7SQDA4352V5/action/citation_signature","submit_replication":"https://pith.science/pith/KXFLG3G2OTG4VXD7SQDA4352V5/action/replication_record"}},"created_at":"2026-05-17T23:39:37.184512+00:00","updated_at":"2026-05-17T23:39:37.184512+00:00"}