{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:KK6LOIZSPSDIIBEPSZ2ZJNQKJH","short_pith_number":"pith:KK6LOIZS","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"},"canonical_sha256":"52bcb723327c8684048f967594b60a49e348bf8b2a11d3433cf10095e4d361f2","source":{"kind":"arxiv","id":"1212.2058","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.2058","created_at":"2026-05-18T02:30:32Z"},{"alias_kind":"arxiv_version","alias_value":"1212.2058v3","created_at":"2026-05-18T02:30:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2058","created_at":"2026-05-18T02:30:32Z"},{"alias_kind":"pith_short_12","alias_value":"KK6LOIZSPSDI","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KK6LOIZSPSDIIBEP","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KK6LOIZS","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:KK6LOIZSPSDIIBEPSZ2ZJNQKJH","target":"record","payload":{"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"},"canonical_sha256":"52bcb723327c8684048f967594b60a49e348bf8b2a11d3433cf10095e4d361f2","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"},"source_kind":"arxiv","source_id":"1212.2058","source_version":3,"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-18T02:30:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5LQw5Ini5oqdorCLwuA2KfApVJtbRAuKc7GJVywH0BZROEIRLBCatlYDjKeT1870hLaBRcSdth42wNEoolPuCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:37:53.233674Z"},"content_sha256":"c71fac61c34385187f4cdef40fa6079cc8831c8578232d01a695651cf6e050d5","schema_version":"1.0","event_id":"sha256:c71fac61c34385187f4cdef40fa6079cc8831c8578232d01a695651cf6e050d5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:KK6LOIZSPSDIIBEPSZ2ZJNQKJH","target":"graph","payload":{"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"},"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-18T02:30:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WmeYeJyCf/dmCWVwSK/+RZWlF9VbwNvOysj7tgIwFYA/Pwaby8KAmPpVOrln6WJmbHYqsJNOWcrf08q3tHqZDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:37:53.234435Z"},"content_sha256":"df8c38b3a401003aaadcc3c59b5a254c4e343b578d8ba90fa8a733e82719b8d2","schema_version":"1.0","event_id":"sha256:df8c38b3a401003aaadcc3c59b5a254c4e343b578d8ba90fa8a733e82719b8d2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KK6LOIZSPSDIIBEPSZ2ZJNQKJH/bundle.json","state_url":"https://pith.science/pith/KK6LOIZSPSDIIBEPSZ2ZJNQKJH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KK6LOIZSPSDIIBEPSZ2ZJNQKJH/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-05-31T12:37:53Z","links":{"resolver":"https://pith.science/pith/KK6LOIZSPSDIIBEPSZ2ZJNQKJH","bundle":"https://pith.science/pith/KK6LOIZSPSDIIBEPSZ2ZJNQKJH/bundle.json","state":"https://pith.science/pith/KK6LOIZSPSDIIBEPSZ2ZJNQKJH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KK6LOIZSPSDIIBEPSZ2ZJNQKJH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:KK6LOIZSPSDIIBEPSZ2ZJNQKJH","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":"360382f9ceac2bb09f28364d4d57d44d48efdd727438a3afacd1405b3ab879c0","cross_cats_sorted":["cs.CG","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-10T13:36:35Z","title_canon_sha256":"7a29ccb82b525da3800e7152ad94f10208aa7c316638d67d61e77c3de826f2f4"},"schema_version":"1.0","source":{"id":"1212.2058","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.2058","created_at":"2026-05-18T02:30:32Z"},{"alias_kind":"arxiv_version","alias_value":"1212.2058v3","created_at":"2026-05-18T02:30:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2058","created_at":"2026-05-18T02:30:32Z"},{"alias_kind":"pith_short_12","alias_value":"KK6LOIZSPSDI","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KK6LOIZSPSDIIBEP","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KK6LOIZS","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:df8c38b3a401003aaadcc3c59b5a254c4e343b578d8ba90fa8a733e82719b8d2","target":"graph","created_at":"2026-05-18T02:30:32Z","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":"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}$","authors_text":"Arkadiusz Pawlik, Bartosz Walczak, Jakub Kozik, Micha{\\l} Laso\\'n, Piotr Micek, Tomasz Krawczyk, William T. Trotter","cross_cats":["cs.CG","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-10T13:36:35Z","title":"Triangle-free geometric intersection graphs with large chromatic number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2058","kind":"arxiv","version":3},"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:c71fac61c34385187f4cdef40fa6079cc8831c8578232d01a695651cf6e050d5","target":"record","created_at":"2026-05-18T02:30:32Z","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":"360382f9ceac2bb09f28364d4d57d44d48efdd727438a3afacd1405b3ab879c0","cross_cats_sorted":["cs.CG","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-10T13:36:35Z","title_canon_sha256":"7a29ccb82b525da3800e7152ad94f10208aa7c316638d67d61e77c3de826f2f4"},"schema_version":"1.0","source":{"id":"1212.2058","kind":"arxiv","version":3}},"canonical_sha256":"52bcb723327c8684048f967594b60a49e348bf8b2a11d3433cf10095e4d361f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52bcb723327c8684048f967594b60a49e348bf8b2a11d3433cf10095e4d361f2","first_computed_at":"2026-05-18T02:30:32.761117Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:32.761117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zMwHOwVJ0rV7cy2HuQorLIwgIflrc5lhZNx7g6h7YAPv3sLv3CA/okFdpgT342EFuduM4NBnHSF9JAkalml6Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:32.761526Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.2058","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c71fac61c34385187f4cdef40fa6079cc8831c8578232d01a695651cf6e050d5","sha256:df8c38b3a401003aaadcc3c59b5a254c4e343b578d8ba90fa8a733e82719b8d2"],"state_sha256":"641df0092a54c29c3700682ae1fdd0147c22bbfb5171a3e11d6004e25440024f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vCsF4Ko/zqQ4BeRapAXuou42oS5bNe1ConmT6ozXiRQS9YS2qaPyieWCkio5Oe7/knAyX/3PJGpY4yFaY/A0DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:37:53.238358Z","bundle_sha256":"227ebe66b35c1e4346fe7c9b6631562acdfe621829c31b42a433bb24784911b2"}}