{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:JWSHLNRE3VG3WOWNAIO7H4UEKD","short_pith_number":"pith:JWSHLNRE","canonical_record":{"source":{"id":"2410.23637","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-31T05:07:01Z","cross_cats_sorted":["cs.AI","cs.DS","cs.GT"],"title_canon_sha256":"f95f6e8002cc7bd7e3fe595be855735dffcaba2dfed1a327dcc86ce752767b75","abstract_canon_sha256":"53a0c08cc731dff9c6388166da018c77c7b66902a5de068e96c570d445de006d"},"schema_version":"1.0"},"canonical_sha256":"4da475b624dd4dbb3acd021df3f28450d59d1fd300b3aab1307a1a4391fcedbe","source":{"kind":"arxiv","id":"2410.23637","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.23637","created_at":"2026-07-05T10:23:57Z"},{"alias_kind":"arxiv_version","alias_value":"2410.23637v2","created_at":"2026-07-05T10:23:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.23637","created_at":"2026-07-05T10:23:57Z"},{"alias_kind":"pith_short_12","alias_value":"JWSHLNRE3VG3","created_at":"2026-07-05T10:23:57Z"},{"alias_kind":"pith_short_16","alias_value":"JWSHLNRE3VG3WOWN","created_at":"2026-07-05T10:23:57Z"},{"alias_kind":"pith_short_8","alias_value":"JWSHLNRE","created_at":"2026-07-05T10:23:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:JWSHLNRE3VG3WOWNAIO7H4UEKD","target":"record","payload":{"canonical_record":{"source":{"id":"2410.23637","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-31T05:07:01Z","cross_cats_sorted":["cs.AI","cs.DS","cs.GT"],"title_canon_sha256":"f95f6e8002cc7bd7e3fe595be855735dffcaba2dfed1a327dcc86ce752767b75","abstract_canon_sha256":"53a0c08cc731dff9c6388166da018c77c7b66902a5de068e96c570d445de006d"},"schema_version":"1.0"},"canonical_sha256":"4da475b624dd4dbb3acd021df3f28450d59d1fd300b3aab1307a1a4391fcedbe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:23:57.626415Z","signature_b64":"Q1q35ksvnin1uB9S+OeVBZVopsCk7yxlnLfUZkQwQwYMNxpEoVsSNpj+1oalNlN5BlSVVwD0EvXFKRafJ9gYBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4da475b624dd4dbb3acd021df3f28450d59d1fd300b3aab1307a1a4391fcedbe","last_reissued_at":"2026-07-05T10:23:57.625759Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:23:57.625759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.23637","source_version":2,"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-07-05T10:23:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Wty1hedqXhauMUWisGWZ3QLT6gjJHB8AOMoDpmRvqGZ78kTxcg8l8Sp00jWXOQFiE59HrA88qS+W6vXHm6+CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T03:39:28.161814Z"},"content_sha256":"e7f175c2b84c303a2326c6ea6142757f6dfd98ad71558065ef04d2ee8aa74309","schema_version":"1.0","event_id":"sha256:e7f175c2b84c303a2326c6ea6142757f6dfd98ad71558065ef04d2ee8aa74309"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:JWSHLNRE3VG3WOWNAIO7H4UEKD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Anytime-Constrained Equilibria in Polynomial Time","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI","cs.DS","cs.GT"],"primary_cat":"cs.LG","authors_text":"Jeremy McMahan","submitted_at":"2024-10-31T05:07:01Z","abstract_excerpt":"We extend anytime constraints to the Markov game setting and the corresponding solution concept of an anytime-constrained equilibrium (ACE). Then, we present a comprehensive theory of anytime-constrained equilibria that includes (1) a computational characterization of feasible policies, (2) a fixed-parameter tractable algorithm for computing ACE, and (3) a polynomial-time algorithm for approximately computing ACE. Since computing a feasible policy is NP-hard even for two-player zero-sum games, our approximation guarantees are optimal so long as $P \\neq NP$. We also develop the first theory of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.23637","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.23637/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T10:23:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XJBcmW1ar+xmX0fnSo0f/56wW89NRoshVPvaxZP47ityyoQ4uauRVL9kARUiDnIVa+ThzT7D1Nwkc1AiOAtjDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T03:39:28.162346Z"},"content_sha256":"aa15ecc48ba63af68a150e681f200d9e912e74682605b4778bacdf986d5118a7","schema_version":"1.0","event_id":"sha256:aa15ecc48ba63af68a150e681f200d9e912e74682605b4778bacdf986d5118a7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JWSHLNRE3VG3WOWNAIO7H4UEKD/bundle.json","state_url":"https://pith.science/pith/JWSHLNRE3VG3WOWNAIO7H4UEKD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JWSHLNRE3VG3WOWNAIO7H4UEKD/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-08-10T03:39:28Z","links":{"resolver":"https://pith.science/pith/JWSHLNRE3VG3WOWNAIO7H4UEKD","bundle":"https://pith.science/pith/JWSHLNRE3VG3WOWNAIO7H4UEKD/bundle.json","state":"https://pith.science/pith/JWSHLNRE3VG3WOWNAIO7H4UEKD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JWSHLNRE3VG3WOWNAIO7H4UEKD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:JWSHLNRE3VG3WOWNAIO7H4UEKD","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":"53a0c08cc731dff9c6388166da018c77c7b66902a5de068e96c570d445de006d","cross_cats_sorted":["cs.AI","cs.DS","cs.GT"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-31T05:07:01Z","title_canon_sha256":"f95f6e8002cc7bd7e3fe595be855735dffcaba2dfed1a327dcc86ce752767b75"},"schema_version":"1.0","source":{"id":"2410.23637","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.23637","created_at":"2026-07-05T10:23:57Z"},{"alias_kind":"arxiv_version","alias_value":"2410.23637v2","created_at":"2026-07-05T10:23:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.23637","created_at":"2026-07-05T10:23:57Z"},{"alias_kind":"pith_short_12","alias_value":"JWSHLNRE3VG3","created_at":"2026-07-05T10:23:57Z"},{"alias_kind":"pith_short_16","alias_value":"JWSHLNRE3VG3WOWN","created_at":"2026-07-05T10:23:57Z"},{"alias_kind":"pith_short_8","alias_value":"JWSHLNRE","created_at":"2026-07-05T10:23:57Z"}],"graph_snapshots":[{"event_id":"sha256:aa15ecc48ba63af68a150e681f200d9e912e74682605b4778bacdf986d5118a7","target":"graph","created_at":"2026-07-05T10:23:57Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2410.23637/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We extend anytime constraints to the Markov game setting and the corresponding solution concept of an anytime-constrained equilibrium (ACE). Then, we present a comprehensive theory of anytime-constrained equilibria that includes (1) a computational characterization of feasible policies, (2) a fixed-parameter tractable algorithm for computing ACE, and (3) a polynomial-time algorithm for approximately computing ACE. Since computing a feasible policy is NP-hard even for two-player zero-sum games, our approximation guarantees are optimal so long as $P \\neq NP$. We also develop the first theory of ","authors_text":"Jeremy McMahan","cross_cats":["cs.AI","cs.DS","cs.GT"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-31T05:07:01Z","title":"Anytime-Constrained Equilibria in Polynomial Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.23637","kind":"arxiv","version":2},"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:e7f175c2b84c303a2326c6ea6142757f6dfd98ad71558065ef04d2ee8aa74309","target":"record","created_at":"2026-07-05T10:23:57Z","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":"53a0c08cc731dff9c6388166da018c77c7b66902a5de068e96c570d445de006d","cross_cats_sorted":["cs.AI","cs.DS","cs.GT"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-31T05:07:01Z","title_canon_sha256":"f95f6e8002cc7bd7e3fe595be855735dffcaba2dfed1a327dcc86ce752767b75"},"schema_version":"1.0","source":{"id":"2410.23637","kind":"arxiv","version":2}},"canonical_sha256":"4da475b624dd4dbb3acd021df3f28450d59d1fd300b3aab1307a1a4391fcedbe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4da475b624dd4dbb3acd021df3f28450d59d1fd300b3aab1307a1a4391fcedbe","first_computed_at":"2026-07-05T10:23:57.625759Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:23:57.625759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q1q35ksvnin1uB9S+OeVBZVopsCk7yxlnLfUZkQwQwYMNxpEoVsSNpj+1oalNlN5BlSVVwD0EvXFKRafJ9gYBg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:23:57.626415Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.23637","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7f175c2b84c303a2326c6ea6142757f6dfd98ad71558065ef04d2ee8aa74309","sha256:aa15ecc48ba63af68a150e681f200d9e912e74682605b4778bacdf986d5118a7"],"state_sha256":"37a5151fddf6f98d2cd25013ac797a4d0e47b23cdcfc39c59a3339e82937a8af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j2W+hNl+BTzODpMz0MkjM5r/vhPT9te6HmIq9Qd1rMqWY8sXTuVMVn/OdE9voU1uPzvLLNzKwtt0cAC49IDwBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T03:39:28.167592Z","bundle_sha256":"20d17d5a625f3c1df5958f8afaba49ac2400f3a14a2daccf53f71a7938286e43"}}