{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:B3MLSOXRALWYN6ROCF5XBQDDPF","short_pith_number":"pith:B3MLSOXR","canonical_record":{"source":{"id":"1503.07082","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-03-24T15:37:28Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"9756cd85da9bfec0c4fb1f4b5a3ec50c0d45cc0d390bb612c1473a81ad66e4de","abstract_canon_sha256":"9918a0300e4e7782e5416e13f1d8b1d122bcda47f29109d8169758ec4dca4aea"},"schema_version":"1.0"},"canonical_sha256":"0ed8b93af102ed86fa2e117b70c06379436c33a707781d6b7a1b3986251badfa","source":{"kind":"arxiv","id":"1503.07082","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.07082","created_at":"2026-05-17T23:54:57Z"},{"alias_kind":"arxiv_version","alias_value":"1503.07082v2","created_at":"2026-05-17T23:54:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07082","created_at":"2026-05-17T23:54:57Z"},{"alias_kind":"pith_short_12","alias_value":"B3MLSOXRALWY","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"B3MLSOXRALWYN6RO","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"B3MLSOXR","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:B3MLSOXRALWYN6ROCF5XBQDDPF","target":"record","payload":{"canonical_record":{"source":{"id":"1503.07082","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-03-24T15:37:28Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"9756cd85da9bfec0c4fb1f4b5a3ec50c0d45cc0d390bb612c1473a81ad66e4de","abstract_canon_sha256":"9918a0300e4e7782e5416e13f1d8b1d122bcda47f29109d8169758ec4dca4aea"},"schema_version":"1.0"},"canonical_sha256":"0ed8b93af102ed86fa2e117b70c06379436c33a707781d6b7a1b3986251badfa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:57.210609Z","signature_b64":"ZxYiESOUDEKCRUxfs8ZBWc1oie/cIXOe5pQsMiUVnjs9bjlB0LzyyQ6c6JfOCW0IIeBVA5ZUWOJ+MTjUyM+oAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ed8b93af102ed86fa2e117b70c06379436c33a707781d6b7a1b3986251badfa","last_reissued_at":"2026-05-17T23:54:57.209977Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:57.209977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.07082","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:54:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3WWscPNM/8qy62EkMiwzd1xhdiFFw1DSnNfqpcY4UhmcbXsIUMSatrxgfv/UQHKWNMoxBTlokko7imSSDJVYDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T04:52:31.828370Z"},"content_sha256":"4dbe347ba1578e8131fe04c06d7e0d9c4e3058e47d83de0ec529c3b6def09b70","schema_version":"1.0","event_id":"sha256:4dbe347ba1578e8131fe04c06d7e0d9c4e3058e47d83de0ec529c3b6def09b70"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:B3MLSOXRALWYN6ROCF5XBQDDPF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recognition and Complexity of Point Visibility Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CG","authors_text":"Jean Cardinal, Udo Hoffmann","submitted_at":"2015-03-24T15:37:28Z","abstract_excerpt":"A point visibility graph is a graph induced by a set of points in the plane, where every vertex corresponds to a point, and two vertices are adjacent whenever the two corresponding points are visible from each other, that is, the open segment between them does not contain any other point of the set. We study the recognition problem for point visibility graphs: given a simple undirected graph, decide whether it is the visibility graph of some point set in the plane. We show that the problem is complete for the existential theory of the reals. Hence the problem is as hard as deciding the existen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07082","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:54:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TRRZXCQsySZ8ydSoowpKuu6BnQw6pbyfsj5venasNO7vlnHQZwNnbsUH+rC648y8bR5j4rmt0fHVAQ54FRmJAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T04:52:31.828762Z"},"content_sha256":"60365d0ba8ef068a60459e48a11d60fec35a1365803e9a7942e4377817a30bf2","schema_version":"1.0","event_id":"sha256:60365d0ba8ef068a60459e48a11d60fec35a1365803e9a7942e4377817a30bf2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B3MLSOXRALWYN6ROCF5XBQDDPF/bundle.json","state_url":"https://pith.science/pith/B3MLSOXRALWYN6ROCF5XBQDDPF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B3MLSOXRALWYN6ROCF5XBQDDPF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-05T04:52:31Z","links":{"resolver":"https://pith.science/pith/B3MLSOXRALWYN6ROCF5XBQDDPF","bundle":"https://pith.science/pith/B3MLSOXRALWYN6ROCF5XBQDDPF/bundle.json","state":"https://pith.science/pith/B3MLSOXRALWYN6ROCF5XBQDDPF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B3MLSOXRALWYN6ROCF5XBQDDPF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:B3MLSOXRALWYN6ROCF5XBQDDPF","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"9918a0300e4e7782e5416e13f1d8b1d122bcda47f29109d8169758ec4dca4aea","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-03-24T15:37:28Z","title_canon_sha256":"9756cd85da9bfec0c4fb1f4b5a3ec50c0d45cc0d390bb612c1473a81ad66e4de"},"schema_version":"1.0","source":{"id":"1503.07082","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.07082","created_at":"2026-05-17T23:54:57Z"},{"alias_kind":"arxiv_version","alias_value":"1503.07082v2","created_at":"2026-05-17T23:54:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07082","created_at":"2026-05-17T23:54:57Z"},{"alias_kind":"pith_short_12","alias_value":"B3MLSOXRALWY","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"B3MLSOXRALWYN6RO","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"B3MLSOXR","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:60365d0ba8ef068a60459e48a11d60fec35a1365803e9a7942e4377817a30bf2","target":"graph","created_at":"2026-05-17T23:54:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"A point visibility graph is a graph induced by a set of points in the plane, where every vertex corresponds to a point, and two vertices are adjacent whenever the two corresponding points are visible from each other, that is, the open segment between them does not contain any other point of the set. We study the recognition problem for point visibility graphs: given a simple undirected graph, decide whether it is the visibility graph of some point set in the plane. We show that the problem is complete for the existential theory of the reals. Hence the problem is as hard as deciding the existen","authors_text":"Jean Cardinal, Udo Hoffmann","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-03-24T15:37:28Z","title":"Recognition and Complexity of Point Visibility Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07082","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4dbe347ba1578e8131fe04c06d7e0d9c4e3058e47d83de0ec529c3b6def09b70","target":"record","created_at":"2026-05-17T23:54:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"9918a0300e4e7782e5416e13f1d8b1d122bcda47f29109d8169758ec4dca4aea","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-03-24T15:37:28Z","title_canon_sha256":"9756cd85da9bfec0c4fb1f4b5a3ec50c0d45cc0d390bb612c1473a81ad66e4de"},"schema_version":"1.0","source":{"id":"1503.07082","kind":"arxiv","version":2}},"canonical_sha256":"0ed8b93af102ed86fa2e117b70c06379436c33a707781d6b7a1b3986251badfa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ed8b93af102ed86fa2e117b70c06379436c33a707781d6b7a1b3986251badfa","first_computed_at":"2026-05-17T23:54:57.209977Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:57.209977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZxYiESOUDEKCRUxfs8ZBWc1oie/cIXOe5pQsMiUVnjs9bjlB0LzyyQ6c6JfOCW0IIeBVA5ZUWOJ+MTjUyM+oAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:57.210609Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.07082","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4dbe347ba1578e8131fe04c06d7e0d9c4e3058e47d83de0ec529c3b6def09b70","sha256:60365d0ba8ef068a60459e48a11d60fec35a1365803e9a7942e4377817a30bf2"],"state_sha256":"0e4b282ddc63b158ac95c978612de3849f09dc6c6a0861c70e5f6a64fff29ca4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ENjAYqbXMzWFQ1dcuh7SRwTOCSWOyuCtlIFiwwCvvkvBccyt5J6bFHGjI3EmhX1wt2JDokCccchD47WioNc6CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T04:52:31.830960Z","bundle_sha256":"8722709715a28e67f3b038e0263f7a0a28ed07c7be6367e3290155900421af6c"}}