{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:5524QOQPH7UGDMZQZLSBOXREAR","short_pith_number":"pith:5524QOQP","schema_version":"1.0","canonical_sha256":"ef75c83a0f3fe861b330cae4175e240441175eaada7db38eb73dd12aaa08d51d","source":{"kind":"arxiv","id":"1207.0660","version":2},"attestation_state":"computed","paper":{"title":"No-regret Dynamics and Fictitious Play","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"math.DS","authors_text":"Andriy Zapechelnyuk (QMUL), Yannick Viossat (CEREMADE)","submitted_at":"2012-07-03T13:04:33Z","abstract_excerpt":"Potential based no-regret dynamics are shown to be related to fictitious play. Roughly, these are epsilon-best reply dynamics where epsilon is the maximal regret, which vanishes with time. This allows for alternative and sometimes much shorter proofs of known results on convergence of no-regret dynamics to the set of Nash equilibria."},"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":"1207.0660","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2012-07-03T13:04:33Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"07b5175e68a09573e838f1d50abb148c05e5dd047e9a14ceb874a92db5730839","abstract_canon_sha256":"19562ccb4cafd1b23d328b41d7ca003a4823d425b786dab20429ed540d57cfc8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:50.050705Z","signature_b64":"tkTdR+aXmiwmXLrlE3h1bDvj2hUlH/7xjhxZ1KnWT/IUSHPA8sKJjU6vkvE2BQ0tFBX7tjSfOsdj/Tp6Z0rdAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef75c83a0f3fe861b330cae4175e240441175eaada7db38eb73dd12aaa08d51d","last_reissued_at":"2026-05-18T03:04:50.049937Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:50.049937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"No-regret Dynamics and Fictitious Play","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"math.DS","authors_text":"Andriy Zapechelnyuk (QMUL), Yannick Viossat (CEREMADE)","submitted_at":"2012-07-03T13:04:33Z","abstract_excerpt":"Potential based no-regret dynamics are shown to be related to fictitious play. Roughly, these are epsilon-best reply dynamics where epsilon is the maximal regret, which vanishes with time. This allows for alternative and sometimes much shorter proofs of known results on convergence of no-regret dynamics to the set of Nash equilibria."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0660","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":"1207.0660","created_at":"2026-05-18T03:04:50.050064+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.0660v2","created_at":"2026-05-18T03:04:50.050064+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0660","created_at":"2026-05-18T03:04:50.050064+00:00"},{"alias_kind":"pith_short_12","alias_value":"5524QOQPH7UG","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"5524QOQPH7UGDMZQ","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"5524QOQP","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/5524QOQPH7UGDMZQZLSBOXREAR","json":"https://pith.science/pith/5524QOQPH7UGDMZQZLSBOXREAR.json","graph_json":"https://pith.science/api/pith-number/5524QOQPH7UGDMZQZLSBOXREAR/graph.json","events_json":"https://pith.science/api/pith-number/5524QOQPH7UGDMZQZLSBOXREAR/events.json","paper":"https://pith.science/paper/5524QOQP"},"agent_actions":{"view_html":"https://pith.science/pith/5524QOQPH7UGDMZQZLSBOXREAR","download_json":"https://pith.science/pith/5524QOQPH7UGDMZQZLSBOXREAR.json","view_paper":"https://pith.science/paper/5524QOQP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.0660&json=true","fetch_graph":"https://pith.science/api/pith-number/5524QOQPH7UGDMZQZLSBOXREAR/graph.json","fetch_events":"https://pith.science/api/pith-number/5524QOQPH7UGDMZQZLSBOXREAR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5524QOQPH7UGDMZQZLSBOXREAR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5524QOQPH7UGDMZQZLSBOXREAR/action/storage_attestation","attest_author":"https://pith.science/pith/5524QOQPH7UGDMZQZLSBOXREAR/action/author_attestation","sign_citation":"https://pith.science/pith/5524QOQPH7UGDMZQZLSBOXREAR/action/citation_signature","submit_replication":"https://pith.science/pith/5524QOQPH7UGDMZQZLSBOXREAR/action/replication_record"}},"created_at":"2026-05-18T03:04:50.050064+00:00","updated_at":"2026-05-18T03:04:50.050064+00:00"}