{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4VJYRWD4BBPRQ4AUTUOPMELZJC","short_pith_number":"pith:4VJYRWD4","schema_version":"1.0","canonical_sha256":"e55388d87c085f1870149d1cf611794895cac3d4ce921bb38fd767d1e3cce9a0","source":{"kind":"arxiv","id":"2508.04537","version":1},"attestation_state":"computed","paper":{"title":"Behaviorally Adaptive Multi-Robot Hazard Localization in Failure-Prone, Communication-Denied Environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.RO","authors_text":"Aamodh Suresh, Alkesh K. Srivastava, Carlos Nieto-Granda","submitted_at":"2025-08-06T15:23:22Z","abstract_excerpt":"We address the challenge of multi-robot autonomous hazard mapping in high-risk, failure-prone, communication-denied environments such as post-disaster zones, underground mines, caves, and planetary surfaces. In these missions, robots must explore and map hazards while minimizing the risk of failure due to environmental threats or hardware limitations. We introduce a behavior-adaptive, information-theoretic planning framework for multi-robot teams grounded in the concept of Behavioral Entropy (BE), that generalizes Shannon entropy (SE) to capture diverse human-like uncertainty evaluations. Buil"},"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":"2508.04537","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-08-06T15:23:22Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"cfde6be0806f12b61bdd1bdd5e34d80ad68d068e0be3f967829560156fa72298","abstract_canon_sha256":"8ea78e97a742873648dc894f5a5ef28fe9bf87118b38170dafcaa8f4c4cc2459"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:49:39.125022Z","signature_b64":"bytdXFBJlTm+PUk/qPVDbKjz9J6d2b5rZEIPykG2H3zoRPrJ3mRrM41cBtNDRLwmENV0rrUaA+cZq0S1mD8cAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e55388d87c085f1870149d1cf611794895cac3d4ce921bb38fd767d1e3cce9a0","last_reissued_at":"2026-07-05T11:49:39.124564Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:49:39.124564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Behaviorally Adaptive Multi-Robot Hazard Localization in Failure-Prone, Communication-Denied Environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.RO","authors_text":"Aamodh Suresh, Alkesh K. Srivastava, Carlos Nieto-Granda","submitted_at":"2025-08-06T15:23:22Z","abstract_excerpt":"We address the challenge of multi-robot autonomous hazard mapping in high-risk, failure-prone, communication-denied environments such as post-disaster zones, underground mines, caves, and planetary surfaces. In these missions, robots must explore and map hazards while minimizing the risk of failure due to environmental threats or hardware limitations. We introduce a behavior-adaptive, information-theoretic planning framework for multi-robot teams grounded in the concept of Behavioral Entropy (BE), that generalizes Shannon entropy (SE) to capture diverse human-like uncertainty evaluations. Buil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.04537","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/2508.04537/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":"2508.04537","created_at":"2026-07-05T11:49:39.124628+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.04537v1","created_at":"2026-07-05T11:49:39.124628+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.04537","created_at":"2026-07-05T11:49:39.124628+00:00"},{"alias_kind":"pith_short_12","alias_value":"4VJYRWD4BBPR","created_at":"2026-07-05T11:49:39.124628+00:00"},{"alias_kind":"pith_short_16","alias_value":"4VJYRWD4BBPRQ4AU","created_at":"2026-07-05T11:49:39.124628+00:00"},{"alias_kind":"pith_short_8","alias_value":"4VJYRWD4","created_at":"2026-07-05T11:49:39.124628+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.02296","citing_title":"A Kinetic Theory of Encounter-Based Information Propagation in Multi-Robot Systems","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2605.16673","citing_title":"Bayesian Networks for Path-Based Sensors: Gathering Information and Path Planning in Communication Denied Environments","ref_index":25,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4VJYRWD4BBPRQ4AUTUOPMELZJC","json":"https://pith.science/pith/4VJYRWD4BBPRQ4AUTUOPMELZJC.json","graph_json":"https://pith.science/api/pith-number/4VJYRWD4BBPRQ4AUTUOPMELZJC/graph.json","events_json":"https://pith.science/api/pith-number/4VJYRWD4BBPRQ4AUTUOPMELZJC/events.json","paper":"https://pith.science/paper/4VJYRWD4"},"agent_actions":{"view_html":"https://pith.science/pith/4VJYRWD4BBPRQ4AUTUOPMELZJC","download_json":"https://pith.science/pith/4VJYRWD4BBPRQ4AUTUOPMELZJC.json","view_paper":"https://pith.science/paper/4VJYRWD4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.04537&json=true","fetch_graph":"https://pith.science/api/pith-number/4VJYRWD4BBPRQ4AUTUOPMELZJC/graph.json","fetch_events":"https://pith.science/api/pith-number/4VJYRWD4BBPRQ4AUTUOPMELZJC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4VJYRWD4BBPRQ4AUTUOPMELZJC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4VJYRWD4BBPRQ4AUTUOPMELZJC/action/storage_attestation","attest_author":"https://pith.science/pith/4VJYRWD4BBPRQ4AUTUOPMELZJC/action/author_attestation","sign_citation":"https://pith.science/pith/4VJYRWD4BBPRQ4AUTUOPMELZJC/action/citation_signature","submit_replication":"https://pith.science/pith/4VJYRWD4BBPRQ4AUTUOPMELZJC/action/replication_record"}},"created_at":"2026-07-05T11:49:39.124628+00:00","updated_at":"2026-07-05T11:49:39.124628+00:00"}