{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:2WOQ3BYFLGP6KP6IQGYV4UQ77R","short_pith_number":"pith:2WOQ3BYF","canonical_record":{"source":{"id":"2502.05526","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-02-08T11:13:07Z","cross_cats_sorted":["cs.AI","cs.LG","cs.MA"],"title_canon_sha256":"a8b7281561b1c0d0dcfce5866eedef20eacef97ee50de9102f9cdbc11f6a3628","abstract_canon_sha256":"0496d3ace31cac3ab5a39a6fbf8904ba383ce06751192c696b87cd70d0cdc48e"},"schema_version":"1.0"},"canonical_sha256":"d59d0d8705599fe53fc881b15e521ffc4bdb7d08fa75d00b62ce5933e4106d17","source":{"kind":"arxiv","id":"2502.05526","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.05526","created_at":"2026-07-05T10:11:39Z"},{"alias_kind":"arxiv_version","alias_value":"2502.05526v1","created_at":"2026-07-05T10:11:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.05526","created_at":"2026-07-05T10:11:39Z"},{"alias_kind":"pith_short_12","alias_value":"2WOQ3BYFLGP6","created_at":"2026-07-05T10:11:39Z"},{"alias_kind":"pith_short_16","alias_value":"2WOQ3BYFLGP6KP6I","created_at":"2026-07-05T10:11:39Z"},{"alias_kind":"pith_short_8","alias_value":"2WOQ3BYF","created_at":"2026-07-05T10:11:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:2WOQ3BYFLGP6KP6IQGYV4UQ77R","target":"record","payload":{"canonical_record":{"source":{"id":"2502.05526","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-02-08T11:13:07Z","cross_cats_sorted":["cs.AI","cs.LG","cs.MA"],"title_canon_sha256":"a8b7281561b1c0d0dcfce5866eedef20eacef97ee50de9102f9cdbc11f6a3628","abstract_canon_sha256":"0496d3ace31cac3ab5a39a6fbf8904ba383ce06751192c696b87cd70d0cdc48e"},"schema_version":"1.0"},"canonical_sha256":"d59d0d8705599fe53fc881b15e521ffc4bdb7d08fa75d00b62ce5933e4106d17","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:11:39.420853Z","signature_b64":"5EPHolS4lnwSomrss83PD9UJa6ld4hGeLp+I0rxjvM5e4yuyuxYCVbWVEALDNDs1R/yF1a1oSwcotDqq0MfOCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d59d0d8705599fe53fc881b15e521ffc4bdb7d08fa75d00b62ce5933e4106d17","last_reissued_at":"2026-07-05T10:11:39.420466Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:11:39.420466Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.05526","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-05T10:11:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ajIe+bXWVXKEJiueQPA+LvM5vVEcgSoO9fiB3E06H50i3/eeO0NNa99Q0jBrzBVuVshmsybhzUxBmq2M0CY/Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T15:42:19.245308Z"},"content_sha256":"450e9603620a2be5b68b3d72af1763009dca828d90a6c7de255b244307288746","schema_version":"1.0","event_id":"sha256:450e9603620a2be5b68b3d72af1763009dca828d90a6c7de255b244307288746"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:2WOQ3BYFLGP6KP6IQGYV4UQ77R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Learning Scalable Agile Dynamic Motion Planning for Robosoccer Teams with Policy Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.MA"],"primary_cat":"cs.RO","authors_text":"Batuhan Altundas, Brandon Ho, Matthew Gombolay","submitted_at":"2025-02-08T11:13:07Z","abstract_excerpt":"In fast-paced, ever-changing environments, dynamic Motion Planning for Multi-Agent Systems in the presence of obstacles is a universal and unsolved problem. Be it from path planning around obstacles to the movement of robotic arms, or in planning navigation of robot teams in settings such as Robosoccer, dynamic motion planning is needed to avoid collisions while reaching the targeted destination when multiple agents occupy the same area. In continuous domains where the world changes quickly, existing classical Motion Planning algorithms such as RRT* and A* become computationally expensive to r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.05526","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/2502.05526/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-05T10:11:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TMGQ4Tay0LIVOQISumAoMNvgGIqEWQ1xMBahRgeLTPcFUW/pu4e0S0cr/W8Na9qZY+AM5avr7yD2T/qtqfaVBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T15:42:19.245808Z"},"content_sha256":"e735425be2235e01a8d8b4f87122be29a7f680528d36d13a0fd5768d800e7d2a","schema_version":"1.0","event_id":"sha256:e735425be2235e01a8d8b4f87122be29a7f680528d36d13a0fd5768d800e7d2a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2WOQ3BYFLGP6KP6IQGYV4UQ77R/bundle.json","state_url":"https://pith.science/pith/2WOQ3BYFLGP6KP6IQGYV4UQ77R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2WOQ3BYFLGP6KP6IQGYV4UQ77R/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-09T15:42:19Z","links":{"resolver":"https://pith.science/pith/2WOQ3BYFLGP6KP6IQGYV4UQ77R","bundle":"https://pith.science/pith/2WOQ3BYFLGP6KP6IQGYV4UQ77R/bundle.json","state":"https://pith.science/pith/2WOQ3BYFLGP6KP6IQGYV4UQ77R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2WOQ3BYFLGP6KP6IQGYV4UQ77R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:2WOQ3BYFLGP6KP6IQGYV4UQ77R","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":"0496d3ace31cac3ab5a39a6fbf8904ba383ce06751192c696b87cd70d0cdc48e","cross_cats_sorted":["cs.AI","cs.LG","cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-02-08T11:13:07Z","title_canon_sha256":"a8b7281561b1c0d0dcfce5866eedef20eacef97ee50de9102f9cdbc11f6a3628"},"schema_version":"1.0","source":{"id":"2502.05526","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.05526","created_at":"2026-07-05T10:11:39Z"},{"alias_kind":"arxiv_version","alias_value":"2502.05526v1","created_at":"2026-07-05T10:11:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.05526","created_at":"2026-07-05T10:11:39Z"},{"alias_kind":"pith_short_12","alias_value":"2WOQ3BYFLGP6","created_at":"2026-07-05T10:11:39Z"},{"alias_kind":"pith_short_16","alias_value":"2WOQ3BYFLGP6KP6I","created_at":"2026-07-05T10:11:39Z"},{"alias_kind":"pith_short_8","alias_value":"2WOQ3BYF","created_at":"2026-07-05T10:11:39Z"}],"graph_snapshots":[{"event_id":"sha256:e735425be2235e01a8d8b4f87122be29a7f680528d36d13a0fd5768d800e7d2a","target":"graph","created_at":"2026-07-05T10:11:39Z","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/2502.05526/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In fast-paced, ever-changing environments, dynamic Motion Planning for Multi-Agent Systems in the presence of obstacles is a universal and unsolved problem. Be it from path planning around obstacles to the movement of robotic arms, or in planning navigation of robot teams in settings such as Robosoccer, dynamic motion planning is needed to avoid collisions while reaching the targeted destination when multiple agents occupy the same area. In continuous domains where the world changes quickly, existing classical Motion Planning algorithms such as RRT* and A* become computationally expensive to r","authors_text":"Batuhan Altundas, Brandon Ho, Matthew Gombolay","cross_cats":["cs.AI","cs.LG","cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-02-08T11:13:07Z","title":"Towards Learning Scalable Agile Dynamic Motion Planning for Robosoccer Teams with Policy Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.05526","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:450e9603620a2be5b68b3d72af1763009dca828d90a6c7de255b244307288746","target":"record","created_at":"2026-07-05T10:11:39Z","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":"0496d3ace31cac3ab5a39a6fbf8904ba383ce06751192c696b87cd70d0cdc48e","cross_cats_sorted":["cs.AI","cs.LG","cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-02-08T11:13:07Z","title_canon_sha256":"a8b7281561b1c0d0dcfce5866eedef20eacef97ee50de9102f9cdbc11f6a3628"},"schema_version":"1.0","source":{"id":"2502.05526","kind":"arxiv","version":1}},"canonical_sha256":"d59d0d8705599fe53fc881b15e521ffc4bdb7d08fa75d00b62ce5933e4106d17","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d59d0d8705599fe53fc881b15e521ffc4bdb7d08fa75d00b62ce5933e4106d17","first_computed_at":"2026-07-05T10:11:39.420466Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:11:39.420466Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5EPHolS4lnwSomrss83PD9UJa6ld4hGeLp+I0rxjvM5e4yuyuxYCVbWVEALDNDs1R/yF1a1oSwcotDqq0MfOCw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:11:39.420853Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.05526","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:450e9603620a2be5b68b3d72af1763009dca828d90a6c7de255b244307288746","sha256:e735425be2235e01a8d8b4f87122be29a7f680528d36d13a0fd5768d800e7d2a"],"state_sha256":"583405dde2a6d7ffa7022ac58c144bfb89619162de4dce3477e765e8b23821e3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nmPAjN4K3GlHegC4WETp5lNNJl3b5CLqz+AOzY98WK6oM2n6THELDfzLhFP1cyezywbFrHEzSku16TQbRAXRBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T15:42:19.251000Z","bundle_sha256":"404d1dff8edaafecd5c1a37b3cbc96a22f37acd433640dcad9266ac538116d5a"}}