{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:QAS67GIF5QDQJILG3E6SV4T4AN","short_pith_number":"pith:QAS67GIF","schema_version":"1.0","canonical_sha256":"8025ef9905ec0704a166d93d2af27c036ab5e12712443cdb201fa88429cc0c52","source":{"kind":"arxiv","id":"1612.02158","version":2},"attestation_state":"computed","paper":{"title":"Proper Coloring of Geometric Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Bal\\'azs Keszegh, D\\\"om\\\"ot\\\"or P\\'alv\\\"olgyi","submitted_at":"2016-12-07T09:12:00Z","abstract_excerpt":"We study whether for a given planar family F there is an m such that any finite set of points can be 3-colored such that any member of F that contains at least m points contains two points with different colors. We conjecture that if F is a family of pseudo-disks, then such an m exists. We prove this in the special case when F is the family of all homothetic copies of a given convex polygon. We also study the problem in higher dimensions."},"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":"1612.02158","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-07T09:12:00Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"51d8eec313b4540f1d6e0ee8fa1721afa78a68fc505d8cfe2ac5ec51d8ffe0ce","abstract_canon_sha256":"4cca39ef731f429d6dcf36ff03de585952e2004392db33119cf3fa18e36efbb1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:34.678523Z","signature_b64":"tFpBe7M1eW7G5Fjt1/uXpCN5pQjWXdPwmkz0LTRZzzfjF9Cwyw36Gyf827MeixcDsNOxUuVIQU4XQQpPYJ8fBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8025ef9905ec0704a166d93d2af27c036ab5e12712443cdb201fa88429cc0c52","last_reissued_at":"2026-05-17T23:48:34.677857Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:34.677857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proper Coloring of Geometric Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Bal\\'azs Keszegh, D\\\"om\\\"ot\\\"or P\\'alv\\\"olgyi","submitted_at":"2016-12-07T09:12:00Z","abstract_excerpt":"We study whether for a given planar family F there is an m such that any finite set of points can be 3-colored such that any member of F that contains at least m points contains two points with different colors. We conjecture that if F is a family of pseudo-disks, then such an m exists. We prove this in the special case when F is the family of all homothetic copies of a given convex polygon. We also study the problem in higher dimensions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.02158","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":"1612.02158","created_at":"2026-05-17T23:48:34.677970+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.02158v2","created_at":"2026-05-17T23:48:34.677970+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.02158","created_at":"2026-05-17T23:48:34.677970+00:00"},{"alias_kind":"pith_short_12","alias_value":"QAS67GIF5QDQ","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"QAS67GIF5QDQJILG","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"QAS67GIF","created_at":"2026-05-18T12:30:39.010887+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/QAS67GIF5QDQJILG3E6SV4T4AN","json":"https://pith.science/pith/QAS67GIF5QDQJILG3E6SV4T4AN.json","graph_json":"https://pith.science/api/pith-number/QAS67GIF5QDQJILG3E6SV4T4AN/graph.json","events_json":"https://pith.science/api/pith-number/QAS67GIF5QDQJILG3E6SV4T4AN/events.json","paper":"https://pith.science/paper/QAS67GIF"},"agent_actions":{"view_html":"https://pith.science/pith/QAS67GIF5QDQJILG3E6SV4T4AN","download_json":"https://pith.science/pith/QAS67GIF5QDQJILG3E6SV4T4AN.json","view_paper":"https://pith.science/paper/QAS67GIF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.02158&json=true","fetch_graph":"https://pith.science/api/pith-number/QAS67GIF5QDQJILG3E6SV4T4AN/graph.json","fetch_events":"https://pith.science/api/pith-number/QAS67GIF5QDQJILG3E6SV4T4AN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QAS67GIF5QDQJILG3E6SV4T4AN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QAS67GIF5QDQJILG3E6SV4T4AN/action/storage_attestation","attest_author":"https://pith.science/pith/QAS67GIF5QDQJILG3E6SV4T4AN/action/author_attestation","sign_citation":"https://pith.science/pith/QAS67GIF5QDQJILG3E6SV4T4AN/action/citation_signature","submit_replication":"https://pith.science/pith/QAS67GIF5QDQJILG3E6SV4T4AN/action/replication_record"}},"created_at":"2026-05-17T23:48:34.677970+00:00","updated_at":"2026-05-17T23:48:34.677970+00:00"}