{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ZFBZTQJ6NH3DTEHHB477T7NCEG","short_pith_number":"pith:ZFBZTQJ6","schema_version":"1.0","canonical_sha256":"c94399c13e69f63990e70f3ff9fda221930323ed5bb996b5bdcb81d1db43bb1d","source":{"kind":"arxiv","id":"1903.01720","version":1},"attestation_state":"computed","paper":{"title":"Multi-Agent Learning in Network Zero-Sum Games is a Hamiltonian System","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.MA"],"primary_cat":"cs.GT","authors_text":"Georgios Piliouras, James P. Bailey","submitted_at":"2019-03-05T08:11:13Z","abstract_excerpt":"Zero-sum games are natural, if informal, analogues of closed physical systems where no energy/utility can enter or exit. This analogy can be extended even further if we consider zero-sum network (polymatrix) games where multiple agents interact in a closed economy. Typically, (network) zero-sum games are studied from the perspective of Nash equilibria. Nevertheless, this comes in contrast with the way we typically think about closed physical systems, e.g., Earth-moon systems which move perpetually along recurrent trajectories of constant energy.\n  We establish a formal and robust connection be"},"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":"1903.01720","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-03-05T08:11:13Z","cross_cats_sorted":["cs.LG","cs.MA"],"title_canon_sha256":"2dc65a2eb58184e304a4060b1aa51f7a0ff1cbc9229d502fe0b695777bee76f2","abstract_canon_sha256":"5e174895ead37aa62d44d34449cb47d5295a284deec49dd689526a3a4bf7b319"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:59.942295Z","signature_b64":"FeMffCyCz9+KDMk31XFhHrn9EuJMGMAVTOHz3DLh0InEAh2mlcwk63cy1YHw2C9/DYXO7xbskvqbCR75OlcGBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c94399c13e69f63990e70f3ff9fda221930323ed5bb996b5bdcb81d1db43bb1d","last_reissued_at":"2026-05-17T23:51:59.941825Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:59.941825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Agent Learning in Network Zero-Sum Games is a Hamiltonian System","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.MA"],"primary_cat":"cs.GT","authors_text":"Georgios Piliouras, James P. Bailey","submitted_at":"2019-03-05T08:11:13Z","abstract_excerpt":"Zero-sum games are natural, if informal, analogues of closed physical systems where no energy/utility can enter or exit. This analogy can be extended even further if we consider zero-sum network (polymatrix) games where multiple agents interact in a closed economy. Typically, (network) zero-sum games are studied from the perspective of Nash equilibria. Nevertheless, this comes in contrast with the way we typically think about closed physical systems, e.g., Earth-moon systems which move perpetually along recurrent trajectories of constant energy.\n  We establish a formal and robust connection be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01720","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":"1903.01720","created_at":"2026-05-17T23:51:59.941904+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.01720v1","created_at":"2026-05-17T23:51:59.941904+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01720","created_at":"2026-05-17T23:51:59.941904+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZFBZTQJ6NH3D","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZFBZTQJ6NH3DTEHH","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZFBZTQJ6","created_at":"2026-05-18T12:33:33.725879+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/ZFBZTQJ6NH3DTEHHB477T7NCEG","json":"https://pith.science/pith/ZFBZTQJ6NH3DTEHHB477T7NCEG.json","graph_json":"https://pith.science/api/pith-number/ZFBZTQJ6NH3DTEHHB477T7NCEG/graph.json","events_json":"https://pith.science/api/pith-number/ZFBZTQJ6NH3DTEHHB477T7NCEG/events.json","paper":"https://pith.science/paper/ZFBZTQJ6"},"agent_actions":{"view_html":"https://pith.science/pith/ZFBZTQJ6NH3DTEHHB477T7NCEG","download_json":"https://pith.science/pith/ZFBZTQJ6NH3DTEHHB477T7NCEG.json","view_paper":"https://pith.science/paper/ZFBZTQJ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.01720&json=true","fetch_graph":"https://pith.science/api/pith-number/ZFBZTQJ6NH3DTEHHB477T7NCEG/graph.json","fetch_events":"https://pith.science/api/pith-number/ZFBZTQJ6NH3DTEHHB477T7NCEG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZFBZTQJ6NH3DTEHHB477T7NCEG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZFBZTQJ6NH3DTEHHB477T7NCEG/action/storage_attestation","attest_author":"https://pith.science/pith/ZFBZTQJ6NH3DTEHHB477T7NCEG/action/author_attestation","sign_citation":"https://pith.science/pith/ZFBZTQJ6NH3DTEHHB477T7NCEG/action/citation_signature","submit_replication":"https://pith.science/pith/ZFBZTQJ6NH3DTEHHB477T7NCEG/action/replication_record"}},"created_at":"2026-05-17T23:51:59.941904+00:00","updated_at":"2026-05-17T23:51:59.941904+00:00"}