{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:H3QQLGWTBT6RW6K6C6DOXE3RZL","short_pith_number":"pith:H3QQLGWT","schema_version":"1.0","canonical_sha256":"3ee1059ad30cfd1b795e1786eb9371caf0cbc534f6511882833906333af4788a","source":{"kind":"arxiv","id":"1905.09988","version":2},"attestation_state":"computed","paper":{"title":"Decentralized Informative Path Planning with Exploration-Exploitation Balance for Swarm Robotic Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.MA","authors_text":"Payam Ghassemi, Souma Chowdhury","submitted_at":"2019-05-24T01:27:12Z","abstract_excerpt":"Swarm robotic search is concerned with searching targets in unknown environments (e.g., for search and rescue or hazard localization), using a large number of collaborating simple mobile robots. In such applications, decentralized swarm systems are touted for their task/coverage scalability, time efficiency, and fault tolerance. To guide the behavior of such swarm systems, two broad classes of approaches are available, namely nature-inspired swarm heuristics and multi-robotic search methods. However, simultaneously offering computationally-efficient scalability and fundamental insights into th"},"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":"1905.09988","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-05-24T01:27:12Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"9286c080ea88c1436c30adc630e04ea37167ec12aa9d59b6c8b3e5e83857ea9b","abstract_canon_sha256":"36b44584dfbf5e8f42bd5fa41d79f5b7871c8888f9680f7ca0b67d3a0638f221"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:37.440856Z","signature_b64":"eOfSRJMJa/w8m9smasddDMmf6wqLLD1VOwHQexxexOF3KQGYIXRWaVgjReX6fOfqHlpr2kMU4uOL9Tec3mGuAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ee1059ad30cfd1b795e1786eb9371caf0cbc534f6511882833906333af4788a","last_reissued_at":"2026-05-17T23:44:37.440175Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:37.440175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decentralized Informative Path Planning with Exploration-Exploitation Balance for Swarm Robotic Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.MA","authors_text":"Payam Ghassemi, Souma Chowdhury","submitted_at":"2019-05-24T01:27:12Z","abstract_excerpt":"Swarm robotic search is concerned with searching targets in unknown environments (e.g., for search and rescue or hazard localization), using a large number of collaborating simple mobile robots. In such applications, decentralized swarm systems are touted for their task/coverage scalability, time efficiency, and fault tolerance. To guide the behavior of such swarm systems, two broad classes of approaches are available, namely nature-inspired swarm heuristics and multi-robotic search methods. However, simultaneously offering computationally-efficient scalability and fundamental insights into th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.09988","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.09988","created_at":"2026-05-17T23:44:37.440281+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.09988v2","created_at":"2026-05-17T23:44:37.440281+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09988","created_at":"2026-05-17T23:44:37.440281+00:00"},{"alias_kind":"pith_short_12","alias_value":"H3QQLGWTBT6R","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"H3QQLGWTBT6RW6K6","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"H3QQLGWT","created_at":"2026-05-18T12:33:18.533446+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.04396","citing_title":"Informative Path Planning with Local Penalization for Decentralized and Asynchronous Swarm Robotic Search","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/H3QQLGWTBT6RW6K6C6DOXE3RZL","json":"https://pith.science/pith/H3QQLGWTBT6RW6K6C6DOXE3RZL.json","graph_json":"https://pith.science/api/pith-number/H3QQLGWTBT6RW6K6C6DOXE3RZL/graph.json","events_json":"https://pith.science/api/pith-number/H3QQLGWTBT6RW6K6C6DOXE3RZL/events.json","paper":"https://pith.science/paper/H3QQLGWT"},"agent_actions":{"view_html":"https://pith.science/pith/H3QQLGWTBT6RW6K6C6DOXE3RZL","download_json":"https://pith.science/pith/H3QQLGWTBT6RW6K6C6DOXE3RZL.json","view_paper":"https://pith.science/paper/H3QQLGWT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.09988&json=true","fetch_graph":"https://pith.science/api/pith-number/H3QQLGWTBT6RW6K6C6DOXE3RZL/graph.json","fetch_events":"https://pith.science/api/pith-number/H3QQLGWTBT6RW6K6C6DOXE3RZL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H3QQLGWTBT6RW6K6C6DOXE3RZL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H3QQLGWTBT6RW6K6C6DOXE3RZL/action/storage_attestation","attest_author":"https://pith.science/pith/H3QQLGWTBT6RW6K6C6DOXE3RZL/action/author_attestation","sign_citation":"https://pith.science/pith/H3QQLGWTBT6RW6K6C6DOXE3RZL/action/citation_signature","submit_replication":"https://pith.science/pith/H3QQLGWTBT6RW6K6C6DOXE3RZL/action/replication_record"}},"created_at":"2026-05-17T23:44:37.440281+00:00","updated_at":"2026-05-17T23:44:37.440281+00:00"}