{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HY3OU7ZFM5BRKAWCTR33VW5VUD","short_pith_number":"pith:HY3OU7ZF","canonical_record":{"source":{"id":"1809.10503","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-09-27T13:14:17Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"278b97656eed332b06cea08e3b762bac92c253fd02316df7154165c05f415a21","abstract_canon_sha256":"80c88da849b512b78e4e96f05e7d6ba855b39748097432b89fcdcbcecbe9a660"},"schema_version":"1.0"},"canonical_sha256":"3e36ea7f2567431502c29c77badbb5a0ea1bbbfdb3c601b5c1927dd455fdbe50","source":{"kind":"arxiv","id":"1809.10503","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.10503","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"arxiv_version","alias_value":"1809.10503v1","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10503","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"pith_short_12","alias_value":"HY3OU7ZFM5BR","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HY3OU7ZFM5BRKAWC","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HY3OU7ZF","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HY3OU7ZFM5BRKAWCTR33VW5VUD","target":"record","payload":{"canonical_record":{"source":{"id":"1809.10503","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-09-27T13:14:17Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"278b97656eed332b06cea08e3b762bac92c253fd02316df7154165c05f415a21","abstract_canon_sha256":"80c88da849b512b78e4e96f05e7d6ba855b39748097432b89fcdcbcecbe9a660"},"schema_version":"1.0"},"canonical_sha256":"3e36ea7f2567431502c29c77badbb5a0ea1bbbfdb3c601b5c1927dd455fdbe50","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:38.217446Z","signature_b64":"6PM4iwUjCRwkMgVxMwOqd3aNZnZXK6umqUN4o+tXqRYCbvVKOxVr5y1v3LhuwhtnLb/060jmvIHatccjSMHDAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e36ea7f2567431502c29c77badbb5a0ea1bbbfdb3c601b5c1927dd455fdbe50","last_reissued_at":"2026-05-18T00:04:38.216924Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:38.216924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.10503","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-18T00:04:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CVKZYoJBx+nl2x1BD34QfeN+8R93yTMLT+2YWQPa8llkKUg7+s68CXbwOffoOX6uABz1SeSHgqhHGmd0bf1KBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:39:02.206176Z"},"content_sha256":"6a538480a210c06cebdded9cd03e324929a44b9b86ab5b48b8905588b200c24d","schema_version":"1.0","event_id":"sha256:6a538480a210c06cebdded9cd03e324929a44b9b86ab5b48b8905588b200c24d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HY3OU7ZFM5BRKAWCTR33VW5VUD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Equilibria in Quantitative Concurrent Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.GT","authors_text":"Rajeev Alur, Shaull Almagor, Suguman Bansal","submitted_at":"2018-09-27T13:14:17Z","abstract_excerpt":"Synthesis of finite-state controllers from high-level specifications in multi-agent systems can be reduced to solving multi-player concurrent games over finite graphs. The complexity of solving such games with qualitative objectives for agents, such as reaching a target set, is well understood resulting in tools with applications in robotics. In this paper, we introduce quantitative concurrent graph games, where transitions have separate costs for different agents, and each agent attempts to reach its target set while minimizing its own cost along the path. In this model, a solution to the gam"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10503","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-18T00:04:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"orhA7ZU/xa/t0DvjXUVnnfGpEtv2Vk8Wduf9Gsqv9/iyD7MzCnugOUq7l9WKd7B/+stR1+u5C8Er/eFdtUvSBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:39:02.206616Z"},"content_sha256":"ac4a6de8ca0a0f9ef8082456b314708b33213deeba3a941d63cc236b3a535cc1","schema_version":"1.0","event_id":"sha256:ac4a6de8ca0a0f9ef8082456b314708b33213deeba3a941d63cc236b3a535cc1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HY3OU7ZFM5BRKAWCTR33VW5VUD/bundle.json","state_url":"https://pith.science/pith/HY3OU7ZFM5BRKAWCTR33VW5VUD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HY3OU7ZFM5BRKAWCTR33VW5VUD/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-26T03:39:02Z","links":{"resolver":"https://pith.science/pith/HY3OU7ZFM5BRKAWCTR33VW5VUD","bundle":"https://pith.science/pith/HY3OU7ZFM5BRKAWCTR33VW5VUD/bundle.json","state":"https://pith.science/pith/HY3OU7ZFM5BRKAWCTR33VW5VUD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HY3OU7ZFM5BRKAWCTR33VW5VUD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HY3OU7ZFM5BRKAWCTR33VW5VUD","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":"80c88da849b512b78e4e96f05e7d6ba855b39748097432b89fcdcbcecbe9a660","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-09-27T13:14:17Z","title_canon_sha256":"278b97656eed332b06cea08e3b762bac92c253fd02316df7154165c05f415a21"},"schema_version":"1.0","source":{"id":"1809.10503","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.10503","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"arxiv_version","alias_value":"1809.10503v1","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10503","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"pith_short_12","alias_value":"HY3OU7ZFM5BR","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HY3OU7ZFM5BRKAWC","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HY3OU7ZF","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:ac4a6de8ca0a0f9ef8082456b314708b33213deeba3a941d63cc236b3a535cc1","target":"graph","created_at":"2026-05-18T00:04:38Z","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":"Synthesis of finite-state controllers from high-level specifications in multi-agent systems can be reduced to solving multi-player concurrent games over finite graphs. The complexity of solving such games with qualitative objectives for agents, such as reaching a target set, is well understood resulting in tools with applications in robotics. In this paper, we introduce quantitative concurrent graph games, where transitions have separate costs for different agents, and each agent attempts to reach its target set while minimizing its own cost along the path. In this model, a solution to the gam","authors_text":"Rajeev Alur, Shaull Almagor, Suguman Bansal","cross_cats":["cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-09-27T13:14:17Z","title":"Equilibria in Quantitative Concurrent Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10503","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:6a538480a210c06cebdded9cd03e324929a44b9b86ab5b48b8905588b200c24d","target":"record","created_at":"2026-05-18T00:04:38Z","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":"80c88da849b512b78e4e96f05e7d6ba855b39748097432b89fcdcbcecbe9a660","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-09-27T13:14:17Z","title_canon_sha256":"278b97656eed332b06cea08e3b762bac92c253fd02316df7154165c05f415a21"},"schema_version":"1.0","source":{"id":"1809.10503","kind":"arxiv","version":1}},"canonical_sha256":"3e36ea7f2567431502c29c77badbb5a0ea1bbbfdb3c601b5c1927dd455fdbe50","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e36ea7f2567431502c29c77badbb5a0ea1bbbfdb3c601b5c1927dd455fdbe50","first_computed_at":"2026-05-18T00:04:38.216924Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:38.216924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6PM4iwUjCRwkMgVxMwOqd3aNZnZXK6umqUN4o+tXqRYCbvVKOxVr5y1v3LhuwhtnLb/060jmvIHatccjSMHDAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:38.217446Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.10503","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a538480a210c06cebdded9cd03e324929a44b9b86ab5b48b8905588b200c24d","sha256:ac4a6de8ca0a0f9ef8082456b314708b33213deeba3a941d63cc236b3a535cc1"],"state_sha256":"95033695f33aa3bee3f28c535bd7e5bdf75ee1fadb8efce829caf6454fa0eef0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8g7gokE853c1/QflDcjm/8FBKCFSiWHT6VpAO3k3oArtlsbtDfpVdHu3jzQGO1WnGkqtKyWg/oYAI4zULO0lDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T03:39:02.209698Z","bundle_sha256":"70938cb11877b830b1ed08c47f8d6f2c3dd03044165bd266e3a35564dbdd6d5b"}}