{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ZK3BTGPPULV2MTLDTXC2SFHNPC","short_pith_number":"pith:ZK3BTGPP","schema_version":"1.0","canonical_sha256":"cab61999efa2eba64d639dc5a914ed788e777741395bd45d47caa7d64a2a6ec3","source":{"kind":"arxiv","id":"2605.23930","version":1},"attestation_state":"computed","paper":{"title":"Quantum Frog: Emergent Cooperation and Difficulty Scaling in a Quantized-Time Cooperative Game","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.MA"],"primary_cat":"cs.AI","authors_text":"Saad Mankarious","submitted_at":"2026-04-22T00:55:08Z","abstract_excerpt":"We introduce \\emph{Quantum Frog}, a two-player cooperative game built on a novel \\emph{quantized-time} mechanic in which the environment advances only when a player acts. Inspired by the classic arcade game Frogger, Quantum Frog requires two frogs to cross an 8$\\times$8 grid of traffic and reach the far side together. We use reinforcement learning (RL) as an analytical lens to answer four design questions: (1) how does game difficulty scale with traffic density, (2) what is the optimal single-agent policy and why, (3) how large is the cooperation gap between independent and cooperative two-age"},"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":"2605.23930","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-04-22T00:55:08Z","cross_cats_sorted":["cs.LG","cs.MA"],"title_canon_sha256":"f5664855075d42038ff8a1ab96d9a53ca5d93da6fbc53f0236827956ea22f724","abstract_canon_sha256":"9f895c4d0a57c9954df4a2318f4c73764f5ee4a0c2d36a8e83bd3d783a28f629"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T00:02:22.432344Z","signature_b64":"t3rAScGuohDZnLeDjgLIaOHurzWHPfF6Znrg4GTZY+hWXXdQ05deDgUhg26kDyMs39/bhad3rqxjc1kbpNstAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cab61999efa2eba64d639dc5a914ed788e777741395bd45d47caa7d64a2a6ec3","last_reissued_at":"2026-05-26T00:02:22.431368Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T00:02:22.431368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Frog: Emergent Cooperation and Difficulty Scaling in a Quantized-Time Cooperative Game","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.MA"],"primary_cat":"cs.AI","authors_text":"Saad Mankarious","submitted_at":"2026-04-22T00:55:08Z","abstract_excerpt":"We introduce \\emph{Quantum Frog}, a two-player cooperative game built on a novel \\emph{quantized-time} mechanic in which the environment advances only when a player acts. Inspired by the classic arcade game Frogger, Quantum Frog requires two frogs to cross an 8$\\times$8 grid of traffic and reach the far side together. We use reinforcement learning (RL) as an analytical lens to answer four design questions: (1) how does game difficulty scale with traffic density, (2) what is the optimal single-agent policy and why, (3) how large is the cooperation gap between independent and cooperative two-age"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.23930","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/2605.23930/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":"2605.23930","created_at":"2026-05-26T00:02:22.431521+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.23930v1","created_at":"2026-05-26T00:02:22.431521+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.23930","created_at":"2026-05-26T00:02:22.431521+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZK3BTGPPULV2","created_at":"2026-05-26T00:02:22.431521+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZK3BTGPPULV2MTLD","created_at":"2026-05-26T00:02:22.431521+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZK3BTGPP","created_at":"2026-05-26T00:02:22.431521+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/ZK3BTGPPULV2MTLDTXC2SFHNPC","json":"https://pith.science/pith/ZK3BTGPPULV2MTLDTXC2SFHNPC.json","graph_json":"https://pith.science/api/pith-number/ZK3BTGPPULV2MTLDTXC2SFHNPC/graph.json","events_json":"https://pith.science/api/pith-number/ZK3BTGPPULV2MTLDTXC2SFHNPC/events.json","paper":"https://pith.science/paper/ZK3BTGPP"},"agent_actions":{"view_html":"https://pith.science/pith/ZK3BTGPPULV2MTLDTXC2SFHNPC","download_json":"https://pith.science/pith/ZK3BTGPPULV2MTLDTXC2SFHNPC.json","view_paper":"https://pith.science/paper/ZK3BTGPP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.23930&json=true","fetch_graph":"https://pith.science/api/pith-number/ZK3BTGPPULV2MTLDTXC2SFHNPC/graph.json","fetch_events":"https://pith.science/api/pith-number/ZK3BTGPPULV2MTLDTXC2SFHNPC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZK3BTGPPULV2MTLDTXC2SFHNPC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZK3BTGPPULV2MTLDTXC2SFHNPC/action/storage_attestation","attest_author":"https://pith.science/pith/ZK3BTGPPULV2MTLDTXC2SFHNPC/action/author_attestation","sign_citation":"https://pith.science/pith/ZK3BTGPPULV2MTLDTXC2SFHNPC/action/citation_signature","submit_replication":"https://pith.science/pith/ZK3BTGPPULV2MTLDTXC2SFHNPC/action/replication_record"}},"created_at":"2026-05-26T00:02:22.431521+00:00","updated_at":"2026-05-26T00:02:22.431521+00:00"}