{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NONQU4HWTJQAONNC4REOWG6TT2","short_pith_number":"pith:NONQU4HW","canonical_record":{"source":{"id":"1607.03039","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-11T17:09:53Z","cross_cats_sorted":[],"title_canon_sha256":"d587d02986053f2f14ea8420207222dd4e0cbe31beae7ed61175275758bef709","abstract_canon_sha256":"1226a775b0503b18347187fd58db678b45b453154d60af48b1bd28a0ef8dde33"},"schema_version":"1.0"},"canonical_sha256":"6b9b0a70f69a600735a2e448eb1bd39e8a7d9a98c4f616f3704268089a82166e","source":{"kind":"arxiv","id":"1607.03039","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.03039","created_at":"2026-05-18T01:09:06Z"},{"alias_kind":"arxiv_version","alias_value":"1607.03039v2","created_at":"2026-05-18T01:09:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.03039","created_at":"2026-05-18T01:09:06Z"},{"alias_kind":"pith_short_12","alias_value":"NONQU4HWTJQA","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NONQU4HWTJQAONNC","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NONQU4HW","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NONQU4HWTJQAONNC4REOWG6TT2","target":"record","payload":{"canonical_record":{"source":{"id":"1607.03039","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-11T17:09:53Z","cross_cats_sorted":[],"title_canon_sha256":"d587d02986053f2f14ea8420207222dd4e0cbe31beae7ed61175275758bef709","abstract_canon_sha256":"1226a775b0503b18347187fd58db678b45b453154d60af48b1bd28a0ef8dde33"},"schema_version":"1.0"},"canonical_sha256":"6b9b0a70f69a600735a2e448eb1bd39e8a7d9a98c4f616f3704268089a82166e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:06.260939Z","signature_b64":"Pmr4v6cVldeySyKodLFo9m7/rrvoEa7G1ZPW7v79EjNNCmvUkIC+w5lgIMdkvPHZ3St6p8V+Dg5rXoD6ZAs4Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b9b0a70f69a600735a2e448eb1bd39e8a7d9a98c4f616f3704268089a82166e","last_reissued_at":"2026-05-18T01:09:06.260507Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:06.260507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.03039","source_version":2,"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:09:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rban5bfVEG0nxFy++0pWzzzWxjrzxKbxEr06f85hCPEpQW5b+besMJ+7XuIfcEm0isCLhtd2+1AnWS9oWKhrCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T14:03:06.128266Z"},"content_sha256":"b873f760cc20da473e814954d6219119b40512d6803edcec7d920886fa2313b4","schema_version":"1.0","event_id":"sha256:b873f760cc20da473e814954d6219119b40512d6803edcec7d920886fa2313b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NONQU4HWTJQAONNC4REOWG6TT2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Clearing an Orthogonal Polygon Using Sliding Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ali Narenji Sheshkalani, Mohammad Ghodsi, Salma Sadat Mahdavi","submitted_at":"2016-07-11T17:09:53Z","abstract_excerpt":"In a multi-robot system, a number of autonomous robots would sense, communicate, and decide to move within a given domain to achieve a common goal. In this paper, we consider a new variant of the pursuit-evasion problem in which the robots (pursuers) each move back and forth along an orthogonal line segment inside a simple orthogonal polygon $P$. A point $p$ can be covered by a sliding robot that moves along a line segment s, if there exists a point $q\\in s$ such that $\\overline{pq}$ is a line segment perpendicular to $s$. In the pursuit-evasion problem, a polygonal region is given and a robot"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.03039","kind":"arxiv","version":2},"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:09:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XGWK9Pram2Zm9mhVe9wdePYoyVhh07O+DuZpYhiy0Ip1RpB2U7UHlPwymzOxmCuYZJ+Ishq4DWaOxj5fIyv2Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T14:03:06.128660Z"},"content_sha256":"51cccef1887e2f64b0d9377da41cf43f526dac5fa6301403a7588c188e3b37d3","schema_version":"1.0","event_id":"sha256:51cccef1887e2f64b0d9377da41cf43f526dac5fa6301403a7588c188e3b37d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NONQU4HWTJQAONNC4REOWG6TT2/bundle.json","state_url":"https://pith.science/pith/NONQU4HWTJQAONNC4REOWG6TT2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NONQU4HWTJQAONNC4REOWG6TT2/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-20T14:03:06Z","links":{"resolver":"https://pith.science/pith/NONQU4HWTJQAONNC4REOWG6TT2","bundle":"https://pith.science/pith/NONQU4HWTJQAONNC4REOWG6TT2/bundle.json","state":"https://pith.science/pith/NONQU4HWTJQAONNC4REOWG6TT2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NONQU4HWTJQAONNC4REOWG6TT2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NONQU4HWTJQAONNC4REOWG6TT2","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":"1226a775b0503b18347187fd58db678b45b453154d60af48b1bd28a0ef8dde33","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-11T17:09:53Z","title_canon_sha256":"d587d02986053f2f14ea8420207222dd4e0cbe31beae7ed61175275758bef709"},"schema_version":"1.0","source":{"id":"1607.03039","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.03039","created_at":"2026-05-18T01:09:06Z"},{"alias_kind":"arxiv_version","alias_value":"1607.03039v2","created_at":"2026-05-18T01:09:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.03039","created_at":"2026-05-18T01:09:06Z"},{"alias_kind":"pith_short_12","alias_value":"NONQU4HWTJQA","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NONQU4HWTJQAONNC","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NONQU4HW","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:51cccef1887e2f64b0d9377da41cf43f526dac5fa6301403a7588c188e3b37d3","target":"graph","created_at":"2026-05-18T01:09:06Z","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":"In a multi-robot system, a number of autonomous robots would sense, communicate, and decide to move within a given domain to achieve a common goal. In this paper, we consider a new variant of the pursuit-evasion problem in which the robots (pursuers) each move back and forth along an orthogonal line segment inside a simple orthogonal polygon $P$. A point $p$ can be covered by a sliding robot that moves along a line segment s, if there exists a point $q\\in s$ such that $\\overline{pq}$ is a line segment perpendicular to $s$. In the pursuit-evasion problem, a polygonal region is given and a robot","authors_text":"Ali Narenji Sheshkalani, Mohammad Ghodsi, Salma Sadat Mahdavi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-11T17:09:53Z","title":"Clearing an Orthogonal Polygon Using Sliding Robots"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.03039","kind":"arxiv","version":2},"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:b873f760cc20da473e814954d6219119b40512d6803edcec7d920886fa2313b4","target":"record","created_at":"2026-05-18T01:09:06Z","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":"1226a775b0503b18347187fd58db678b45b453154d60af48b1bd28a0ef8dde33","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-11T17:09:53Z","title_canon_sha256":"d587d02986053f2f14ea8420207222dd4e0cbe31beae7ed61175275758bef709"},"schema_version":"1.0","source":{"id":"1607.03039","kind":"arxiv","version":2}},"canonical_sha256":"6b9b0a70f69a600735a2e448eb1bd39e8a7d9a98c4f616f3704268089a82166e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b9b0a70f69a600735a2e448eb1bd39e8a7d9a98c4f616f3704268089a82166e","first_computed_at":"2026-05-18T01:09:06.260507Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:06.260507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Pmr4v6cVldeySyKodLFo9m7/rrvoEa7G1ZPW7v79EjNNCmvUkIC+w5lgIMdkvPHZ3St6p8V+Dg5rXoD6ZAs4Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:06.260939Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.03039","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b873f760cc20da473e814954d6219119b40512d6803edcec7d920886fa2313b4","sha256:51cccef1887e2f64b0d9377da41cf43f526dac5fa6301403a7588c188e3b37d3"],"state_sha256":"e96ac84900e1d2c8b6f22825f5254373f6bb583dd0f6bfae23929fab3fe5ff90"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z5fLZq/L26FtRNzeQVjpQwo/aUWhi8IWVahfOvVp1ki8yPNz+rMhZkixvO1bWC5DRbd+Xv01XwxUDFeWgQpICQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T14:03:06.130605Z","bundle_sha256":"a42c17bf8789d547ea0eed9ef138141f69a479fd14ed23e3f761c68df9b0a882"}}