{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:E2CA6BKZKDDBZFFOM53ZYOH4ZN","short_pith_number":"pith:E2CA6BKZ","canonical_record":{"source":{"id":"1201.6054","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-01-29T16:32:05Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"8717c2e383b3a5cd129063de7d6b346e60ca42e7beee198e20f17e605c2dff5e","abstract_canon_sha256":"57fcdbc013eb59e3e9903ca12aeee16c45a2d9902ed235f55e3fb8aa3b490b55"},"schema_version":"1.0"},"canonical_sha256":"26840f055950c61c94ae67779c38fccb769807772167d6958f0d26a3b0c17cea","source":{"kind":"arxiv","id":"1201.6054","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.6054","created_at":"2026-05-18T02:57:00Z"},{"alias_kind":"arxiv_version","alias_value":"1201.6054v4","created_at":"2026-05-18T02:57:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.6054","created_at":"2026-05-18T02:57:00Z"},{"alias_kind":"pith_short_12","alias_value":"E2CA6BKZKDDB","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"E2CA6BKZKDDBZFFO","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"E2CA6BKZ","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:E2CA6BKZKDDBZFFOM53ZYOH4ZN","target":"record","payload":{"canonical_record":{"source":{"id":"1201.6054","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-01-29T16:32:05Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"8717c2e383b3a5cd129063de7d6b346e60ca42e7beee198e20f17e605c2dff5e","abstract_canon_sha256":"57fcdbc013eb59e3e9903ca12aeee16c45a2d9902ed235f55e3fb8aa3b490b55"},"schema_version":"1.0"},"canonical_sha256":"26840f055950c61c94ae67779c38fccb769807772167d6958f0d26a3b0c17cea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:00.247886Z","signature_b64":"DoxOWuRtj2Js9GhUZQGYskzEZnt//cW5Mrbu5Iq95L+WAoUEOg5iMR5qjztb7BC/KmTGjNbcJ9h0UJPZutKmCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26840f055950c61c94ae67779c38fccb769807772167d6958f0d26a3b0c17cea","last_reissued_at":"2026-05-18T02:57:00.247400Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:00.247400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.6054","source_version":4,"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-18T02:57:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MEBasC+3/WUtXGbzUoB9znBPOMy3AxX0Rdz/CWpY6XpPqk4g4tDVARA2FGaY2vFLtmL0vUx3agvGdZEyQE7lCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T10:43:36.880607Z"},"content_sha256":"fb9fb38f5972ee815d1f49644bf00683cc84f5e79b864a44559400046e9e80b8","schema_version":"1.0","event_id":"sha256:fb9fb38f5972ee815d1f49644bf00683cc84f5e79b864a44559400046e9e80b8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:E2CA6BKZKDDBZFFOM53ZYOH4ZN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Attainability in Repeated Games with Vector Payoffs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"math.OC","authors_text":"Dario Bauso, Ehud Lehrer, Eilon Solan, Xavier Venel","submitted_at":"2012-01-29T16:32:05Z","abstract_excerpt":"We introduce the concept of attainable sets of payoffs in two-player repeated games with vector payoffs. A set of payoff vectors is called {\\em attainable} if player 1 can ensure that there is a finite horizon $T$ such that after time $T$ the distance between the set and the cumulative payoff is arbitrarily small, regardless of what strategy player 2 is using. This paper focuses on the case where the attainable set consists of one payoff vector. In this case the vector is called an attainable vector. We study properties of the set of attainable vectors, and characterize when a specific vector "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.6054","kind":"arxiv","version":4},"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-18T02:57:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gIiJr4co72Gl1qR9IOshRaC+kKmgvM5uDKqPVOB8tItDXDj+WVQwfhFF6VXpUELwWEZ9qfohHdXhntqGybsfAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T10:43:36.880949Z"},"content_sha256":"2882c2d3ef4868826850f7149bb347309935a547000ae1adc5212b65fc5a75ed","schema_version":"1.0","event_id":"sha256:2882c2d3ef4868826850f7149bb347309935a547000ae1adc5212b65fc5a75ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E2CA6BKZKDDBZFFOM53ZYOH4ZN/bundle.json","state_url":"https://pith.science/pith/E2CA6BKZKDDBZFFOM53ZYOH4ZN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E2CA6BKZKDDBZFFOM53ZYOH4ZN/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-21T10:43:36Z","links":{"resolver":"https://pith.science/pith/E2CA6BKZKDDBZFFOM53ZYOH4ZN","bundle":"https://pith.science/pith/E2CA6BKZKDDBZFFOM53ZYOH4ZN/bundle.json","state":"https://pith.science/pith/E2CA6BKZKDDBZFFOM53ZYOH4ZN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E2CA6BKZKDDBZFFOM53ZYOH4ZN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:E2CA6BKZKDDBZFFOM53ZYOH4ZN","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":"57fcdbc013eb59e3e9903ca12aeee16c45a2d9902ed235f55e3fb8aa3b490b55","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-01-29T16:32:05Z","title_canon_sha256":"8717c2e383b3a5cd129063de7d6b346e60ca42e7beee198e20f17e605c2dff5e"},"schema_version":"1.0","source":{"id":"1201.6054","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.6054","created_at":"2026-05-18T02:57:00Z"},{"alias_kind":"arxiv_version","alias_value":"1201.6054v4","created_at":"2026-05-18T02:57:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.6054","created_at":"2026-05-18T02:57:00Z"},{"alias_kind":"pith_short_12","alias_value":"E2CA6BKZKDDB","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"E2CA6BKZKDDBZFFO","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"E2CA6BKZ","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:2882c2d3ef4868826850f7149bb347309935a547000ae1adc5212b65fc5a75ed","target":"graph","created_at":"2026-05-18T02:57:00Z","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":"We introduce the concept of attainable sets of payoffs in two-player repeated games with vector payoffs. A set of payoff vectors is called {\\em attainable} if player 1 can ensure that there is a finite horizon $T$ such that after time $T$ the distance between the set and the cumulative payoff is arbitrarily small, regardless of what strategy player 2 is using. This paper focuses on the case where the attainable set consists of one payoff vector. In this case the vector is called an attainable vector. We study properties of the set of attainable vectors, and characterize when a specific vector ","authors_text":"Dario Bauso, Ehud Lehrer, Eilon Solan, Xavier Venel","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-01-29T16:32:05Z","title":"Attainability in Repeated Games with Vector Payoffs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.6054","kind":"arxiv","version":4},"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:fb9fb38f5972ee815d1f49644bf00683cc84f5e79b864a44559400046e9e80b8","target":"record","created_at":"2026-05-18T02:57:00Z","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":"57fcdbc013eb59e3e9903ca12aeee16c45a2d9902ed235f55e3fb8aa3b490b55","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-01-29T16:32:05Z","title_canon_sha256":"8717c2e383b3a5cd129063de7d6b346e60ca42e7beee198e20f17e605c2dff5e"},"schema_version":"1.0","source":{"id":"1201.6054","kind":"arxiv","version":4}},"canonical_sha256":"26840f055950c61c94ae67779c38fccb769807772167d6958f0d26a3b0c17cea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26840f055950c61c94ae67779c38fccb769807772167d6958f0d26a3b0c17cea","first_computed_at":"2026-05-18T02:57:00.247400Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:57:00.247400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DoxOWuRtj2Js9GhUZQGYskzEZnt//cW5Mrbu5Iq95L+WAoUEOg5iMR5qjztb7BC/KmTGjNbcJ9h0UJPZutKmCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:57:00.247886Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.6054","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb9fb38f5972ee815d1f49644bf00683cc84f5e79b864a44559400046e9e80b8","sha256:2882c2d3ef4868826850f7149bb347309935a547000ae1adc5212b65fc5a75ed"],"state_sha256":"6485f6cb0f2a4c2d4b09b6576b4cbe4431c07bb5f036648857f984fd3b8e3a08"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lYfPOQBw5F4HDrTurmkT/ypiyEsPpSDDrE4G4qpfVVlywwRLWOQeDFuzDttvPi36MSbqADsTduKScyzDKJfbBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T10:43:36.882880Z","bundle_sha256":"899f87d2ee348108484ccc46fc43d11f4b90978444ee976df812789057b5defc"}}