{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZYJWANUZI5LIOJHL257JIA7TEH","short_pith_number":"pith:ZYJWANUZ","canonical_record":{"source":{"id":"1706.06992","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-21T16:28:56Z","cross_cats_sorted":[],"title_canon_sha256":"515cfe543a1c6d47a089ac15d2367df1a648519a560c73e9f481fdaf4b96182f","abstract_canon_sha256":"ab97f2ddac7099ea70ba6d64d72782f1a623d41908c5ecea358323db9f15b5eb"},"schema_version":"1.0"},"canonical_sha256":"ce1360369947568724ebd77e9403f321cc643d71e0293fa5fddf3a8021526c1d","source":{"kind":"arxiv","id":"1706.06992","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.06992","created_at":"2026-05-18T00:35:51Z"},{"alias_kind":"arxiv_version","alias_value":"1706.06992v3","created_at":"2026-05-18T00:35:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06992","created_at":"2026-05-18T00:35:51Z"},{"alias_kind":"pith_short_12","alias_value":"ZYJWANUZI5LI","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZYJWANUZI5LIOJHL","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZYJWANUZ","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZYJWANUZI5LIOJHL257JIA7TEH","target":"record","payload":{"canonical_record":{"source":{"id":"1706.06992","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-21T16:28:56Z","cross_cats_sorted":[],"title_canon_sha256":"515cfe543a1c6d47a089ac15d2367df1a648519a560c73e9f481fdaf4b96182f","abstract_canon_sha256":"ab97f2ddac7099ea70ba6d64d72782f1a623d41908c5ecea358323db9f15b5eb"},"schema_version":"1.0"},"canonical_sha256":"ce1360369947568724ebd77e9403f321cc643d71e0293fa5fddf3a8021526c1d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:51.150159Z","signature_b64":"ANMx7Worq8rMo8yZ5+lUSzPoLx8cv5WuvANBrRAB69ZZrGC2rGsdqL9OIj2uRNg6FQ/zb4w384T8t0MpDj4jCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce1360369947568724ebd77e9403f321cc643d71e0293fa5fddf3a8021526c1d","last_reissued_at":"2026-05-18T00:35:51.149718Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:51.149718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.06992","source_version":3,"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-18T00:35:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KZDQnJZYklP9H/bcI0k491EDxoOPQ7+qhUUgnQEHuSU0y57OujZ7KMZKe/hIG9ls4GiPn7m7HbG5Cny/VLckBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T16:38:01.712183Z"},"content_sha256":"5945876698a39d500ba210b9ec44800ac9619d11f03162ac1a37dfb420dab2fb","schema_version":"1.0","event_id":"sha256:5945876698a39d500ba210b9ec44800ac9619d11f03162ac1a37dfb420dab2fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZYJWANUZI5LIOJHL257JIA7TEH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Obstacle Numbers of Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"John Gimbel, Patrice Ossona de Mendez, Pavel Valtr","submitted_at":"2017-06-21T16:28:56Z","abstract_excerpt":"Given finitely many connected polygonal obstacles $O_1,\\dots,O_k$ in the plane and a set $P$ of points in general position and not in any obstacle, the {\\em visibility graph} of $P$ with obstacles $O_1,\\dots,O_k$ is the (geometric) graph with vertex set $P$, where two vertices are adjacent if the straight line segment joining them intersects no obstacle. The obstacle number of a graph $G$ is the smallest integer $k$ such that $G$ is the visibility graph of a set of points with $k$ obstacles. If $G$ is planar, we define the planar obstacle number of $G$ by further requiring that the visibility "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.06992","kind":"arxiv","version":3},"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-18T00:35:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/YvxvUZ72xrzQ9386L8Odjqxo5S7lfVzbYb5wK9ok9sBkbHxpG+JzZaZb8uHgH5WGWTP4vrTpt3SaGwqGxRUBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T16:38:01.712543Z"},"content_sha256":"f9a88b1a30eacfa56159dbc82eef4e476291b582b34d46f8f283b70a8391e5eb","schema_version":"1.0","event_id":"sha256:f9a88b1a30eacfa56159dbc82eef4e476291b582b34d46f8f283b70a8391e5eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZYJWANUZI5LIOJHL257JIA7TEH/bundle.json","state_url":"https://pith.science/pith/ZYJWANUZI5LIOJHL257JIA7TEH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZYJWANUZI5LIOJHL257JIA7TEH/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-06-24T16:38:01Z","links":{"resolver":"https://pith.science/pith/ZYJWANUZI5LIOJHL257JIA7TEH","bundle":"https://pith.science/pith/ZYJWANUZI5LIOJHL257JIA7TEH/bundle.json","state":"https://pith.science/pith/ZYJWANUZI5LIOJHL257JIA7TEH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZYJWANUZI5LIOJHL257JIA7TEH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZYJWANUZI5LIOJHL257JIA7TEH","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":"ab97f2ddac7099ea70ba6d64d72782f1a623d41908c5ecea358323db9f15b5eb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-21T16:28:56Z","title_canon_sha256":"515cfe543a1c6d47a089ac15d2367df1a648519a560c73e9f481fdaf4b96182f"},"schema_version":"1.0","source":{"id":"1706.06992","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.06992","created_at":"2026-05-18T00:35:51Z"},{"alias_kind":"arxiv_version","alias_value":"1706.06992v3","created_at":"2026-05-18T00:35:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06992","created_at":"2026-05-18T00:35:51Z"},{"alias_kind":"pith_short_12","alias_value":"ZYJWANUZI5LI","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZYJWANUZI5LIOJHL","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZYJWANUZ","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:f9a88b1a30eacfa56159dbc82eef4e476291b582b34d46f8f283b70a8391e5eb","target":"graph","created_at":"2026-05-18T00:35:51Z","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":"Given finitely many connected polygonal obstacles $O_1,\\dots,O_k$ in the plane and a set $P$ of points in general position and not in any obstacle, the {\\em visibility graph} of $P$ with obstacles $O_1,\\dots,O_k$ is the (geometric) graph with vertex set $P$, where two vertices are adjacent if the straight line segment joining them intersects no obstacle. The obstacle number of a graph $G$ is the smallest integer $k$ such that $G$ is the visibility graph of a set of points with $k$ obstacles. If $G$ is planar, we define the planar obstacle number of $G$ by further requiring that the visibility ","authors_text":"John Gimbel, Patrice Ossona de Mendez, Pavel Valtr","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-21T16:28:56Z","title":"Obstacle Numbers of Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.06992","kind":"arxiv","version":3},"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:5945876698a39d500ba210b9ec44800ac9619d11f03162ac1a37dfb420dab2fb","target":"record","created_at":"2026-05-18T00:35:51Z","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":"ab97f2ddac7099ea70ba6d64d72782f1a623d41908c5ecea358323db9f15b5eb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-21T16:28:56Z","title_canon_sha256":"515cfe543a1c6d47a089ac15d2367df1a648519a560c73e9f481fdaf4b96182f"},"schema_version":"1.0","source":{"id":"1706.06992","kind":"arxiv","version":3}},"canonical_sha256":"ce1360369947568724ebd77e9403f321cc643d71e0293fa5fddf3a8021526c1d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce1360369947568724ebd77e9403f321cc643d71e0293fa5fddf3a8021526c1d","first_computed_at":"2026-05-18T00:35:51.149718Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:51.149718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ANMx7Worq8rMo8yZ5+lUSzPoLx8cv5WuvANBrRAB69ZZrGC2rGsdqL9OIj2uRNg6FQ/zb4w384T8t0MpDj4jCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:51.150159Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.06992","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5945876698a39d500ba210b9ec44800ac9619d11f03162ac1a37dfb420dab2fb","sha256:f9a88b1a30eacfa56159dbc82eef4e476291b582b34d46f8f283b70a8391e5eb"],"state_sha256":"ee19f0599511749b245c694223887b693cf8e261b69272aec688ff48945a3269"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"57HJZlHfWcW0FmU1cE67tCLr4sBzwEkGWi171ZYvcEYET2NVjLKOQdOQrq4k2wB53Qq16uBpBcEHRp8dYD73Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T16:38:01.714406Z","bundle_sha256":"4c0ac7892ce0eee441b98227dd3b73fede20bf3642c7d84b9c46850d0f5b8215"}}