{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4P3VU5V72ADJEZ5OV43ENYZKDU","short_pith_number":"pith:4P3VU5V7","schema_version":"1.0","canonical_sha256":"e3f75a76bfd0069267aeaf3646e32a1d3255e0cfb9087862911ccf78472543e9","source":{"kind":"arxiv","id":"1301.0541","version":4},"attestation_state":"computed","paper":{"title":"Coloring triangle-free rectangle overlap graphs with $O(\\log\\log n)$ colors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CG","authors_text":"Arkadiusz Pawlik, Bartosz Walczak, Tomasz Krawczyk","submitted_at":"2013-01-03T20:24:33Z","abstract_excerpt":"Recently, it was proved that triangle-free intersection graphs of $n$ line segments in the plane can have chromatic number as large as $\\Theta(\\log\\log n)$. Essentially the same construction produces $\\Theta(\\log\\log n)$-chromatic triangle-free intersection graphs of a variety of other geometric shapes---those belonging to any class of compact arc-connected sets in $\\mathbb{R}^2$ closed under horizontal scaling, vertical scaling, and translation, except for axis-parallel rectangles. We show that this construction is asymptotically optimal for intersection graphs of boundaries of axis-parallel "},"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":"1301.0541","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-01-03T20:24:33Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"b5cdc610a9ddd27fe32c1584dfbaf22baf877c5977c79d09478014028eeeb64e","abstract_canon_sha256":"cec8d9bbd6d7a3a8aae5857992a608de201bf7079464d91efd38141b644cc2e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:32.736836Z","signature_b64":"HIpMdcmM2fEVbj3Rvx5QdpO1x7p+e0Gf9M/ov9o0ezfo0Y4jVpuXZpvUyF00jVhL+Ni9jcN9wzwWEz6Q3XNbDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3f75a76bfd0069267aeaf3646e32a1d3255e0cfb9087862911ccf78472543e9","last_reissued_at":"2026-05-18T02:30:32.736262Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:32.736262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coloring triangle-free rectangle overlap graphs with $O(\\log\\log n)$ colors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CG","authors_text":"Arkadiusz Pawlik, Bartosz Walczak, Tomasz Krawczyk","submitted_at":"2013-01-03T20:24:33Z","abstract_excerpt":"Recently, it was proved that triangle-free intersection graphs of $n$ line segments in the plane can have chromatic number as large as $\\Theta(\\log\\log n)$. Essentially the same construction produces $\\Theta(\\log\\log n)$-chromatic triangle-free intersection graphs of a variety of other geometric shapes---those belonging to any class of compact arc-connected sets in $\\mathbb{R}^2$ closed under horizontal scaling, vertical scaling, and translation, except for axis-parallel rectangles. We show that this construction is asymptotically optimal for intersection graphs of boundaries of axis-parallel "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0541","kind":"arxiv","version":4},"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":"1301.0541","created_at":"2026-05-18T02:30:32.736358+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.0541v4","created_at":"2026-05-18T02:30:32.736358+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0541","created_at":"2026-05-18T02:30:32.736358+00:00"},{"alias_kind":"pith_short_12","alias_value":"4P3VU5V72ADJ","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"4P3VU5V72ADJEZ5O","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"4P3VU5V7","created_at":"2026-05-18T12:27:34.582898+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/4P3VU5V72ADJEZ5OV43ENYZKDU","json":"https://pith.science/pith/4P3VU5V72ADJEZ5OV43ENYZKDU.json","graph_json":"https://pith.science/api/pith-number/4P3VU5V72ADJEZ5OV43ENYZKDU/graph.json","events_json":"https://pith.science/api/pith-number/4P3VU5V72ADJEZ5OV43ENYZKDU/events.json","paper":"https://pith.science/paper/4P3VU5V7"},"agent_actions":{"view_html":"https://pith.science/pith/4P3VU5V72ADJEZ5OV43ENYZKDU","download_json":"https://pith.science/pith/4P3VU5V72ADJEZ5OV43ENYZKDU.json","view_paper":"https://pith.science/paper/4P3VU5V7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.0541&json=true","fetch_graph":"https://pith.science/api/pith-number/4P3VU5V72ADJEZ5OV43ENYZKDU/graph.json","fetch_events":"https://pith.science/api/pith-number/4P3VU5V72ADJEZ5OV43ENYZKDU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4P3VU5V72ADJEZ5OV43ENYZKDU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4P3VU5V72ADJEZ5OV43ENYZKDU/action/storage_attestation","attest_author":"https://pith.science/pith/4P3VU5V72ADJEZ5OV43ENYZKDU/action/author_attestation","sign_citation":"https://pith.science/pith/4P3VU5V72ADJEZ5OV43ENYZKDU/action/citation_signature","submit_replication":"https://pith.science/pith/4P3VU5V72ADJEZ5OV43ENYZKDU/action/replication_record"}},"created_at":"2026-05-18T02:30:32.736358+00:00","updated_at":"2026-05-18T02:30:32.736358+00:00"}