{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:XET54DSW4LENFQ5K4MWBADXOAK","short_pith_number":"pith:XET54DSW","schema_version":"1.0","canonical_sha256":"b927de0e56e2c8d2c3aae32c100eee028ec9c62a8375ae6713910d73f0607be8","source":{"kind":"arxiv","id":"1406.2636","version":1},"attestation_state":"computed","paper":{"title":"Intersection graphs of segments and $\\exists\\mathbb{R}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CG","authors_text":"Jiri Matousek","submitted_at":"2014-06-10T17:20:49Z","abstract_excerpt":"A graph $G$ with vertex set $\\{v_1,v_2,\\ldots,v_n\\}$ is an intersection graph of segments if there are segments $s_1,\\ldots,s_n$ in the plane such that $s_i$ and $s_j$ have a common point if and only if $\\{v_i,v_j\\}$ is an edge of~$G$. In this expository paper, we consider the algorithmic problem of testing whether a given abstract graph is an intersection graph of segments.\n  It turned out that this problem is complete for an interesting recently introduced class of computational problems, denoted by $\\exists\\mathbb{R}$. This class consists of problems that can be reduced, in polynomial time,"},"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":"1406.2636","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-06-10T17:20:49Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"56c6999544fc4ebcf9000ef11bd48424e9aaa4d824f94d31e6b38bf1ad9eb30a","abstract_canon_sha256":"13fbc62ca91612178a3f749f628893b50016ba208ce509684a6ff894506bf806"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:01.259888Z","signature_b64":"Da/vifdYsCp42LqtXMivGFEFvg4lLP2SVyRieeShgfmV3hM9Z0CcQnsXieWqiSbPtgAxp6h9MyGXW9KLcRFkCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b927de0e56e2c8d2c3aae32c100eee028ec9c62a8375ae6713910d73f0607be8","last_reissued_at":"2026-05-18T02:50:01.259432Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:01.259432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Intersection graphs of segments and $\\exists\\mathbb{R}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CG","authors_text":"Jiri Matousek","submitted_at":"2014-06-10T17:20:49Z","abstract_excerpt":"A graph $G$ with vertex set $\\{v_1,v_2,\\ldots,v_n\\}$ is an intersection graph of segments if there are segments $s_1,\\ldots,s_n$ in the plane such that $s_i$ and $s_j$ have a common point if and only if $\\{v_i,v_j\\}$ is an edge of~$G$. In this expository paper, we consider the algorithmic problem of testing whether a given abstract graph is an intersection graph of segments.\n  It turned out that this problem is complete for an interesting recently introduced class of computational problems, denoted by $\\exists\\mathbb{R}$. This class consists of problems that can be reduced, in polynomial time,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2636","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":"1406.2636","created_at":"2026-05-18T02:50:01.259497+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.2636v1","created_at":"2026-05-18T02:50:01.259497+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2636","created_at":"2026-05-18T02:50:01.259497+00:00"},{"alias_kind":"pith_short_12","alias_value":"XET54DSW4LEN","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"XET54DSW4LENFQ5K","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"XET54DSW","created_at":"2026-05-18T12:28:57.508820+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"1907.04645","citing_title":"Smoothed Analysis of Order Types","ref_index":28,"is_internal_anchor":true},{"citing_arxiv_id":"2604.26749","citing_title":"The Nesting Bird Box Problem is ER-complete: Sharp Hardness Results for the Hidden Set Problem","ref_index":17,"is_internal_anchor":true},{"citing_arxiv_id":"2605.01592","citing_title":"Witness Set: A Visibility Problem in $NP\\cap XP$","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XET54DSW4LENFQ5K4MWBADXOAK","json":"https://pith.science/pith/XET54DSW4LENFQ5K4MWBADXOAK.json","graph_json":"https://pith.science/api/pith-number/XET54DSW4LENFQ5K4MWBADXOAK/graph.json","events_json":"https://pith.science/api/pith-number/XET54DSW4LENFQ5K4MWBADXOAK/events.json","paper":"https://pith.science/paper/XET54DSW"},"agent_actions":{"view_html":"https://pith.science/pith/XET54DSW4LENFQ5K4MWBADXOAK","download_json":"https://pith.science/pith/XET54DSW4LENFQ5K4MWBADXOAK.json","view_paper":"https://pith.science/paper/XET54DSW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.2636&json=true","fetch_graph":"https://pith.science/api/pith-number/XET54DSW4LENFQ5K4MWBADXOAK/graph.json","fetch_events":"https://pith.science/api/pith-number/XET54DSW4LENFQ5K4MWBADXOAK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XET54DSW4LENFQ5K4MWBADXOAK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XET54DSW4LENFQ5K4MWBADXOAK/action/storage_attestation","attest_author":"https://pith.science/pith/XET54DSW4LENFQ5K4MWBADXOAK/action/author_attestation","sign_citation":"https://pith.science/pith/XET54DSW4LENFQ5K4MWBADXOAK/action/citation_signature","submit_replication":"https://pith.science/pith/XET54DSW4LENFQ5K4MWBADXOAK/action/replication_record"}},"created_at":"2026-05-18T02:50:01.259497+00:00","updated_at":"2026-05-18T02:50:01.259497+00:00"}