{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:EGC5I7ESGATJE435WYZ5ZWEBMS","short_pith_number":"pith:EGC5I7ES","schema_version":"1.0","canonical_sha256":"2185d47c92302692737db633dcd881649cfb8703402169074909bc700befa4fb","source":{"kind":"arxiv","id":"2206.01306","version":2},"attestation_state":"computed","paper":{"title":"Deceptive Planning for Resource Allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"math.OC","authors_text":"Brian M. Sadler, Mustafa O. Karabag, Shenghui Chen, Ufuk Topcu, Yagiz Savas","submitted_at":"2022-06-02T21:23:16Z","abstract_excerpt":"We consider a team of autonomous agents that navigate in an adversarial environment and aim to achieve a task by allocating their resources over a set of target locations. An adversary in the environment observes the autonomous team's behavior to infer their objective and responds against the team. In this setting, we propose strategies for controlling the density of the autonomous team so that they can deceive the adversary regarding their objective while achieving the desired final resource allocation. We first develop a prediction algorithm based on the principle of maximum entropy to expre"},"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":"2206.01306","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-06-02T21:23:16Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"1b4f45d996f60832f2cdb7ecafc0dc96620ba026b0b75676d225d3c8c0c0aa62","abstract_canon_sha256":"88e5a691da219dc81c02f7b163b369c675d84ab6d4e4df131ec242ab95205e0c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:57:38.052683Z","signature_b64":"auvIV1KbMiE4mVoToGinIWqomloXmHTx44zoAO8c+W5PPS4F1jyIZ+AndsnMxAwCem2Dz4emPHqvJmJpsyaCBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2185d47c92302692737db633dcd881649cfb8703402169074909bc700befa4fb","last_reissued_at":"2026-07-05T06:57:38.052194Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:57:38.052194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deceptive Planning for Resource Allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"math.OC","authors_text":"Brian M. Sadler, Mustafa O. Karabag, Shenghui Chen, Ufuk Topcu, Yagiz Savas","submitted_at":"2022-06-02T21:23:16Z","abstract_excerpt":"We consider a team of autonomous agents that navigate in an adversarial environment and aim to achieve a task by allocating their resources over a set of target locations. An adversary in the environment observes the autonomous team's behavior to infer their objective and responds against the team. In this setting, we propose strategies for controlling the density of the autonomous team so that they can deceive the adversary regarding their objective while achieving the desired final resource allocation. We first develop a prediction algorithm based on the principle of maximum entropy to expre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.01306","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2206.01306/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":"2206.01306","created_at":"2026-07-05T06:57:38.052252+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.01306v2","created_at":"2026-07-05T06:57:38.052252+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.01306","created_at":"2026-07-05T06:57:38.052252+00:00"},{"alias_kind":"pith_short_12","alias_value":"EGC5I7ESGATJ","created_at":"2026-07-05T06:57:38.052252+00:00"},{"alias_kind":"pith_short_16","alias_value":"EGC5I7ESGATJE435","created_at":"2026-07-05T06:57:38.052252+00:00"},{"alias_kind":"pith_short_8","alias_value":"EGC5I7ES","created_at":"2026-07-05T06:57:38.052252+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.14085","citing_title":"Receding Horizon Multi-Agent Deceptive Path Planner","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EGC5I7ESGATJE435WYZ5ZWEBMS","json":"https://pith.science/pith/EGC5I7ESGATJE435WYZ5ZWEBMS.json","graph_json":"https://pith.science/api/pith-number/EGC5I7ESGATJE435WYZ5ZWEBMS/graph.json","events_json":"https://pith.science/api/pith-number/EGC5I7ESGATJE435WYZ5ZWEBMS/events.json","paper":"https://pith.science/paper/EGC5I7ES"},"agent_actions":{"view_html":"https://pith.science/pith/EGC5I7ESGATJE435WYZ5ZWEBMS","download_json":"https://pith.science/pith/EGC5I7ESGATJE435WYZ5ZWEBMS.json","view_paper":"https://pith.science/paper/EGC5I7ES","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.01306&json=true","fetch_graph":"https://pith.science/api/pith-number/EGC5I7ESGATJE435WYZ5ZWEBMS/graph.json","fetch_events":"https://pith.science/api/pith-number/EGC5I7ESGATJE435WYZ5ZWEBMS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EGC5I7ESGATJE435WYZ5ZWEBMS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EGC5I7ESGATJE435WYZ5ZWEBMS/action/storage_attestation","attest_author":"https://pith.science/pith/EGC5I7ESGATJE435WYZ5ZWEBMS/action/author_attestation","sign_citation":"https://pith.science/pith/EGC5I7ESGATJE435WYZ5ZWEBMS/action/citation_signature","submit_replication":"https://pith.science/pith/EGC5I7ESGATJE435WYZ5ZWEBMS/action/replication_record"}},"created_at":"2026-07-05T06:57:38.052252+00:00","updated_at":"2026-07-05T06:57:38.052252+00:00"}