{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BXYFLSEYPVHRNXQ6L2J2EPWHH6","short_pith_number":"pith:BXYFLSEY","canonical_record":{"source":{"id":"1611.00450","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-02T02:34:59Z","cross_cats_sorted":[],"title_canon_sha256":"30846defa74d4fb5e58b12d22d02cfafc0dc73e75c7a87c5e59b45425a86b2ab","abstract_canon_sha256":"405fa5f58f4f6b20f596f2c336a5a14e56cd1ea60cdaf209d352c34f7886faf2"},"schema_version":"1.0"},"canonical_sha256":"0df055c8987d4f16de1e5e93a23ec73fb81589047cedb27188a0e4b14d940acd","source":{"kind":"arxiv","id":"1611.00450","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.00450","created_at":"2026-05-18T01:00:32Z"},{"alias_kind":"arxiv_version","alias_value":"1611.00450v1","created_at":"2026-05-18T01:00:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00450","created_at":"2026-05-18T01:00:32Z"},{"alias_kind":"pith_short_12","alias_value":"BXYFLSEYPVHR","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BXYFLSEYPVHRNXQ6","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BXYFLSEY","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BXYFLSEYPVHRNXQ6L2J2EPWHH6","target":"record","payload":{"canonical_record":{"source":{"id":"1611.00450","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-02T02:34:59Z","cross_cats_sorted":[],"title_canon_sha256":"30846defa74d4fb5e58b12d22d02cfafc0dc73e75c7a87c5e59b45425a86b2ab","abstract_canon_sha256":"405fa5f58f4f6b20f596f2c336a5a14e56cd1ea60cdaf209d352c34f7886faf2"},"schema_version":"1.0"},"canonical_sha256":"0df055c8987d4f16de1e5e93a23ec73fb81589047cedb27188a0e4b14d940acd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:32.824610Z","signature_b64":"p9FpxIqlrlbLsu5Sq7nLTpYap5in7mQtSU9v9sPyn/PwwwmPvgVUD17L3yKjpMqacAZ4OSH7vKBeq3FYMA/4Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0df055c8987d4f16de1e5e93a23ec73fb81589047cedb27188a0e4b14d940acd","last_reissued_at":"2026-05-18T01:00:32.824015Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:32.824015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.00450","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:00:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X1AoCzo1gJN6liRaasLmCvEJS+0xw2ehSRgCq7JgRAwEQofdC2UEssnDWD+5Mmc5SjCy46ibAgRyJzKWghb3DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:12:32.903963Z"},"content_sha256":"6e2ea0dac6ecd69035d29334d3e673ffa50dd04079f3e249a9e89fa0c1a1f39a","schema_version":"1.0","event_id":"sha256:6e2ea0dac6ecd69035d29334d3e673ffa50dd04079f3e249a9e89fa0c1a1f39a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BXYFLSEYPVHRNXQ6L2J2EPWHH6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiplayer Reach-Avoid Games via Pairwise Outcomes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Claire J. Tomlin, Mo Chen, Zhengyuan Zhou","submitted_at":"2016-11-02T02:34:59Z","abstract_excerpt":"A multiplayer reach-avoid game is a differential game between an attacking team with NA attackers and a defending team with ND defenders playing on a compact domain with obstacles. The attacking team aims to send M of the NA attackers to some target location, while the defending team aims to prevent that by capturing attackers or indefinitely delaying attackers from reaching the target. Although the analysis of this game plays an important role in many applications, the optimal solution to this game is computationally intractable when NA>1 or ND>1. In this paper, we present two approaches for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00450","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:00:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NE26KuSxcG0ygwlFW99T9PhUZozamh1N+pY4rQnJb+1QMhApA4QHlkwFwZ1N9anFJNHl57puIpmcJ1MkL4GnAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:12:32.904303Z"},"content_sha256":"210c18e88fd4b2e5444cd1a58afa4c508f14b12b744382b81d7a5ee1a4ffe7d1","schema_version":"1.0","event_id":"sha256:210c18e88fd4b2e5444cd1a58afa4c508f14b12b744382b81d7a5ee1a4ffe7d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BXYFLSEYPVHRNXQ6L2J2EPWHH6/bundle.json","state_url":"https://pith.science/pith/BXYFLSEYPVHRNXQ6L2J2EPWHH6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BXYFLSEYPVHRNXQ6L2J2EPWHH6/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-30T08:12:32Z","links":{"resolver":"https://pith.science/pith/BXYFLSEYPVHRNXQ6L2J2EPWHH6","bundle":"https://pith.science/pith/BXYFLSEYPVHRNXQ6L2J2EPWHH6/bundle.json","state":"https://pith.science/pith/BXYFLSEYPVHRNXQ6L2J2EPWHH6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BXYFLSEYPVHRNXQ6L2J2EPWHH6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BXYFLSEYPVHRNXQ6L2J2EPWHH6","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":"405fa5f58f4f6b20f596f2c336a5a14e56cd1ea60cdaf209d352c34f7886faf2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-02T02:34:59Z","title_canon_sha256":"30846defa74d4fb5e58b12d22d02cfafc0dc73e75c7a87c5e59b45425a86b2ab"},"schema_version":"1.0","source":{"id":"1611.00450","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.00450","created_at":"2026-05-18T01:00:32Z"},{"alias_kind":"arxiv_version","alias_value":"1611.00450v1","created_at":"2026-05-18T01:00:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00450","created_at":"2026-05-18T01:00:32Z"},{"alias_kind":"pith_short_12","alias_value":"BXYFLSEYPVHR","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BXYFLSEYPVHRNXQ6","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BXYFLSEY","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:210c18e88fd4b2e5444cd1a58afa4c508f14b12b744382b81d7a5ee1a4ffe7d1","target":"graph","created_at":"2026-05-18T01:00: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":"A multiplayer reach-avoid game is a differential game between an attacking team with NA attackers and a defending team with ND defenders playing on a compact domain with obstacles. The attacking team aims to send M of the NA attackers to some target location, while the defending team aims to prevent that by capturing attackers or indefinitely delaying attackers from reaching the target. Although the analysis of this game plays an important role in many applications, the optimal solution to this game is computationally intractable when NA>1 or ND>1. In this paper, we present two approaches for ","authors_text":"Claire J. Tomlin, Mo Chen, Zhengyuan Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-02T02:34:59Z","title":"Multiplayer Reach-Avoid Games via Pairwise Outcomes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00450","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:6e2ea0dac6ecd69035d29334d3e673ffa50dd04079f3e249a9e89fa0c1a1f39a","target":"record","created_at":"2026-05-18T01:00: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":"405fa5f58f4f6b20f596f2c336a5a14e56cd1ea60cdaf209d352c34f7886faf2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-02T02:34:59Z","title_canon_sha256":"30846defa74d4fb5e58b12d22d02cfafc0dc73e75c7a87c5e59b45425a86b2ab"},"schema_version":"1.0","source":{"id":"1611.00450","kind":"arxiv","version":1}},"canonical_sha256":"0df055c8987d4f16de1e5e93a23ec73fb81589047cedb27188a0e4b14d940acd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0df055c8987d4f16de1e5e93a23ec73fb81589047cedb27188a0e4b14d940acd","first_computed_at":"2026-05-18T01:00:32.824015Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:32.824015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p9FpxIqlrlbLsu5Sq7nLTpYap5in7mQtSU9v9sPyn/PwwwmPvgVUD17L3yKjpMqacAZ4OSH7vKBeq3FYMA/4Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:32.824610Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.00450","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e2ea0dac6ecd69035d29334d3e673ffa50dd04079f3e249a9e89fa0c1a1f39a","sha256:210c18e88fd4b2e5444cd1a58afa4c508f14b12b744382b81d7a5ee1a4ffe7d1"],"state_sha256":"e6b72296f91e7e5d3e96c27361cdfec0d5b34e9a45b03e8a8c374340d200b851"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VnvA2q4dOlw3hoLvBe7gd8pCiW8XCqS12ahS5d2a5CaWrmibbOoEdEQxb5r3BcoLfu10Z0+5LXVIx3Z8ImMxDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:12:32.906591Z","bundle_sha256":"4a8bf3aeee463473e4acc4cb30b371bd76ac836689b5211dd32263f26008921f"}}