{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:AC6SLTUJ36ITFGL5ROKF6OOZ4V","short_pith_number":"pith:AC6SLTUJ","canonical_record":{"source":{"id":"1105.4931","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-25T04:35:07Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"b1f63bd19352b5f6f598674d712d6daad7c6f59bf49c9cd5b28674ccf18713c2","abstract_canon_sha256":"894094dcbda67133a02044dec1df944c0e7455b3706d81d01159cd74b47155b0"},"schema_version":"1.0"},"canonical_sha256":"00bd25ce89df9132997d8b945f39d9e554a7d667cf75eef7c1c5e58d6169785b","source":{"kind":"arxiv","id":"1105.4931","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.4931","created_at":"2026-05-18T04:21:13Z"},{"alias_kind":"arxiv_version","alias_value":"1105.4931v2","created_at":"2026-05-18T04:21:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.4931","created_at":"2026-05-18T04:21:13Z"},{"alias_kind":"pith_short_12","alias_value":"AC6SLTUJ36IT","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"AC6SLTUJ36ITFGL5","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"AC6SLTUJ","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:AC6SLTUJ36ITFGL5ROKF6OOZ4V","target":"record","payload":{"canonical_record":{"source":{"id":"1105.4931","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-25T04:35:07Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"b1f63bd19352b5f6f598674d712d6daad7c6f59bf49c9cd5b28674ccf18713c2","abstract_canon_sha256":"894094dcbda67133a02044dec1df944c0e7455b3706d81d01159cd74b47155b0"},"schema_version":"1.0"},"canonical_sha256":"00bd25ce89df9132997d8b945f39d9e554a7d667cf75eef7c1c5e58d6169785b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:21:13.183509Z","signature_b64":"qe8HUby4qwwjOhQIdlxF4deyrrmcAP1odFzORVl4O7GrWPcrgGiSu25Yl7ytCkjh/RY3l51XHI6YQJEwwHI+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00bd25ce89df9132997d8b945f39d9e554a7d667cf75eef7c1c5e58d6169785b","last_reissued_at":"2026-05-18T04:21:13.182788Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:21:13.182788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.4931","source_version":2,"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-18T04:21:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uEHDDfzOS1GWHqIr3fs4pom7NAwh3jnSvhuWAofSEDQSl18ICQJdXD0jJq666eQj5uMg327/QaiKEzmBHqYPAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:37:49.145744Z"},"content_sha256":"dcd0fac3bbe7ac2ad53bd4cf075cac81a0600e2daf219e44e84d2535e0cbfe11","schema_version":"1.0","event_id":"sha256:dcd0fac3bbe7ac2ad53bd4cf075cac81a0600e2daf219e44e84d2535e0cbfe11"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:AC6SLTUJ36ITFGL5ROKF6OOZ4V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The chromatic number of the convex segment disjointness graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"David R. Wood, Ruy Fabila-Monroy","submitted_at":"2011-05-25T04:35:07Z","abstract_excerpt":"Let $P$ be a set of $n$ points in general and convex position in the plane. Let $D_n$ be the graph whose vertex set is the set of all line segments with endpoints in $P$, where disjoint segments are adjacent. The chromatic number of this graph was first studied by Araujo et al. [\\emph{CGTA}, 2005]. The previous best bounds are $\\frac{3n}{4}\\leq\\chi(D_n) <n-\\sqrt{\\frac{n}{2}}$ (ignoring lower order terms). In this paper we improve the lower bound to $\\chi(D_n)\\geq n-\\sqrt{2n}$, to conclude a near-tight bound on $\\chi(D_n)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.4931","kind":"arxiv","version":2},"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-18T04:21:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"amfnGOzKic/DveYMRef/UeTtwK8MAFEQGwRRqMO7xtUiKJL0j4u1F3HdfnuRzFSkAY2XTZikw9Wdro2BWShTCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:37:49.146092Z"},"content_sha256":"cfe6cb3e9d25ac8b1c5ebe4e2a32c48d56f2587afe180f3f447346115dcd63b2","schema_version":"1.0","event_id":"sha256:cfe6cb3e9d25ac8b1c5ebe4e2a32c48d56f2587afe180f3f447346115dcd63b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AC6SLTUJ36ITFGL5ROKF6OOZ4V/bundle.json","state_url":"https://pith.science/pith/AC6SLTUJ36ITFGL5ROKF6OOZ4V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AC6SLTUJ36ITFGL5ROKF6OOZ4V/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-06-02T15:37:49Z","links":{"resolver":"https://pith.science/pith/AC6SLTUJ36ITFGL5ROKF6OOZ4V","bundle":"https://pith.science/pith/AC6SLTUJ36ITFGL5ROKF6OOZ4V/bundle.json","state":"https://pith.science/pith/AC6SLTUJ36ITFGL5ROKF6OOZ4V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AC6SLTUJ36ITFGL5ROKF6OOZ4V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:AC6SLTUJ36ITFGL5ROKF6OOZ4V","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":"894094dcbda67133a02044dec1df944c0e7455b3706d81d01159cd74b47155b0","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-25T04:35:07Z","title_canon_sha256":"b1f63bd19352b5f6f598674d712d6daad7c6f59bf49c9cd5b28674ccf18713c2"},"schema_version":"1.0","source":{"id":"1105.4931","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.4931","created_at":"2026-05-18T04:21:13Z"},{"alias_kind":"arxiv_version","alias_value":"1105.4931v2","created_at":"2026-05-18T04:21:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.4931","created_at":"2026-05-18T04:21:13Z"},{"alias_kind":"pith_short_12","alias_value":"AC6SLTUJ36IT","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"AC6SLTUJ36ITFGL5","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"AC6SLTUJ","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:cfe6cb3e9d25ac8b1c5ebe4e2a32c48d56f2587afe180f3f447346115dcd63b2","target":"graph","created_at":"2026-05-18T04:21:13Z","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":"Let $P$ be a set of $n$ points in general and convex position in the plane. Let $D_n$ be the graph whose vertex set is the set of all line segments with endpoints in $P$, where disjoint segments are adjacent. The chromatic number of this graph was first studied by Araujo et al. [\\emph{CGTA}, 2005]. The previous best bounds are $\\frac{3n}{4}\\leq\\chi(D_n) <n-\\sqrt{\\frac{n}{2}}$ (ignoring lower order terms). In this paper we improve the lower bound to $\\chi(D_n)\\geq n-\\sqrt{2n}$, to conclude a near-tight bound on $\\chi(D_n)$.","authors_text":"David R. Wood, Ruy Fabila-Monroy","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-25T04:35:07Z","title":"The chromatic number of the convex segment disjointness graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.4931","kind":"arxiv","version":2},"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:dcd0fac3bbe7ac2ad53bd4cf075cac81a0600e2daf219e44e84d2535e0cbfe11","target":"record","created_at":"2026-05-18T04:21:13Z","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":"894094dcbda67133a02044dec1df944c0e7455b3706d81d01159cd74b47155b0","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-25T04:35:07Z","title_canon_sha256":"b1f63bd19352b5f6f598674d712d6daad7c6f59bf49c9cd5b28674ccf18713c2"},"schema_version":"1.0","source":{"id":"1105.4931","kind":"arxiv","version":2}},"canonical_sha256":"00bd25ce89df9132997d8b945f39d9e554a7d667cf75eef7c1c5e58d6169785b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"00bd25ce89df9132997d8b945f39d9e554a7d667cf75eef7c1c5e58d6169785b","first_computed_at":"2026-05-18T04:21:13.182788Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:21:13.182788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qe8HUby4qwwjOhQIdlxF4deyrrmcAP1odFzORVl4O7GrWPcrgGiSu25Yl7ytCkjh/RY3l51XHI6YQJEwwHI+CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:21:13.183509Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.4931","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dcd0fac3bbe7ac2ad53bd4cf075cac81a0600e2daf219e44e84d2535e0cbfe11","sha256:cfe6cb3e9d25ac8b1c5ebe4e2a32c48d56f2587afe180f3f447346115dcd63b2"],"state_sha256":"1c37dec26c9763ebe3f9bc3c3635c8bbaa6a262d1ffe2e97929e2a0f148823d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"48ZZ3D7jgob0fxxmskhqWCQegU14rbBf6kTzsmRbsdlPMCd6hOk+THlSwpTaXyMJdOsl4ILCfWrMlfqEez3LAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T15:37:49.148342Z","bundle_sha256":"ec0af0799c11b16938267bc4b1e1d52b56d8d94da548cf64a1ab19bd9e557f1a"}}