{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SVLHPTOXQCKEC2M66F5IKG6P4Y","short_pith_number":"pith:SVLHPTOX","schema_version":"1.0","canonical_sha256":"955677cdd7809441699ef17a851bcfe63418278cc476a40c5d6849ca892eab97","source":{"kind":"arxiv","id":"1804.07150","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1804.07150","created_at":"2026-05-18T00:18:01.264740+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.07150v1","created_at":"2026-05-18T00:18:01.264740+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07150","created_at":"2026-05-18T00:18:01.264740+00:00"},{"alias_kind":"pith_short_12","alias_value":"SVLHPTOXQCKE","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"SVLHPTOXQCKEC2M6","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"SVLHPTOX","created_at":"2026-05-18T12:32:53.628368+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SVLHPTOXQCKEC2M66F5IKG6P4Y","json":"https://pith.science/pith/SVLHPTOXQCKEC2M66F5IKG6P4Y.json","graph_json":"https://pith.science/api/pith-number/SVLHPTOXQCKEC2M66F5IKG6P4Y/graph.json","events_json":"https://pith.science/api/pith-number/SVLHPTOXQCKEC2M66F5IKG6P4Y/events.json","paper":"https://pith.science/paper/SVLHPTOX"},"agent_actions":{"view_html":"https://pith.science/pith/SVLHPTOXQCKEC2M66F5IKG6P4Y","download_json":"https://pith.science/pith/SVLHPTOXQCKEC2M66F5IKG6P4Y.json","view_paper":"https://pith.science/paper/SVLHPTOX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.07150&json=true","fetch_graph":"https://pith.science/api/pith-number/SVLHPTOXQCKEC2M66F5IKG6P4Y/graph.json","fetch_events":"https://pith.science/api/pith-number/SVLHPTOXQCKEC2M66F5IKG6P4Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SVLHPTOXQCKEC2M66F5IKG6P4Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SVLHPTOXQCKEC2M66F5IKG6P4Y/action/storage_attestation","attest_author":"https://pith.science/pith/SVLHPTOXQCKEC2M66F5IKG6P4Y/action/author_attestation","sign_citation":"https://pith.science/pith/SVLHPTOXQCKEC2M66F5IKG6P4Y/action/citation_signature","submit_replication":"https://pith.science/pith/SVLHPTOXQCKEC2M66F5IKG6P4Y/action/replication_record"}},"created_at":"2026-05-18T00:18:01.264740+00:00","updated_at":"2026-05-18T00:18:01.264740+00:00"}