{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:F7GIKXW34NVUJIGN6BLG2NL7PD","short_pith_number":"pith:F7GIKXW3","schema_version":"1.0","canonical_sha256":"2fcc855edbe36b44a0cdf0566d357f78de26e923178fba8c3016b47d6d8e00fc","source":{"kind":"arxiv","id":"2604.03042","version":2},"attestation_state":"computed","paper":{"title":"Enhancing Multi-Robot Exploration Using Probabilistic Frontier Prioritization with Dirichlet Process Gaussian Mixtures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A Dirichlet process Gaussian mixture model ranks frontiers probabilistically to improve multi-robot exploration efficiency.","cross_cats":[],"primary_cat":"cs.RO","authors_text":"John Lewis Devassy, M\\'ario A. T. Figueiredo, Meysam Basiri, Pedro U. Lima","submitted_at":"2026-04-03T13:51:23Z","abstract_excerpt":"Multi-agent autonomous exploration is essential for applications such as environmental monitoring, search and rescue, and industrial-scale surveillance. However, effective coordination under communication constraints remains a significant challenge. Frontier exploration algorithms analyze the boundary between the known and unknown regions to determine the next-best view that maximizes exploratory gain. This article proposes an enhancement to existing frontier-based exploration algorithms by introducing a probabilistic approach to frontier prioritization. By leveraging Dirichlet process Gaussia"},"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":"2604.03042","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-04-03T13:51:23Z","cross_cats_sorted":[],"title_canon_sha256":"5962fa033649b57f1ebed0d5ee432e74ce13cf9ae6fc893a7b3556a2109ea0a8","abstract_canon_sha256":"0986d4ff6248b56ccba6aedf786d8afd06c23c26ef53a7708557783ba010d05b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-05T01:15:23.409112Z","signature_b64":"XYf+4DQ1jvFdaEcenM0Jnob2p8uw/xht4jY8Kz7NVct7ofQlfR34yRtq+tn6cLphTI3bSI2alf3bT/B2tFI7Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fcc855edbe36b44a0cdf0566d357f78de26e923178fba8c3016b47d6d8e00fc","last_reissued_at":"2026-06-05T01:15:23.408616Z","signature_status":"signed_v1","first_computed_at":"2026-06-05T01:15:23.408616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enhancing Multi-Robot Exploration Using Probabilistic Frontier Prioritization with Dirichlet Process Gaussian Mixtures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A Dirichlet process Gaussian mixture model ranks frontiers probabilistically to improve multi-robot exploration efficiency.","cross_cats":[],"primary_cat":"cs.RO","authors_text":"John Lewis Devassy, M\\'ario A. T. Figueiredo, Meysam Basiri, Pedro U. Lima","submitted_at":"2026-04-03T13:51:23Z","abstract_excerpt":"Multi-agent autonomous exploration is essential for applications such as environmental monitoring, search and rescue, and industrial-scale surveillance. However, effective coordination under communication constraints remains a significant challenge. Frontier exploration algorithms analyze the boundary between the known and unknown regions to determine the next-best view that maximizes exploratory gain. This article proposes an enhancement to existing frontier-based exploration algorithms by introducing a probabilistic approach to frontier prioritization. By leveraging Dirichlet process Gaussia"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"The proposed enhancement, integrated into two state-of-the-art multi-agent exploration algorithms, consistently improves performance across environments of varying clutter, communication constraints, and team sizes. Simulations showcase an average gain of 10% and 14% for the two algorithms across all combinations.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the DP-GMM probabilistic formulation of information gain reliably produces superior frontier rankings compared to the baseline algorithms without introducing unaccounted computational costs or failures in real-world sensor noise.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"DP-GMM based probabilistic frontier prioritization enhances two multi-agent exploration algorithms with average gains of 10% and 14% in simulations across varied conditions and real dual-drone tests.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A Dirichlet process Gaussian mixture model ranks frontiers probabilistically to improve multi-robot exploration efficiency.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"ea39e4bd009274e7450a3b1c98d6cd5416b9ca4a94b495b3318eb119c2228e82"},"source":{"id":"2604.03042","kind":"arxiv","version":2},"verdict":{"id":"143cd074-eabe-4472-9be7-9726529871c5","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-13T19:17:35.877077Z","strongest_claim":"The proposed enhancement, integrated into two state-of-the-art multi-agent exploration algorithms, consistently improves performance across environments of varying clutter, communication constraints, and team sizes. Simulations showcase an average gain of 10% and 14% for the two algorithms across all combinations.","one_line_summary":"DP-GMM based probabilistic frontier prioritization enhances two multi-agent exploration algorithms with average gains of 10% and 14% in simulations across varied conditions and real dual-drone tests.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the DP-GMM probabilistic formulation of information gain reliably produces superior frontier rankings compared to the baseline algorithms without introducing unaccounted computational costs or failures in real-world sensor noise.","pith_extraction_headline":"A Dirichlet process Gaussian mixture model ranks frontiers probabilistically to improve multi-robot exploration efficiency."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.03042/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":"2604.03042","created_at":"2026-06-05T01:15:23.408675+00:00"},{"alias_kind":"arxiv_version","alias_value":"2604.03042v2","created_at":"2026-06-05T01:15:23.408675+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.03042","created_at":"2026-06-05T01:15:23.408675+00:00"},{"alias_kind":"pith_short_12","alias_value":"F7GIKXW34NVU","created_at":"2026-06-05T01:15:23.408675+00:00"},{"alias_kind":"pith_short_16","alias_value":"F7GIKXW34NVUJIGN","created_at":"2026-06-05T01:15:23.408675+00:00"},{"alias_kind":"pith_short_8","alias_value":"F7GIKXW3","created_at":"2026-06-05T01:15:23.408675+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/F7GIKXW34NVUJIGN6BLG2NL7PD","json":"https://pith.science/pith/F7GIKXW34NVUJIGN6BLG2NL7PD.json","graph_json":"https://pith.science/api/pith-number/F7GIKXW34NVUJIGN6BLG2NL7PD/graph.json","events_json":"https://pith.science/api/pith-number/F7GIKXW34NVUJIGN6BLG2NL7PD/events.json","paper":"https://pith.science/paper/F7GIKXW3"},"agent_actions":{"view_html":"https://pith.science/pith/F7GIKXW34NVUJIGN6BLG2NL7PD","download_json":"https://pith.science/pith/F7GIKXW34NVUJIGN6BLG2NL7PD.json","view_paper":"https://pith.science/paper/F7GIKXW3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2604.03042&json=true","fetch_graph":"https://pith.science/api/pith-number/F7GIKXW34NVUJIGN6BLG2NL7PD/graph.json","fetch_events":"https://pith.science/api/pith-number/F7GIKXW34NVUJIGN6BLG2NL7PD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F7GIKXW34NVUJIGN6BLG2NL7PD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F7GIKXW34NVUJIGN6BLG2NL7PD/action/storage_attestation","attest_author":"https://pith.science/pith/F7GIKXW34NVUJIGN6BLG2NL7PD/action/author_attestation","sign_citation":"https://pith.science/pith/F7GIKXW34NVUJIGN6BLG2NL7PD/action/citation_signature","submit_replication":"https://pith.science/pith/F7GIKXW34NVUJIGN6BLG2NL7PD/action/replication_record"}},"created_at":"2026-06-05T01:15:23.408675+00:00","updated_at":"2026-06-05T01:15:23.408675+00:00"}