{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:TPR5AX6POHXBT3Y4WT25WA2EUQ","short_pith_number":"pith:TPR5AX6P","schema_version":"1.0","canonical_sha256":"9be3d05fcf71ee19ef1cb4f5db0344a430b60589ec4698cf5ed0e4b2040f8d5d","source":{"kind":"arxiv","id":"1111.5986","version":1},"attestation_state":"computed","paper":{"title":"The Clique Problem in Ray Intersection Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.CG","authors_text":"Jean Cardinal, Sergio Cabello, Stefan Langerman","submitted_at":"2011-11-25T13:48:12Z","abstract_excerpt":"Ray intersection graphs are intersection graphs of rays, or halflines, in the plane. We show that any planar graph has an even subdivision whose complement is a ray intersection graph. The construction can be done in polynomial time and implies that finding a maximum clique in a segment intersection graph is NP-hard. This solves a 21-year old open problem posed by Kratochv\\'il and Ne\\v{s}et\\v{r}il."},"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":"1111.5986","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-11-25T13:48:12Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"99432de470ce04931051bd65a2b3063e8d417ef99e17c5ed9bbb814f2fba8112","abstract_canon_sha256":"c84b075e6b4db72e717efdd3cdc7f38aa1411265cfd5b9ccecfe66ec7037c6e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:41.287475Z","signature_b64":"+C5CUvu9ge/8+lUvjA++DoTUSG/y4w8WXNTwRZfSkVEZgGQVEQjBdROLx+Q5e6y84+K7BF99H3MtQIQxSTxDAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9be3d05fcf71ee19ef1cb4f5db0344a430b60589ec4698cf5ed0e4b2040f8d5d","last_reissued_at":"2026-05-18T04:07:41.286940Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:41.286940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Clique Problem in Ray Intersection Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.CG","authors_text":"Jean Cardinal, Sergio Cabello, Stefan Langerman","submitted_at":"2011-11-25T13:48:12Z","abstract_excerpt":"Ray intersection graphs are intersection graphs of rays, or halflines, in the plane. We show that any planar graph has an even subdivision whose complement is a ray intersection graph. The construction can be done in polynomial time and implies that finding a maximum clique in a segment intersection graph is NP-hard. This solves a 21-year old open problem posed by Kratochv\\'il and Ne\\v{s}et\\v{r}il."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.5986","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":"1111.5986","created_at":"2026-05-18T04:07:41.287022+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.5986v1","created_at":"2026-05-18T04:07:41.287022+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.5986","created_at":"2026-05-18T04:07:41.287022+00:00"},{"alias_kind":"pith_short_12","alias_value":"TPR5AX6POHXB","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"TPR5AX6POHXBT3Y4","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"TPR5AX6P","created_at":"2026-05-18T12:26:42.757692+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/TPR5AX6POHXBT3Y4WT25WA2EUQ","json":"https://pith.science/pith/TPR5AX6POHXBT3Y4WT25WA2EUQ.json","graph_json":"https://pith.science/api/pith-number/TPR5AX6POHXBT3Y4WT25WA2EUQ/graph.json","events_json":"https://pith.science/api/pith-number/TPR5AX6POHXBT3Y4WT25WA2EUQ/events.json","paper":"https://pith.science/paper/TPR5AX6P"},"agent_actions":{"view_html":"https://pith.science/pith/TPR5AX6POHXBT3Y4WT25WA2EUQ","download_json":"https://pith.science/pith/TPR5AX6POHXBT3Y4WT25WA2EUQ.json","view_paper":"https://pith.science/paper/TPR5AX6P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.5986&json=true","fetch_graph":"https://pith.science/api/pith-number/TPR5AX6POHXBT3Y4WT25WA2EUQ/graph.json","fetch_events":"https://pith.science/api/pith-number/TPR5AX6POHXBT3Y4WT25WA2EUQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TPR5AX6POHXBT3Y4WT25WA2EUQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TPR5AX6POHXBT3Y4WT25WA2EUQ/action/storage_attestation","attest_author":"https://pith.science/pith/TPR5AX6POHXBT3Y4WT25WA2EUQ/action/author_attestation","sign_citation":"https://pith.science/pith/TPR5AX6POHXBT3Y4WT25WA2EUQ/action/citation_signature","submit_replication":"https://pith.science/pith/TPR5AX6POHXBT3Y4WT25WA2EUQ/action/replication_record"}},"created_at":"2026-05-18T04:07:41.287022+00:00","updated_at":"2026-05-18T04:07:41.287022+00:00"}