{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:F7GIKXW34NVUJIGN6BLG2NL7PD","short_pith_number":"pith:F7GIKXW3","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"},"canonical_sha256":"2fcc855edbe36b44a0cdf0566d357f78de26e923178fba8c3016b47d6d8e00fc","source":{"kind":"arxiv","id":"2604.03042","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.03042","created_at":"2026-06-05T01:15:23Z"},{"alias_kind":"arxiv_version","alias_value":"2604.03042v2","created_at":"2026-06-05T01:15:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.03042","created_at":"2026-06-05T01:15:23Z"},{"alias_kind":"pith_short_12","alias_value":"F7GIKXW34NVU","created_at":"2026-06-05T01:15:23Z"},{"alias_kind":"pith_short_16","alias_value":"F7GIKXW34NVUJIGN","created_at":"2026-06-05T01:15:23Z"},{"alias_kind":"pith_short_8","alias_value":"F7GIKXW3","created_at":"2026-06-05T01:15:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:F7GIKXW34NVUJIGN6BLG2NL7PD","target":"record","payload":{"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"},"canonical_sha256":"2fcc855edbe36b44a0cdf0566d357f78de26e923178fba8c3016b47d6d8e00fc","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"},"source_kind":"arxiv","source_id":"2604.03042","source_version":2,"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-06-05T01:15:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lPXiwrlKYC1H2sb9CdGZiyjBt43ISgH2xf9XvoJLuqEAaoy20oftlg0o92SiNjQBhLnrEye2p35h8oYQbvLnCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T16:08:20.967772Z"},"content_sha256":"d2f867d6e1c70142bef47cc14607e32b5a65b93d871c5d4104f1f1c21b45e0f2","schema_version":"1.0","event_id":"sha256:d2f867d6e1c70142bef47cc14607e32b5a65b93d871c5d4104f1f1c21b45e0f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:F7GIKXW34NVUJIGN6BLG2NL7PD","target":"graph","payload":{"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"},"verdict_id":"143cd074-eabe-4472-9be7-9726529871c5"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-05T01:15:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oYL6MkTA9G538hfug5jyafAax5co+QktABbrgdzPT4alsN1Vqc3lV9hhkcqGzySu9rFzD5J6rMIdNgmlYkmBCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T16:08:20.968214Z"},"content_sha256":"5e9bb93cca2a76fc80a3ed043ccbe9308af8c080eed64e2d40fa6f7557cbff32","schema_version":"1.0","event_id":"sha256:5e9bb93cca2a76fc80a3ed043ccbe9308af8c080eed64e2d40fa6f7557cbff32"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F7GIKXW34NVUJIGN6BLG2NL7PD/bundle.json","state_url":"https://pith.science/pith/F7GIKXW34NVUJIGN6BLG2NL7PD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F7GIKXW34NVUJIGN6BLG2NL7PD/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-06-27T16:08:20Z","links":{"resolver":"https://pith.science/pith/F7GIKXW34NVUJIGN6BLG2NL7PD","bundle":"https://pith.science/pith/F7GIKXW34NVUJIGN6BLG2NL7PD/bundle.json","state":"https://pith.science/pith/F7GIKXW34NVUJIGN6BLG2NL7PD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F7GIKXW34NVUJIGN6BLG2NL7PD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:F7GIKXW34NVUJIGN6BLG2NL7PD","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":"0986d4ff6248b56ccba6aedf786d8afd06c23c26ef53a7708557783ba010d05b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-04-03T13:51:23Z","title_canon_sha256":"5962fa033649b57f1ebed0d5ee432e74ce13cf9ae6fc893a7b3556a2109ea0a8"},"schema_version":"1.0","source":{"id":"2604.03042","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.03042","created_at":"2026-06-05T01:15:23Z"},{"alias_kind":"arxiv_version","alias_value":"2604.03042v2","created_at":"2026-06-05T01:15:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.03042","created_at":"2026-06-05T01:15:23Z"},{"alias_kind":"pith_short_12","alias_value":"F7GIKXW34NVU","created_at":"2026-06-05T01:15:23Z"},{"alias_kind":"pith_short_16","alias_value":"F7GIKXW34NVUJIGN","created_at":"2026-06-05T01:15:23Z"},{"alias_kind":"pith_short_8","alias_value":"F7GIKXW3","created_at":"2026-06-05T01:15:23Z"}],"graph_snapshots":[{"event_id":"sha256:5e9bb93cca2a76fc80a3ed043ccbe9308af8c080eed64e2d40fa6f7557cbff32","target":"graph","created_at":"2026-06-05T01:15:23Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A Dirichlet process Gaussian mixture model ranks frontiers probabilistically to improve multi-robot exploration efficiency."}],"snapshot_sha256":"ea39e4bd009274e7450a3b1c98d6cd5416b9ca4a94b495b3318eb119c2228e82"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2604.03042/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"John Lewis Devassy, M\\'ario A. T. Figueiredo, Meysam Basiri, Pedro U. Lima","cross_cats":[],"headline":"A Dirichlet process Gaussian mixture model ranks frontiers probabilistically to improve multi-robot exploration efficiency.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-04-03T13:51:23Z","title":"Enhancing Multi-Robot Exploration Using Probabilistic Frontier Prioritization with Dirichlet Process Gaussian Mixtures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.03042","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-13T19:17:35.877077Z","id":"143cd074-eabe-4472-9be7-9726529871c5","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"A Dirichlet process Gaussian mixture model ranks frontiers probabilistically to improve multi-robot exploration efficiency.","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.","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."}},"verdict_id":"143cd074-eabe-4472-9be7-9726529871c5"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d2f867d6e1c70142bef47cc14607e32b5a65b93d871c5d4104f1f1c21b45e0f2","target":"record","created_at":"2026-06-05T01:15:23Z","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":"0986d4ff6248b56ccba6aedf786d8afd06c23c26ef53a7708557783ba010d05b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-04-03T13:51:23Z","title_canon_sha256":"5962fa033649b57f1ebed0d5ee432e74ce13cf9ae6fc893a7b3556a2109ea0a8"},"schema_version":"1.0","source":{"id":"2604.03042","kind":"arxiv","version":2}},"canonical_sha256":"2fcc855edbe36b44a0cdf0566d357f78de26e923178fba8c3016b47d6d8e00fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2fcc855edbe36b44a0cdf0566d357f78de26e923178fba8c3016b47d6d8e00fc","first_computed_at":"2026-06-05T01:15:23.408616Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-05T01:15:23.408616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XYf+4DQ1jvFdaEcenM0Jnob2p8uw/xht4jY8Kz7NVct7ofQlfR34yRtq+tn6cLphTI3bSI2alf3bT/B2tFI7Ag==","signature_status":"signed_v1","signed_at":"2026-06-05T01:15:23.409112Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.03042","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d2f867d6e1c70142bef47cc14607e32b5a65b93d871c5d4104f1f1c21b45e0f2","sha256:5e9bb93cca2a76fc80a3ed043ccbe9308af8c080eed64e2d40fa6f7557cbff32"],"state_sha256":"9f77fe45e770fc349f375656c731ae15c49843fc9f5b79b5ab5317989b51e8e1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NOPjx2SmzyFnQH/9cZ+UtLHGXooqDPE+tv+pnMLUuFUCfow03JQMKx5r+DSu96JrCLHvgK+VRiNiu6FqluchCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T16:08:20.970554Z","bundle_sha256":"e826855af4a1eebf2d1ca582c2ff2c79aa93f6a4ffa625bf8b8199ca43e2368a"}}