{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QM3VBRWE5VGBZXINJ7FL5Z4WBA","short_pith_number":"pith:QM3VBRWE","schema_version":"1.0","canonical_sha256":"833750c6c4ed4c1cdd0d4fcabee7960814ecac24a7f50cb5472b4159b547b231","source":{"kind":"arxiv","id":"1701.02555","version":1},"attestation_state":"computed","paper":{"title":"The ANTS problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Amos Korman (IRIF, GANG), Ofer Feinerman","submitted_at":"2017-01-10T12:38:44Z","abstract_excerpt":"We introduce the Ants Nearby Treasure Search (ANTS) problem, which models natural cooperative foraging behavior such as that performed by ants around their nest. In this problem, k probabilistic agents, initially placed at a central location, collectively search for a treasure on the two-dimensional grid. The treasure is placed at a target location by an adversary and the agents' goal is to find it as fast as possible as a function of both k and D, where D is the (unknown) distance between the central location and the target. We concentrate on the case in which agents cannot communicate while "},"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":"1701.02555","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-01-10T12:38:44Z","cross_cats_sorted":[],"title_canon_sha256":"c7a9ba0ab14683a89928448429da8e88aba3182b1c134c3da1ab39278f302f2f","abstract_canon_sha256":"3217d936000b65ccc16e488ab0c12bf7aca8c20437c8864514fe423487625cb9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:03.992007Z","signature_b64":"Rf3+n2YhdDSWDqJbpxwCuEAGXncg6rZ2riSOHGVtSMRWiAKXtdyPWG225YiACJsVmnu/Bszt7RgQ5VcE8OBWAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"833750c6c4ed4c1cdd0d4fcabee7960814ecac24a7f50cb5472b4159b547b231","last_reissued_at":"2026-05-18T00:53:03.991424Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:03.991424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The ANTS problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Amos Korman (IRIF, GANG), Ofer Feinerman","submitted_at":"2017-01-10T12:38:44Z","abstract_excerpt":"We introduce the Ants Nearby Treasure Search (ANTS) problem, which models natural cooperative foraging behavior such as that performed by ants around their nest. In this problem, k probabilistic agents, initially placed at a central location, collectively search for a treasure on the two-dimensional grid. The treasure is placed at a target location by an adversary and the agents' goal is to find it as fast as possible as a function of both k and D, where D is the (unknown) distance between the central location and the target. We concentrate on the case in which agents cannot communicate while "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02555","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":""},"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":"1701.02555","created_at":"2026-05-18T00:53:03.991513+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.02555v1","created_at":"2026-05-18T00:53:03.991513+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02555","created_at":"2026-05-18T00:53:03.991513+00:00"},{"alias_kind":"pith_short_12","alias_value":"QM3VBRWE5VGB","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"QM3VBRWE5VGBZXIN","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"QM3VBRWE","created_at":"2026-05-18T12:31:39.905425+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/QM3VBRWE5VGBZXINJ7FL5Z4WBA","json":"https://pith.science/pith/QM3VBRWE5VGBZXINJ7FL5Z4WBA.json","graph_json":"https://pith.science/api/pith-number/QM3VBRWE5VGBZXINJ7FL5Z4WBA/graph.json","events_json":"https://pith.science/api/pith-number/QM3VBRWE5VGBZXINJ7FL5Z4WBA/events.json","paper":"https://pith.science/paper/QM3VBRWE"},"agent_actions":{"view_html":"https://pith.science/pith/QM3VBRWE5VGBZXINJ7FL5Z4WBA","download_json":"https://pith.science/pith/QM3VBRWE5VGBZXINJ7FL5Z4WBA.json","view_paper":"https://pith.science/paper/QM3VBRWE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.02555&json=true","fetch_graph":"https://pith.science/api/pith-number/QM3VBRWE5VGBZXINJ7FL5Z4WBA/graph.json","fetch_events":"https://pith.science/api/pith-number/QM3VBRWE5VGBZXINJ7FL5Z4WBA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QM3VBRWE5VGBZXINJ7FL5Z4WBA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QM3VBRWE5VGBZXINJ7FL5Z4WBA/action/storage_attestation","attest_author":"https://pith.science/pith/QM3VBRWE5VGBZXINJ7FL5Z4WBA/action/author_attestation","sign_citation":"https://pith.science/pith/QM3VBRWE5VGBZXINJ7FL5Z4WBA/action/citation_signature","submit_replication":"https://pith.science/pith/QM3VBRWE5VGBZXINJ7FL5Z4WBA/action/replication_record"}},"created_at":"2026-05-18T00:53:03.991513+00:00","updated_at":"2026-05-18T00:53:03.991513+00:00"}