{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:RFPYNK77R5RKK4RWTQHOOMHZSS","short_pith_number":"pith:RFPYNK77","schema_version":"1.0","canonical_sha256":"895f86abff8f62a572369c0ee730f994bc18496a8d6df356ceb8294db6fcfe99","source":{"kind":"arxiv","id":"1512.06112","version":5},"attestation_state":"computed","paper":{"title":"Coloring curves that cross a fixed curve","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM"],"primary_cat":"math.CO","authors_text":"Alexandre Rok, Bartosz Walczak","submitted_at":"2015-12-18T20:53:12Z","abstract_excerpt":"We prove that for every integer $t\\geq 1$, the class of intersection graphs of curves in the plane each of which crosses a fixed curve in at least one and at most $t$ points is $\\chi$-bounded. This is essentially the strongest $\\chi$-boundedness result one can get for this kind of graph classes. As a corollary, we prove that for any fixed integers $k\\geq 2$ and $t\\geq 1$, every $k$-quasi-planar topological graph on $n$ vertices with any two edges crossing at most $t$ times has $O(n\\log n)$ edges."},"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":"1512.06112","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-18T20:53:12Z","cross_cats_sorted":["cs.CG","cs.DM"],"title_canon_sha256":"2e5d87828f542613a958bf4b632a16ab5cb42494ba95f9815d605572c411a853","abstract_canon_sha256":"694bf370dec05a6083d967f7f773b99d641256e12798057239ed02900fcae413"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:44.249059Z","signature_b64":"10pKiWPFRifrnRA7ehlaP9b0PAfko8eIQle3Mse9wKPLczA0b3f58wKhp/Leg/Ba0bABTVBFX9XlyKgZs8WLDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"895f86abff8f62a572369c0ee730f994bc18496a8d6df356ceb8294db6fcfe99","last_reissued_at":"2026-05-18T00:33:44.248563Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:44.248563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coloring curves that cross a fixed curve","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM"],"primary_cat":"math.CO","authors_text":"Alexandre Rok, Bartosz Walczak","submitted_at":"2015-12-18T20:53:12Z","abstract_excerpt":"We prove that for every integer $t\\geq 1$, the class of intersection graphs of curves in the plane each of which crosses a fixed curve in at least one and at most $t$ points is $\\chi$-bounded. This is essentially the strongest $\\chi$-boundedness result one can get for this kind of graph classes. As a corollary, we prove that for any fixed integers $k\\geq 2$ and $t\\geq 1$, every $k$-quasi-planar topological graph on $n$ vertices with any two edges crossing at most $t$ times has $O(n\\log n)$ edges."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.06112","kind":"arxiv","version":5},"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":"1512.06112","created_at":"2026-05-18T00:33:44.248641+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.06112v5","created_at":"2026-05-18T00:33:44.248641+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06112","created_at":"2026-05-18T00:33:44.248641+00:00"},{"alias_kind":"pith_short_12","alias_value":"RFPYNK77R5RK","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"RFPYNK77R5RKK4RW","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"RFPYNK77","created_at":"2026-05-18T12:29:39.896362+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/RFPYNK77R5RKK4RWTQHOOMHZSS","json":"https://pith.science/pith/RFPYNK77R5RKK4RWTQHOOMHZSS.json","graph_json":"https://pith.science/api/pith-number/RFPYNK77R5RKK4RWTQHOOMHZSS/graph.json","events_json":"https://pith.science/api/pith-number/RFPYNK77R5RKK4RWTQHOOMHZSS/events.json","paper":"https://pith.science/paper/RFPYNK77"},"agent_actions":{"view_html":"https://pith.science/pith/RFPYNK77R5RKK4RWTQHOOMHZSS","download_json":"https://pith.science/pith/RFPYNK77R5RKK4RWTQHOOMHZSS.json","view_paper":"https://pith.science/paper/RFPYNK77","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.06112&json=true","fetch_graph":"https://pith.science/api/pith-number/RFPYNK77R5RKK4RWTQHOOMHZSS/graph.json","fetch_events":"https://pith.science/api/pith-number/RFPYNK77R5RKK4RWTQHOOMHZSS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RFPYNK77R5RKK4RWTQHOOMHZSS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RFPYNK77R5RKK4RWTQHOOMHZSS/action/storage_attestation","attest_author":"https://pith.science/pith/RFPYNK77R5RKK4RWTQHOOMHZSS/action/author_attestation","sign_citation":"https://pith.science/pith/RFPYNK77R5RKK4RWTQHOOMHZSS/action/citation_signature","submit_replication":"https://pith.science/pith/RFPYNK77R5RKK4RWTQHOOMHZSS/action/replication_record"}},"created_at":"2026-05-18T00:33:44.248641+00:00","updated_at":"2026-05-18T00:33:44.248641+00:00"}