{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:6HFPZCHBKKERU7Y7TTVYW3GXYT","short_pith_number":"pith:6HFPZCHB","schema_version":"1.0","canonical_sha256":"f1cafc88e152891a7f1f9ceb8b6cd7c4ffbeb1597e77e0225226e95dafa80baa","source":{"kind":"arxiv","id":"2504.21071","version":1},"attestation_state":"computed","paper":{"title":"Automated Parking Trajectory Generation Using Deep Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Hao Liu, Haopeng Zhao, Yongzhou Chen, Yutong Luo, Zheyu Zhang, Zhichao Ma","submitted_at":"2025-04-29T15:25:34Z","abstract_excerpt":"Autonomous parking is a key technology in modern autonomous driving systems, requiring high precision, strong adaptability, and efficiency in complex environments. This paper proposes a Deep Reinforcement Learning (DRL) framework based on the Soft Actor-Critic (SAC) algorithm to optimize autonomous parking tasks. SAC, an off-policy method with entropy regularization, is particularly well-suited for continuous action spaces, enabling fine-grained vehicle control. We model the parking task as a Markov Decision Process (MDP) and train an agent to maximize cumulative rewards while balancing explor"},"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":"2504.21071","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-04-29T15:25:34Z","cross_cats_sorted":[],"title_canon_sha256":"64247f4710ffd7974cea438da473339e5e9c57d0ead98857b88308953920c561","abstract_canon_sha256":"89e072dba5c35a096fac4a2d5bf40d0853745da948b19c2ad026cb54709eaa83"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:55:56.257765Z","signature_b64":"fc+xa2hutVBKMmKqMnSx+39q/3OeTU4K0Xy8qse8OqoGH2+c1h6H8fneKnAAtSEgEcecJXKeNbTv4XQTOL1zDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1cafc88e152891a7f1f9ceb8b6cd7c4ffbeb1597e77e0225226e95dafa80baa","last_reissued_at":"2026-07-05T10:55:56.257279Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:55:56.257279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automated Parking Trajectory Generation Using Deep Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Hao Liu, Haopeng Zhao, Yongzhou Chen, Yutong Luo, Zheyu Zhang, Zhichao Ma","submitted_at":"2025-04-29T15:25:34Z","abstract_excerpt":"Autonomous parking is a key technology in modern autonomous driving systems, requiring high precision, strong adaptability, and efficiency in complex environments. This paper proposes a Deep Reinforcement Learning (DRL) framework based on the Soft Actor-Critic (SAC) algorithm to optimize autonomous parking tasks. SAC, an off-policy method with entropy regularization, is particularly well-suited for continuous action spaces, enabling fine-grained vehicle control. We model the parking task as a Markov Decision Process (MDP) and train an agent to maximize cumulative rewards while balancing explor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.21071","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/2504.21071/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":"2504.21071","created_at":"2026-07-05T10:55:56.257341+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.21071v1","created_at":"2026-07-05T10:55:56.257341+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.21071","created_at":"2026-07-05T10:55:56.257341+00:00"},{"alias_kind":"pith_short_12","alias_value":"6HFPZCHBKKER","created_at":"2026-07-05T10:55:56.257341+00:00"},{"alias_kind":"pith_short_16","alias_value":"6HFPZCHBKKERU7Y7","created_at":"2026-07-05T10:55:56.257341+00:00"},{"alias_kind":"pith_short_8","alias_value":"6HFPZCHB","created_at":"2026-07-05T10:55:56.257341+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.01035","citing_title":"Research on Low-Latency Inference and Training Efficiency Optimization for Graph Neural Network and Large Language Model-Based Recommendation Systems","ref_index":30,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6HFPZCHBKKERU7Y7TTVYW3GXYT","json":"https://pith.science/pith/6HFPZCHBKKERU7Y7TTVYW3GXYT.json","graph_json":"https://pith.science/api/pith-number/6HFPZCHBKKERU7Y7TTVYW3GXYT/graph.json","events_json":"https://pith.science/api/pith-number/6HFPZCHBKKERU7Y7TTVYW3GXYT/events.json","paper":"https://pith.science/paper/6HFPZCHB"},"agent_actions":{"view_html":"https://pith.science/pith/6HFPZCHBKKERU7Y7TTVYW3GXYT","download_json":"https://pith.science/pith/6HFPZCHBKKERU7Y7TTVYW3GXYT.json","view_paper":"https://pith.science/paper/6HFPZCHB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.21071&json=true","fetch_graph":"https://pith.science/api/pith-number/6HFPZCHBKKERU7Y7TTVYW3GXYT/graph.json","fetch_events":"https://pith.science/api/pith-number/6HFPZCHBKKERU7Y7TTVYW3GXYT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6HFPZCHBKKERU7Y7TTVYW3GXYT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6HFPZCHBKKERU7Y7TTVYW3GXYT/action/storage_attestation","attest_author":"https://pith.science/pith/6HFPZCHBKKERU7Y7TTVYW3GXYT/action/author_attestation","sign_citation":"https://pith.science/pith/6HFPZCHBKKERU7Y7TTVYW3GXYT/action/citation_signature","submit_replication":"https://pith.science/pith/6HFPZCHBKKERU7Y7TTVYW3GXYT/action/replication_record"}},"created_at":"2026-07-05T10:55:56.257341+00:00","updated_at":"2026-07-05T10:55:56.257341+00:00"}