{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:KK6LOIZSPSDIIBEPSZ2ZJNQKJH","short_pith_number":"pith:KK6LOIZS","schema_version":"1.0","canonical_sha256":"52bcb723327c8684048f967594b60a49e348bf8b2a11d3433cf10095e4d361f2","source":{"kind":"arxiv","id":"1212.2058","version":3},"attestation_state":"computed","paper":{"title":"Triangle-free geometric intersection graphs with large chromatic number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM"],"primary_cat":"math.CO","authors_text":"Arkadiusz Pawlik, Bartosz Walczak, Jakub Kozik, Micha{\\l} Laso\\'n, Piotr Micek, Tomasz Krawczyk, William T. Trotter","submitted_at":"2012-12-10T13:36:35Z","abstract_excerpt":"Several classical constructions illustrate the fact that the chromatic number of a graph can be arbitrarily large compared to its clique number. However, until very recently, no such construction was known for intersection graphs of geometric objects in the plane. We provide a general construction that for any arc-connected compact set $X$ in $\\mathbb{R}^2$ that is not an axis-aligned rectangle and for any positive integer $k$ produces a family $\\mathcal{F}$ of sets, each obtained by an independent horizontal and vertical scaling and translation of $X$, such that no three sets in $\\mathcal{F}$"},"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":"1212.2058","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-10T13:36:35Z","cross_cats_sorted":["cs.CG","cs.DM"],"title_canon_sha256":"7a29ccb82b525da3800e7152ad94f10208aa7c316638d67d61e77c3de826f2f4","abstract_canon_sha256":"360382f9ceac2bb09f28364d4d57d44d48efdd727438a3afacd1405b3ab879c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:32.761526Z","signature_b64":"zMwHOwVJ0rV7cy2HuQorLIwgIflrc5lhZNx7g6h7YAPv3sLv3CA/okFdpgT342EFuduM4NBnHSF9JAkalml6Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52bcb723327c8684048f967594b60a49e348bf8b2a11d3433cf10095e4d361f2","last_reissued_at":"2026-05-18T02:30:32.761117Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:32.761117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Triangle-free geometric intersection graphs with large chromatic number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM"],"primary_cat":"math.CO","authors_text":"Arkadiusz Pawlik, Bartosz Walczak, Jakub Kozik, Micha{\\l} Laso\\'n, Piotr Micek, Tomasz Krawczyk, William T. Trotter","submitted_at":"2012-12-10T13:36:35Z","abstract_excerpt":"Several classical constructions illustrate the fact that the chromatic number of a graph can be arbitrarily large compared to its clique number. However, until very recently, no such construction was known for intersection graphs of geometric objects in the plane. We provide a general construction that for any arc-connected compact set $X$ in $\\mathbb{R}^2$ that is not an axis-aligned rectangle and for any positive integer $k$ produces a family $\\mathcal{F}$ of sets, each obtained by an independent horizontal and vertical scaling and translation of $X$, such that no three sets in $\\mathcal{F}$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2058","kind":"arxiv","version":3},"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":"1212.2058","created_at":"2026-05-18T02:30:32.761179+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.2058v3","created_at":"2026-05-18T02:30:32.761179+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2058","created_at":"2026-05-18T02:30:32.761179+00:00"},{"alias_kind":"pith_short_12","alias_value":"KK6LOIZSPSDI","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"KK6LOIZSPSDIIBEP","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"KK6LOIZS","created_at":"2026-05-18T12:27:11.947152+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/KK6LOIZSPSDIIBEPSZ2ZJNQKJH","json":"https://pith.science/pith/KK6LOIZSPSDIIBEPSZ2ZJNQKJH.json","graph_json":"https://pith.science/api/pith-number/KK6LOIZSPSDIIBEPSZ2ZJNQKJH/graph.json","events_json":"https://pith.science/api/pith-number/KK6LOIZSPSDIIBEPSZ2ZJNQKJH/events.json","paper":"https://pith.science/paper/KK6LOIZS"},"agent_actions":{"view_html":"https://pith.science/pith/KK6LOIZSPSDIIBEPSZ2ZJNQKJH","download_json":"https://pith.science/pith/KK6LOIZSPSDIIBEPSZ2ZJNQKJH.json","view_paper":"https://pith.science/paper/KK6LOIZS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.2058&json=true","fetch_graph":"https://pith.science/api/pith-number/KK6LOIZSPSDIIBEPSZ2ZJNQKJH/graph.json","fetch_events":"https://pith.science/api/pith-number/KK6LOIZSPSDIIBEPSZ2ZJNQKJH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KK6LOIZSPSDIIBEPSZ2ZJNQKJH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KK6LOIZSPSDIIBEPSZ2ZJNQKJH/action/storage_attestation","attest_author":"https://pith.science/pith/KK6LOIZSPSDIIBEPSZ2ZJNQKJH/action/author_attestation","sign_citation":"https://pith.science/pith/KK6LOIZSPSDIIBEPSZ2ZJNQKJH/action/citation_signature","submit_replication":"https://pith.science/pith/KK6LOIZSPSDIIBEPSZ2ZJNQKJH/action/replication_record"}},"created_at":"2026-05-18T02:30:32.761179+00:00","updated_at":"2026-05-18T02:30:32.761179+00:00"}