{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:U723ZRNDUASTZMHDNLRQ33H2Y5","short_pith_number":"pith:U723ZRND","schema_version":"1.0","canonical_sha256":"a7f5bcc5a3a0253cb0e36ae30decfac75a51fa5e35e621d102c7d81206701e4e","source":{"kind":"arxiv","id":"1806.09771","version":1},"attestation_state":"computed","paper":{"title":"Q-DeckRec: A Fast Deck Recommendation System for Collectible Card Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Chris Amato, Magy Seif El-Nasr, Seth Cooper, Truong-Huy Nguyen, Yizhou Sun, Zhengxing Chen","submitted_at":"2018-06-26T02:55:16Z","abstract_excerpt":"Deck building is a crucial component in playing Collectible Card Games (CCGs). The goal of deck building is to choose a fixed-sized subset of cards from a large card pool, so that they work well together in-game against specific opponents. Existing methods either lack flexibility to adapt to different opponents or require large computational resources, still making them unsuitable for any real-time or large-scale application. We propose a new deck recommendation system, named Q-DeckRec, which learns a deck search policy during a training phase and uses it to solve deck building problem instanc"},"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":"1806.09771","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-06-26T02:55:16Z","cross_cats_sorted":[],"title_canon_sha256":"dd5155e558fec0f0b0262a4056907fa889c33b0e25860bba3fbfdc3bb7954f41","abstract_canon_sha256":"7a7e2634f5c08e4de014756d1f6cf7d56d4e162de3e84f6da392b88ab2bcd12b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:23.412740Z","signature_b64":"kisdtXKSnFbMZhfvl/4p4PAhm3QZH+VTYgyRJYWsGaj1rI2eydm15pM2K0TG0WCTVeDswMKcePclVfbgAs5gCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7f5bcc5a3a0253cb0e36ae30decfac75a51fa5e35e621d102c7d81206701e4e","last_reissued_at":"2026-05-18T00:12:23.411897Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:23.411897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Q-DeckRec: A Fast Deck Recommendation System for Collectible Card Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Chris Amato, Magy Seif El-Nasr, Seth Cooper, Truong-Huy Nguyen, Yizhou Sun, Zhengxing Chen","submitted_at":"2018-06-26T02:55:16Z","abstract_excerpt":"Deck building is a crucial component in playing Collectible Card Games (CCGs). The goal of deck building is to choose a fixed-sized subset of cards from a large card pool, so that they work well together in-game against specific opponents. Existing methods either lack flexibility to adapt to different opponents or require large computational resources, still making them unsuitable for any real-time or large-scale application. We propose a new deck recommendation system, named Q-DeckRec, which learns a deck search policy during a training phase and uses it to solve deck building problem instanc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09771","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":""},"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":"1806.09771","created_at":"2026-05-18T00:12:23.412055+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.09771v1","created_at":"2026-05-18T00:12:23.412055+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09771","created_at":"2026-05-18T00:12:23.412055+00:00"},{"alias_kind":"pith_short_12","alias_value":"U723ZRNDUAST","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"U723ZRNDUASTZMHD","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"U723ZRND","created_at":"2026-05-18T12:32:56.356000+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/U723ZRNDUASTZMHDNLRQ33H2Y5","json":"https://pith.science/pith/U723ZRNDUASTZMHDNLRQ33H2Y5.json","graph_json":"https://pith.science/api/pith-number/U723ZRNDUASTZMHDNLRQ33H2Y5/graph.json","events_json":"https://pith.science/api/pith-number/U723ZRNDUASTZMHDNLRQ33H2Y5/events.json","paper":"https://pith.science/paper/U723ZRND"},"agent_actions":{"view_html":"https://pith.science/pith/U723ZRNDUASTZMHDNLRQ33H2Y5","download_json":"https://pith.science/pith/U723ZRNDUASTZMHDNLRQ33H2Y5.json","view_paper":"https://pith.science/paper/U723ZRND","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.09771&json=true","fetch_graph":"https://pith.science/api/pith-number/U723ZRNDUASTZMHDNLRQ33H2Y5/graph.json","fetch_events":"https://pith.science/api/pith-number/U723ZRNDUASTZMHDNLRQ33H2Y5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U723ZRNDUASTZMHDNLRQ33H2Y5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U723ZRNDUASTZMHDNLRQ33H2Y5/action/storage_attestation","attest_author":"https://pith.science/pith/U723ZRNDUASTZMHDNLRQ33H2Y5/action/author_attestation","sign_citation":"https://pith.science/pith/U723ZRNDUASTZMHDNLRQ33H2Y5/action/citation_signature","submit_replication":"https://pith.science/pith/U723ZRNDUASTZMHDNLRQ33H2Y5/action/replication_record"}},"created_at":"2026-05-18T00:12:23.412055+00:00","updated_at":"2026-05-18T00:12:23.412055+00:00"}