{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SVLHPTOXQCKEC2M66F5IKG6P4Y","short_pith_number":"pith:SVLHPTOX","canonical_record":{"source":{"id":"1804.07150","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-04-19T13:26:19Z","cross_cats_sorted":[],"title_canon_sha256":"1579f1c0a0c58020c032e8d42d321f084e212795f1b588edf343e31d3a75228e","abstract_canon_sha256":"ef244f4d1f8e53c9e4f1121b937487bf151f81fd61fba1a57d8b07fe88e4d8e6"},"schema_version":"1.0"},"canonical_sha256":"955677cdd7809441699ef17a851bcfe63418278cc476a40c5d6849ca892eab97","source":{"kind":"arxiv","id":"1804.07150","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.07150","created_at":"2026-05-18T00:18:01Z"},{"alias_kind":"arxiv_version","alias_value":"1804.07150v1","created_at":"2026-05-18T00:18:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07150","created_at":"2026-05-18T00:18:01Z"},{"alias_kind":"pith_short_12","alias_value":"SVLHPTOXQCKE","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SVLHPTOXQCKEC2M6","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SVLHPTOX","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SVLHPTOXQCKEC2M66F5IKG6P4Y","target":"record","payload":{"canonical_record":{"source":{"id":"1804.07150","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-04-19T13:26:19Z","cross_cats_sorted":[],"title_canon_sha256":"1579f1c0a0c58020c032e8d42d321f084e212795f1b588edf343e31d3a75228e","abstract_canon_sha256":"ef244f4d1f8e53c9e4f1121b937487bf151f81fd61fba1a57d8b07fe88e4d8e6"},"schema_version":"1.0"},"canonical_sha256":"955677cdd7809441699ef17a851bcfe63418278cc476a40c5d6849ca892eab97","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:01.265280Z","signature_b64":"CSNQkDBUGVZpVCKkK+t7a6hRM7THe+v/2eSgvYbD66s8F2Jp1hXGrohy8MKFFY8TKBj+xpPdENcv6XCVKdWoAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"955677cdd7809441699ef17a851bcfe63418278cc476a40c5d6849ca892eab97","last_reissued_at":"2026-05-18T00:18:01.264644Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:01.264644Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.07150","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-18T00:18:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QnEjRwAtRcOPW0ZbLNqPGebyXvEDzL7cnPTgNOxc+5/ZCaF7b3w2Ff/Tyvb0lZptVJmGa/H0/71yDza0/2xMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:47:56.970959Z"},"content_sha256":"b3077021481deeb27472c99c27518b5281fd7eea0be1a994256972fa4a8756f0","schema_version":"1.0","event_id":"sha256:b3077021481deeb27472c99c27518b5281fd7eea0be1a994256972fa4a8756f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SVLHPTOXQCKEC2M66F5IKG6P4Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Bounds for Guarding Plane Graphs with Edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ahmad Biniaz, Aur\\'elien Ooms, Prosenjit Bose, Sander Verdonschot","submitted_at":"2018-04-19T13:26:19Z","abstract_excerpt":"An \"edge guard set\" of a plane graph $G$ is a subset $\\Gamma$ of edges of $G$ such that each face of $G$ is incident to an endpoint of an edge in $\\Gamma$. Such a set is said to guard $G$. We improve the known upper bounds on the number of edges required to guard any $n$-vertex embedded planar graph $G$:\n  1- We present a simple inductive proof for a theorem of Everett and Rivera-Campo (1997) that $G$ can be guarded with at most $ \\frac{2n}{5}$ edges, then extend this approach with a deeper analysis to yield an improved bound of $\\frac{3n}{8}$ edges for any plane graph.\n  2- We prove that ther"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.07150","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-18T00:18:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jYYWW+oxQtB51vD+VWlq0P0ITQrwS+v1slTwaPWNE+wnj+mAy4baqPzclG1VkS+l/kj2oZSUfgwnifrJNx0JDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:47:56.971599Z"},"content_sha256":"206c94356471c127220bed7fdd60489dbbfcd1b2269eb6fe615967fd48d7880e","schema_version":"1.0","event_id":"sha256:206c94356471c127220bed7fdd60489dbbfcd1b2269eb6fe615967fd48d7880e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SVLHPTOXQCKEC2M66F5IKG6P4Y/bundle.json","state_url":"https://pith.science/pith/SVLHPTOXQCKEC2M66F5IKG6P4Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SVLHPTOXQCKEC2M66F5IKG6P4Y/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-25T15:47:56Z","links":{"resolver":"https://pith.science/pith/SVLHPTOXQCKEC2M66F5IKG6P4Y","bundle":"https://pith.science/pith/SVLHPTOXQCKEC2M66F5IKG6P4Y/bundle.json","state":"https://pith.science/pith/SVLHPTOXQCKEC2M66F5IKG6P4Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SVLHPTOXQCKEC2M66F5IKG6P4Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SVLHPTOXQCKEC2M66F5IKG6P4Y","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":"ef244f4d1f8e53c9e4f1121b937487bf151f81fd61fba1a57d8b07fe88e4d8e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-04-19T13:26:19Z","title_canon_sha256":"1579f1c0a0c58020c032e8d42d321f084e212795f1b588edf343e31d3a75228e"},"schema_version":"1.0","source":{"id":"1804.07150","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.07150","created_at":"2026-05-18T00:18:01Z"},{"alias_kind":"arxiv_version","alias_value":"1804.07150v1","created_at":"2026-05-18T00:18:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07150","created_at":"2026-05-18T00:18:01Z"},{"alias_kind":"pith_short_12","alias_value":"SVLHPTOXQCKE","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SVLHPTOXQCKEC2M6","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SVLHPTOX","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:206c94356471c127220bed7fdd60489dbbfcd1b2269eb6fe615967fd48d7880e","target":"graph","created_at":"2026-05-18T00:18:01Z","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":"An \"edge guard set\" of a plane graph $G$ is a subset $\\Gamma$ of edges of $G$ such that each face of $G$ is incident to an endpoint of an edge in $\\Gamma$. Such a set is said to guard $G$. We improve the known upper bounds on the number of edges required to guard any $n$-vertex embedded planar graph $G$:\n  1- We present a simple inductive proof for a theorem of Everett and Rivera-Campo (1997) that $G$ can be guarded with at most $ \\frac{2n}{5}$ edges, then extend this approach with a deeper analysis to yield an improved bound of $\\frac{3n}{8}$ edges for any plane graph.\n  2- We prove that ther","authors_text":"Ahmad Biniaz, Aur\\'elien Ooms, Prosenjit Bose, Sander Verdonschot","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-04-19T13:26:19Z","title":"Improved Bounds for Guarding Plane Graphs with Edges"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.07150","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:b3077021481deeb27472c99c27518b5281fd7eea0be1a994256972fa4a8756f0","target":"record","created_at":"2026-05-18T00:18:01Z","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":"ef244f4d1f8e53c9e4f1121b937487bf151f81fd61fba1a57d8b07fe88e4d8e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-04-19T13:26:19Z","title_canon_sha256":"1579f1c0a0c58020c032e8d42d321f084e212795f1b588edf343e31d3a75228e"},"schema_version":"1.0","source":{"id":"1804.07150","kind":"arxiv","version":1}},"canonical_sha256":"955677cdd7809441699ef17a851bcfe63418278cc476a40c5d6849ca892eab97","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"955677cdd7809441699ef17a851bcfe63418278cc476a40c5d6849ca892eab97","first_computed_at":"2026-05-18T00:18:01.264644Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:01.264644Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CSNQkDBUGVZpVCKkK+t7a6hRM7THe+v/2eSgvYbD66s8F2Jp1hXGrohy8MKFFY8TKBj+xpPdENcv6XCVKdWoAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:01.265280Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.07150","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3077021481deeb27472c99c27518b5281fd7eea0be1a994256972fa4a8756f0","sha256:206c94356471c127220bed7fdd60489dbbfcd1b2269eb6fe615967fd48d7880e"],"state_sha256":"3014b9a4840d09d584a2db8f4a5f56f8423b672bec0fb6f1a1521d4685c2e147"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EBE/w52HZLD/r1zpHo2TuDoQC4yH5AdxR2zlCf/JuCMsRWVBxeWqN90hj1ihWfMEPCSmMueXlfMIiEzYbIZKBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:47:56.975030Z","bundle_sha256":"12692f5a9fabb47239e1a678d210c65acb13b21419a4a5d1fb7057346d41367d"}}