{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GUGXC2IAP7XK7CU5M7ZXMVBMVQ","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":"73f9483554f2af741ce129c8ecdf87e041d1bba268a64d6a607a26efdcaa9ee2","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-18T18:39:53Z","title_canon_sha256":"fc4d751b421d2c928a59f5f7f24888c5cbe048b403a872762c5e75ac13195beb"},"schema_version":"1.0","source":{"id":"1803.06710","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06710","created_at":"2026-05-18T00:20:45Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06710v1","created_at":"2026-05-18T00:20:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06710","created_at":"2026-05-18T00:20:45Z"},{"alias_kind":"pith_short_12","alias_value":"GUGXC2IAP7XK","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GUGXC2IAP7XK7CU5","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GUGXC2IA","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:7eae3bb8004c762d681904ffcdcaded95e122e6778d92579c4a90daf6d2042ee","target":"graph","created_at":"2026-05-18T00:20:45Z","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 {\\em string graph} is the intersection graph of a family of continuous arcs in the plane. The intersection graph of a family of plane convex sets is a string graph, but not all string graphs can be obtained in this way. We prove the following structure theorem conjectured by Janson and Uzzell: The vertex set of {\\em almost all} string graphs on $n$ vertices can be partitioned into {\\em five} cliques such that some pair of them is not connected by any edge ($n\\rightarrow\\infty$). We also show that every graph with the above property is an intersection graph of plane convex sets. As a corollar","authors_text":"Bruce Reed, J\\'anos Pach, Yelena Yuditsky","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-18T18:39:53Z","title":"Almost all string graphs are intersection graphs of plane convex sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06710","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:3bccdebdaeda1aa522edf6e5a57cf63c72b26edb6f977002446b00137dde8e95","target":"record","created_at":"2026-05-18T00:20:45Z","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":"73f9483554f2af741ce129c8ecdf87e041d1bba268a64d6a607a26efdcaa9ee2","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-18T18:39:53Z","title_canon_sha256":"fc4d751b421d2c928a59f5f7f24888c5cbe048b403a872762c5e75ac13195beb"},"schema_version":"1.0","source":{"id":"1803.06710","kind":"arxiv","version":1}},"canonical_sha256":"350d7169007feeaf8a9d67f376542cac06b26e8e9e051e6c42122eb24d070e16","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"350d7169007feeaf8a9d67f376542cac06b26e8e9e051e6c42122eb24d070e16","first_computed_at":"2026-05-18T00:20:45.191900Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:45.191900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OTP6TY/H7vOYQSn+K7W+zVmvEuPNifLujLamBrwpY6M3NdIJ3TyCDS9YVmlWHkFWgI97GIA+Ur+CHjLl6QwrAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:45.192471Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.06710","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3bccdebdaeda1aa522edf6e5a57cf63c72b26edb6f977002446b00137dde8e95","sha256:7eae3bb8004c762d681904ffcdcaded95e122e6778d92579c4a90daf6d2042ee"],"state_sha256":"3d16204a1fcddf45b3d2cc906d82781887e23125300f084458d012e67842fea0"}