{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:PIMPU6NW3REYAQGUTDUV3GNSQC","short_pith_number":"pith:PIMPU6NW","canonical_record":{"source":{"id":"1308.2757","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-08-13T05:16:18Z","cross_cats_sorted":[],"title_canon_sha256":"c6c86aac9f5d6c74da4403497f912255014f9385c5f865375888b46bd3e71fa8","abstract_canon_sha256":"adf885f9cf5316997848ef9109d393cde77f6186215435ef081993da7bed1385"},"schema_version":"1.0"},"canonical_sha256":"7a18fa79b6dc498040d498e95d99b28089ee0f9c4d604675d08f7750e76e0561","source":{"kind":"arxiv","id":"1308.2757","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.2757","created_at":"2026-05-18T03:11:59Z"},{"alias_kind":"arxiv_version","alias_value":"1308.2757v3","created_at":"2026-05-18T03:11:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.2757","created_at":"2026-05-18T03:11:59Z"},{"alias_kind":"pith_short_12","alias_value":"PIMPU6NW3REY","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PIMPU6NW3REYAQGU","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PIMPU6NW","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:PIMPU6NW3REYAQGUTDUV3GNSQC","target":"record","payload":{"canonical_record":{"source":{"id":"1308.2757","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-08-13T05:16:18Z","cross_cats_sorted":[],"title_canon_sha256":"c6c86aac9f5d6c74da4403497f912255014f9385c5f865375888b46bd3e71fa8","abstract_canon_sha256":"adf885f9cf5316997848ef9109d393cde77f6186215435ef081993da7bed1385"},"schema_version":"1.0"},"canonical_sha256":"7a18fa79b6dc498040d498e95d99b28089ee0f9c4d604675d08f7750e76e0561","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:59.038256Z","signature_b64":"ca2siRKvze5IEKUEVitBMOVSzW4jQObpwcSL3bp7rqyNXUC/AoXell6XTL2lfNgfprh/gFH++9EUf/ey5ZAfAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a18fa79b6dc498040d498e95d99b28089ee0f9c4d604675d08f7750e76e0561","last_reissued_at":"2026-05-18T03:11:59.037667Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:59.037667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.2757","source_version":3,"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:11:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n2cp3yIAc/5kWNa4xPBY9Jeu7wy9Ak1CNtVST4QrfaEugzbNO38iDNRipYODoXIvvRT1Alm8lHJnFU0l8zQ8AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:54:00.411569Z"},"content_sha256":"3bb1d2195df73d763902ce12530a0c9ae67d7e70bb18e66cbd2d5165b39d6cec","schema_version":"1.0","event_id":"sha256:3bb1d2195df73d763902ce12530a0c9ae67d7e70bb18e66cbd2d5165b39d6cec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:PIMPU6NW3REYAQGUTDUV3GNSQC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A (7/2)-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ali Mehrabi, Omrit Filtser, Robert Fraser, Saeed Mehrabi, Stephane Durocher","submitted_at":"2013-08-13T05:16:18Z","abstract_excerpt":"Consider a sliding camera that travels back and forth along an orthogonal line segment $s$ inside an orthogonal polygon $P$ with $n$ vertices. The camera can see a point $p$ inside $P$ if and only if there exists a line segment containing $p$ that crosses $s$ at a right angle and is completely contained in $P$. In the minimum sliding cameras (MSC) problem, the objective is to guard $P$ with the minimum number of sliding cameras. In this paper, we give an $O(n^{5/2})$-time $(7/2)$-approximation algorithm to the MSC problem on any simple orthogonal polygon with $n$ vertices, answering a question"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.2757","kind":"arxiv","version":3},"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:11:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+5gxFQKII/qAMold+i+7WgU0DgbZTskmZ5x4VgCImYTudn9i52pwopWf/iAXOzAAl8C/BtbDlOlqjChn2AIgCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:54:00.411916Z"},"content_sha256":"0960fed8a51397c36a89fe0d1b495c4252fda7ff4045126560657d71384d3f78","schema_version":"1.0","event_id":"sha256:0960fed8a51397c36a89fe0d1b495c4252fda7ff4045126560657d71384d3f78"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PIMPU6NW3REYAQGUTDUV3GNSQC/bundle.json","state_url":"https://pith.science/pith/PIMPU6NW3REYAQGUTDUV3GNSQC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PIMPU6NW3REYAQGUTDUV3GNSQC/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-02T06:54:00Z","links":{"resolver":"https://pith.science/pith/PIMPU6NW3REYAQGUTDUV3GNSQC","bundle":"https://pith.science/pith/PIMPU6NW3REYAQGUTDUV3GNSQC/bundle.json","state":"https://pith.science/pith/PIMPU6NW3REYAQGUTDUV3GNSQC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PIMPU6NW3REYAQGUTDUV3GNSQC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:PIMPU6NW3REYAQGUTDUV3GNSQC","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":"adf885f9cf5316997848ef9109d393cde77f6186215435ef081993da7bed1385","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-08-13T05:16:18Z","title_canon_sha256":"c6c86aac9f5d6c74da4403497f912255014f9385c5f865375888b46bd3e71fa8"},"schema_version":"1.0","source":{"id":"1308.2757","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.2757","created_at":"2026-05-18T03:11:59Z"},{"alias_kind":"arxiv_version","alias_value":"1308.2757v3","created_at":"2026-05-18T03:11:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.2757","created_at":"2026-05-18T03:11:59Z"},{"alias_kind":"pith_short_12","alias_value":"PIMPU6NW3REY","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PIMPU6NW3REYAQGU","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PIMPU6NW","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:0960fed8a51397c36a89fe0d1b495c4252fda7ff4045126560657d71384d3f78","target":"graph","created_at":"2026-05-18T03:11:59Z","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":"Consider a sliding camera that travels back and forth along an orthogonal line segment $s$ inside an orthogonal polygon $P$ with $n$ vertices. The camera can see a point $p$ inside $P$ if and only if there exists a line segment containing $p$ that crosses $s$ at a right angle and is completely contained in $P$. In the minimum sliding cameras (MSC) problem, the objective is to guard $P$ with the minimum number of sliding cameras. In this paper, we give an $O(n^{5/2})$-time $(7/2)$-approximation algorithm to the MSC problem on any simple orthogonal polygon with $n$ vertices, answering a question","authors_text":"Ali Mehrabi, Omrit Filtser, Robert Fraser, Saeed Mehrabi, Stephane Durocher","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-08-13T05:16:18Z","title":"A (7/2)-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.2757","kind":"arxiv","version":3},"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:3bb1d2195df73d763902ce12530a0c9ae67d7e70bb18e66cbd2d5165b39d6cec","target":"record","created_at":"2026-05-18T03:11:59Z","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":"adf885f9cf5316997848ef9109d393cde77f6186215435ef081993da7bed1385","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-08-13T05:16:18Z","title_canon_sha256":"c6c86aac9f5d6c74da4403497f912255014f9385c5f865375888b46bd3e71fa8"},"schema_version":"1.0","source":{"id":"1308.2757","kind":"arxiv","version":3}},"canonical_sha256":"7a18fa79b6dc498040d498e95d99b28089ee0f9c4d604675d08f7750e76e0561","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a18fa79b6dc498040d498e95d99b28089ee0f9c4d604675d08f7750e76e0561","first_computed_at":"2026-05-18T03:11:59.037667Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:11:59.037667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ca2siRKvze5IEKUEVitBMOVSzW4jQObpwcSL3bp7rqyNXUC/AoXell6XTL2lfNgfprh/gFH++9EUf/ey5ZAfAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:11:59.038256Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.2757","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3bb1d2195df73d763902ce12530a0c9ae67d7e70bb18e66cbd2d5165b39d6cec","sha256:0960fed8a51397c36a89fe0d1b495c4252fda7ff4045126560657d71384d3f78"],"state_sha256":"2e843bda3ba8f5b1c133120f337bb57672996316016a46cb6c401f51686b14ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xoQ+NqVSpH5ov7VRzSv59twxjBKxe4ezqkhkD6fHshZCicDT+fuHrSA+XrV2DhnbaFLQgsVGvm3AAxv+pWvuBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T06:54:00.413836Z","bundle_sha256":"03966fff64ec5e67f096551fe9d8ddea767080cd8639f4443c878c4a48a8c0f4"}}