{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:3Z563V6SGOIOI5VV6CAEPQJ2NL","short_pith_number":"pith:3Z563V6S","schema_version":"1.0","canonical_sha256":"de7bedd7d23390e476b5f08047c13a6ae18f3e01c98f92f4da11d48389558a0a","source":{"kind":"arxiv","id":"1212.6355","version":1},"attestation_state":"computed","paper":{"title":"Efficient Decomposition of Bimatrix Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Arno Pauly, Xiang Jiang","submitted_at":"2012-12-27T11:57:24Z","abstract_excerpt":"Exploiting the algebraic structure of the set of bimatrix games, a divide-and-conquer algorithm for finding Nash equilibria is proposed. The algorithm is fixed-parameter tractable with the size of the largest irreducible component of a game as parameter. An implementation of the algorithm is shown to yield a significant performance increase on inputs with small parameters."},"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":"1212.6355","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-12-27T11:57:24Z","cross_cats_sorted":[],"title_canon_sha256":"cc03c03642b92e5f7585cd4c536e17d0d8f626ea80126bfc24cbe7942d86839c","abstract_canon_sha256":"4176a00bb16fb2b8567fb85c3b2745e4e16dd5db22f6be7bcdee3d62d5d5825b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:40.010111Z","signature_b64":"0J4S/rW1/6U/B7RaZ3Z4Afch4vhAwgeGlx8cOELkt1FTbSIJ0dEvwHFw1PTNeMYPfB9+h8J0hiaIAK7Qgek4Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de7bedd7d23390e476b5f08047c13a6ae18f3e01c98f92f4da11d48389558a0a","last_reissued_at":"2026-05-18T03:37:40.009370Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:40.009370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Decomposition of Bimatrix Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Arno Pauly, Xiang Jiang","submitted_at":"2012-12-27T11:57:24Z","abstract_excerpt":"Exploiting the algebraic structure of the set of bimatrix games, a divide-and-conquer algorithm for finding Nash equilibria is proposed. The algorithm is fixed-parameter tractable with the size of the largest irreducible component of a game as parameter. An implementation of the algorithm is shown to yield a significant performance increase on inputs with small parameters."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6355","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":"1212.6355","created_at":"2026-05-18T03:37:40.009470+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.6355v1","created_at":"2026-05-18T03:37:40.009470+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6355","created_at":"2026-05-18T03:37:40.009470+00:00"},{"alias_kind":"pith_short_12","alias_value":"3Z563V6SGOIO","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"3Z563V6SGOIOI5VV","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"3Z563V6S","created_at":"2026-05-18T12:26:53.410803+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/3Z563V6SGOIOI5VV6CAEPQJ2NL","json":"https://pith.science/pith/3Z563V6SGOIOI5VV6CAEPQJ2NL.json","graph_json":"https://pith.science/api/pith-number/3Z563V6SGOIOI5VV6CAEPQJ2NL/graph.json","events_json":"https://pith.science/api/pith-number/3Z563V6SGOIOI5VV6CAEPQJ2NL/events.json","paper":"https://pith.science/paper/3Z563V6S"},"agent_actions":{"view_html":"https://pith.science/pith/3Z563V6SGOIOI5VV6CAEPQJ2NL","download_json":"https://pith.science/pith/3Z563V6SGOIOI5VV6CAEPQJ2NL.json","view_paper":"https://pith.science/paper/3Z563V6S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.6355&json=true","fetch_graph":"https://pith.science/api/pith-number/3Z563V6SGOIOI5VV6CAEPQJ2NL/graph.json","fetch_events":"https://pith.science/api/pith-number/3Z563V6SGOIOI5VV6CAEPQJ2NL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3Z563V6SGOIOI5VV6CAEPQJ2NL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3Z563V6SGOIOI5VV6CAEPQJ2NL/action/storage_attestation","attest_author":"https://pith.science/pith/3Z563V6SGOIOI5VV6CAEPQJ2NL/action/author_attestation","sign_citation":"https://pith.science/pith/3Z563V6SGOIOI5VV6CAEPQJ2NL/action/citation_signature","submit_replication":"https://pith.science/pith/3Z563V6SGOIOI5VV6CAEPQJ2NL/action/replication_record"}},"created_at":"2026-05-18T03:37:40.009470+00:00","updated_at":"2026-05-18T03:37:40.009470+00:00"}