{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:QZJTX6TVD5DB2UW7BWNGRWCWUG","short_pith_number":"pith:QZJTX6TV","canonical_record":{"source":{"id":"2507.01940","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2025-07-02T17:51:11Z","cross_cats_sorted":[],"title_canon_sha256":"ea5450cb36b87038819ac0e2051a5c342afa1d8844266a003d93612953ae7c21","abstract_canon_sha256":"42a6274541a2c443b3eb4703987831935c3167ff8c874b766d8ee8a7daae7415"},"schema_version":"1.0"},"canonical_sha256":"86533bfa751f461d52df0d9a68d856a1a68b5c33c61d7651425c91630f8de17a","source":{"kind":"arxiv","id":"2507.01940","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.01940","created_at":"2026-07-05T11:30:58Z"},{"alias_kind":"arxiv_version","alias_value":"2507.01940v1","created_at":"2026-07-05T11:30:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.01940","created_at":"2026-07-05T11:30:58Z"},{"alias_kind":"pith_short_12","alias_value":"QZJTX6TVD5DB","created_at":"2026-07-05T11:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"QZJTX6TVD5DB2UW7","created_at":"2026-07-05T11:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"QZJTX6TV","created_at":"2026-07-05T11:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:QZJTX6TVD5DB2UW7BWNGRWCWUG","target":"record","payload":{"canonical_record":{"source":{"id":"2507.01940","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2025-07-02T17:51:11Z","cross_cats_sorted":[],"title_canon_sha256":"ea5450cb36b87038819ac0e2051a5c342afa1d8844266a003d93612953ae7c21","abstract_canon_sha256":"42a6274541a2c443b3eb4703987831935c3167ff8c874b766d8ee8a7daae7415"},"schema_version":"1.0"},"canonical_sha256":"86533bfa751f461d52df0d9a68d856a1a68b5c33c61d7651425c91630f8de17a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:30:58.578586Z","signature_b64":"UMNoiU+tlmafF5WybUE2xDYp1WWeoOFALMY4LYytUeSNQCpYc9cjt8mrK+ow6wDAZp7upL1wkruBjlUsx7pVAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86533bfa751f461d52df0d9a68d856a1a68b5c33c61d7651425c91630f8de17a","last_reissued_at":"2026-07-05T11:30:58.578076Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:30:58.578076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.01940","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-07-05T11:30:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aCBGva8vOJIThuX5Ldu48pBiIZjHJ3yghg39O85nPpt1ZbbEgDKARY/fpZ3faDi0of78jJl0q1DpHa9EovJmAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T06:18:39.064629Z"},"content_sha256":"6f571973c70246ee2455f8ccedb447e87ebe4452275a8188b00bda3658ef8c0f","schema_version":"1.0","event_id":"sha256:6f571973c70246ee2455f8ccedb447e87ebe4452275a8188b00bda3658ef8c0f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:QZJTX6TVD5DB2UW7BWNGRWCWUG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiple Watchman Routes in Staircase Polygons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anna Br\\\"otzner, Bengt J. Nilsson, Christiane Schmidt","submitted_at":"2025-07-02T17:51:11Z","abstract_excerpt":"We consider the watchman route problem for multiple watchmen in staircase polygons, which are rectilinear $x$- and $y$-monotone polygons. For two watchmen, we propose an algorithm to find an optimal solution that takes quadratic time, improving on the cubic time of a trivial solution. For $m \\geq 3$ watchmen, we explain where this approach fails, and present an approximation algorithm for the min-max criterion with only an additive error."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.01940","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.01940/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:30:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wpdJKR+b/nwTV7VuF49GWqH4V0SeuLvVXFSftMWNjacn9ZVD6MrQxp/Irb+kmcKm0ZuU7JXgEup95Q960CWQCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T06:18:39.065539Z"},"content_sha256":"7195fca78391b2318963d78cdf5d006336ac42323e61a239498ee60a85c9e57b","schema_version":"1.0","event_id":"sha256:7195fca78391b2318963d78cdf5d006336ac42323e61a239498ee60a85c9e57b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QZJTX6TVD5DB2UW7BWNGRWCWUG/bundle.json","state_url":"https://pith.science/pith/QZJTX6TVD5DB2UW7BWNGRWCWUG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QZJTX6TVD5DB2UW7BWNGRWCWUG/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-08-07T06:18:39Z","links":{"resolver":"https://pith.science/pith/QZJTX6TVD5DB2UW7BWNGRWCWUG","bundle":"https://pith.science/pith/QZJTX6TVD5DB2UW7BWNGRWCWUG/bundle.json","state":"https://pith.science/pith/QZJTX6TVD5DB2UW7BWNGRWCWUG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QZJTX6TVD5DB2UW7BWNGRWCWUG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:QZJTX6TVD5DB2UW7BWNGRWCWUG","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":"42a6274541a2c443b3eb4703987831935c3167ff8c874b766d8ee8a7daae7415","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2025-07-02T17:51:11Z","title_canon_sha256":"ea5450cb36b87038819ac0e2051a5c342afa1d8844266a003d93612953ae7c21"},"schema_version":"1.0","source":{"id":"2507.01940","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.01940","created_at":"2026-07-05T11:30:58Z"},{"alias_kind":"arxiv_version","alias_value":"2507.01940v1","created_at":"2026-07-05T11:30:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.01940","created_at":"2026-07-05T11:30:58Z"},{"alias_kind":"pith_short_12","alias_value":"QZJTX6TVD5DB","created_at":"2026-07-05T11:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"QZJTX6TVD5DB2UW7","created_at":"2026-07-05T11:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"QZJTX6TV","created_at":"2026-07-05T11:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:7195fca78391b2318963d78cdf5d006336ac42323e61a239498ee60a85c9e57b","target":"graph","created_at":"2026-07-05T11:30:58Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2507.01940/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the watchman route problem for multiple watchmen in staircase polygons, which are rectilinear $x$- and $y$-monotone polygons. For two watchmen, we propose an algorithm to find an optimal solution that takes quadratic time, improving on the cubic time of a trivial solution. For $m \\geq 3$ watchmen, we explain where this approach fails, and present an approximation algorithm for the min-max criterion with only an additive error.","authors_text":"Anna Br\\\"otzner, Bengt J. Nilsson, Christiane Schmidt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2025-07-02T17:51:11Z","title":"Multiple Watchman Routes in Staircase Polygons"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.01940","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:6f571973c70246ee2455f8ccedb447e87ebe4452275a8188b00bda3658ef8c0f","target":"record","created_at":"2026-07-05T11:30:58Z","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":"42a6274541a2c443b3eb4703987831935c3167ff8c874b766d8ee8a7daae7415","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2025-07-02T17:51:11Z","title_canon_sha256":"ea5450cb36b87038819ac0e2051a5c342afa1d8844266a003d93612953ae7c21"},"schema_version":"1.0","source":{"id":"2507.01940","kind":"arxiv","version":1}},"canonical_sha256":"86533bfa751f461d52df0d9a68d856a1a68b5c33c61d7651425c91630f8de17a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86533bfa751f461d52df0d9a68d856a1a68b5c33c61d7651425c91630f8de17a","first_computed_at":"2026-07-05T11:30:58.578076Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:30:58.578076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UMNoiU+tlmafF5WybUE2xDYp1WWeoOFALMY4LYytUeSNQCpYc9cjt8mrK+ow6wDAZp7upL1wkruBjlUsx7pVAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:30:58.578586Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.01940","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f571973c70246ee2455f8ccedb447e87ebe4452275a8188b00bda3658ef8c0f","sha256:7195fca78391b2318963d78cdf5d006336ac42323e61a239498ee60a85c9e57b"],"state_sha256":"dd1d8f237f7a6cfd35dc1823df8ef9bc0333f025b1dd4300df0872c00213057d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i+1+q7Q1wFzGrRTj1wzgdWt6hYl6txghyaCskRZ2LiaWxBq7hN0t+C8u9/wVW8vdNNOiZcsPJahagVCKlTZdDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T06:18:39.077456Z","bundle_sha256":"f1ef2d87ea7e9f002a2397ccc8110daa775f5653942038838385db7db49f8f89"}}