{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:GNV6R5JUGSSFK6ESXV3Q2AKCOG","short_pith_number":"pith:GNV6R5JU","schema_version":"1.0","canonical_sha256":"336be8f53434a4557892bd770d014271985889587829bce64fb0f47abdd47851","source":{"kind":"arxiv","id":"2505.23708","version":1},"attestation_state":"computed","paper":{"title":"AMOR: Adaptive Character Control through Multi-Objective Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GR"],"primary_cat":"cs.RO","authors_text":"Agon Serifi, David M\\\"uller, Espen Knoop, Lucas N. Alegre, Moritz B\\\"acher, Ruben Grandia","submitted_at":"2025-05-29T17:41:48Z","abstract_excerpt":"Reinforcement learning (RL) has significantly advanced the control of physics-based and robotic characters that track kinematic reference motion. However, methods typically rely on a weighted sum of conflicting reward functions, requiring extensive tuning to achieve a desired behavior. Due to the computational cost of RL, this iterative process is a tedious, time-intensive task. Furthermore, for robotics applications, the weights need to be chosen such that the policy performs well in the real world, despite inevitable sim-to-real gaps. To address these challenges, we propose a multi-objective"},"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":"2505.23708","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-05-29T17:41:48Z","cross_cats_sorted":["cs.GR"],"title_canon_sha256":"1d90a8d7c9963008c114efa4eaca117c9d7c523b0ee9e4fb4698ffa623ce09cd","abstract_canon_sha256":"f6861f27e66f4356920c2e0ddd90d4d5993254275e477d1fdfe433b09a7a0203"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:12:13.115791Z","signature_b64":"1H8qIKKSiVueS4FxsMlpa5FTuZhPVWE183xaD7gOIA9nmz8Qr614hz8GQk/Lfj904PZWU+45Qz2UUZ+GgWaNDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"336be8f53434a4557892bd770d014271985889587829bce64fb0f47abdd47851","last_reissued_at":"2026-07-05T11:12:13.115284Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:12:13.115284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"AMOR: Adaptive Character Control through Multi-Objective Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GR"],"primary_cat":"cs.RO","authors_text":"Agon Serifi, David M\\\"uller, Espen Knoop, Lucas N. Alegre, Moritz B\\\"acher, Ruben Grandia","submitted_at":"2025-05-29T17:41:48Z","abstract_excerpt":"Reinforcement learning (RL) has significantly advanced the control of physics-based and robotic characters that track kinematic reference motion. However, methods typically rely on a weighted sum of conflicting reward functions, requiring extensive tuning to achieve a desired behavior. Due to the computational cost of RL, this iterative process is a tedious, time-intensive task. Furthermore, for robotics applications, the weights need to be chosen such that the policy performs well in the real world, despite inevitable sim-to-real gaps. To address these challenges, we propose a multi-objective"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.23708","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/2505.23708/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":"2505.23708","created_at":"2026-07-05T11:12:13.115357+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.23708v1","created_at":"2026-07-05T11:12:13.115357+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.23708","created_at":"2026-07-05T11:12:13.115357+00:00"},{"alias_kind":"pith_short_12","alias_value":"GNV6R5JUGSSF","created_at":"2026-07-05T11:12:13.115357+00:00"},{"alias_kind":"pith_short_16","alias_value":"GNV6R5JUGSSFK6ES","created_at":"2026-07-05T11:12:13.115357+00:00"},{"alias_kind":"pith_short_8","alias_value":"GNV6R5JU","created_at":"2026-07-05T11:12:13.115357+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/GNV6R5JUGSSFK6ESXV3Q2AKCOG","json":"https://pith.science/pith/GNV6R5JUGSSFK6ESXV3Q2AKCOG.json","graph_json":"https://pith.science/api/pith-number/GNV6R5JUGSSFK6ESXV3Q2AKCOG/graph.json","events_json":"https://pith.science/api/pith-number/GNV6R5JUGSSFK6ESXV3Q2AKCOG/events.json","paper":"https://pith.science/paper/GNV6R5JU"},"agent_actions":{"view_html":"https://pith.science/pith/GNV6R5JUGSSFK6ESXV3Q2AKCOG","download_json":"https://pith.science/pith/GNV6R5JUGSSFK6ESXV3Q2AKCOG.json","view_paper":"https://pith.science/paper/GNV6R5JU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.23708&json=true","fetch_graph":"https://pith.science/api/pith-number/GNV6R5JUGSSFK6ESXV3Q2AKCOG/graph.json","fetch_events":"https://pith.science/api/pith-number/GNV6R5JUGSSFK6ESXV3Q2AKCOG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GNV6R5JUGSSFK6ESXV3Q2AKCOG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GNV6R5JUGSSFK6ESXV3Q2AKCOG/action/storage_attestation","attest_author":"https://pith.science/pith/GNV6R5JUGSSFK6ESXV3Q2AKCOG/action/author_attestation","sign_citation":"https://pith.science/pith/GNV6R5JUGSSFK6ESXV3Q2AKCOG/action/citation_signature","submit_replication":"https://pith.science/pith/GNV6R5JUGSSFK6ESXV3Q2AKCOG/action/replication_record"}},"created_at":"2026-07-05T11:12:13.115357+00:00","updated_at":"2026-07-05T11:12:13.115357+00:00"}