{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3Z35BBOACQQBP64MQBNJD4OE3U","short_pith_number":"pith:3Z35BBOA","schema_version":"1.0","canonical_sha256":"de77d085c0142017fb8c805a91f1c4dd2fa0a616918fd5433fe74dd3d99a358c","source":{"kind":"arxiv","id":"2408.03785","version":1},"attestation_state":"computed","paper":{"title":"A time-dependent symplectic network for non-convex path planning problems with linear and nonlinear dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chenye Wang, George Karniadakis, Jerome Darbon, Shanqing Liu, Zhen Zhang","submitted_at":"2024-08-07T14:09:41Z","abstract_excerpt":"We propose a novel neural network architecture (TSympOCNet) to address high--dimensional optimal control problems with linear and nonlinear dynamics. An important application of this method is to solve the path planning problem of multi-agent vehicles in real time. The new method extends our previous SympOCNet framework by introducing a time-dependent symplectic network into the architecture. In addition, we propose a more general latent representation, which greatly improves model expressivity based on the universal approximation theorem. We demonstrate the efficacy of TSympOCNet in path plan"},"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":"2408.03785","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-08-07T14:09:41Z","cross_cats_sorted":[],"title_canon_sha256":"1b27f378a2c495d0d99515de76f61284516133fd14dd74e5b307be2a9e426c4f","abstract_canon_sha256":"36fdd990dc1fed9f791deea3444acd2703eeea5181d60a0e1dd9dc3efc91d033"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:53:11.111870Z","signature_b64":"kBNy5j85kk2PVilcAamzS92JG5J7bhX48hekCmCoTEw4O4L7BJ0l9u77BQ7+FjFQ+E6TDysPfB3uUdnpJkYuCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de77d085c0142017fb8c805a91f1c4dd2fa0a616918fd5433fe74dd3d99a358c","last_reissued_at":"2026-07-05T08:53:11.111387Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:53:11.111387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A time-dependent symplectic network for non-convex path planning problems with linear and nonlinear dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chenye Wang, George Karniadakis, Jerome Darbon, Shanqing Liu, Zhen Zhang","submitted_at":"2024-08-07T14:09:41Z","abstract_excerpt":"We propose a novel neural network architecture (TSympOCNet) to address high--dimensional optimal control problems with linear and nonlinear dynamics. An important application of this method is to solve the path planning problem of multi-agent vehicles in real time. The new method extends our previous SympOCNet framework by introducing a time-dependent symplectic network into the architecture. In addition, we propose a more general latent representation, which greatly improves model expressivity based on the universal approximation theorem. We demonstrate the efficacy of TSympOCNet in path plan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.03785","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/2408.03785/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":"2408.03785","created_at":"2026-07-05T08:53:11.111446+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.03785v1","created_at":"2026-07-05T08:53:11.111446+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.03785","created_at":"2026-07-05T08:53:11.111446+00:00"},{"alias_kind":"pith_short_12","alias_value":"3Z35BBOACQQB","created_at":"2026-07-05T08:53:11.111446+00:00"},{"alias_kind":"pith_short_16","alias_value":"3Z35BBOACQQBP64M","created_at":"2026-07-05T08:53:11.111446+00:00"},{"alias_kind":"pith_short_8","alias_value":"3Z35BBOA","created_at":"2026-07-05T08:53:11.111446+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/3Z35BBOACQQBP64MQBNJD4OE3U","json":"https://pith.science/pith/3Z35BBOACQQBP64MQBNJD4OE3U.json","graph_json":"https://pith.science/api/pith-number/3Z35BBOACQQBP64MQBNJD4OE3U/graph.json","events_json":"https://pith.science/api/pith-number/3Z35BBOACQQBP64MQBNJD4OE3U/events.json","paper":"https://pith.science/paper/3Z35BBOA"},"agent_actions":{"view_html":"https://pith.science/pith/3Z35BBOACQQBP64MQBNJD4OE3U","download_json":"https://pith.science/pith/3Z35BBOACQQBP64MQBNJD4OE3U.json","view_paper":"https://pith.science/paper/3Z35BBOA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.03785&json=true","fetch_graph":"https://pith.science/api/pith-number/3Z35BBOACQQBP64MQBNJD4OE3U/graph.json","fetch_events":"https://pith.science/api/pith-number/3Z35BBOACQQBP64MQBNJD4OE3U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3Z35BBOACQQBP64MQBNJD4OE3U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3Z35BBOACQQBP64MQBNJD4OE3U/action/storage_attestation","attest_author":"https://pith.science/pith/3Z35BBOACQQBP64MQBNJD4OE3U/action/author_attestation","sign_citation":"https://pith.science/pith/3Z35BBOACQQBP64MQBNJD4OE3U/action/citation_signature","submit_replication":"https://pith.science/pith/3Z35BBOACQQBP64MQBNJD4OE3U/action/replication_record"}},"created_at":"2026-07-05T08:53:11.111446+00:00","updated_at":"2026-07-05T08:53:11.111446+00:00"}