{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:4YHJYNBK3424YBGEAPXLX43RYI","short_pith_number":"pith:4YHJYNBK","canonical_record":{"source":{"id":"2011.04240","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-11-09T08:14:28Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"451f93f3b6124e7e46df6c4220358446f9205d3565d47fce54c2708cc01334ce","abstract_canon_sha256":"b86946a5d04a55e7a5ae0cade5cf390cc8ec323e16e2890104e3f516b0ffee74"},"schema_version":"1.0"},"canonical_sha256":"e60e9c342adf35cc04c403eebbf371c23a2c4e9de1b21fa4e7fb884ca4f12d2a","source":{"kind":"arxiv","id":"2011.04240","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.04240","created_at":"2026-07-05T01:50:03Z"},{"alias_kind":"arxiv_version","alias_value":"2011.04240v1","created_at":"2026-07-05T01:50:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.04240","created_at":"2026-07-05T01:50:03Z"},{"alias_kind":"pith_short_12","alias_value":"4YHJYNBK3424","created_at":"2026-07-05T01:50:03Z"},{"alias_kind":"pith_short_16","alias_value":"4YHJYNBK3424YBGE","created_at":"2026-07-05T01:50:03Z"},{"alias_kind":"pith_short_8","alias_value":"4YHJYNBK","created_at":"2026-07-05T01:50:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:4YHJYNBK3424YBGEAPXLX43RYI","target":"record","payload":{"canonical_record":{"source":{"id":"2011.04240","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-11-09T08:14:28Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"451f93f3b6124e7e46df6c4220358446f9205d3565d47fce54c2708cc01334ce","abstract_canon_sha256":"b86946a5d04a55e7a5ae0cade5cf390cc8ec323e16e2890104e3f516b0ffee74"},"schema_version":"1.0"},"canonical_sha256":"e60e9c342adf35cc04c403eebbf371c23a2c4e9de1b21fa4e7fb884ca4f12d2a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:50:03.701138Z","signature_b64":"nkk8pjfHTYaeUVeXynShd2vNRVu+FEYVwywCocpsIvPjNwqU/pV0rux9DkA9HoKg40Y1LSkb2azLVUDaFaQ4Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e60e9c342adf35cc04c403eebbf371c23a2c4e9de1b21fa4e7fb884ca4f12d2a","last_reissued_at":"2026-07-05T01:50:03.700778Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:50:03.700778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2011.04240","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-05T01:50:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZVTUW0lsMJknHLMOrk/mjh+yC6Hr088u2nQM+JIHX/9KQREOgWMZLEmsHBxcLu0h+4+lqnsgzxKcoiQ3L1zJCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T15:50:13.561639Z"},"content_sha256":"852ed7ac0be0a557618b8b6413353c57a5a5dcb31688128bf9b6d936479b07ad","schema_version":"1.0","event_id":"sha256:852ed7ac0be0a557618b8b6413353c57a5a5dcb31688128bf9b6d936479b07ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:4YHJYNBK3424YBGEAPXLX43RYI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GPU Accelerated Convex Approximations for Fast Multi-Agent Trajectory Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.RO","authors_text":"Alvo Aabloo, Arun Kumar Singh, Fatemeh Rastgar, Houman Masnavi, Jatan Shrestha, Karl Kruusamae","submitted_at":"2020-11-09T08:14:28Z","abstract_excerpt":"In this paper, we present a computationally efficient trajectory optimizer that can exploit GPUs to jointly compute trajectories of tens of agents in under a second. At the heart of our optimizer is a novel reformulation of the non-convex collision avoidance constraints that reduces the core computation in each iteration to that of solving a large scale, convex, unconstrained Quadratic Program (QP). We also show that the matrix factorization/inverse computation associated with the QP needs to be done only once and can be done offline for a given number of agents. This further simplifies the so"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.04240","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/2011.04240/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-05T01:50:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"scX3/oCgqPUiJexfaBh0iyrVWRN4fjgIpsHreg4IJ9kNpA34Yc2d88OL9kuT+TW9KbnIhp0kCXlmnAFIFI0NAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T15:50:13.562136Z"},"content_sha256":"3c78f66e9d6f7939e94d06794d70f5fcffa1367bc5f07cd64f55a980c86acb75","schema_version":"1.0","event_id":"sha256:3c78f66e9d6f7939e94d06794d70f5fcffa1367bc5f07cd64f55a980c86acb75"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4YHJYNBK3424YBGEAPXLX43RYI/bundle.json","state_url":"https://pith.science/pith/4YHJYNBK3424YBGEAPXLX43RYI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4YHJYNBK3424YBGEAPXLX43RYI/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-03T15:50:13Z","links":{"resolver":"https://pith.science/pith/4YHJYNBK3424YBGEAPXLX43RYI","bundle":"https://pith.science/pith/4YHJYNBK3424YBGEAPXLX43RYI/bundle.json","state":"https://pith.science/pith/4YHJYNBK3424YBGEAPXLX43RYI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4YHJYNBK3424YBGEAPXLX43RYI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:4YHJYNBK3424YBGEAPXLX43RYI","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":"b86946a5d04a55e7a5ae0cade5cf390cc8ec323e16e2890104e3f516b0ffee74","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-11-09T08:14:28Z","title_canon_sha256":"451f93f3b6124e7e46df6c4220358446f9205d3565d47fce54c2708cc01334ce"},"schema_version":"1.0","source":{"id":"2011.04240","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.04240","created_at":"2026-07-05T01:50:03Z"},{"alias_kind":"arxiv_version","alias_value":"2011.04240v1","created_at":"2026-07-05T01:50:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.04240","created_at":"2026-07-05T01:50:03Z"},{"alias_kind":"pith_short_12","alias_value":"4YHJYNBK3424","created_at":"2026-07-05T01:50:03Z"},{"alias_kind":"pith_short_16","alias_value":"4YHJYNBK3424YBGE","created_at":"2026-07-05T01:50:03Z"},{"alias_kind":"pith_short_8","alias_value":"4YHJYNBK","created_at":"2026-07-05T01:50:03Z"}],"graph_snapshots":[{"event_id":"sha256:3c78f66e9d6f7939e94d06794d70f5fcffa1367bc5f07cd64f55a980c86acb75","target":"graph","created_at":"2026-07-05T01:50:03Z","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/2011.04240/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we present a computationally efficient trajectory optimizer that can exploit GPUs to jointly compute trajectories of tens of agents in under a second. At the heart of our optimizer is a novel reformulation of the non-convex collision avoidance constraints that reduces the core computation in each iteration to that of solving a large scale, convex, unconstrained Quadratic Program (QP). We also show that the matrix factorization/inverse computation associated with the QP needs to be done only once and can be done offline for a given number of agents. This further simplifies the so","authors_text":"Alvo Aabloo, Arun Kumar Singh, Fatemeh Rastgar, Houman Masnavi, Jatan Shrestha, Karl Kruusamae","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-11-09T08:14:28Z","title":"GPU Accelerated Convex Approximations for Fast Multi-Agent Trajectory Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.04240","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:852ed7ac0be0a557618b8b6413353c57a5a5dcb31688128bf9b6d936479b07ad","target":"record","created_at":"2026-07-05T01:50:03Z","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":"b86946a5d04a55e7a5ae0cade5cf390cc8ec323e16e2890104e3f516b0ffee74","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-11-09T08:14:28Z","title_canon_sha256":"451f93f3b6124e7e46df6c4220358446f9205d3565d47fce54c2708cc01334ce"},"schema_version":"1.0","source":{"id":"2011.04240","kind":"arxiv","version":1}},"canonical_sha256":"e60e9c342adf35cc04c403eebbf371c23a2c4e9de1b21fa4e7fb884ca4f12d2a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e60e9c342adf35cc04c403eebbf371c23a2c4e9de1b21fa4e7fb884ca4f12d2a","first_computed_at":"2026-07-05T01:50:03.700778Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:50:03.700778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nkk8pjfHTYaeUVeXynShd2vNRVu+FEYVwywCocpsIvPjNwqU/pV0rux9DkA9HoKg40Y1LSkb2azLVUDaFaQ4Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T01:50:03.701138Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.04240","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:852ed7ac0be0a557618b8b6413353c57a5a5dcb31688128bf9b6d936479b07ad","sha256:3c78f66e9d6f7939e94d06794d70f5fcffa1367bc5f07cd64f55a980c86acb75"],"state_sha256":"4f64de12aa7e547d417dfc32633728052ab10f1e0836751837b6bb2a61b6636a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3ASEPlTOAGXkAovga8AJ6fMlUGtftius4TGCwWcRmqAOmnrHOcOEdv+vS0TKLxJAv6VVmrSnhmONwgrk+TovCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T15:50:13.566251Z","bundle_sha256":"a94423ca4ce2608b97ab91668ca3e75dea8ba59b4f7bb31df6cf856ad908b6ad"}}