{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:N5FOXCIYM743TRIC6RQRO62VCE","short_pith_number":"pith:N5FOXCIY","schema_version":"1.0","canonical_sha256":"6f4aeb891867f9b9c502f461177b55112187f5a7a7373248ea4fa9e9fdabca9e","source":{"kind":"arxiv","id":"1109.6182","version":1},"attestation_state":"computed","paper":{"title":"Bilinear Games: Polynomial Time Algorithms for Rank Based Subclasses","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Albert Xin Jiang, Jugal Garg, Ruta Mehta","submitted_at":"2011-09-28T12:15:42Z","abstract_excerpt":"Motivated by the sequence form formulation of Koller et al. (GEB'96), this paper defines {\\em bilinear games}, and proposes efficient algorithms for its rank based subclasses. Bilinear games are two-player non-cooperative single-shot games with compact polytopal strategy sets and two payoff matrices (A,B) such that when (x,y) is the played strategy profile, the payoffs of the players are xAy and xBy respectively. We show that bilinear games are very general and capture many interesting classes of games like bimatrix games, two player Bayesian games, polymatrix games, two-player extensive form "},"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":"1109.6182","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-09-28T12:15:42Z","cross_cats_sorted":[],"title_canon_sha256":"0369049bec1f7f7e0974f4192144102ee8f5abf26067504639fae240832122ba","abstract_canon_sha256":"e32eb7a917d982df88dba331e13e47112809eef25d522397857dfe104bcb3cfa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:09.623206Z","signature_b64":"O11g/hFU0A4DO4mOjN5As1txDTwjtOo+wVS1IlzqjpOYOxi9FN5xmGnsYU+8DCi7ghbtu8HUjKN4zQlqRGmwCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f4aeb891867f9b9c502f461177b55112187f5a7a7373248ea4fa9e9fdabca9e","last_reissued_at":"2026-05-18T04:12:09.622755Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:09.622755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bilinear Games: Polynomial Time Algorithms for Rank Based Subclasses","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Albert Xin Jiang, Jugal Garg, Ruta Mehta","submitted_at":"2011-09-28T12:15:42Z","abstract_excerpt":"Motivated by the sequence form formulation of Koller et al. (GEB'96), this paper defines {\\em bilinear games}, and proposes efficient algorithms for its rank based subclasses. Bilinear games are two-player non-cooperative single-shot games with compact polytopal strategy sets and two payoff matrices (A,B) such that when (x,y) is the played strategy profile, the payoffs of the players are xAy and xBy respectively. We show that bilinear games are very general and capture many interesting classes of games like bimatrix games, two player Bayesian games, polymatrix games, two-player extensive form "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.6182","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":"1109.6182","created_at":"2026-05-18T04:12:09.622827+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.6182v1","created_at":"2026-05-18T04:12:09.622827+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.6182","created_at":"2026-05-18T04:12:09.622827+00:00"},{"alias_kind":"pith_short_12","alias_value":"N5FOXCIYM743","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"N5FOXCIYM743TRIC","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"N5FOXCIY","created_at":"2026-05-18T12:26:37.096874+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/N5FOXCIYM743TRIC6RQRO62VCE","json":"https://pith.science/pith/N5FOXCIYM743TRIC6RQRO62VCE.json","graph_json":"https://pith.science/api/pith-number/N5FOXCIYM743TRIC6RQRO62VCE/graph.json","events_json":"https://pith.science/api/pith-number/N5FOXCIYM743TRIC6RQRO62VCE/events.json","paper":"https://pith.science/paper/N5FOXCIY"},"agent_actions":{"view_html":"https://pith.science/pith/N5FOXCIYM743TRIC6RQRO62VCE","download_json":"https://pith.science/pith/N5FOXCIYM743TRIC6RQRO62VCE.json","view_paper":"https://pith.science/paper/N5FOXCIY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.6182&json=true","fetch_graph":"https://pith.science/api/pith-number/N5FOXCIYM743TRIC6RQRO62VCE/graph.json","fetch_events":"https://pith.science/api/pith-number/N5FOXCIYM743TRIC6RQRO62VCE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N5FOXCIYM743TRIC6RQRO62VCE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N5FOXCIYM743TRIC6RQRO62VCE/action/storage_attestation","attest_author":"https://pith.science/pith/N5FOXCIYM743TRIC6RQRO62VCE/action/author_attestation","sign_citation":"https://pith.science/pith/N5FOXCIYM743TRIC6RQRO62VCE/action/citation_signature","submit_replication":"https://pith.science/pith/N5FOXCIYM743TRIC6RQRO62VCE/action/replication_record"}},"created_at":"2026-05-18T04:12:09.622827+00:00","updated_at":"2026-05-18T04:12:09.622827+00:00"}