{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3576QRMFWJDKGR2IACANG2OW7X","short_pith_number":"pith:3576QRMF","schema_version":"1.0","canonical_sha256":"df7fe84585b246a347480080d369d6fdea8e6dc4dab42f04d5a124aa491e6834","source":{"kind":"arxiv","id":"1609.00481","version":2},"attestation_state":"computed","paper":{"title":"Linear Game Theory : Reduction of complexity by decomposing large games into partial games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Takahiro Shiga, Tatsuya Iwase","submitted_at":"2016-09-02T07:09:02Z","abstract_excerpt":"With increasing game size, a problem of computational complexity arises. This is especially true in real world problems such as in social systems, where there is a significant population of players involved in the game, and the complexity problem is critical. Previous studies in algorithmic game theory propose succinct games that enable small descriptions of payoff matrices and reduction of complexities. However, some of the suggested compromises lose generality with strict assumptions such as symmetries in utility functions and cannot be applied to the full range of real world problems that m"},"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":"1609.00481","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-09-02T07:09:02Z","cross_cats_sorted":[],"title_canon_sha256":"cb50686eb69fa8575fe8f774515e516d0a4f64b529a34255b44493e352f55266","abstract_canon_sha256":"5f29fdae802c350cd8cd04d19a10086afe56f7c0474b986e35ae971989b5aac1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:53.198820Z","signature_b64":"ShTRr3KaJukYRIRDbOKSIFEKQdgkq/DY5Y2h1SfnYZyp2It6hNSzBQbRfILRWnh4nXrgZn6GbRFEnAKQmGD9CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df7fe84585b246a347480080d369d6fdea8e6dc4dab42f04d5a124aa491e6834","last_reissued_at":"2026-05-18T01:04:53.198244Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:53.198244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Game Theory : Reduction of complexity by decomposing large games into partial games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Takahiro Shiga, Tatsuya Iwase","submitted_at":"2016-09-02T07:09:02Z","abstract_excerpt":"With increasing game size, a problem of computational complexity arises. This is especially true in real world problems such as in social systems, where there is a significant population of players involved in the game, and the complexity problem is critical. Previous studies in algorithmic game theory propose succinct games that enable small descriptions of payoff matrices and reduction of complexities. However, some of the suggested compromises lose generality with strict assumptions such as symmetries in utility functions and cannot be applied to the full range of real world problems that m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00481","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":"1609.00481","created_at":"2026-05-18T01:04:53.198357+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.00481v2","created_at":"2026-05-18T01:04:53.198357+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00481","created_at":"2026-05-18T01:04:53.198357+00:00"},{"alias_kind":"pith_short_12","alias_value":"3576QRMFWJDK","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"3576QRMFWJDKGR2I","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"3576QRMF","created_at":"2026-05-18T12:29:55.572404+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/3576QRMFWJDKGR2IACANG2OW7X","json":"https://pith.science/pith/3576QRMFWJDKGR2IACANG2OW7X.json","graph_json":"https://pith.science/api/pith-number/3576QRMFWJDKGR2IACANG2OW7X/graph.json","events_json":"https://pith.science/api/pith-number/3576QRMFWJDKGR2IACANG2OW7X/events.json","paper":"https://pith.science/paper/3576QRMF"},"agent_actions":{"view_html":"https://pith.science/pith/3576QRMFWJDKGR2IACANG2OW7X","download_json":"https://pith.science/pith/3576QRMFWJDKGR2IACANG2OW7X.json","view_paper":"https://pith.science/paper/3576QRMF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.00481&json=true","fetch_graph":"https://pith.science/api/pith-number/3576QRMFWJDKGR2IACANG2OW7X/graph.json","fetch_events":"https://pith.science/api/pith-number/3576QRMFWJDKGR2IACANG2OW7X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3576QRMFWJDKGR2IACANG2OW7X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3576QRMFWJDKGR2IACANG2OW7X/action/storage_attestation","attest_author":"https://pith.science/pith/3576QRMFWJDKGR2IACANG2OW7X/action/author_attestation","sign_citation":"https://pith.science/pith/3576QRMFWJDKGR2IACANG2OW7X/action/citation_signature","submit_replication":"https://pith.science/pith/3576QRMFWJDKGR2IACANG2OW7X/action/replication_record"}},"created_at":"2026-05-18T01:04:53.198357+00:00","updated_at":"2026-05-18T01:04:53.198357+00:00"}