{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:KVVE5IQ3YLDVRSQTD44I24NBHO","short_pith_number":"pith:KVVE5IQ3","canonical_record":{"source":{"id":"1106.3622","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-18T07:23:00Z","cross_cats_sorted":[],"title_canon_sha256":"dd9b8b95c84d87196357b5ec23b4e46e1c40648b6f2a55d2b1c3b5ce9c689bae","abstract_canon_sha256":"45402ab7a793a77514879e3ad0cd37537240fd87dc1c1cf8c83154bfa1351705"},"schema_version":"1.0"},"canonical_sha256":"556a4ea21bc2c758ca131f388d71a13b80dcf144da67922b21fd5fedfb3d518d","source":{"kind":"arxiv","id":"1106.3622","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.3622","created_at":"2026-05-18T03:35:41Z"},{"alias_kind":"arxiv_version","alias_value":"1106.3622v1","created_at":"2026-05-18T03:35:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.3622","created_at":"2026-05-18T03:35:41Z"},{"alias_kind":"pith_short_12","alias_value":"KVVE5IQ3YLDV","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"KVVE5IQ3YLDVRSQT","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"KVVE5IQ3","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:KVVE5IQ3YLDVRSQTD44I24NBHO","target":"record","payload":{"canonical_record":{"source":{"id":"1106.3622","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-18T07:23:00Z","cross_cats_sorted":[],"title_canon_sha256":"dd9b8b95c84d87196357b5ec23b4e46e1c40648b6f2a55d2b1c3b5ce9c689bae","abstract_canon_sha256":"45402ab7a793a77514879e3ad0cd37537240fd87dc1c1cf8c83154bfa1351705"},"schema_version":"1.0"},"canonical_sha256":"556a4ea21bc2c758ca131f388d71a13b80dcf144da67922b21fd5fedfb3d518d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:41.406941Z","signature_b64":"3xDM7ZpRQ4quws3S/+hH08ZbUesYKNwcg8Lnv/FTGQALby6VXuMb0xNcWQzmUSHhv1KbH4y7sPl99quuiLAPCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"556a4ea21bc2c758ca131f388d71a13b80dcf144da67922b21fd5fedfb3d518d","last_reissued_at":"2026-05-18T03:35:41.406039Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:41.406039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.3622","source_version":1,"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-18T03:35:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KQHrqw7O0vmqYuzSyvpnkVIYep5GuSpOszvd555N1YVxp8JHm0vFk4b85nKgnbg8llaAQktNcZ3fdBYUarLrBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:57:01.192021Z"},"content_sha256":"407df5c9b7b43ea095f0128f61d1ccfd9e3583dade8596935e53e1798039643a","schema_version":"1.0","event_id":"sha256:407df5c9b7b43ea095f0128f61d1ccfd9e3583dade8596935e53e1798039643a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:KVVE5IQ3YLDVRSQTD44I24NBHO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the connectivity of visibility graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Attila P\\'or, David R. Wood, Michael S. Payne, Pavel Valtr","submitted_at":"2011-06-18T07:23:00Z","abstract_excerpt":"The visibility graph of a finite set of points in the plane has the points as vertices and an edge between two vertices if the line segment between them contains no other points. This paper establishes bounds on the edge- and vertex-connectivity of visibility graphs.\n  Unless all its vertices are collinear, a visibility graph has diameter at most 2, and so it follows by a result of Plesn\\'ik (1975) that its edge-connectivity equals its minimum degree. We strengthen the result of Plesn\\'ik by showing that for any two vertices v and w in a graph of diameter 2, if deg(v) <= deg(w) then there exis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.3622","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"},"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-18T03:35:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zBm3OfhJE2XrQfpQT9nsGKFZMrs/lrgSlugS/yBn6Y8cI22qXlbv7gIzo7cxpeQNuBCMi/nTKQPx0s4jpqTuCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:57:01.192370Z"},"content_sha256":"8efbb26b42d160d1bfdfd8c41b9a7a554377465473920544be35295136cb4efd","schema_version":"1.0","event_id":"sha256:8efbb26b42d160d1bfdfd8c41b9a7a554377465473920544be35295136cb4efd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KVVE5IQ3YLDVRSQTD44I24NBHO/bundle.json","state_url":"https://pith.science/pith/KVVE5IQ3YLDVRSQTD44I24NBHO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KVVE5IQ3YLDVRSQTD44I24NBHO/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-28T12:57:01Z","links":{"resolver":"https://pith.science/pith/KVVE5IQ3YLDVRSQTD44I24NBHO","bundle":"https://pith.science/pith/KVVE5IQ3YLDVRSQTD44I24NBHO/bundle.json","state":"https://pith.science/pith/KVVE5IQ3YLDVRSQTD44I24NBHO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KVVE5IQ3YLDVRSQTD44I24NBHO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:KVVE5IQ3YLDVRSQTD44I24NBHO","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":"45402ab7a793a77514879e3ad0cd37537240fd87dc1c1cf8c83154bfa1351705","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-18T07:23:00Z","title_canon_sha256":"dd9b8b95c84d87196357b5ec23b4e46e1c40648b6f2a55d2b1c3b5ce9c689bae"},"schema_version":"1.0","source":{"id":"1106.3622","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.3622","created_at":"2026-05-18T03:35:41Z"},{"alias_kind":"arxiv_version","alias_value":"1106.3622v1","created_at":"2026-05-18T03:35:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.3622","created_at":"2026-05-18T03:35:41Z"},{"alias_kind":"pith_short_12","alias_value":"KVVE5IQ3YLDV","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"KVVE5IQ3YLDVRSQT","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"KVVE5IQ3","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:8efbb26b42d160d1bfdfd8c41b9a7a554377465473920544be35295136cb4efd","target":"graph","created_at":"2026-05-18T03:35:41Z","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":"The visibility graph of a finite set of points in the plane has the points as vertices and an edge between two vertices if the line segment between them contains no other points. This paper establishes bounds on the edge- and vertex-connectivity of visibility graphs.\n  Unless all its vertices are collinear, a visibility graph has diameter at most 2, and so it follows by a result of Plesn\\'ik (1975) that its edge-connectivity equals its minimum degree. We strengthen the result of Plesn\\'ik by showing that for any two vertices v and w in a graph of diameter 2, if deg(v) <= deg(w) then there exis","authors_text":"Attila P\\'or, David R. Wood, Michael S. Payne, Pavel Valtr","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-18T07:23:00Z","title":"On the connectivity of visibility graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.3622","kind":"arxiv","version":1},"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:407df5c9b7b43ea095f0128f61d1ccfd9e3583dade8596935e53e1798039643a","target":"record","created_at":"2026-05-18T03:35:41Z","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":"45402ab7a793a77514879e3ad0cd37537240fd87dc1c1cf8c83154bfa1351705","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-18T07:23:00Z","title_canon_sha256":"dd9b8b95c84d87196357b5ec23b4e46e1c40648b6f2a55d2b1c3b5ce9c689bae"},"schema_version":"1.0","source":{"id":"1106.3622","kind":"arxiv","version":1}},"canonical_sha256":"556a4ea21bc2c758ca131f388d71a13b80dcf144da67922b21fd5fedfb3d518d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"556a4ea21bc2c758ca131f388d71a13b80dcf144da67922b21fd5fedfb3d518d","first_computed_at":"2026-05-18T03:35:41.406039Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:41.406039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3xDM7ZpRQ4quws3S/+hH08ZbUesYKNwcg8Lnv/FTGQALby6VXuMb0xNcWQzmUSHhv1KbH4y7sPl99quuiLAPCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:41.406941Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.3622","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:407df5c9b7b43ea095f0128f61d1ccfd9e3583dade8596935e53e1798039643a","sha256:8efbb26b42d160d1bfdfd8c41b9a7a554377465473920544be35295136cb4efd"],"state_sha256":"8bbffd01c3453bc7e8364f9d868b9e7292f73c726006275ff8ac9bfbcebc1395"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9AeEbT7DoLeNBpIbCfXbqWuMMJ8IxAbfRqgMXdPoVIwF83vG5oRuCi5CvHrXqexAjhJsa/CXv2Ej0F8IgCYHDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:57:01.194346Z","bundle_sha256":"1c769bb28b78474260b49928c65e733ac52738c8a87bb41e2b673263234cc4bd"}}