{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KXFLG3G2OTG4VXD7SQDA4352V5","short_pith_number":"pith:KXFLG3G2","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"},"canonical_sha256":"55cab36cda74cdcadc7f94060e6fbaaf70ede5bf40be6c554b6bf4c1a8535338","source":{"kind":"arxiv","id":"1805.02947","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KXFLG3G2OTG4VXD7SQDA4352V5","target":"record","payload":{"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"},"canonical_sha256":"55cab36cda74cdcadc7f94060e6fbaaf70ede5bf40be6c554b6bf4c1a8535338","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"},"source_kind":"arxiv","source_id":"1805.02947","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-17T23:39:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UW05zoetoaqoIZEqyqqQ/Pz4oZUHe8x+sLdTeZp5xKVfJLAQkuRK68EWIxw7J6zjRJO+pZ2iit4MjheF0/hBAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:26:43.608427Z"},"content_sha256":"86e7044d40b0609d85420f63a92b08a496df381db7f81d7dd82531682811711c","schema_version":"1.0","event_id":"sha256:86e7044d40b0609d85420f63a92b08a496df381db7f81d7dd82531682811711c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KXFLG3G2OTG4VXD7SQDA4352V5","target":"graph","payload":{"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"},"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-17T23:39:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"URxScsqEF2YpOxE4XjmgRqUUQnOuejm8byV08c0mpP3H8LEZEQKpQnR2uoALPQ3IRMiFftoUuJa0XsMlhheDBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:26:43.609092Z"},"content_sha256":"55c7ca1538604857b18b896782c01d2ee7d5aae30cd3aa8fc1521530af3451c6","schema_version":"1.0","event_id":"sha256:55c7ca1538604857b18b896782c01d2ee7d5aae30cd3aa8fc1521530af3451c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KXFLG3G2OTG4VXD7SQDA4352V5/bundle.json","state_url":"https://pith.science/pith/KXFLG3G2OTG4VXD7SQDA4352V5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KXFLG3G2OTG4VXD7SQDA4352V5/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-25T16:26:43Z","links":{"resolver":"https://pith.science/pith/KXFLG3G2OTG4VXD7SQDA4352V5","bundle":"https://pith.science/pith/KXFLG3G2OTG4VXD7SQDA4352V5/bundle.json","state":"https://pith.science/pith/KXFLG3G2OTG4VXD7SQDA4352V5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KXFLG3G2OTG4VXD7SQDA4352V5/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NFGQq87otpYmrbGsn7zsHkE3uma1nbQkrB+2oVeetKhWZrGBnQO7Oujx3uP/+po/yeOgTpjWi12XPsD/CdbpBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:26:43.613063Z","bundle_sha256":"6b7cf74dc3c48f44b0f41da09ee0db358733b22523e7479f3e67b42347d353ee"}}