{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:EZCZ2QEK3CBTTMD3OECMCBELF4","short_pith_number":"pith:EZCZ2QEK","schema_version":"1.0","canonical_sha256":"26459d408ad88339b07b7104c1048b2f12a5686abec295f9e16ff19c029bf474","source":{"kind":"arxiv","id":"1105.0169","version":1},"attestation_state":"computed","paper":{"title":"Coloring half-planes and bottomless rectangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bal\\'azs Keszegh","submitted_at":"2011-05-01T13:08:20Z","abstract_excerpt":"We prove lower and upper bounds for the chromatic number of certain hypergraphs defined by geometric regions. This problem has close relations to conflict-free colorings. One of the most interesting type of regions to consider for this problem is that of the axis-parallel rectangles. We completely solve the problem for a special case of them, for bottomless rectangles. We also give an almost complete answer for half-planes and pose several open problems. Moreover we give efficient coloring algorithms."},"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":"1105.0169","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-01T13:08:20Z","cross_cats_sorted":[],"title_canon_sha256":"81b83c9103249bd840657df2509ca87944618c314c90efd78b76df3d55d14b80","abstract_canon_sha256":"70619c3090734094688031709175a697fd499cc047f6522df3fe51937fb3b4bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:12.390134Z","signature_b64":"ZMFHQ1wBvNFNwdG9PbQpiL8sVw3THFjxYCPqzVQbwPJ3z5DEqoco8iZIfWqKKXjnoMR98M3qDHHlmaPvR/XlCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26459d408ad88339b07b7104c1048b2f12a5686abec295f9e16ff19c029bf474","last_reissued_at":"2026-05-18T04:23:12.389586Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:12.389586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coloring half-planes and bottomless rectangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bal\\'azs Keszegh","submitted_at":"2011-05-01T13:08:20Z","abstract_excerpt":"We prove lower and upper bounds for the chromatic number of certain hypergraphs defined by geometric regions. This problem has close relations to conflict-free colorings. One of the most interesting type of regions to consider for this problem is that of the axis-parallel rectangles. We completely solve the problem for a special case of them, for bottomless rectangles. We also give an almost complete answer for half-planes and pose several open problems. Moreover we give efficient coloring algorithms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0169","kind":"arxiv","version":1},"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":"1105.0169","created_at":"2026-05-18T04:23:12.389648+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.0169v1","created_at":"2026-05-18T04:23:12.389648+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0169","created_at":"2026-05-18T04:23:12.389648+00:00"},{"alias_kind":"pith_short_12","alias_value":"EZCZ2QEK3CBT","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"EZCZ2QEK3CBTTMD3","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"EZCZ2QEK","created_at":"2026-05-18T12:26:28.662955+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/EZCZ2QEK3CBTTMD3OECMCBELF4","json":"https://pith.science/pith/EZCZ2QEK3CBTTMD3OECMCBELF4.json","graph_json":"https://pith.science/api/pith-number/EZCZ2QEK3CBTTMD3OECMCBELF4/graph.json","events_json":"https://pith.science/api/pith-number/EZCZ2QEK3CBTTMD3OECMCBELF4/events.json","paper":"https://pith.science/paper/EZCZ2QEK"},"agent_actions":{"view_html":"https://pith.science/pith/EZCZ2QEK3CBTTMD3OECMCBELF4","download_json":"https://pith.science/pith/EZCZ2QEK3CBTTMD3OECMCBELF4.json","view_paper":"https://pith.science/paper/EZCZ2QEK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.0169&json=true","fetch_graph":"https://pith.science/api/pith-number/EZCZ2QEK3CBTTMD3OECMCBELF4/graph.json","fetch_events":"https://pith.science/api/pith-number/EZCZ2QEK3CBTTMD3OECMCBELF4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EZCZ2QEK3CBTTMD3OECMCBELF4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EZCZ2QEK3CBTTMD3OECMCBELF4/action/storage_attestation","attest_author":"https://pith.science/pith/EZCZ2QEK3CBTTMD3OECMCBELF4/action/author_attestation","sign_citation":"https://pith.science/pith/EZCZ2QEK3CBTTMD3OECMCBELF4/action/citation_signature","submit_replication":"https://pith.science/pith/EZCZ2QEK3CBTTMD3OECMCBELF4/action/replication_record"}},"created_at":"2026-05-18T04:23:12.389648+00:00","updated_at":"2026-05-18T04:23:12.389648+00:00"}