{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:H5EQZ6EHD37GLX4DJESR3XXOP5","short_pith_number":"pith:H5EQZ6EH","schema_version":"1.0","canonical_sha256":"3f490cf8871efe65df8349251ddeee7f52e77bd033370a0a633c928d8be67b74","source":{"kind":"arxiv","id":"1406.2428","version":2},"attestation_state":"computed","paper":{"title":"Point visibility graph recognition is NP-hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.CG","authors_text":"Bodhayan Roy","submitted_at":"2014-06-10T06:05:59Z","abstract_excerpt":"Given a 3-SAT formula, a graph can be constructed in polynomial time such that the graph is a point visibility graph if and only if the 3-SAT formula is satisfiable. This reduction establishes that the problem of recognition of point visibility graphs is NP-hard."},"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.2428","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-06-10T06:05:59Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"dcfb1f78d2f224d4a5c3de4a5d4fb8fce9f286d4038d4039ce9a51b8dc9b7eec","abstract_canon_sha256":"2ffbf82d0237ba1c8a2988e661bdc2480e4647b878245d370b23f5c10a66fb2d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:39.054532Z","signature_b64":"dooQRteAnojnAAf5Lag7l0xuml4Jgr4umsKQ+boZwIr5gnAs3282GTRcl3EzVuiHKfgiPaD0kVq28wDYq0EWAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f490cf8871efe65df8349251ddeee7f52e77bd033370a0a633c928d8be67b74","last_reissued_at":"2026-05-18T01:15:39.053788Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:39.053788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Point visibility graph recognition is NP-hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.CG","authors_text":"Bodhayan Roy","submitted_at":"2014-06-10T06:05:59Z","abstract_excerpt":"Given a 3-SAT formula, a graph can be constructed in polynomial time such that the graph is a point visibility graph if and only if the 3-SAT formula is satisfiable. This reduction establishes that the problem of recognition of point visibility graphs is NP-hard."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2428","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":"1406.2428","created_at":"2026-05-18T01:15:39.053916+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.2428v2","created_at":"2026-05-18T01:15:39.053916+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2428","created_at":"2026-05-18T01:15:39.053916+00:00"},{"alias_kind":"pith_short_12","alias_value":"H5EQZ6EHD37G","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"H5EQZ6EHD37GLX4D","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"H5EQZ6EH","created_at":"2026-05-18T12:28:30.664211+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/H5EQZ6EHD37GLX4DJESR3XXOP5","json":"https://pith.science/pith/H5EQZ6EHD37GLX4DJESR3XXOP5.json","graph_json":"https://pith.science/api/pith-number/H5EQZ6EHD37GLX4DJESR3XXOP5/graph.json","events_json":"https://pith.science/api/pith-number/H5EQZ6EHD37GLX4DJESR3XXOP5/events.json","paper":"https://pith.science/paper/H5EQZ6EH"},"agent_actions":{"view_html":"https://pith.science/pith/H5EQZ6EHD37GLX4DJESR3XXOP5","download_json":"https://pith.science/pith/H5EQZ6EHD37GLX4DJESR3XXOP5.json","view_paper":"https://pith.science/paper/H5EQZ6EH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.2428&json=true","fetch_graph":"https://pith.science/api/pith-number/H5EQZ6EHD37GLX4DJESR3XXOP5/graph.json","fetch_events":"https://pith.science/api/pith-number/H5EQZ6EHD37GLX4DJESR3XXOP5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H5EQZ6EHD37GLX4DJESR3XXOP5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H5EQZ6EHD37GLX4DJESR3XXOP5/action/storage_attestation","attest_author":"https://pith.science/pith/H5EQZ6EHD37GLX4DJESR3XXOP5/action/author_attestation","sign_citation":"https://pith.science/pith/H5EQZ6EHD37GLX4DJESR3XXOP5/action/citation_signature","submit_replication":"https://pith.science/pith/H5EQZ6EHD37GLX4DJESR3XXOP5/action/replication_record"}},"created_at":"2026-05-18T01:15:39.053916+00:00","updated_at":"2026-05-18T01:15:39.053916+00:00"}