{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HYNVKO5Y4PDXVAZXBZ547D6HEN","short_pith_number":"pith:HYNVKO5Y","canonical_record":{"source":{"id":"1507.05787","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-07-21T11:07:53Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"000b4c4721f7dd01154f87883793208b2665109fdfa55294ebb9273c5e3ed824","abstract_canon_sha256":"70a2a0f173200bf74a9791c92a64a6b40abc426dbfc555b09e370e0bae938a91"},"schema_version":"1.0"},"canonical_sha256":"3e1b553bb8e3c77a83370e7bcf8fc723730ea4305544213b3a877d3c41eeb112","source":{"kind":"arxiv","id":"1507.05787","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05787","created_at":"2026-05-18T01:36:32Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05787v1","created_at":"2026-05-18T01:36:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05787","created_at":"2026-05-18T01:36:32Z"},{"alias_kind":"pith_short_12","alias_value":"HYNVKO5Y4PDX","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HYNVKO5Y4PDXVAZX","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HYNVKO5Y","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HYNVKO5Y4PDXVAZXBZ547D6HEN","target":"record","payload":{"canonical_record":{"source":{"id":"1507.05787","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-07-21T11:07:53Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"000b4c4721f7dd01154f87883793208b2665109fdfa55294ebb9273c5e3ed824","abstract_canon_sha256":"70a2a0f173200bf74a9791c92a64a6b40abc426dbfc555b09e370e0bae938a91"},"schema_version":"1.0"},"canonical_sha256":"3e1b553bb8e3c77a83370e7bcf8fc723730ea4305544213b3a877d3c41eeb112","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:32.445461Z","signature_b64":"tZwf5aG5Xaksba9S0nOSpR6hT2VHs9yY8yaJdEQGF71xjALMrhIOzH15NZbUn7v5/XTXl02OS577YOBci5JmBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e1b553bb8e3c77a83370e7bcf8fc723730ea4305544213b3a877d3c41eeb112","last_reissued_at":"2026-05-18T01:36:32.444847Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:32.444847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.05787","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:36:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rVRhxKR1H0rh06t+oQIaOw1c4eS5II48fEYoMP+zwCc4KC8A8huLeId3B5MjrXCLLOmpA4gdDln0l/0OH93yBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:49:02.200789Z"},"content_sha256":"b630d55478131c7a5db530d0e56b7f4e08e478360a56138a0700bba0888522f5","schema_version":"1.0","event_id":"sha256:b630d55478131c7a5db530d0e56b7f4e08e478360a56138a0700bba0888522f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HYNVKO5Y4PDXVAZXBZ547D6HEN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Revisiting Robustness in Priced Timed Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Ashutosh Trivedi, Lakshmi Manasa, Shankara Narayanan Krishna, Shibashis Guha","submitted_at":"2015-07-21T11:07:53Z","abstract_excerpt":"Priced timed games are optimal-cost reachability games played between two players---the controller and the environment---by moving a token along the edges of infinite graphs of configurations of priced timed automata. The goal of the controller is to reach a given set of target locations as cheaply as possible, while the goal of the environment is the opposite. Priced timed games are known to be undecidable for timed automata with $3$ or more clocks, while they are known to be decidable for automata with $1$ clock.\n  In an attempt to recover decidability for priced timed games Bouyer, Markey, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05787","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:36:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"17/vAmOy2189kj0UhzOy/7SxHiqxf1Cq0aJD8/RwAozvFDtgWKy1w8hXmzqTYDdG7tNfUaH5xQ4rteXrU9ncAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:49:02.201588Z"},"content_sha256":"494a18577373460abcc97b9ac57e445817cb55c54e7928f8ab1435a37c18e2ae","schema_version":"1.0","event_id":"sha256:494a18577373460abcc97b9ac57e445817cb55c54e7928f8ab1435a37c18e2ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HYNVKO5Y4PDXVAZXBZ547D6HEN/bundle.json","state_url":"https://pith.science/pith/HYNVKO5Y4PDXVAZXBZ547D6HEN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HYNVKO5Y4PDXVAZXBZ547D6HEN/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-30T13:49:02Z","links":{"resolver":"https://pith.science/pith/HYNVKO5Y4PDXVAZXBZ547D6HEN","bundle":"https://pith.science/pith/HYNVKO5Y4PDXVAZXBZ547D6HEN/bundle.json","state":"https://pith.science/pith/HYNVKO5Y4PDXVAZXBZ547D6HEN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HYNVKO5Y4PDXVAZXBZ547D6HEN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HYNVKO5Y4PDXVAZXBZ547D6HEN","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":"70a2a0f173200bf74a9791c92a64a6b40abc426dbfc555b09e370e0bae938a91","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-07-21T11:07:53Z","title_canon_sha256":"000b4c4721f7dd01154f87883793208b2665109fdfa55294ebb9273c5e3ed824"},"schema_version":"1.0","source":{"id":"1507.05787","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05787","created_at":"2026-05-18T01:36:32Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05787v1","created_at":"2026-05-18T01:36:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05787","created_at":"2026-05-18T01:36:32Z"},{"alias_kind":"pith_short_12","alias_value":"HYNVKO5Y4PDX","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HYNVKO5Y4PDXVAZX","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HYNVKO5Y","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:494a18577373460abcc97b9ac57e445817cb55c54e7928f8ab1435a37c18e2ae","target":"graph","created_at":"2026-05-18T01:36: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":"Priced timed games are optimal-cost reachability games played between two players---the controller and the environment---by moving a token along the edges of infinite graphs of configurations of priced timed automata. The goal of the controller is to reach a given set of target locations as cheaply as possible, while the goal of the environment is the opposite. Priced timed games are known to be undecidable for timed automata with $3$ or more clocks, while they are known to be decidable for automata with $1$ clock.\n  In an attempt to recover decidability for priced timed games Bouyer, Markey, ","authors_text":"Ashutosh Trivedi, Lakshmi Manasa, Shankara Narayanan Krishna, Shibashis Guha","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-07-21T11:07:53Z","title":"Revisiting Robustness in Priced Timed Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05787","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:b630d55478131c7a5db530d0e56b7f4e08e478360a56138a0700bba0888522f5","target":"record","created_at":"2026-05-18T01:36: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":"70a2a0f173200bf74a9791c92a64a6b40abc426dbfc555b09e370e0bae938a91","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-07-21T11:07:53Z","title_canon_sha256":"000b4c4721f7dd01154f87883793208b2665109fdfa55294ebb9273c5e3ed824"},"schema_version":"1.0","source":{"id":"1507.05787","kind":"arxiv","version":1}},"canonical_sha256":"3e1b553bb8e3c77a83370e7bcf8fc723730ea4305544213b3a877d3c41eeb112","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e1b553bb8e3c77a83370e7bcf8fc723730ea4305544213b3a877d3c41eeb112","first_computed_at":"2026-05-18T01:36:32.444847Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:32.444847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tZwf5aG5Xaksba9S0nOSpR6hT2VHs9yY8yaJdEQGF71xjALMrhIOzH15NZbUn7v5/XTXl02OS577YOBci5JmBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:32.445461Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.05787","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b630d55478131c7a5db530d0e56b7f4e08e478360a56138a0700bba0888522f5","sha256:494a18577373460abcc97b9ac57e445817cb55c54e7928f8ab1435a37c18e2ae"],"state_sha256":"97f14bc10c8f01e2978ce7e9a28052600bacf07822f40306016ce74ea5757609"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xcoLjqrecaXYv37peiGgxpau0AunuV3N/GZWOzgcD22ps+EDKaMakbzCsaDQO2xlWcKj+Ri07Z0hIS0h5y/BAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T13:49:02.206437Z","bundle_sha256":"4e03be4eb39b235acc48d8b0b2a7a22eb7da98a8fc0b82fca1d462d8115bb440"}}