{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:77MB5KML7H22JTHAXXWQJVGCDZ","short_pith_number":"pith:77MB5KML","schema_version":"1.0","canonical_sha256":"ffd81ea98bf9f5a4cce0bded04d4c21e6a385c2c688744e37f4cb3e3b3ef4377","source":{"kind":"arxiv","id":"2407.14151","version":1},"attestation_state":"computed","paper":{"title":"A Comparative Study of Deep Reinforcement Learning Models: DQN vs PPO vs A2C","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Daniel A. Vidal Guerra, Neil De La Fuente","submitted_at":"2024-07-19T09:29:38Z","abstract_excerpt":"This study conducts a comparative analysis of three advanced Deep Reinforcement Learning models: Deep Q-Networks (DQN), Proximal Policy Optimization (PPO), and Advantage Actor-Critic (A2C), within the BreakOut Atari game environment. Our research assesses the performance and effectiveness of these models in a controlled setting. Through rigorous experimentation, we examine each model's learning efficiency, strategy development, and adaptability under dynamic game conditions. The findings provide critical insights into the practical applications of these models in game-based learning environmen"},"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":"2407.14151","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-07-19T09:29:38Z","cross_cats_sorted":[],"title_canon_sha256":"8e93452ff7f674f591230066197ea903c9d0b7732c8aa5018b4c420cc54acd0a","abstract_canon_sha256":"33b86a4dcfa17bb15517719f2b586c542716440df6944480f96289163f3f0218"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:45:59.135133Z","signature_b64":"dFJD+p475tUmnAOBmlGsAaeQ69QlTdLz7EEJtJOpDUe3FvytOap3/o0emfh5GxAcDIT2jWaxoJR4WrqHkDl/Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffd81ea98bf9f5a4cce0bded04d4c21e6a385c2c688744e37f4cb3e3b3ef4377","last_reissued_at":"2026-07-05T08:45:59.134665Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:45:59.134665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Comparative Study of Deep Reinforcement Learning Models: DQN vs PPO vs A2C","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Daniel A. Vidal Guerra, Neil De La Fuente","submitted_at":"2024-07-19T09:29:38Z","abstract_excerpt":"This study conducts a comparative analysis of three advanced Deep Reinforcement Learning models: Deep Q-Networks (DQN), Proximal Policy Optimization (PPO), and Advantage Actor-Critic (A2C), within the BreakOut Atari game environment. Our research assesses the performance and effectiveness of these models in a controlled setting. Through rigorous experimentation, we examine each model's learning efficiency, strategy development, and adaptability under dynamic game conditions. The findings provide critical insights into the practical applications of these models in game-based learning environmen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.14151","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/2407.14151/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":"2407.14151","created_at":"2026-07-05T08:45:59.134731+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.14151v1","created_at":"2026-07-05T08:45:59.134731+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.14151","created_at":"2026-07-05T08:45:59.134731+00:00"},{"alias_kind":"pith_short_12","alias_value":"77MB5KML7H22","created_at":"2026-07-05T08:45:59.134731+00:00"},{"alias_kind":"pith_short_16","alias_value":"77MB5KML7H22JTHA","created_at":"2026-07-05T08:45:59.134731+00:00"},{"alias_kind":"pith_short_8","alias_value":"77MB5KML","created_at":"2026-07-05T08:45:59.134731+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.02049","citing_title":"Explainable Data-driven Deep Reinforcement Learning Methods for Optimal Energy Management in Buildings","ref_index":62,"is_internal_anchor":false},{"citing_arxiv_id":"2604.12667","citing_title":"Safe reinforcement learning with online filtering for fatigue-predictive human-robot task planning and allocation in production","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/77MB5KML7H22JTHAXXWQJVGCDZ","json":"https://pith.science/pith/77MB5KML7H22JTHAXXWQJVGCDZ.json","graph_json":"https://pith.science/api/pith-number/77MB5KML7H22JTHAXXWQJVGCDZ/graph.json","events_json":"https://pith.science/api/pith-number/77MB5KML7H22JTHAXXWQJVGCDZ/events.json","paper":"https://pith.science/paper/77MB5KML"},"agent_actions":{"view_html":"https://pith.science/pith/77MB5KML7H22JTHAXXWQJVGCDZ","download_json":"https://pith.science/pith/77MB5KML7H22JTHAXXWQJVGCDZ.json","view_paper":"https://pith.science/paper/77MB5KML","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.14151&json=true","fetch_graph":"https://pith.science/api/pith-number/77MB5KML7H22JTHAXXWQJVGCDZ/graph.json","fetch_events":"https://pith.science/api/pith-number/77MB5KML7H22JTHAXXWQJVGCDZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/77MB5KML7H22JTHAXXWQJVGCDZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/77MB5KML7H22JTHAXXWQJVGCDZ/action/storage_attestation","attest_author":"https://pith.science/pith/77MB5KML7H22JTHAXXWQJVGCDZ/action/author_attestation","sign_citation":"https://pith.science/pith/77MB5KML7H22JTHAXXWQJVGCDZ/action/citation_signature","submit_replication":"https://pith.science/pith/77MB5KML7H22JTHAXXWQJVGCDZ/action/replication_record"}},"created_at":"2026-07-05T08:45:59.134731+00:00","updated_at":"2026-07-05T08:45:59.134731+00:00"}