{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UOXSIBHD6X325DP3YATT3BVV3Z","short_pith_number":"pith:UOXSIBHD","canonical_record":{"source":{"id":"1809.06727","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-18T13:45:14Z","cross_cats_sorted":["cs.DM","cs.MA","math.CO"],"title_canon_sha256":"42bdadd79f0fd2ee8973431feac71606be0a3f0a4ce9972cb11a439b9ef3a00d","abstract_canon_sha256":"2f0bcc4e86a70c64dce687c119426b03ce43c0535d068729e0544d2d765dbfee"},"schema_version":"1.0"},"canonical_sha256":"a3af2404e3f5f7ae8dfbc0273d86b5de4f20a20bea0200ca4ff991f694f8891b","source":{"kind":"arxiv","id":"1809.06727","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.06727","created_at":"2026-05-17T23:43:28Z"},{"alias_kind":"arxiv_version","alias_value":"1809.06727v2","created_at":"2026-05-17T23:43:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.06727","created_at":"2026-05-17T23:43:28Z"},{"alias_kind":"pith_short_12","alias_value":"UOXSIBHD6X32","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UOXSIBHD6X325DP3","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UOXSIBHD","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UOXSIBHD6X325DP3YATT3BVV3Z","target":"record","payload":{"canonical_record":{"source":{"id":"1809.06727","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-18T13:45:14Z","cross_cats_sorted":["cs.DM","cs.MA","math.CO"],"title_canon_sha256":"42bdadd79f0fd2ee8973431feac71606be0a3f0a4ce9972cb11a439b9ef3a00d","abstract_canon_sha256":"2f0bcc4e86a70c64dce687c119426b03ce43c0535d068729e0544d2d765dbfee"},"schema_version":"1.0"},"canonical_sha256":"a3af2404e3f5f7ae8dfbc0273d86b5de4f20a20bea0200ca4ff991f694f8891b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:28.256635Z","signature_b64":"g1uHWPFDclipNSnUbAKOUR4kGDjLYWW9jARVsaGq6av9L6mPJCz8GPg69QXlXijyrMxnDHiftm9/WeB6X3lgAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3af2404e3f5f7ae8dfbc0273d86b5de4f20a20bea0200ca4ff991f694f8891b","last_reissued_at":"2026-05-17T23:43:28.256204Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:28.256204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.06727","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-17T23:43:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cHVoNVo3V507Bkvn/d3m3kNxfHMnNJB22z9qugI5v2sUSCWDZvwyrbTk8XNiBVZpLYIGATYGJFhtDuUqENvTCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:29:36.742951Z"},"content_sha256":"79c5788cb9d7c77030f3b63407b880990c3d43e7aec7739f2581bd8b009546f6","schema_version":"1.0","event_id":"sha256:79c5788cb9d7c77030f3b63407b880990c3d43e7aec7739f2581bd8b009546f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UOXSIBHD6X325DP3YATT3BVV3Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal strategies for patrolling fences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.MA","math.CO"],"primary_cat":"cs.DS","authors_text":"Anders Martinsson, Bernhard Haeupler, Fabian Kuhn, Kalina Petrova, Pascal Pfister","submitted_at":"2018-09-18T13:45:14Z","abstract_excerpt":"A classical multi-agent fence patrolling problem asks: What is the maximum length $L$ of a line that $k$ agents with maximum speeds $v_1,\\ldots,v_k$ can patrol if each point on the line needs to be visited at least once every unit of time. It is easy to see that $L = \\alpha \\sum_{i=1}^k v_i$ for some efficiency $\\alpha \\in [\\frac{1}{2},1)$. After a series of works giving better and better efficiencies, it was conjectured that the best possible efficiency approaches $\\frac{2}{3}$. No upper bounds on the efficiency below $1$ were known. We prove the first such upper bounds and tightly bound the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.06727","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-17T23:43:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tSAueGOWzyWZZGJBoo35+CLw7PNse8TAx/luZuFtLAB8S0toJLwdGQMCcnWTk/vK/+efPZoaz0rrlpeacU43Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:29:36.743637Z"},"content_sha256":"d0a7445c61f454a80ff0a3bd4f7b7013e7f59ed3d3609b80e9d2ca3018748e23","schema_version":"1.0","event_id":"sha256:d0a7445c61f454a80ff0a3bd4f7b7013e7f59ed3d3609b80e9d2ca3018748e23"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UOXSIBHD6X325DP3YATT3BVV3Z/bundle.json","state_url":"https://pith.science/pith/UOXSIBHD6X325DP3YATT3BVV3Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UOXSIBHD6X325DP3YATT3BVV3Z/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-05-26T16:29:36Z","links":{"resolver":"https://pith.science/pith/UOXSIBHD6X325DP3YATT3BVV3Z","bundle":"https://pith.science/pith/UOXSIBHD6X325DP3YATT3BVV3Z/bundle.json","state":"https://pith.science/pith/UOXSIBHD6X325DP3YATT3BVV3Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UOXSIBHD6X325DP3YATT3BVV3Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UOXSIBHD6X325DP3YATT3BVV3Z","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":"2f0bcc4e86a70c64dce687c119426b03ce43c0535d068729e0544d2d765dbfee","cross_cats_sorted":["cs.DM","cs.MA","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-18T13:45:14Z","title_canon_sha256":"42bdadd79f0fd2ee8973431feac71606be0a3f0a4ce9972cb11a439b9ef3a00d"},"schema_version":"1.0","source":{"id":"1809.06727","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.06727","created_at":"2026-05-17T23:43:28Z"},{"alias_kind":"arxiv_version","alias_value":"1809.06727v2","created_at":"2026-05-17T23:43:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.06727","created_at":"2026-05-17T23:43:28Z"},{"alias_kind":"pith_short_12","alias_value":"UOXSIBHD6X32","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UOXSIBHD6X325DP3","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UOXSIBHD","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:d0a7445c61f454a80ff0a3bd4f7b7013e7f59ed3d3609b80e9d2ca3018748e23","target":"graph","created_at":"2026-05-17T23:43:28Z","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":"A classical multi-agent fence patrolling problem asks: What is the maximum length $L$ of a line that $k$ agents with maximum speeds $v_1,\\ldots,v_k$ can patrol if each point on the line needs to be visited at least once every unit of time. It is easy to see that $L = \\alpha \\sum_{i=1}^k v_i$ for some efficiency $\\alpha \\in [\\frac{1}{2},1)$. After a series of works giving better and better efficiencies, it was conjectured that the best possible efficiency approaches $\\frac{2}{3}$. No upper bounds on the efficiency below $1$ were known. We prove the first such upper bounds and tightly bound the ","authors_text":"Anders Martinsson, Bernhard Haeupler, Fabian Kuhn, Kalina Petrova, Pascal Pfister","cross_cats":["cs.DM","cs.MA","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-18T13:45:14Z","title":"Optimal strategies for patrolling fences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.06727","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:79c5788cb9d7c77030f3b63407b880990c3d43e7aec7739f2581bd8b009546f6","target":"record","created_at":"2026-05-17T23:43:28Z","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":"2f0bcc4e86a70c64dce687c119426b03ce43c0535d068729e0544d2d765dbfee","cross_cats_sorted":["cs.DM","cs.MA","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-18T13:45:14Z","title_canon_sha256":"42bdadd79f0fd2ee8973431feac71606be0a3f0a4ce9972cb11a439b9ef3a00d"},"schema_version":"1.0","source":{"id":"1809.06727","kind":"arxiv","version":2}},"canonical_sha256":"a3af2404e3f5f7ae8dfbc0273d86b5de4f20a20bea0200ca4ff991f694f8891b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3af2404e3f5f7ae8dfbc0273d86b5de4f20a20bea0200ca4ff991f694f8891b","first_computed_at":"2026-05-17T23:43:28.256204Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:28.256204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g1uHWPFDclipNSnUbAKOUR4kGDjLYWW9jARVsaGq6av9L6mPJCz8GPg69QXlXijyrMxnDHiftm9/WeB6X3lgAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:28.256635Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.06727","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:79c5788cb9d7c77030f3b63407b880990c3d43e7aec7739f2581bd8b009546f6","sha256:d0a7445c61f454a80ff0a3bd4f7b7013e7f59ed3d3609b80e9d2ca3018748e23"],"state_sha256":"ab2cd72cbde2c233a7a54ca72366d5a659e745563da34946b1d8b8e78628ce65"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IoWM6vxRWqoILoRiEJp4ZManswR1SVTn7F88nFKoFsp/f29SzB5j0mIc0YrSFhTZiDIy7GN2kxZhHkPI9VvODA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:29:36.747121Z","bundle_sha256":"40966b562e0d4435a9db916908a7ba53e3f753bd504bf7d3c95a22f4d4519bf9"}}