{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:JDVPNSEXEAQ6SLHJWXATUM2KN6","short_pith_number":"pith:JDVPNSEX","canonical_record":{"source":{"id":"1607.00278","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-01T15:07:32Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"ae97eae2399922fac8a9bf5deb80098de4374402f944e6ded63ab7343bae48ee","abstract_canon_sha256":"6995a4afcc3fc7ad6003dda6b6c65a476bc71ce324a9a6b1b54127821315f158"},"schema_version":"1.0"},"canonical_sha256":"48eaf6c8972021e92ce9b5c13a334a6f908feaa7f62619e3a27b9984c915b30a","source":{"kind":"arxiv","id":"1607.00278","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.00278","created_at":"2026-05-18T01:06:28Z"},{"alias_kind":"arxiv_version","alias_value":"1607.00278v2","created_at":"2026-05-18T01:06:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00278","created_at":"2026-05-18T01:06:28Z"},{"alias_kind":"pith_short_12","alias_value":"JDVPNSEXEAQ6","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JDVPNSEXEAQ6SLHJ","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JDVPNSEX","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:JDVPNSEXEAQ6SLHJWXATUM2KN6","target":"record","payload":{"canonical_record":{"source":{"id":"1607.00278","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-01T15:07:32Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"ae97eae2399922fac8a9bf5deb80098de4374402f944e6ded63ab7343bae48ee","abstract_canon_sha256":"6995a4afcc3fc7ad6003dda6b6c65a476bc71ce324a9a6b1b54127821315f158"},"schema_version":"1.0"},"canonical_sha256":"48eaf6c8972021e92ce9b5c13a334a6f908feaa7f62619e3a27b9984c915b30a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:28.509338Z","signature_b64":"zM0WPCbCS/70D/yOecJplFZHi9SHGRJnFpTx+7y/qoDOXjgZGcoUyPgAIhACfRoIv1gtvrqpVx2cQNn4Kru9Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48eaf6c8972021e92ce9b5c13a334a6f908feaa7f62619e3a27b9984c915b30a","last_reissued_at":"2026-05-18T01:06:28.508882Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:28.508882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.00278","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-18T01:06:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mzNHmNtZ9gtqAWE8rMGrtSsUU2TV2KK1TFWocruIZCcZ7y0BhPnO6U+E8Tik/HcCL7X87yj3HYQb3b3+wglpDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:49:24.204634Z"},"content_sha256":"e9e911c88c9a9be79abaad5b7b89c79bc07d461eb09d03bb8a1ab3e9aca92ebf","schema_version":"1.0","event_id":"sha256:e9e911c88c9a9be79abaad5b7b89c79bc07d461eb09d03bb8a1ab3e9aca92ebf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:JDVPNSEXEAQ6SLHJWXATUM2KN6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Obstructing Visibilities with One Obstacle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CG","authors_text":"Alexander Wolff, Fabian Lipp, Ji-Won Park, Steven Chaplick","submitted_at":"2016-07-01T15:07:32Z","abstract_excerpt":"Obstacle representations of graphs have been investigated quite intensely over the last few years. We focus on graphs that can be represented by a single obstacle. Given a (topologically open) polygon $C$ and a finite set $P$ of points in general position in the complement of $C$, the visibility graph $G_C(P)$ has a vertex for each point in $P$ and an edge $pq$ for any two points $p$ and $q$ in $P$ that can see each other, that is, $\\overline{pq} \\cap C=\\emptyset$. We draw $G_C(P)$ straight-line. Given a graph $G$, we want to compute an obstacle representation of $G$, that is, an obstacle $C$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00278","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-18T01:06:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+UgyzVusGYCu/A5LNvG/RSNf9mtEI0cJeQ+i5HRApqJczDqhMDF7alZUA/q88BP6CyuW9hD2Vw2ymVumBGcjBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:49:24.205251Z"},"content_sha256":"92bb0b1f46968796b2cd49d8948d5055b1b0a41311c117fa93b9ff9b8498c81a","schema_version":"1.0","event_id":"sha256:92bb0b1f46968796b2cd49d8948d5055b1b0a41311c117fa93b9ff9b8498c81a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JDVPNSEXEAQ6SLHJWXATUM2KN6/bundle.json","state_url":"https://pith.science/pith/JDVPNSEXEAQ6SLHJWXATUM2KN6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JDVPNSEXEAQ6SLHJWXATUM2KN6/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-05-28T06:49:24Z","links":{"resolver":"https://pith.science/pith/JDVPNSEXEAQ6SLHJWXATUM2KN6","bundle":"https://pith.science/pith/JDVPNSEXEAQ6SLHJWXATUM2KN6/bundle.json","state":"https://pith.science/pith/JDVPNSEXEAQ6SLHJWXATUM2KN6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JDVPNSEXEAQ6SLHJWXATUM2KN6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:JDVPNSEXEAQ6SLHJWXATUM2KN6","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":"6995a4afcc3fc7ad6003dda6b6c65a476bc71ce324a9a6b1b54127821315f158","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-01T15:07:32Z","title_canon_sha256":"ae97eae2399922fac8a9bf5deb80098de4374402f944e6ded63ab7343bae48ee"},"schema_version":"1.0","source":{"id":"1607.00278","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.00278","created_at":"2026-05-18T01:06:28Z"},{"alias_kind":"arxiv_version","alias_value":"1607.00278v2","created_at":"2026-05-18T01:06:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00278","created_at":"2026-05-18T01:06:28Z"},{"alias_kind":"pith_short_12","alias_value":"JDVPNSEXEAQ6","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JDVPNSEXEAQ6SLHJ","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JDVPNSEX","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:92bb0b1f46968796b2cd49d8948d5055b1b0a41311c117fa93b9ff9b8498c81a","target":"graph","created_at":"2026-05-18T01:06:28Z","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":"Obstacle representations of graphs have been investigated quite intensely over the last few years. We focus on graphs that can be represented by a single obstacle. Given a (topologically open) polygon $C$ and a finite set $P$ of points in general position in the complement of $C$, the visibility graph $G_C(P)$ has a vertex for each point in $P$ and an edge $pq$ for any two points $p$ and $q$ in $P$ that can see each other, that is, $\\overline{pq} \\cap C=\\emptyset$. We draw $G_C(P)$ straight-line. Given a graph $G$, we want to compute an obstacle representation of $G$, that is, an obstacle $C$ ","authors_text":"Alexander Wolff, Fabian Lipp, Ji-Won Park, Steven Chaplick","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-01T15:07:32Z","title":"Obstructing Visibilities with One Obstacle"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00278","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:e9e911c88c9a9be79abaad5b7b89c79bc07d461eb09d03bb8a1ab3e9aca92ebf","target":"record","created_at":"2026-05-18T01:06:28Z","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":"6995a4afcc3fc7ad6003dda6b6c65a476bc71ce324a9a6b1b54127821315f158","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-01T15:07:32Z","title_canon_sha256":"ae97eae2399922fac8a9bf5deb80098de4374402f944e6ded63ab7343bae48ee"},"schema_version":"1.0","source":{"id":"1607.00278","kind":"arxiv","version":2}},"canonical_sha256":"48eaf6c8972021e92ce9b5c13a334a6f908feaa7f62619e3a27b9984c915b30a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"48eaf6c8972021e92ce9b5c13a334a6f908feaa7f62619e3a27b9984c915b30a","first_computed_at":"2026-05-18T01:06:28.508882Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:06:28.508882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zM0WPCbCS/70D/yOecJplFZHi9SHGRJnFpTx+7y/qoDOXjgZGcoUyPgAIhACfRoIv1gtvrqpVx2cQNn4Kru9Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:06:28.509338Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.00278","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e9e911c88c9a9be79abaad5b7b89c79bc07d461eb09d03bb8a1ab3e9aca92ebf","sha256:92bb0b1f46968796b2cd49d8948d5055b1b0a41311c117fa93b9ff9b8498c81a"],"state_sha256":"15b99ff5b0b41027b8a3368d451f38fa7dcd176ddf58aace489e4ed975a3a43e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"piy+BYRJm5juRFbHZuDMhC1gSduHSYoR12NVHuUa4E6tn4YYNcpSy7A5TGqSmwJinR3gt3+qfNvXmKYsDivvCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:49:24.208273Z","bundle_sha256":"264f1f891cd9a2923b944bc2cb4fce6ae4026b67f8d3ad5d0091862f866ce77d"}}