{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ZB4SDGGSRDZWC3OVSNCMHUZCRO","short_pith_number":"pith:ZB4SDGGS","schema_version":"1.0","canonical_sha256":"c8792198d288f3616dd59344c3d3228b9bd9bdd475b0943777e836c24f44b101","source":{"kind":"arxiv","id":"1410.7273","version":1},"attestation_state":"computed","paper":{"title":"5 Colorable Visibility Graphs Have Bounded Size or 4 Collinear Points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"B\\'alint Hujter, S\\'andor Kisfaludi-Bak","submitted_at":"2014-10-27T15:23:34Z","abstract_excerpt":"We investigate the question of finding a bound for the size of a $\\chi$-colorable finite visibility graph that has at most $\\ell$ collinear points. This can be regarded as a relaxed version of the Big Line - Big Clique conjecture. We prove that any finite point set that has at least 2311 points has either 4 collinear points or a visibility graph that cannot be 5-colored."},"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":"1410.7273","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-27T15:23:34Z","cross_cats_sorted":[],"title_canon_sha256":"bd82d3bf23678e0a908b57e4dd0cacc45038d73e5039e6e8b89958e704b2b91f","abstract_canon_sha256":"f17abcca274b4eb4bb05a5d7ef372cd8aea9d0734247bd98d8626ccabe74c1ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:17.674432Z","signature_b64":"JUnsled2WS6QBk49aG32mXexpGmrwkuybgZQHgYaejGoARmvr0Twg9dBtGg9EFrkA1RpTweNXMeGpDwjYaUYBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8792198d288f3616dd59344c3d3228b9bd9bdd475b0943777e836c24f44b101","last_reissued_at":"2026-05-18T02:39:17.673881Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:17.673881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"5 Colorable Visibility Graphs Have Bounded Size or 4 Collinear Points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"B\\'alint Hujter, S\\'andor Kisfaludi-Bak","submitted_at":"2014-10-27T15:23:34Z","abstract_excerpt":"We investigate the question of finding a bound for the size of a $\\chi$-colorable finite visibility graph that has at most $\\ell$ collinear points. This can be regarded as a relaxed version of the Big Line - Big Clique conjecture. We prove that any finite point set that has at least 2311 points has either 4 collinear points or a visibility graph that cannot be 5-colored."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7273","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":"1410.7273","created_at":"2026-05-18T02:39:17.673984+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.7273v1","created_at":"2026-05-18T02:39:17.673984+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7273","created_at":"2026-05-18T02:39:17.673984+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZB4SDGGSRDZW","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZB4SDGGSRDZWC3OV","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZB4SDGGS","created_at":"2026-05-18T12:28:59.999130+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/ZB4SDGGSRDZWC3OVSNCMHUZCRO","json":"https://pith.science/pith/ZB4SDGGSRDZWC3OVSNCMHUZCRO.json","graph_json":"https://pith.science/api/pith-number/ZB4SDGGSRDZWC3OVSNCMHUZCRO/graph.json","events_json":"https://pith.science/api/pith-number/ZB4SDGGSRDZWC3OVSNCMHUZCRO/events.json","paper":"https://pith.science/paper/ZB4SDGGS"},"agent_actions":{"view_html":"https://pith.science/pith/ZB4SDGGSRDZWC3OVSNCMHUZCRO","download_json":"https://pith.science/pith/ZB4SDGGSRDZWC3OVSNCMHUZCRO.json","view_paper":"https://pith.science/paper/ZB4SDGGS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.7273&json=true","fetch_graph":"https://pith.science/api/pith-number/ZB4SDGGSRDZWC3OVSNCMHUZCRO/graph.json","fetch_events":"https://pith.science/api/pith-number/ZB4SDGGSRDZWC3OVSNCMHUZCRO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZB4SDGGSRDZWC3OVSNCMHUZCRO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZB4SDGGSRDZWC3OVSNCMHUZCRO/action/storage_attestation","attest_author":"https://pith.science/pith/ZB4SDGGSRDZWC3OVSNCMHUZCRO/action/author_attestation","sign_citation":"https://pith.science/pith/ZB4SDGGSRDZWC3OVSNCMHUZCRO/action/citation_signature","submit_replication":"https://pith.science/pith/ZB4SDGGSRDZWC3OVSNCMHUZCRO/action/replication_record"}},"created_at":"2026-05-18T02:39:17.673984+00:00","updated_at":"2026-05-18T02:39:17.673984+00:00"}