{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:D7SK3RYMCDPW5FOXSWZJONRKLA","short_pith_number":"pith:D7SK3RYM","schema_version":"1.0","canonical_sha256":"1fe4adc70c10df6e95d795b297362a5819f2b5d93ac2080f761ae0bb2109a499","source":{"kind":"arxiv","id":"1301.0577","version":1},"attestation_state":"computed","paper":{"title":"Efficient Nash Computation in Large Population Games with Bounded Influence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.GT","authors_text":"Michael Kearns, Yishay Mansour","submitted_at":"2012-12-12T15:56:50Z","abstract_excerpt":"We introduce a general representation of large-population games in which each player      s influence ON the others IS centralized AND limited,     but may otherwise be arbitrary.This representation significantly generalizes      the class known AS congestion games IN a natural way.Our main      results are provably correct AND efficient algorithms FOR     computing AND     learning approximate Nash equilibria IN this general framework."},"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":"1301.0577","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-12-12T15:56:50Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"c6ac473bb70f21c3c5e0f25f0d9f1beaf1ae7b5c253f07058b7e43c56853d1f4","abstract_canon_sha256":"91d16f2b62a53d3dcf309325a450b5b1e176a4a0b12279a308dde8320bd24e95"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:18.413456Z","signature_b64":"zMsVzw2OwiUQ/dMkcGk4lbZQyGu2rOyJZvX6l3c1UFYR6KGMLkwVZ7Hr+7bssuUoK0EUvT3oA3Uku6c1MewsDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1fe4adc70c10df6e95d795b297362a5819f2b5d93ac2080f761ae0bb2109a499","last_reissued_at":"2026-05-18T03:37:18.412972Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:18.412972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Nash Computation in Large Population Games with Bounded Influence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.GT","authors_text":"Michael Kearns, Yishay Mansour","submitted_at":"2012-12-12T15:56:50Z","abstract_excerpt":"We introduce a general representation of large-population games in which each player      s influence ON the others IS centralized AND limited,     but may otherwise be arbitrary.This representation significantly generalizes      the class known AS congestion games IN a natural way.Our main      results are provably correct AND efficient algorithms FOR     computing AND     learning approximate Nash equilibria IN this general framework."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0577","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":"1301.0577","created_at":"2026-05-18T03:37:18.413046+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.0577v1","created_at":"2026-05-18T03:37:18.413046+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0577","created_at":"2026-05-18T03:37:18.413046+00:00"},{"alias_kind":"pith_short_12","alias_value":"D7SK3RYMCDPW","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"D7SK3RYMCDPW5FOX","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"D7SK3RYM","created_at":"2026-05-18T12:27:01.376967+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/D7SK3RYMCDPW5FOXSWZJONRKLA","json":"https://pith.science/pith/D7SK3RYMCDPW5FOXSWZJONRKLA.json","graph_json":"https://pith.science/api/pith-number/D7SK3RYMCDPW5FOXSWZJONRKLA/graph.json","events_json":"https://pith.science/api/pith-number/D7SK3RYMCDPW5FOXSWZJONRKLA/events.json","paper":"https://pith.science/paper/D7SK3RYM"},"agent_actions":{"view_html":"https://pith.science/pith/D7SK3RYMCDPW5FOXSWZJONRKLA","download_json":"https://pith.science/pith/D7SK3RYMCDPW5FOXSWZJONRKLA.json","view_paper":"https://pith.science/paper/D7SK3RYM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.0577&json=true","fetch_graph":"https://pith.science/api/pith-number/D7SK3RYMCDPW5FOXSWZJONRKLA/graph.json","fetch_events":"https://pith.science/api/pith-number/D7SK3RYMCDPW5FOXSWZJONRKLA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D7SK3RYMCDPW5FOXSWZJONRKLA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D7SK3RYMCDPW5FOXSWZJONRKLA/action/storage_attestation","attest_author":"https://pith.science/pith/D7SK3RYMCDPW5FOXSWZJONRKLA/action/author_attestation","sign_citation":"https://pith.science/pith/D7SK3RYMCDPW5FOXSWZJONRKLA/action/citation_signature","submit_replication":"https://pith.science/pith/D7SK3RYMCDPW5FOXSWZJONRKLA/action/replication_record"}},"created_at":"2026-05-18T03:37:18.413046+00:00","updated_at":"2026-05-18T03:37:18.413046+00:00"}