{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MUCVTUKS3EGXOHDUCOZGNNXN3F","short_pith_number":"pith:MUCVTUKS","schema_version":"1.0","canonical_sha256":"650559d152d90d771c7413b266b6edd974a53e5afc5bac78a80e5ece0341bdb6","source":{"kind":"arxiv","id":"1505.00039","version":2},"attestation_state":"computed","paper":{"title":"Learning Cooperative Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Ariel D. Procaccia, Maria-Florina Balcan, Yair Zick","submitted_at":"2015-04-30T21:36:55Z","abstract_excerpt":"This paper explores a PAC (probably approximately correct) learning model in cooperative games. Specifically, we are given $m$ random samples of coalitions and their values, taken from some unknown cooperative game; can we predict the values of unseen coalitions? We study the PAC learnability of several well-known classes of cooperative games, such as network flow games, threshold task games, and induced subgraph games. We also establish a novel connection between PAC learnability and core stability: for games that are efficiently learnable, it is possible to find payoff divisions that are lik"},"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":"1505.00039","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-04-30T21:36:55Z","cross_cats_sorted":[],"title_canon_sha256":"28d12b85f2e0d662efe89226752a3ba48bc02bb098e93b0516be4a221939a18b","abstract_canon_sha256":"aec9330876c98ff95b584cb6e63036ef5c1fd7f6744dc55e317538b768978223"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:57.025360Z","signature_b64":"ncH0her9FgNGVi93IMT8tuDnOF/9Af/ZbMdBmvkehFbQPO1NCx1ypKMMKgdJgVdHnKfTlkxRfKIddy5yGcgdBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"650559d152d90d771c7413b266b6edd974a53e5afc5bac78a80e5ece0341bdb6","last_reissued_at":"2026-05-18T01:02:57.024809Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:57.024809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Cooperative Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Ariel D. Procaccia, Maria-Florina Balcan, Yair Zick","submitted_at":"2015-04-30T21:36:55Z","abstract_excerpt":"This paper explores a PAC (probably approximately correct) learning model in cooperative games. Specifically, we are given $m$ random samples of coalitions and their values, taken from some unknown cooperative game; can we predict the values of unseen coalitions? We study the PAC learnability of several well-known classes of cooperative games, such as network flow games, threshold task games, and induced subgraph games. We also establish a novel connection between PAC learnability and core stability: for games that are efficiently learnable, it is possible to find payoff divisions that are lik"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.00039","kind":"arxiv","version":2},"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":"1505.00039","created_at":"2026-05-18T01:02:57.024885+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.00039v2","created_at":"2026-05-18T01:02:57.024885+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00039","created_at":"2026-05-18T01:02:57.024885+00:00"},{"alias_kind":"pith_short_12","alias_value":"MUCVTUKS3EGX","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MUCVTUKS3EGXOHDU","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MUCVTUKS","created_at":"2026-05-18T12:29:32.376354+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/MUCVTUKS3EGXOHDUCOZGNNXN3F","json":"https://pith.science/pith/MUCVTUKS3EGXOHDUCOZGNNXN3F.json","graph_json":"https://pith.science/api/pith-number/MUCVTUKS3EGXOHDUCOZGNNXN3F/graph.json","events_json":"https://pith.science/api/pith-number/MUCVTUKS3EGXOHDUCOZGNNXN3F/events.json","paper":"https://pith.science/paper/MUCVTUKS"},"agent_actions":{"view_html":"https://pith.science/pith/MUCVTUKS3EGXOHDUCOZGNNXN3F","download_json":"https://pith.science/pith/MUCVTUKS3EGXOHDUCOZGNNXN3F.json","view_paper":"https://pith.science/paper/MUCVTUKS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.00039&json=true","fetch_graph":"https://pith.science/api/pith-number/MUCVTUKS3EGXOHDUCOZGNNXN3F/graph.json","fetch_events":"https://pith.science/api/pith-number/MUCVTUKS3EGXOHDUCOZGNNXN3F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MUCVTUKS3EGXOHDUCOZGNNXN3F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MUCVTUKS3EGXOHDUCOZGNNXN3F/action/storage_attestation","attest_author":"https://pith.science/pith/MUCVTUKS3EGXOHDUCOZGNNXN3F/action/author_attestation","sign_citation":"https://pith.science/pith/MUCVTUKS3EGXOHDUCOZGNNXN3F/action/citation_signature","submit_replication":"https://pith.science/pith/MUCVTUKS3EGXOHDUCOZGNNXN3F/action/replication_record"}},"created_at":"2026-05-18T01:02:57.024885+00:00","updated_at":"2026-05-18T01:02:57.024885+00:00"}