{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:OX3OFPV4H5XU3X4GU6NTKHSW63","short_pith_number":"pith:OX3OFPV4","schema_version":"1.0","canonical_sha256":"75f6e2bebc3f6f4ddf86a79b351e56f6e1e368dab95d7a8e3f96f11a2c567109","source":{"kind":"arxiv","id":"1511.03827","version":2},"attestation_state":"computed","paper":{"title":"Coloring non-crossing strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Arnaud Labourel, Daniel Gon\\c{c}alves, Louis Esperet","submitted_at":"2015-11-12T09:25:00Z","abstract_excerpt":"For a family of geometric objects in the plane $\\mathcal{F}=\\{S_1,\\ldots,S_n\\}$, define $\\chi(\\mathcal{F})$ as the least integer $\\ell$ such that the elements of $\\mathcal{F}$ can be colored with $\\ell$ colors, in such a way that any two intersecting objects have distinct colors. When $\\mathcal{F}$ is a set of pseudo-disks that may only intersect on their boundaries, and such that any point of the plane is contained in at most $k$ pseudo-disks, it can be proven that $\\chi(\\mathcal{F})\\le 3k/2 + o(k)$ since the problem is equivalent to cyclic coloring of plane graphs. In this paper, we study th"},"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":"1511.03827","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-12T09:25:00Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"eb90bf25490936d54eed7b5b36a9596831df141ccef4b9f9c686f8dbe9b4f3ad","abstract_canon_sha256":"541f3a769a26529559ed09b6110826010967871e6b20c210a7930f0b2e2617df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:44.249663Z","signature_b64":"yNjMrWXY7EW4UclGt8fyXxtIST2npEKsJE7/eThffqu7w4Z5YKPiPMIioD7wyN9bQ86K/VM7M3sEAIZzrYnJDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75f6e2bebc3f6f4ddf86a79b351e56f6e1e368dab95d7a8e3f96f11a2c567109","last_reissued_at":"2026-05-18T00:57:44.249091Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:44.249091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coloring non-crossing strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Arnaud Labourel, Daniel Gon\\c{c}alves, Louis Esperet","submitted_at":"2015-11-12T09:25:00Z","abstract_excerpt":"For a family of geometric objects in the plane $\\mathcal{F}=\\{S_1,\\ldots,S_n\\}$, define $\\chi(\\mathcal{F})$ as the least integer $\\ell$ such that the elements of $\\mathcal{F}$ can be colored with $\\ell$ colors, in such a way that any two intersecting objects have distinct colors. When $\\mathcal{F}$ is a set of pseudo-disks that may only intersect on their boundaries, and such that any point of the plane is contained in at most $k$ pseudo-disks, it can be proven that $\\chi(\\mathcal{F})\\le 3k/2 + o(k)$ since the problem is equivalent to cyclic coloring of plane graphs. In this paper, we study th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.03827","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.03827","created_at":"2026-05-18T00:57:44.249196+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.03827v2","created_at":"2026-05-18T00:57:44.249196+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.03827","created_at":"2026-05-18T00:57:44.249196+00:00"},{"alias_kind":"pith_short_12","alias_value":"OX3OFPV4H5XU","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"OX3OFPV4H5XU3X4G","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"OX3OFPV4","created_at":"2026-05-18T12:29:34.919912+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/OX3OFPV4H5XU3X4GU6NTKHSW63","json":"https://pith.science/pith/OX3OFPV4H5XU3X4GU6NTKHSW63.json","graph_json":"https://pith.science/api/pith-number/OX3OFPV4H5XU3X4GU6NTKHSW63/graph.json","events_json":"https://pith.science/api/pith-number/OX3OFPV4H5XU3X4GU6NTKHSW63/events.json","paper":"https://pith.science/paper/OX3OFPV4"},"agent_actions":{"view_html":"https://pith.science/pith/OX3OFPV4H5XU3X4GU6NTKHSW63","download_json":"https://pith.science/pith/OX3OFPV4H5XU3X4GU6NTKHSW63.json","view_paper":"https://pith.science/paper/OX3OFPV4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.03827&json=true","fetch_graph":"https://pith.science/api/pith-number/OX3OFPV4H5XU3X4GU6NTKHSW63/graph.json","fetch_events":"https://pith.science/api/pith-number/OX3OFPV4H5XU3X4GU6NTKHSW63/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OX3OFPV4H5XU3X4GU6NTKHSW63/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OX3OFPV4H5XU3X4GU6NTKHSW63/action/storage_attestation","attest_author":"https://pith.science/pith/OX3OFPV4H5XU3X4GU6NTKHSW63/action/author_attestation","sign_citation":"https://pith.science/pith/OX3OFPV4H5XU3X4GU6NTKHSW63/action/citation_signature","submit_replication":"https://pith.science/pith/OX3OFPV4H5XU3X4GU6NTKHSW63/action/replication_record"}},"created_at":"2026-05-18T00:57:44.249196+00:00","updated_at":"2026-05-18T00:57:44.249196+00:00"}