{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SBTGYZVHUF2ANE7JZYF4I7ZIPQ","short_pith_number":"pith:SBTGYZVH","schema_version":"1.0","canonical_sha256":"90666c66a7a1740693e9ce0bc47f287c3346db33a6be91b572e6fc1c23c162a9","source":{"kind":"arxiv","id":"2406.19495","version":1},"attestation_state":"computed","paper":{"title":"Multi-Agent Search-Type Problems on Polygons","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Caleb Jones, Jesse Lucier, Konstantinos Georgiou","submitted_at":"2024-06-27T19:24:33Z","abstract_excerpt":"We present several advancements in search-type problems for fleets of mobile agents operating in two dimensions under the wireless model. Potential hidden target locations are equidistant from a central point, forming either a disk (infinite possible locations) or regular polygons (finite possible locations). Building on the foundational disk evacuation problem, the disk priority evacuation problem with $k$ Servants, and the disk $w$-weighted search problem, we make improvements on several fronts. First we establish new upper and lower bounds for the $n$-gon priority evacuation problem with $1"},"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":"2406.19495","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2024-06-27T19:24:33Z","cross_cats_sorted":[],"title_canon_sha256":"71c8d703fab2c7337c7f8c11729bb67133f7b184d14e0a1d56deb74a3bd88b6a","abstract_canon_sha256":"eadb65b9f1df303f7ae497f28a959f9394921d19db7aa1c9348a2c3a96220884"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:37:40.378924Z","signature_b64":"X+ykO0LlUOqzDJ0nc+QNTscF4/xrbCcimcJynznuVAM53e3TWDbeO3kczQeO4RWK7BvvBHYyzfdbiwHxMjCZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90666c66a7a1740693e9ce0bc47f287c3346db33a6be91b572e6fc1c23c162a9","last_reissued_at":"2026-07-05T08:37:40.378462Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:37:40.378462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Agent Search-Type Problems on Polygons","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Caleb Jones, Jesse Lucier, Konstantinos Georgiou","submitted_at":"2024-06-27T19:24:33Z","abstract_excerpt":"We present several advancements in search-type problems for fleets of mobile agents operating in two dimensions under the wireless model. Potential hidden target locations are equidistant from a central point, forming either a disk (infinite possible locations) or regular polygons (finite possible locations). Building on the foundational disk evacuation problem, the disk priority evacuation problem with $k$ Servants, and the disk $w$-weighted search problem, we make improvements on several fronts. First we establish new upper and lower bounds for the $n$-gon priority evacuation problem with $1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.19495","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/2406.19495/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":"2406.19495","created_at":"2026-07-05T08:37:40.378514+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.19495v1","created_at":"2026-07-05T08:37:40.378514+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.19495","created_at":"2026-07-05T08:37:40.378514+00:00"},{"alias_kind":"pith_short_12","alias_value":"SBTGYZVHUF2A","created_at":"2026-07-05T08:37:40.378514+00:00"},{"alias_kind":"pith_short_16","alias_value":"SBTGYZVHUF2ANE7J","created_at":"2026-07-05T08:37:40.378514+00:00"},{"alias_kind":"pith_short_8","alias_value":"SBTGYZVH","created_at":"2026-07-05T08:37:40.378514+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/SBTGYZVHUF2ANE7JZYF4I7ZIPQ","json":"https://pith.science/pith/SBTGYZVHUF2ANE7JZYF4I7ZIPQ.json","graph_json":"https://pith.science/api/pith-number/SBTGYZVHUF2ANE7JZYF4I7ZIPQ/graph.json","events_json":"https://pith.science/api/pith-number/SBTGYZVHUF2ANE7JZYF4I7ZIPQ/events.json","paper":"https://pith.science/paper/SBTGYZVH"},"agent_actions":{"view_html":"https://pith.science/pith/SBTGYZVHUF2ANE7JZYF4I7ZIPQ","download_json":"https://pith.science/pith/SBTGYZVHUF2ANE7JZYF4I7ZIPQ.json","view_paper":"https://pith.science/paper/SBTGYZVH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.19495&json=true","fetch_graph":"https://pith.science/api/pith-number/SBTGYZVHUF2ANE7JZYF4I7ZIPQ/graph.json","fetch_events":"https://pith.science/api/pith-number/SBTGYZVHUF2ANE7JZYF4I7ZIPQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SBTGYZVHUF2ANE7JZYF4I7ZIPQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SBTGYZVHUF2ANE7JZYF4I7ZIPQ/action/storage_attestation","attest_author":"https://pith.science/pith/SBTGYZVHUF2ANE7JZYF4I7ZIPQ/action/author_attestation","sign_citation":"https://pith.science/pith/SBTGYZVHUF2ANE7JZYF4I7ZIPQ/action/citation_signature","submit_replication":"https://pith.science/pith/SBTGYZVHUF2ANE7JZYF4I7ZIPQ/action/replication_record"}},"created_at":"2026-07-05T08:37:40.378514+00:00","updated_at":"2026-07-05T08:37:40.378514+00:00"}