{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:FWANFQQHXPRZ7NGYJMA2L2BS5U","short_pith_number":"pith:FWANFQQH","canonical_record":{"source":{"id":"2212.02010","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2022-12-05T03:46:06Z","cross_cats_sorted":["cs.AI","cs.GT"],"title_canon_sha256":"460fbb1fd6e580e7994235ab9f54a5c9574297600247baee8e5321eaf0048906","abstract_canon_sha256":"e9eb08bcc9a9e230a238fb73f08959f57f49b8ed79e68d740e3e58397c574f2d"},"schema_version":"1.0"},"canonical_sha256":"2d80d2c207bbe39fb4d84b01a5e832ed3bd200f28a8f752d8359045c5c16de14","source":{"kind":"arxiv","id":"2212.02010","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.02010","created_at":"2026-07-05T05:22:19Z"},{"alias_kind":"arxiv_version","alias_value":"2212.02010v1","created_at":"2026-07-05T05:22:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.02010","created_at":"2026-07-05T05:22:19Z"},{"alias_kind":"pith_short_12","alias_value":"FWANFQQHXPRZ","created_at":"2026-07-05T05:22:19Z"},{"alias_kind":"pith_short_16","alias_value":"FWANFQQHXPRZ7NGY","created_at":"2026-07-05T05:22:19Z"},{"alias_kind":"pith_short_8","alias_value":"FWANFQQH","created_at":"2026-07-05T05:22:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:FWANFQQHXPRZ7NGYJMA2L2BS5U","target":"record","payload":{"canonical_record":{"source":{"id":"2212.02010","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2022-12-05T03:46:06Z","cross_cats_sorted":["cs.AI","cs.GT"],"title_canon_sha256":"460fbb1fd6e580e7994235ab9f54a5c9574297600247baee8e5321eaf0048906","abstract_canon_sha256":"e9eb08bcc9a9e230a238fb73f08959f57f49b8ed79e68d740e3e58397c574f2d"},"schema_version":"1.0"},"canonical_sha256":"2d80d2c207bbe39fb4d84b01a5e832ed3bd200f28a8f752d8359045c5c16de14","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:22:19.508127Z","signature_b64":"vspI/MxejSbGCdi/G4VD4GEWJa8M29sA21bn2tmFeQi0JoWlGUnjwYDHleihCGnIwW5SD/lcZf4HtQifPd1+Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d80d2c207bbe39fb4d84b01a5e832ed3bd200f28a8f752d8359045c5c16de14","last_reissued_at":"2026-07-05T05:22:19.507681Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:22:19.507681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2212.02010","source_version":1,"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-07-05T05:22:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T7MsQBEB23vn9Ze+X2odis80ItA8b/vyiYP23amYlG05rDpbb0a50XLr6mexICUGZWGOzfvmFQF37cKLO3E2Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T04:03:17.137754Z"},"content_sha256":"37b418b7247f71dd721b58d326299ee80861bae0da896a25385dc707435ebc44","schema_version":"1.0","event_id":"sha256:37b418b7247f71dd721b58d326299ee80861bae0da896a25385dc707435ebc44"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:FWANFQQHXPRZ7NGYJMA2L2BS5U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi Agent Path Finding using Evolutionary Game Theory","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.GT"],"primary_cat":"cs.MA","authors_text":"Jyotirmoy V. Deshmukh, Sheryl Paul","submitted_at":"2022-12-05T03:46:06Z","abstract_excerpt":"In this paper, we consider the problem of path finding for a set of homogeneous and autonomous agents navigating a previously unknown stochastic environment. In our problem setting, each agent attempts to maximize a given utility function while respecting safety properties. Our solution is based on ideas from evolutionary game theory, namely replicating policies that perform well and diminishing ones that do not. We do a comprehensive comparison with related multiagent planning methods, and show that our technique beats state of the art RL algorithms in minimizing path length by nearly 30% in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.02010","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/2212.02010/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":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:22:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GjiJCHPhag8/Sc0XRQXGwn+LOwXJZWXLkH55hkj+ZgJIHesQLunNW2kS6vXL7Xqr9LbAP3yLH2wKATHYXp9uCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T04:03:17.138284Z"},"content_sha256":"3fedd4419bdad6413b2e71ae258dbfe50076964147762629aaf991b432b166d7","schema_version":"1.0","event_id":"sha256:3fedd4419bdad6413b2e71ae258dbfe50076964147762629aaf991b432b166d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FWANFQQHXPRZ7NGYJMA2L2BS5U/bundle.json","state_url":"https://pith.science/pith/FWANFQQHXPRZ7NGYJMA2L2BS5U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FWANFQQHXPRZ7NGYJMA2L2BS5U/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-08-09T04:03:17Z","links":{"resolver":"https://pith.science/pith/FWANFQQHXPRZ7NGYJMA2L2BS5U","bundle":"https://pith.science/pith/FWANFQQHXPRZ7NGYJMA2L2BS5U/bundle.json","state":"https://pith.science/pith/FWANFQQHXPRZ7NGYJMA2L2BS5U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FWANFQQHXPRZ7NGYJMA2L2BS5U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:FWANFQQHXPRZ7NGYJMA2L2BS5U","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":"e9eb08bcc9a9e230a238fb73f08959f57f49b8ed79e68d740e3e58397c574f2d","cross_cats_sorted":["cs.AI","cs.GT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2022-12-05T03:46:06Z","title_canon_sha256":"460fbb1fd6e580e7994235ab9f54a5c9574297600247baee8e5321eaf0048906"},"schema_version":"1.0","source":{"id":"2212.02010","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.02010","created_at":"2026-07-05T05:22:19Z"},{"alias_kind":"arxiv_version","alias_value":"2212.02010v1","created_at":"2026-07-05T05:22:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.02010","created_at":"2026-07-05T05:22:19Z"},{"alias_kind":"pith_short_12","alias_value":"FWANFQQHXPRZ","created_at":"2026-07-05T05:22:19Z"},{"alias_kind":"pith_short_16","alias_value":"FWANFQQHXPRZ7NGY","created_at":"2026-07-05T05:22:19Z"},{"alias_kind":"pith_short_8","alias_value":"FWANFQQH","created_at":"2026-07-05T05:22:19Z"}],"graph_snapshots":[{"event_id":"sha256:3fedd4419bdad6413b2e71ae258dbfe50076964147762629aaf991b432b166d7","target":"graph","created_at":"2026-07-05T05:22:19Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2212.02010/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we consider the problem of path finding for a set of homogeneous and autonomous agents navigating a previously unknown stochastic environment. In our problem setting, each agent attempts to maximize a given utility function while respecting safety properties. Our solution is based on ideas from evolutionary game theory, namely replicating policies that perform well and diminishing ones that do not. We do a comprehensive comparison with related multiagent planning methods, and show that our technique beats state of the art RL algorithms in minimizing path length by nearly 30% in ","authors_text":"Jyotirmoy V. Deshmukh, Sheryl Paul","cross_cats":["cs.AI","cs.GT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2022-12-05T03:46:06Z","title":"Multi Agent Path Finding using Evolutionary Game Theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.02010","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:37b418b7247f71dd721b58d326299ee80861bae0da896a25385dc707435ebc44","target":"record","created_at":"2026-07-05T05:22:19Z","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":"e9eb08bcc9a9e230a238fb73f08959f57f49b8ed79e68d740e3e58397c574f2d","cross_cats_sorted":["cs.AI","cs.GT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2022-12-05T03:46:06Z","title_canon_sha256":"460fbb1fd6e580e7994235ab9f54a5c9574297600247baee8e5321eaf0048906"},"schema_version":"1.0","source":{"id":"2212.02010","kind":"arxiv","version":1}},"canonical_sha256":"2d80d2c207bbe39fb4d84b01a5e832ed3bd200f28a8f752d8359045c5c16de14","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d80d2c207bbe39fb4d84b01a5e832ed3bd200f28a8f752d8359045c5c16de14","first_computed_at":"2026-07-05T05:22:19.507681Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:22:19.507681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vspI/MxejSbGCdi/G4VD4GEWJa8M29sA21bn2tmFeQi0JoWlGUnjwYDHleihCGnIwW5SD/lcZf4HtQifPd1+Bw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:22:19.508127Z","signed_message":"canonical_sha256_bytes"},"source_id":"2212.02010","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37b418b7247f71dd721b58d326299ee80861bae0da896a25385dc707435ebc44","sha256:3fedd4419bdad6413b2e71ae258dbfe50076964147762629aaf991b432b166d7"],"state_sha256":"94eef4cccf55bff73a1ccbb2e00140e12217d7e77d10e91f0b3ed32a86a73711"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qMnY0Lu76h1FniKUU45JUuTuvErQy25xgMLpye5doMm+45e/Z9EMyaDo4ZNUfNc7HF1Q5fwjM38QBeU+qrqaCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T04:03:17.141515Z","bundle_sha256":"78bd951d1fb4e538480aae7eb5e0f8549dffd82a85c053ab9c7c0c24255d6ff9"}}