{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZYY6OPEOC6RNIOH6JG7AT4SDFX","short_pith_number":"pith:ZYY6OPEO","schema_version":"1.0","canonical_sha256":"ce31e73c8e17a2d438fe49be09f2432ddc1d0c5398f1c6fef3446333e5492012","source":{"kind":"arxiv","id":"1509.01313","version":2},"attestation_state":"computed","paper":{"title":"Dynamic Potential Games in Communications: Fundamentals and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","math.OC"],"primary_cat":"cs.SY","authors_text":"Javier Zazo, Matilde S\\'anchez-Fern\\'andez, Santiago Zazo, Sergio Valcarcel Macua","submitted_at":"2015-09-04T00:25:07Z","abstract_excerpt":"In a noncooperative dynamic game, multiple agents operating in a changing environment aim to optimize their utilities over an infinite time horizon. Time-varying environments allow to model more realistic scenarios (e.g., mobile devices equipped with batteries, wireless communications over a fading channel, etc.). However, solving a dynamic game is a difficult task that requires dealing with multiple coupled optimal control problems. We focus our analysis on a class of problems, named \\textit{dynamic potential games}, whose solution can be found through a single multivariate optimal control pr"},"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":"1509.01313","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-09-04T00:25:07Z","cross_cats_sorted":["cs.GT","math.OC"],"title_canon_sha256":"5778bf581bfdd9d81b524345aa9a13b6c2f17f62ec00606c09534b6dabba0758","abstract_canon_sha256":"68cce5fd35307b8e2d2537bd162fa6d4d39f972175bee5da177768e62031134a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:44.513572Z","signature_b64":"6CXVQBB6d6SlbRFzSKE61PH+BBQ0UrncT1KITBxgLKtyIfIwsNDTPf38Aeobd7ZcJTFoBmC5gWhirf/cBMl5Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce31e73c8e17a2d438fe49be09f2432ddc1d0c5398f1c6fef3446333e5492012","last_reissued_at":"2026-05-18T01:23:44.512917Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:44.512917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Potential Games in Communications: Fundamentals and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","math.OC"],"primary_cat":"cs.SY","authors_text":"Javier Zazo, Matilde S\\'anchez-Fern\\'andez, Santiago Zazo, Sergio Valcarcel Macua","submitted_at":"2015-09-04T00:25:07Z","abstract_excerpt":"In a noncooperative dynamic game, multiple agents operating in a changing environment aim to optimize their utilities over an infinite time horizon. Time-varying environments allow to model more realistic scenarios (e.g., mobile devices equipped with batteries, wireless communications over a fading channel, etc.). However, solving a dynamic game is a difficult task that requires dealing with multiple coupled optimal control problems. We focus our analysis on a class of problems, named \\textit{dynamic potential games}, whose solution can be found through a single multivariate optimal control pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.01313","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":"1509.01313","created_at":"2026-05-18T01:23:44.513004+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.01313v2","created_at":"2026-05-18T01:23:44.513004+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01313","created_at":"2026-05-18T01:23:44.513004+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZYY6OPEOC6RN","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZYY6OPEOC6RNIOH6","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZYY6OPEO","created_at":"2026-05-18T12:29:52.810259+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/ZYY6OPEOC6RNIOH6JG7AT4SDFX","json":"https://pith.science/pith/ZYY6OPEOC6RNIOH6JG7AT4SDFX.json","graph_json":"https://pith.science/api/pith-number/ZYY6OPEOC6RNIOH6JG7AT4SDFX/graph.json","events_json":"https://pith.science/api/pith-number/ZYY6OPEOC6RNIOH6JG7AT4SDFX/events.json","paper":"https://pith.science/paper/ZYY6OPEO"},"agent_actions":{"view_html":"https://pith.science/pith/ZYY6OPEOC6RNIOH6JG7AT4SDFX","download_json":"https://pith.science/pith/ZYY6OPEOC6RNIOH6JG7AT4SDFX.json","view_paper":"https://pith.science/paper/ZYY6OPEO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.01313&json=true","fetch_graph":"https://pith.science/api/pith-number/ZYY6OPEOC6RNIOH6JG7AT4SDFX/graph.json","fetch_events":"https://pith.science/api/pith-number/ZYY6OPEOC6RNIOH6JG7AT4SDFX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZYY6OPEOC6RNIOH6JG7AT4SDFX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZYY6OPEOC6RNIOH6JG7AT4SDFX/action/storage_attestation","attest_author":"https://pith.science/pith/ZYY6OPEOC6RNIOH6JG7AT4SDFX/action/author_attestation","sign_citation":"https://pith.science/pith/ZYY6OPEOC6RNIOH6JG7AT4SDFX/action/citation_signature","submit_replication":"https://pith.science/pith/ZYY6OPEOC6RNIOH6JG7AT4SDFX/action/replication_record"}},"created_at":"2026-05-18T01:23:44.513004+00:00","updated_at":"2026-05-18T01:23:44.513004+00:00"}