{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:4P3VU5V72ADJEZ5OV43ENYZKDU","short_pith_number":"pith:4P3VU5V7","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"},"canonical_sha256":"e3f75a76bfd0069267aeaf3646e32a1d3255e0cfb9087862911ccf78472543e9","source":{"kind":"arxiv","id":"1301.0541","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0541","created_at":"2026-05-18T02:30:32Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0541v4","created_at":"2026-05-18T02:30:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0541","created_at":"2026-05-18T02:30:32Z"},{"alias_kind":"pith_short_12","alias_value":"4P3VU5V72ADJ","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4P3VU5V72ADJEZ5O","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4P3VU5V7","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:4P3VU5V72ADJEZ5OV43ENYZKDU","target":"record","payload":{"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"},"canonical_sha256":"e3f75a76bfd0069267aeaf3646e32a1d3255e0cfb9087862911ccf78472543e9","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"},"source_kind":"arxiv","source_id":"1301.0541","source_version":4,"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":"SzvgskIglXjsyNNQCithGK0HmNiMUSJ9tepePSL3RN/T1N8dwpX94O9LsRa6RFpRmpUuPGvX6tsuNaisZenkAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:50:02.192772Z"},"content_sha256":"634442e7c00558cd186b0ddb8dece2b57ebe8b054d701d1047aba8e555ddf54b","schema_version":"1.0","event_id":"sha256:634442e7c00558cd186b0ddb8dece2b57ebe8b054d701d1047aba8e555ddf54b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:4P3VU5V72ADJEZ5OV43ENYZKDU","target":"graph","payload":{"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"},"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":"6cWMZHxmsVLwAtdY4hyRjaN3DHkdkn5IfgurN86S8vrkig6KPot75GTaRl7B6Jjgiz04WF5Kkb9QTuaYAswYAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:50:02.193547Z"},"content_sha256":"4ce480027503c20b9be1a1fa89e32d9ced572b3998bc57872dba1219051a3c09","schema_version":"1.0","event_id":"sha256:4ce480027503c20b9be1a1fa89e32d9ced572b3998bc57872dba1219051a3c09"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4P3VU5V72ADJEZ5OV43ENYZKDU/bundle.json","state_url":"https://pith.science/pith/4P3VU5V72ADJEZ5OV43ENYZKDU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4P3VU5V72ADJEZ5OV43ENYZKDU/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-31T22:50:02Z","links":{"resolver":"https://pith.science/pith/4P3VU5V72ADJEZ5OV43ENYZKDU","bundle":"https://pith.science/pith/4P3VU5V72ADJEZ5OV43ENYZKDU/bundle.json","state":"https://pith.science/pith/4P3VU5V72ADJEZ5OV43ENYZKDU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4P3VU5V72ADJEZ5OV43ENYZKDU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:4P3VU5V72ADJEZ5OV43ENYZKDU","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":"cec8d9bbd6d7a3a8aae5857992a608de201bf7079464d91efd38141b644cc2e5","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-01-03T20:24:33Z","title_canon_sha256":"b5cdc610a9ddd27fe32c1584dfbaf22baf877c5977c79d09478014028eeeb64e"},"schema_version":"1.0","source":{"id":"1301.0541","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0541","created_at":"2026-05-18T02:30:32Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0541v4","created_at":"2026-05-18T02:30:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0541","created_at":"2026-05-18T02:30:32Z"},{"alias_kind":"pith_short_12","alias_value":"4P3VU5V72ADJ","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4P3VU5V72ADJEZ5O","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4P3VU5V7","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:4ce480027503c20b9be1a1fa89e32d9ced572b3998bc57872dba1219051a3c09","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":"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 ","authors_text":"Arkadiusz Pawlik, Bartosz Walczak, Tomasz Krawczyk","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-01-03T20:24:33Z","title":"Coloring triangle-free rectangle overlap graphs with $O(\\log\\log n)$ colors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0541","kind":"arxiv","version":4},"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:634442e7c00558cd186b0ddb8dece2b57ebe8b054d701d1047aba8e555ddf54b","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":"cec8d9bbd6d7a3a8aae5857992a608de201bf7079464d91efd38141b644cc2e5","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-01-03T20:24:33Z","title_canon_sha256":"b5cdc610a9ddd27fe32c1584dfbaf22baf877c5977c79d09478014028eeeb64e"},"schema_version":"1.0","source":{"id":"1301.0541","kind":"arxiv","version":4}},"canonical_sha256":"e3f75a76bfd0069267aeaf3646e32a1d3255e0cfb9087862911ccf78472543e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3f75a76bfd0069267aeaf3646e32a1d3255e0cfb9087862911ccf78472543e9","first_computed_at":"2026-05-18T02:30:32.736262Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:32.736262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HIpMdcmM2fEVbj3Rvx5QdpO1x7p+e0Gf9M/ov9o0ezfo0Y4jVpuXZpvUyF00jVhL+Ni9jcN9wzwWEz6Q3XNbDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:32.736836Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.0541","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:634442e7c00558cd186b0ddb8dece2b57ebe8b054d701d1047aba8e555ddf54b","sha256:4ce480027503c20b9be1a1fa89e32d9ced572b3998bc57872dba1219051a3c09"],"state_sha256":"724b7415114ef5158dd69e392c4566e459f749a8742789b76859e06a25416988"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d8CpseCjuWCDsW26iKroEh9AJfuMNQPtQe4fK6crpDDwN2PCbvlXHX/CAY7w/9bxu0JbOa384TmzRPO5/S9MDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T22:50:02.197901Z","bundle_sha256":"f4996ce19c30a61777afb270c1fee69e58539730f1203b09ad420b2c2521d0b0"}}