{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SA6JIRBG26DLREGVNBE5LM6NCM","short_pith_number":"pith:SA6JIRBG","schema_version":"1.0","canonical_sha256":"903c944426d786b890d56849d5b3cd1324638ea138b29fb007db65d28e586c1e","source":{"kind":"arxiv","id":"1512.01953","version":2},"attestation_state":"computed","paper":{"title":"Coloring points with respect to squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bal\\'azs Keszegh, Eyal Ackerman, M\\'at\\'e Vizer","submitted_at":"2015-12-07T09:35:19Z","abstract_excerpt":"We consider the problem of $2$-coloring geometric hypergraphs. Specifically, we show that there is a constant $m$ such that any finite set of points in the plane $\\mathcal{S} \\subset {\\mathbb R}^2$ can be $2$-colored such that every axis-parallel square that contains at least $m$ points from $\\mathcal{S}$ contains points of both colors. Our proof is constructive, that is, it provides a polynomial-time algorithm for obtaining such a $2$-coloring. By affine transformations this result immediately applies also when considering $2$-coloring points with respect to homothets of a fixed parallelogram"},"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":"1512.01953","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-07T09:35:19Z","cross_cats_sorted":[],"title_canon_sha256":"e3209dcb1c4b71e4d29e812f24509e25138014e54bf6908c6e0dc313f0e31493","abstract_canon_sha256":"75bac734b9d592c1cdaa3a3e726feb3ccb8be97890ec058f33dc36067a2cdd6f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:35.337487Z","signature_b64":"XJtz3sbQdMkABdJpYLYzwaK59t3EluXUmO2pbbFLO+nbMEzMcoaCt+scVmrKxPBCW6c7eUh5ztMIs673hKr7DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"903c944426d786b890d56849d5b3cd1324638ea138b29fb007db65d28e586c1e","last_reissued_at":"2026-05-18T00:42:35.336847Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:35.336847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coloring points with respect to squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bal\\'azs Keszegh, Eyal Ackerman, M\\'at\\'e Vizer","submitted_at":"2015-12-07T09:35:19Z","abstract_excerpt":"We consider the problem of $2$-coloring geometric hypergraphs. Specifically, we show that there is a constant $m$ such that any finite set of points in the plane $\\mathcal{S} \\subset {\\mathbb R}^2$ can be $2$-colored such that every axis-parallel square that contains at least $m$ points from $\\mathcal{S}$ contains points of both colors. Our proof is constructive, that is, it provides a polynomial-time algorithm for obtaining such a $2$-coloring. By affine transformations this result immediately applies also when considering $2$-coloring points with respect to homothets of a fixed parallelogram"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.01953","kind":"arxiv","version":2},"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":"1512.01953","created_at":"2026-05-18T00:42:35.336945+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.01953v2","created_at":"2026-05-18T00:42:35.336945+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.01953","created_at":"2026-05-18T00:42:35.336945+00:00"},{"alias_kind":"pith_short_12","alias_value":"SA6JIRBG26DL","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"SA6JIRBG26DLREGV","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"SA6JIRBG","created_at":"2026-05-18T12:29:39.896362+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/SA6JIRBG26DLREGVNBE5LM6NCM","json":"https://pith.science/pith/SA6JIRBG26DLREGVNBE5LM6NCM.json","graph_json":"https://pith.science/api/pith-number/SA6JIRBG26DLREGVNBE5LM6NCM/graph.json","events_json":"https://pith.science/api/pith-number/SA6JIRBG26DLREGVNBE5LM6NCM/events.json","paper":"https://pith.science/paper/SA6JIRBG"},"agent_actions":{"view_html":"https://pith.science/pith/SA6JIRBG26DLREGVNBE5LM6NCM","download_json":"https://pith.science/pith/SA6JIRBG26DLREGVNBE5LM6NCM.json","view_paper":"https://pith.science/paper/SA6JIRBG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.01953&json=true","fetch_graph":"https://pith.science/api/pith-number/SA6JIRBG26DLREGVNBE5LM6NCM/graph.json","fetch_events":"https://pith.science/api/pith-number/SA6JIRBG26DLREGVNBE5LM6NCM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SA6JIRBG26DLREGVNBE5LM6NCM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SA6JIRBG26DLREGVNBE5LM6NCM/action/storage_attestation","attest_author":"https://pith.science/pith/SA6JIRBG26DLREGVNBE5LM6NCM/action/author_attestation","sign_citation":"https://pith.science/pith/SA6JIRBG26DLREGVNBE5LM6NCM/action/citation_signature","submit_replication":"https://pith.science/pith/SA6JIRBG26DLREGVNBE5LM6NCM/action/replication_record"}},"created_at":"2026-05-18T00:42:35.336945+00:00","updated_at":"2026-05-18T00:42:35.336945+00:00"}