{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:64MPCOVIFFALPCWWHH4EYF2D5B","short_pith_number":"pith:64MPCOVI","schema_version":"1.0","canonical_sha256":"f718f13aa82940b78ad639f84c1743e86f0a221fdf55f6fec296c20f63290ee3","source":{"kind":"arxiv","id":"2411.15391","version":4},"attestation_state":"computed","paper":{"title":"Disk and Partial Disk Inspection: Worst- to Average-Case and Pareto Upper Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DM","authors_text":"James Conley, Konstantinos Georgiou","submitted_at":"2024-11-23T00:11:56Z","abstract_excerpt":"We consider $n$ unit-speed mobile agents initially positioned at the center of a unit disk, tasked with inspecting all points on the disk's perimeter. A perimeter point is considered covered if an agent located outside the disk's interior has unobstructed visibility of it, treating the disk itself as an obstacle. For $n=1$, this problem is known as the shoreline problem with a known distance. Isbell (1957) derived an optimal trajectory that minimizes the worst-case inspection time for this problem, while Gluss (1961) proposed heuristics for its average-case version. The one-agent case was orig"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2411.15391","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2024-11-23T00:11:56Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"4738f04e7f099199bc5d70ad84dcb7e5c50af6b183f48801234edaa182da2f89","abstract_canon_sha256":"0914290f3a7bc0eb7d6138ad6abe76ac55e8e7dcc07a82cf02a08753f8d96da7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:07:01.929181Z","signature_b64":"f0F78o24qebKDrV2bSwhu5NWYzAow0U4UW1p7MaEniHy+fjU2QTYXQU+vxhSd2ltGr4cU0AoEu+fskYLNRKpDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f718f13aa82940b78ad639f84c1743e86f0a221fdf55f6fec296c20f63290ee3","last_reissued_at":"2026-07-05T12:07:01.928699Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:07:01.928699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Disk and Partial Disk Inspection: Worst- to Average-Case and Pareto Upper Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DM","authors_text":"James Conley, Konstantinos Georgiou","submitted_at":"2024-11-23T00:11:56Z","abstract_excerpt":"We consider $n$ unit-speed mobile agents initially positioned at the center of a unit disk, tasked with inspecting all points on the disk's perimeter. A perimeter point is considered covered if an agent located outside the disk's interior has unobstructed visibility of it, treating the disk itself as an obstacle. For $n=1$, this problem is known as the shoreline problem with a known distance. Isbell (1957) derived an optimal trajectory that minimizes the worst-case inspection time for this problem, while Gluss (1961) proposed heuristics for its average-case version. The one-agent case was orig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.15391","kind":"arxiv","version":4},"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/2411.15391/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2411.15391","created_at":"2026-07-05T12:07:01.928756+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.15391v4","created_at":"2026-07-05T12:07:01.928756+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.15391","created_at":"2026-07-05T12:07:01.928756+00:00"},{"alias_kind":"pith_short_12","alias_value":"64MPCOVIFFAL","created_at":"2026-07-05T12:07:01.928756+00:00"},{"alias_kind":"pith_short_16","alias_value":"64MPCOVIFFALPCWW","created_at":"2026-07-05T12:07:01.928756+00:00"},{"alias_kind":"pith_short_8","alias_value":"64MPCOVI","created_at":"2026-07-05T12:07:01.928756+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/64MPCOVIFFALPCWWHH4EYF2D5B","json":"https://pith.science/pith/64MPCOVIFFALPCWWHH4EYF2D5B.json","graph_json":"https://pith.science/api/pith-number/64MPCOVIFFALPCWWHH4EYF2D5B/graph.json","events_json":"https://pith.science/api/pith-number/64MPCOVIFFALPCWWHH4EYF2D5B/events.json","paper":"https://pith.science/paper/64MPCOVI"},"agent_actions":{"view_html":"https://pith.science/pith/64MPCOVIFFALPCWWHH4EYF2D5B","download_json":"https://pith.science/pith/64MPCOVIFFALPCWWHH4EYF2D5B.json","view_paper":"https://pith.science/paper/64MPCOVI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.15391&json=true","fetch_graph":"https://pith.science/api/pith-number/64MPCOVIFFALPCWWHH4EYF2D5B/graph.json","fetch_events":"https://pith.science/api/pith-number/64MPCOVIFFALPCWWHH4EYF2D5B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/64MPCOVIFFALPCWWHH4EYF2D5B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/64MPCOVIFFALPCWWHH4EYF2D5B/action/storage_attestation","attest_author":"https://pith.science/pith/64MPCOVIFFALPCWWHH4EYF2D5B/action/author_attestation","sign_citation":"https://pith.science/pith/64MPCOVIFFALPCWWHH4EYF2D5B/action/citation_signature","submit_replication":"https://pith.science/pith/64MPCOVIFFALPCWWHH4EYF2D5B/action/replication_record"}},"created_at":"2026-07-05T12:07:01.928756+00:00","updated_at":"2026-07-05T12:07:01.928756+00:00"}