{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:FRJ5SPOMXFJXWMVYPOL3NEJBWM","short_pith_number":"pith:FRJ5SPOM","schema_version":"1.0","canonical_sha256":"2c53d93dccb9537b32b87b97b69121b30cbc298f4c813a431e040b3a0066662b","source":{"kind":"arxiv","id":"2605.14085","version":1},"attestation_state":"computed","paper":{"title":"Receding Horizon Multi-Agent Deceptive Path Planner","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Receding-horizon optimization with Boltzmann policies generates tunable stochastic deceptive paths for single and multiple agents.","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Brian M. Sadler, Rick S. Blum, Xubin Fang","submitted_at":"2026-05-13T20:10:35Z","abstract_excerpt":"Deceptive path planning enables autonomous agents to obscure their true goals from observers by deviating from an expected optimal path. Prior work largely solves full-horizon, end-to-end optimization for single agents, which is expensive to recompute online and difficult to scale or adapt en route. We propose a unified framework for deceptive path planning using a Boltzmann distribution, computing over short-horizon candidate trajectories within a receding-horizon loop. By param- By iterating a user-defined cost that captures deception, resources, and smoothness, and optionally includes coupl"},"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":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.14085","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2026-05-13T20:10:35Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"18ac75e40c1e901ddce0a09e903056e9618d2d9b42baee3d53d7873cfd9377fc","abstract_canon_sha256":"1fb4da8c9c704bf4f63eff9d8b4a0ec743b3d81e575e8ed3791d6e721bc66ad6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:12.271253Z","signature_b64":"L6E25tkEjAjFE/1l60d2nNj0oPmX8wA7n2OEHBfiC1XZdTMy8GFlvBFwsRmOdjsRRxC3/KpPlmBsWxPCAl0qCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c53d93dccb9537b32b87b97b69121b30cbc298f4c813a431e040b3a0066662b","last_reissued_at":"2026-05-17T23:39:12.270649Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:12.270649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Receding Horizon Multi-Agent Deceptive Path Planner","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Receding-horizon optimization with Boltzmann policies generates tunable stochastic deceptive paths for single and multiple agents.","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Brian M. Sadler, Rick S. Blum, Xubin Fang","submitted_at":"2026-05-13T20:10:35Z","abstract_excerpt":"Deceptive path planning enables autonomous agents to obscure their true goals from observers by deviating from an expected optimal path. Prior work largely solves full-horizon, end-to-end optimization for single agents, which is expensive to recompute online and difficult to scale or adapt en route. We propose a unified framework for deceptive path planning using a Boltzmann distribution, computing over short-horizon candidate trajectories within a receding-horizon loop. By param- By iterating a user-defined cost that captures deception, resources, and smoothness, and optionally includes coupl"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"By iterating a user-defined cost that captures deception, resources, and smoothness, and optionally includes coupling terms between agents, the framework yields stochastic policies that balance the tradeoff between optimal paths and deceptive deviation.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That short-horizon optimizations within a receding loop can maintain effective deception without the global view of full-horizon methods, particularly when environmental changes occur.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A receding-horizon planner uses Boltzmann distributions over short trajectories to generate tunable deceptive paths for multiple agents.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Receding-horizon optimization with Boltzmann policies generates tunable stochastic deceptive paths for single and multiple agents.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"4033b98b682b9860f089a4835d306fefbbb3154318e80b2d9bc383958b5f57b9"},"source":{"id":"2605.14085","kind":"arxiv","version":1},"verdict":{"id":"0646a103-b9e6-4fca-accd-ad5c54256cc5","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T05:20:56.105703Z","strongest_claim":"By iterating a user-defined cost that captures deception, resources, and smoothness, and optionally includes coupling terms between agents, the framework yields stochastic policies that balance the tradeoff between optimal paths and deceptive deviation.","one_line_summary":"A receding-horizon planner uses Boltzmann distributions over short trajectories to generate tunable deceptive paths for multiple agents.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That short-horizon optimizations within a receding loop can maintain effective deception without the global view of full-horizon methods, particularly when environmental changes occur.","pith_extraction_headline":"Receding-horizon optimization with Boltzmann policies generates tunable stochastic deceptive paths for single and multiple agents."},"references":{"count":28,"sample":[{"doi":"","year":2005,"title":"Toward a systems- and control-oriented agent framework,","work_id":"34bd9c35-219a-4e52-906c-25b987f13493","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Mission-Driven Trajectory Homotopy to Explore Dynamic Coverage of USV–UA V Sys- tems,","work_id":"accd8404-d131-43b6-a2b3-f9aca524e90e","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"A Universal Reactive Approach for Graph-Based Persistent Path Planning Problems With Temporal Logic Constraints,","work_id":"b18aab38-b54e-4e43-81be-47cb026bce9e","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"Distributed Search Planning in 3-D Environments With a Dynamically Varying Number of Agents,","work_id":"b870c928-8748-4ff9-aab4-3d9615b6f4d6","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"Decentralized Motion Planning for Multiagent Collaboration Under Coupled LTL Task Specifications,","work_id":"5c4125b8-3fd2-4f45-8f2f-3586b438e148","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":28,"snapshot_sha256":"2746765469a05e1ab15784ede6bed2be9d1f0b6e9d9d474f6608ddad28fe8202","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":"2605.14085","created_at":"2026-05-17T23:39:12.270741+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.14085v1","created_at":"2026-05-17T23:39:12.270741+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14085","created_at":"2026-05-17T23:39:12.270741+00:00"},{"alias_kind":"pith_short_12","alias_value":"FRJ5SPOMXFJX","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"FRJ5SPOMXFJXWMVY","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"FRJ5SPOM","created_at":"2026-05-18T12:33:37.589309+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/FRJ5SPOMXFJXWMVYPOL3NEJBWM","json":"https://pith.science/pith/FRJ5SPOMXFJXWMVYPOL3NEJBWM.json","graph_json":"https://pith.science/api/pith-number/FRJ5SPOMXFJXWMVYPOL3NEJBWM/graph.json","events_json":"https://pith.science/api/pith-number/FRJ5SPOMXFJXWMVYPOL3NEJBWM/events.json","paper":"https://pith.science/paper/FRJ5SPOM"},"agent_actions":{"view_html":"https://pith.science/pith/FRJ5SPOMXFJXWMVYPOL3NEJBWM","download_json":"https://pith.science/pith/FRJ5SPOMXFJXWMVYPOL3NEJBWM.json","view_paper":"https://pith.science/paper/FRJ5SPOM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.14085&json=true","fetch_graph":"https://pith.science/api/pith-number/FRJ5SPOMXFJXWMVYPOL3NEJBWM/graph.json","fetch_events":"https://pith.science/api/pith-number/FRJ5SPOMXFJXWMVYPOL3NEJBWM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FRJ5SPOMXFJXWMVYPOL3NEJBWM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FRJ5SPOMXFJXWMVYPOL3NEJBWM/action/storage_attestation","attest_author":"https://pith.science/pith/FRJ5SPOMXFJXWMVYPOL3NEJBWM/action/author_attestation","sign_citation":"https://pith.science/pith/FRJ5SPOMXFJXWMVYPOL3NEJBWM/action/citation_signature","submit_replication":"https://pith.science/pith/FRJ5SPOMXFJXWMVYPOL3NEJBWM/action/replication_record"}},"created_at":"2026-05-17T23:39:12.270741+00:00","updated_at":"2026-05-17T23:39:12.270741+00:00"}