{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FIZ5ODJBV45YLYHESZJZBYS6LM","short_pith_number":"pith:FIZ5ODJB","canonical_record":{"source":{"id":"1607.05527","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-19T11:32:54Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"37822a0f2acb63ce5337b74ee49f88b965ef00f5c3ca8af63f7a0775e4ac7f6d","abstract_canon_sha256":"d87c7fe668e9f683d3c507167f846de5b51f4a5989b3d3836b2f2f13cd14b374"},"schema_version":"1.0"},"canonical_sha256":"2a33d70d21af3b85e0e4965390e25e5b32ce47c45beb6527ea6d0723dd15308f","source":{"kind":"arxiv","id":"1607.05527","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.05527","created_at":"2026-05-18T01:10:46Z"},{"alias_kind":"arxiv_version","alias_value":"1607.05527v1","created_at":"2026-05-18T01:10:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05527","created_at":"2026-05-18T01:10:46Z"},{"alias_kind":"pith_short_12","alias_value":"FIZ5ODJBV45Y","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FIZ5ODJBV45YLYHE","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FIZ5ODJB","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FIZ5ODJBV45YLYHESZJZBYS6LM","target":"record","payload":{"canonical_record":{"source":{"id":"1607.05527","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-19T11:32:54Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"37822a0f2acb63ce5337b74ee49f88b965ef00f5c3ca8af63f7a0775e4ac7f6d","abstract_canon_sha256":"d87c7fe668e9f683d3c507167f846de5b51f4a5989b3d3836b2f2f13cd14b374"},"schema_version":"1.0"},"canonical_sha256":"2a33d70d21af3b85e0e4965390e25e5b32ce47c45beb6527ea6d0723dd15308f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:46.636105Z","signature_b64":"hl5kbN+DiKzKEZaDKw1MEyO6l3mCToHe25P3fh3HLKohBFUcmW68gMUhZICgPoeLcNKwyFkWvCHYxPFp3N/XCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a33d70d21af3b85e0e4965390e25e5b32ce47c45beb6527ea6d0723dd15308f","last_reissued_at":"2026-05-18T01:10:46.635435Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:46.635435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.05527","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-18T01:10:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WayBFB4CqBlfgGwjsQl7vtwGXTNlvg+xYgKJfR288Wsbq3mEqJdunzjkG6VX6bnZlEyV60VURvE3B0EYUwU9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T14:31:54.683347Z"},"content_sha256":"defdfc08ea03104963e2635ebb6085f1d4fdaaaa5a714d9bdc9e4e0e259bb560","schema_version":"1.0","event_id":"sha256:defdfc08ea03104963e2635ebb6085f1d4fdaaaa5a714d9bdc9e4e0e259bb560"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FIZ5ODJBV45YLYHESZJZBYS6LM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Approximation Algorithm for the Art Gallery Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.CG","authors_text":"\\'Edouard Bonnet, Tillmann Miltzow","submitted_at":"2016-07-19T11:32:54Z","abstract_excerpt":"Given a simple polygon $\\mathcal{P}$ on $n$ vertices, two points $x,y$ in $\\mathcal{P}$ are said to be visible to each other if the line segment between $x$ and $y$ is contained in $\\mathcal{P}$. The Point Guard Art Gallery problem asks for a minimum set $S$ such that every point in $\\mathcal{P}$ is visible from a point in $S$. The set $S$ is referred to as guards. Assuming integer coordinates and a specific general position assumption, we present the first $O(\\log \\text{OPT})$-approximation algorithm for the point guard problem for simple polygons. This algorithm combines ideas of a paper of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05527","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-18T01:10:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B3ek6uJpfNkkdTaasuGyQx8XfnZ1uSM8qGeCyuXpBxOcwjoBQh2kvd6zmOT5izpjEq2FgMaNB3rH5FtzKl0tBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T14:31:54.683703Z"},"content_sha256":"72d8ba4b5488bd783a5d873cb638a304b3521a1b3b964d7201f1b2b9df562a4b","schema_version":"1.0","event_id":"sha256:72d8ba4b5488bd783a5d873cb638a304b3521a1b3b964d7201f1b2b9df562a4b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FIZ5ODJBV45YLYHESZJZBYS6LM/bundle.json","state_url":"https://pith.science/pith/FIZ5ODJBV45YLYHESZJZBYS6LM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FIZ5ODJBV45YLYHESZJZBYS6LM/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-11T14:31:54Z","links":{"resolver":"https://pith.science/pith/FIZ5ODJBV45YLYHESZJZBYS6LM","bundle":"https://pith.science/pith/FIZ5ODJBV45YLYHESZJZBYS6LM/bundle.json","state":"https://pith.science/pith/FIZ5ODJBV45YLYHESZJZBYS6LM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FIZ5ODJBV45YLYHESZJZBYS6LM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FIZ5ODJBV45YLYHESZJZBYS6LM","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":"d87c7fe668e9f683d3c507167f846de5b51f4a5989b3d3836b2f2f13cd14b374","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-19T11:32:54Z","title_canon_sha256":"37822a0f2acb63ce5337b74ee49f88b965ef00f5c3ca8af63f7a0775e4ac7f6d"},"schema_version":"1.0","source":{"id":"1607.05527","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.05527","created_at":"2026-05-18T01:10:46Z"},{"alias_kind":"arxiv_version","alias_value":"1607.05527v1","created_at":"2026-05-18T01:10:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05527","created_at":"2026-05-18T01:10:46Z"},{"alias_kind":"pith_short_12","alias_value":"FIZ5ODJBV45Y","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FIZ5ODJBV45YLYHE","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FIZ5ODJB","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:72d8ba4b5488bd783a5d873cb638a304b3521a1b3b964d7201f1b2b9df562a4b","target":"graph","created_at":"2026-05-18T01:10:46Z","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 a simple polygon $\\mathcal{P}$ on $n$ vertices, two points $x,y$ in $\\mathcal{P}$ are said to be visible to each other if the line segment between $x$ and $y$ is contained in $\\mathcal{P}$. The Point Guard Art Gallery problem asks for a minimum set $S$ such that every point in $\\mathcal{P}$ is visible from a point in $S$. The set $S$ is referred to as guards. Assuming integer coordinates and a specific general position assumption, we present the first $O(\\log \\text{OPT})$-approximation algorithm for the point guard problem for simple polygons. This algorithm combines ideas of a paper of ","authors_text":"\\'Edouard Bonnet, Tillmann Miltzow","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-19T11:32:54Z","title":"An Approximation Algorithm for the Art Gallery Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05527","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:defdfc08ea03104963e2635ebb6085f1d4fdaaaa5a714d9bdc9e4e0e259bb560","target":"record","created_at":"2026-05-18T01:10:46Z","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":"d87c7fe668e9f683d3c507167f846de5b51f4a5989b3d3836b2f2f13cd14b374","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-19T11:32:54Z","title_canon_sha256":"37822a0f2acb63ce5337b74ee49f88b965ef00f5c3ca8af63f7a0775e4ac7f6d"},"schema_version":"1.0","source":{"id":"1607.05527","kind":"arxiv","version":1}},"canonical_sha256":"2a33d70d21af3b85e0e4965390e25e5b32ce47c45beb6527ea6d0723dd15308f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a33d70d21af3b85e0e4965390e25e5b32ce47c45beb6527ea6d0723dd15308f","first_computed_at":"2026-05-18T01:10:46.635435Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:46.635435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hl5kbN+DiKzKEZaDKw1MEyO6l3mCToHe25P3fh3HLKohBFUcmW68gMUhZICgPoeLcNKwyFkWvCHYxPFp3N/XCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:46.636105Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.05527","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:defdfc08ea03104963e2635ebb6085f1d4fdaaaa5a714d9bdc9e4e0e259bb560","sha256:72d8ba4b5488bd783a5d873cb638a304b3521a1b3b964d7201f1b2b9df562a4b"],"state_sha256":"cb764ab07def6ac94b60924c9d490193e54abdcb24b2fb649431691d85b6e25d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lqAliKA/+OyQV4nmyWeqYy2xPsNONWzPEhddV01d/DZKtjOZMRN4n2uUouKXLFcdWyfoE5IFK4zGaJL9spvEBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T14:31:54.685729Z","bundle_sha256":"82a80bdaadbafc78858e1bd169368fa80fbdcafd60da0c7ca9b954c1a605fd21"}}