{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:OARVOFJWA2JDDBNZY7SLIJJZNU","short_pith_number":"pith:OARVOFJW","canonical_record":{"source":{"id":"1309.5925","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-23T19:24:10Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"f8e8a6814450c60deb75acf1587057cd9924db34928046b5ee963e5ce6b45a2b","abstract_canon_sha256":"b41f2b19f28ed6d9de36427fc86356616921fb373172ea15fd070908c7a4fdc0"},"schema_version":"1.0"},"canonical_sha256":"702357153606923185b9c7e4b425396d2fa48c00e5f9f8f521d8d12a1133e619","source":{"kind":"arxiv","id":"1309.5925","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5925","created_at":"2026-05-18T01:36:07Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5925v2","created_at":"2026-05-18T01:36:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5925","created_at":"2026-05-18T01:36:07Z"},{"alias_kind":"pith_short_12","alias_value":"OARVOFJWA2JD","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OARVOFJWA2JDDBNZ","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OARVOFJW","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:OARVOFJWA2JDDBNZY7SLIJJZNU","target":"record","payload":{"canonical_record":{"source":{"id":"1309.5925","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-23T19:24:10Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"f8e8a6814450c60deb75acf1587057cd9924db34928046b5ee963e5ce6b45a2b","abstract_canon_sha256":"b41f2b19f28ed6d9de36427fc86356616921fb373172ea15fd070908c7a4fdc0"},"schema_version":"1.0"},"canonical_sha256":"702357153606923185b9c7e4b425396d2fa48c00e5f9f8f521d8d12a1133e619","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:07.466050Z","signature_b64":"WPZ/TfBTI+1qion6DNiILsp2rKYdij3xp8KBAUXiwRFqPVXeu/3fTSKoRQ2gE3H65Cs10eNVbWW6ZilOByxJDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"702357153606923185b9c7e4b425396d2fa48c00e5f9f8f521d8d12a1133e619","last_reissued_at":"2026-05-18T01:36:07.465393Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:07.465393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.5925","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-05-18T01:36:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"retpCxt5iRtBklNscGquHWb9/X/QkvzlGwGF+a+EYt6mLZRyrKcxEty5UWIsoosvhoabWnUPhWjWAAChucAQCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:59:51.572838Z"},"content_sha256":"8e228126db5bfc4f4d20e739ece8ba84482e36b7ac7f38927821ba073fe9adb0","schema_version":"1.0","event_id":"sha256:8e228126db5bfc4f4d20e739ece8ba84482e36b7ac7f38927821ba073fe9adb0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:OARVOFJWA2JDDBNZY7SLIJJZNU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Combinatorial simplex algorithms can solve mean payoff games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.CO","authors_text":"Michael Joswig, Pascal Benchimol, St\\'ephane Gaubert, Xavier Allamigeon","submitted_at":"2013-09-23T19:24:10Z","abstract_excerpt":"A combinatorial simplex algorithm is an instance of the simplex method in which the pivoting depends on combinatorial data only. We show that any algorithm of this kind admits a tropical analogue which can be used to solve mean payoff games. Moreover, any combinatorial simplex algorithm with a strongly polynomial complexity (the existence of such an algorithm is open) would provide in this way a strongly polynomial algorithm solving mean payoff games. Mean payoff games are known to be in NP and co-NP; whether they can be solved in polynomial time is an open problem. Our algorithm relies on a t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5925","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"},"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:36:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WnHkV6e8+kQZmZ2UmIn9J1Oic40Syjm1/fQg2873+fvsMCO+uq7GJUPkBnEfdqCWj3Ec3Ka3QHtXci+J5B8ZCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:59:51.573604Z"},"content_sha256":"be246cdf62616c1c8eb3b32d9ebbc291d59fdf2b89f4bdced55d1109630cb873","schema_version":"1.0","event_id":"sha256:be246cdf62616c1c8eb3b32d9ebbc291d59fdf2b89f4bdced55d1109630cb873"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OARVOFJWA2JDDBNZY7SLIJJZNU/bundle.json","state_url":"https://pith.science/pith/OARVOFJWA2JDDBNZY7SLIJJZNU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OARVOFJWA2JDDBNZY7SLIJJZNU/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-05-25T12:59:51Z","links":{"resolver":"https://pith.science/pith/OARVOFJWA2JDDBNZY7SLIJJZNU","bundle":"https://pith.science/pith/OARVOFJWA2JDDBNZY7SLIJJZNU/bundle.json","state":"https://pith.science/pith/OARVOFJWA2JDDBNZY7SLIJJZNU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OARVOFJWA2JDDBNZY7SLIJJZNU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:OARVOFJWA2JDDBNZY7SLIJJZNU","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":"b41f2b19f28ed6d9de36427fc86356616921fb373172ea15fd070908c7a4fdc0","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-23T19:24:10Z","title_canon_sha256":"f8e8a6814450c60deb75acf1587057cd9924db34928046b5ee963e5ce6b45a2b"},"schema_version":"1.0","source":{"id":"1309.5925","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5925","created_at":"2026-05-18T01:36:07Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5925v2","created_at":"2026-05-18T01:36:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5925","created_at":"2026-05-18T01:36:07Z"},{"alias_kind":"pith_short_12","alias_value":"OARVOFJWA2JD","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OARVOFJWA2JDDBNZ","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OARVOFJW","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:be246cdf62616c1c8eb3b32d9ebbc291d59fdf2b89f4bdced55d1109630cb873","target":"graph","created_at":"2026-05-18T01:36:07Z","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":"A combinatorial simplex algorithm is an instance of the simplex method in which the pivoting depends on combinatorial data only. We show that any algorithm of this kind admits a tropical analogue which can be used to solve mean payoff games. Moreover, any combinatorial simplex algorithm with a strongly polynomial complexity (the existence of such an algorithm is open) would provide in this way a strongly polynomial algorithm solving mean payoff games. Mean payoff games are known to be in NP and co-NP; whether they can be solved in polynomial time is an open problem. Our algorithm relies on a t","authors_text":"Michael Joswig, Pascal Benchimol, St\\'ephane Gaubert, Xavier Allamigeon","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-23T19:24:10Z","title":"Combinatorial simplex algorithms can solve mean payoff games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5925","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:8e228126db5bfc4f4d20e739ece8ba84482e36b7ac7f38927821ba073fe9adb0","target":"record","created_at":"2026-05-18T01:36:07Z","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":"b41f2b19f28ed6d9de36427fc86356616921fb373172ea15fd070908c7a4fdc0","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-23T19:24:10Z","title_canon_sha256":"f8e8a6814450c60deb75acf1587057cd9924db34928046b5ee963e5ce6b45a2b"},"schema_version":"1.0","source":{"id":"1309.5925","kind":"arxiv","version":2}},"canonical_sha256":"702357153606923185b9c7e4b425396d2fa48c00e5f9f8f521d8d12a1133e619","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"702357153606923185b9c7e4b425396d2fa48c00e5f9f8f521d8d12a1133e619","first_computed_at":"2026-05-18T01:36:07.465393Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:07.465393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WPZ/TfBTI+1qion6DNiILsp2rKYdij3xp8KBAUXiwRFqPVXeu/3fTSKoRQ2gE3H65Cs10eNVbWW6ZilOByxJDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:07.466050Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.5925","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e228126db5bfc4f4d20e739ece8ba84482e36b7ac7f38927821ba073fe9adb0","sha256:be246cdf62616c1c8eb3b32d9ebbc291d59fdf2b89f4bdced55d1109630cb873"],"state_sha256":"4d5e6d517550f22097e1c2378881de8253968a355bc8cfc20ddfbb1f93ac1ae2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2qp9H9GzTttprfOf9gkT+lFHZe18wCd/pVeg5zrWgP6B2Mi8FuTY3+Ln+PzjPR8u9OzAWqpvBfe3YVkUt/ZMAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T12:59:51.577804Z","bundle_sha256":"7c3cc15fd33d37d2d3929dd96898bbc6c195648d951d97a27d82321552394c21"}}