{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:EH4JUBM522Y6HZUGSNTV7W7JOE","short_pith_number":"pith:EH4JUBM5","canonical_record":{"source":{"id":"1511.05913","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-11-18T19:14:47Z","cross_cats_sorted":[],"title_canon_sha256":"6b3249f7fb060975a414c0e190650accb5126e2930c69b36d25f5a2558999e10","abstract_canon_sha256":"c9ae3b4149ba8c4193ad654ce3d5769fd303a09e555222d6c6f86251458a933b"},"schema_version":"1.0"},"canonical_sha256":"21f89a059dd6b1e3e68693675fdbe97124ace9f61fb90623b63887c58680c670","source":{"kind":"arxiv","id":"1511.05913","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05913","created_at":"2026-05-18T01:26:32Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05913v1","created_at":"2026-05-18T01:26:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05913","created_at":"2026-05-18T01:26:32Z"},{"alias_kind":"pith_short_12","alias_value":"EH4JUBM522Y6","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EH4JUBM522Y6HZUG","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EH4JUBM5","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:EH4JUBM522Y6HZUGSNTV7W7JOE","target":"record","payload":{"canonical_record":{"source":{"id":"1511.05913","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-11-18T19:14:47Z","cross_cats_sorted":[],"title_canon_sha256":"6b3249f7fb060975a414c0e190650accb5126e2930c69b36d25f5a2558999e10","abstract_canon_sha256":"c9ae3b4149ba8c4193ad654ce3d5769fd303a09e555222d6c6f86251458a933b"},"schema_version":"1.0"},"canonical_sha256":"21f89a059dd6b1e3e68693675fdbe97124ace9f61fb90623b63887c58680c670","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:32.324039Z","signature_b64":"J9ve3TP/IifH6sKWsq7zZdC97pNdHFWFS59Cg4yrHTjRF4+keWTNxbx5bq7YhzfdbgdzSBMxwu93K6r0kVIxCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21f89a059dd6b1e3e68693675fdbe97124ace9f61fb90623b63887c58680c670","last_reissued_at":"2026-05-18T01:26:32.323297Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:32.323297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.05913","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:26:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5wTETYDp0lgkRQcqQz5zQs0PQRi6qCmbDyuKsPXLNJF6DPY695WNI5zNOoGRNoUPRZHoAyoMNRd1Blo8dt6ZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T19:55:49.980934Z"},"content_sha256":"2add51bfcd56a8c23a9ad1e73641c6b2bd457aa7b1328620e911f57cbd7ce105","schema_version":"1.0","event_id":"sha256:2add51bfcd56a8c23a9ad1e73641c6b2bd457aa7b1328620e911f57cbd7ce105"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:EH4JUBM522Y6HZUGSNTV7W7JOE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Convergence in Semi-Anonymous Potential Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Holly Borowski, Jason Marden","submitted_at":"2015-11-18T19:14:47Z","abstract_excerpt":"Log-linear learning has been extensively studied in both the game theoretic and distributed control literature. It is appealing for many applications because it often guarantees that the agents' collective behavior will converge in probability to the optimal system configuration. However, the worst case convergence time can be prohibitively long, i.e., exponential in the number of players. We formalize a modified log-linear learning algorithm whose worst case convergence time is roughly linear in the number of players. We prove this characterization for a class of potential games where agents'"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05913","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:26:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EXPyPOFDPWi4PVKjPRsCu3MHRJEzmE/Ol4N8U2wa8wP8v92XyA6wXnUOrkY3S4ePbeqD92WgGSDZYDNyrnPoCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T19:55:49.981276Z"},"content_sha256":"f1048306d5f6e624e239c0b6ac8d7eadd7e2a25b76bee6232316afb08b5cadc7","schema_version":"1.0","event_id":"sha256:f1048306d5f6e624e239c0b6ac8d7eadd7e2a25b76bee6232316afb08b5cadc7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EH4JUBM522Y6HZUGSNTV7W7JOE/bundle.json","state_url":"https://pith.science/pith/EH4JUBM522Y6HZUGSNTV7W7JOE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EH4JUBM522Y6HZUGSNTV7W7JOE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-28T19:55:49Z","links":{"resolver":"https://pith.science/pith/EH4JUBM522Y6HZUGSNTV7W7JOE","bundle":"https://pith.science/pith/EH4JUBM522Y6HZUGSNTV7W7JOE/bundle.json","state":"https://pith.science/pith/EH4JUBM522Y6HZUGSNTV7W7JOE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EH4JUBM522Y6HZUGSNTV7W7JOE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EH4JUBM522Y6HZUGSNTV7W7JOE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c9ae3b4149ba8c4193ad654ce3d5769fd303a09e555222d6c6f86251458a933b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-11-18T19:14:47Z","title_canon_sha256":"6b3249f7fb060975a414c0e190650accb5126e2930c69b36d25f5a2558999e10"},"schema_version":"1.0","source":{"id":"1511.05913","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05913","created_at":"2026-05-18T01:26:32Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05913v1","created_at":"2026-05-18T01:26:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05913","created_at":"2026-05-18T01:26:32Z"},{"alias_kind":"pith_short_12","alias_value":"EH4JUBM522Y6","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EH4JUBM522Y6HZUG","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EH4JUBM5","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:f1048306d5f6e624e239c0b6ac8d7eadd7e2a25b76bee6232316afb08b5cadc7","target":"graph","created_at":"2026-05-18T01:26:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Log-linear learning has been extensively studied in both the game theoretic and distributed control literature. It is appealing for many applications because it often guarantees that the agents' collective behavior will converge in probability to the optimal system configuration. However, the worst case convergence time can be prohibitively long, i.e., exponential in the number of players. We formalize a modified log-linear learning algorithm whose worst case convergence time is roughly linear in the number of players. We prove this characterization for a class of potential games where agents'","authors_text":"Holly Borowski, Jason Marden","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-11-18T19:14:47Z","title":"Fast Convergence in Semi-Anonymous Potential Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05913","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2add51bfcd56a8c23a9ad1e73641c6b2bd457aa7b1328620e911f57cbd7ce105","target":"record","created_at":"2026-05-18T01:26:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c9ae3b4149ba8c4193ad654ce3d5769fd303a09e555222d6c6f86251458a933b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-11-18T19:14:47Z","title_canon_sha256":"6b3249f7fb060975a414c0e190650accb5126e2930c69b36d25f5a2558999e10"},"schema_version":"1.0","source":{"id":"1511.05913","kind":"arxiv","version":1}},"canonical_sha256":"21f89a059dd6b1e3e68693675fdbe97124ace9f61fb90623b63887c58680c670","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"21f89a059dd6b1e3e68693675fdbe97124ace9f61fb90623b63887c58680c670","first_computed_at":"2026-05-18T01:26:32.323297Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:32.323297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J9ve3TP/IifH6sKWsq7zZdC97pNdHFWFS59Cg4yrHTjRF4+keWTNxbx5bq7YhzfdbgdzSBMxwu93K6r0kVIxCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:32.324039Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.05913","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2add51bfcd56a8c23a9ad1e73641c6b2bd457aa7b1328620e911f57cbd7ce105","sha256:f1048306d5f6e624e239c0b6ac8d7eadd7e2a25b76bee6232316afb08b5cadc7"],"state_sha256":"06307ad03b2a26ed53dde2b9ad0a48ab43d110fa3207e57f3b3cbbfb0aadd796"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"krGgqnEWKWD28FwPAnR8duj6jIsxDC5jPnGvom9CiUnfFoY3pLijn6hPNk7vfGxhfzPXHJhHOf9iSPDwmrEOCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T19:55:49.983130Z","bundle_sha256":"d625ad9698a4905869d1908fc55069bbcd7123aa8fe90d27f244b63f59597793"}}