{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:SBTGYZVHUF2ANE7JZYF4I7ZIPQ","short_pith_number":"pith:SBTGYZVH","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"},"canonical_sha256":"90666c66a7a1740693e9ce0bc47f287c3346db33a6be91b572e6fc1c23c162a9","source":{"kind":"arxiv","id":"2406.19495","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.19495","created_at":"2026-07-05T08:37:40Z"},{"alias_kind":"arxiv_version","alias_value":"2406.19495v1","created_at":"2026-07-05T08:37:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.19495","created_at":"2026-07-05T08:37:40Z"},{"alias_kind":"pith_short_12","alias_value":"SBTGYZVHUF2A","created_at":"2026-07-05T08:37:40Z"},{"alias_kind":"pith_short_16","alias_value":"SBTGYZVHUF2ANE7J","created_at":"2026-07-05T08:37:40Z"},{"alias_kind":"pith_short_8","alias_value":"SBTGYZVH","created_at":"2026-07-05T08:37:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:SBTGYZVHUF2ANE7JZYF4I7ZIPQ","target":"record","payload":{"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"},"canonical_sha256":"90666c66a7a1740693e9ce0bc47f287c3346db33a6be91b572e6fc1c23c162a9","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"},"source_kind":"arxiv","source_id":"2406.19495","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-05T08:37:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MHlm68L/nHYl0cK8ezVMGaKrbku5buw24OWxFoxFgRaipRPBXmMxs1f3KcT0KT1B/KXNpHCtNrMB0uGlAQlZAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T22:37:48.773232Z"},"content_sha256":"c0f1f79a1a7058d37cf909675ff83a0fedd70108cad632b545477d044d23383b","schema_version":"1.0","event_id":"sha256:c0f1f79a1a7058d37cf909675ff83a0fedd70108cad632b545477d044d23383b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:SBTGYZVHUF2ANE7JZYF4I7ZIPQ","target":"graph","payload":{"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"},"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-05T08:37:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6D7fEhlc15bRlW1Voih+MPH8DbDQnqjoCafS9cvMXrBVagN9jCChxheP0Vdy0TwnS5/PZkry1XPwo91NgJzdDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T22:37:48.774325Z"},"content_sha256":"b206c29f51a2df771679246649c893267a5b0112acc8ef181c6de43c758f87b2","schema_version":"1.0","event_id":"sha256:b206c29f51a2df771679246649c893267a5b0112acc8ef181c6de43c758f87b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SBTGYZVHUF2ANE7JZYF4I7ZIPQ/bundle.json","state_url":"https://pith.science/pith/SBTGYZVHUF2ANE7JZYF4I7ZIPQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SBTGYZVHUF2ANE7JZYF4I7ZIPQ/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-07-31T22:37:48Z","links":{"resolver":"https://pith.science/pith/SBTGYZVHUF2ANE7JZYF4I7ZIPQ","bundle":"https://pith.science/pith/SBTGYZVHUF2ANE7JZYF4I7ZIPQ/bundle.json","state":"https://pith.science/pith/SBTGYZVHUF2ANE7JZYF4I7ZIPQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SBTGYZVHUF2ANE7JZYF4I7ZIPQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:SBTGYZVHUF2ANE7JZYF4I7ZIPQ","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":"eadb65b9f1df303f7ae497f28a959f9394921d19db7aa1c9348a2c3a96220884","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2024-06-27T19:24:33Z","title_canon_sha256":"71c8d703fab2c7337c7f8c11729bb67133f7b184d14e0a1d56deb74a3bd88b6a"},"schema_version":"1.0","source":{"id":"2406.19495","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.19495","created_at":"2026-07-05T08:37:40Z"},{"alias_kind":"arxiv_version","alias_value":"2406.19495v1","created_at":"2026-07-05T08:37:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.19495","created_at":"2026-07-05T08:37:40Z"},{"alias_kind":"pith_short_12","alias_value":"SBTGYZVHUF2A","created_at":"2026-07-05T08:37:40Z"},{"alias_kind":"pith_short_16","alias_value":"SBTGYZVHUF2ANE7J","created_at":"2026-07-05T08:37:40Z"},{"alias_kind":"pith_short_8","alias_value":"SBTGYZVH","created_at":"2026-07-05T08:37:40Z"}],"graph_snapshots":[{"event_id":"sha256:b206c29f51a2df771679246649c893267a5b0112acc8ef181c6de43c758f87b2","target":"graph","created_at":"2026-07-05T08:37:40Z","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/2406.19495/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Caleb Jones, Jesse Lucier, Konstantinos Georgiou","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2024-06-27T19:24:33Z","title":"Multi-Agent Search-Type Problems on Polygons"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.19495","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:c0f1f79a1a7058d37cf909675ff83a0fedd70108cad632b545477d044d23383b","target":"record","created_at":"2026-07-05T08:37:40Z","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":"eadb65b9f1df303f7ae497f28a959f9394921d19db7aa1c9348a2c3a96220884","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2024-06-27T19:24:33Z","title_canon_sha256":"71c8d703fab2c7337c7f8c11729bb67133f7b184d14e0a1d56deb74a3bd88b6a"},"schema_version":"1.0","source":{"id":"2406.19495","kind":"arxiv","version":1}},"canonical_sha256":"90666c66a7a1740693e9ce0bc47f287c3346db33a6be91b572e6fc1c23c162a9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90666c66a7a1740693e9ce0bc47f287c3346db33a6be91b572e6fc1c23c162a9","first_computed_at":"2026-07-05T08:37:40.378462Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:37:40.378462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X+ykO0LlUOqzDJ0nc+QNTscF4/xrbCcimcJynznuVAM53e3TWDbeO3kczQeO4RWK7BvvBHYyzfdbiwHxMjCZDg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:37:40.378924Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.19495","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c0f1f79a1a7058d37cf909675ff83a0fedd70108cad632b545477d044d23383b","sha256:b206c29f51a2df771679246649c893267a5b0112acc8ef181c6de43c758f87b2"],"state_sha256":"e07274c12e970242181061e65de4b09dd3274e4c8bed216064b6a18624e57c47"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EaiZIb4GSN2GdC+Ww0rsjCk4r4H5TrnTGYanPpEYn7Htg/5rp2FypAEZkjgOg7Mv/hS0aC2egbbjuYUCzyF8BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-31T22:37:48.777025Z","bundle_sha256":"abffec7676e9e9df754798979ae58166f1dbd2d8f980537f33c036c7c6aa336b"}}