{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:T3GGFQZ2M27O2GQQUYNR6HTIZS","short_pith_number":"pith:T3GGFQZ2","schema_version":"1.0","canonical_sha256":"9ecc62c33a66beed1a10a61b1f1e68cc85e8934c7e9966f1df478075e46edec2","source":{"kind":"arxiv","id":"1803.01914","version":2},"attestation_state":"computed","paper":{"title":"Costs and Rewards in Priced Timed Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"James Worrell, Mahsa Shirmohammadi, Mani Swaminathan, Martin Fr\\\"anzle","submitted_at":"2018-03-05T20:27:48Z","abstract_excerpt":"We consider Pareto analysis of reachable states of multi-priced timed automata (MPTA): timed automata equipped with multiple observers that keep track of costs (to be minimised) and rewards (to be maximised) along a computation. Each observer has a constant non-negative derivative which may depend on the location of the MPTA.\n  We study the Pareto Domination Problem, which asks whether it is possible to reach a target location via a run in which the accumulated costs and rewards Pareto dominate a given objective vector. We show that this problem is undecidable in general, but decidable for MPT"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1803.01914","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-03-05T20:27:48Z","cross_cats_sorted":[],"title_canon_sha256":"33fad1e6a755a641784e434e65ff2c499190c04d9fe1cbedfb6d2b909b3b93c8","abstract_canon_sha256":"8982d1dbdded2cc9953bb473294566ae2e79ee3b83ad77fa47b2377d26dd6201"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:55.323230Z","signature_b64":"wrtBDPvrQMKHV8D96ZVz+iNfHA6TmHBtrHzzDdkezr1LcW4ej3cYcnLVCFNencM0iNpgqiul743kxOFt0TtaAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ecc62c33a66beed1a10a61b1f1e68cc85e8934c7e9966f1df478075e46edec2","last_reissued_at":"2026-05-18T00:15:55.322555Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:55.322555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Costs and Rewards in Priced Timed Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"James Worrell, Mahsa Shirmohammadi, Mani Swaminathan, Martin Fr\\\"anzle","submitted_at":"2018-03-05T20:27:48Z","abstract_excerpt":"We consider Pareto analysis of reachable states of multi-priced timed automata (MPTA): timed automata equipped with multiple observers that keep track of costs (to be minimised) and rewards (to be maximised) along a computation. Each observer has a constant non-negative derivative which may depend on the location of the MPTA.\n  We study the Pareto Domination Problem, which asks whether it is possible to reach a target location via a run in which the accumulated costs and rewards Pareto dominate a given objective vector. We show that this problem is undecidable in general, but decidable for MPT"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.01914","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1803.01914","created_at":"2026-05-18T00:15:55.322667+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.01914v2","created_at":"2026-05-18T00:15:55.322667+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.01914","created_at":"2026-05-18T00:15:55.322667+00:00"},{"alias_kind":"pith_short_12","alias_value":"T3GGFQZ2M27O","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"T3GGFQZ2M27O2GQQ","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"T3GGFQZ2","created_at":"2026-05-18T12:32:53.628368+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T3GGFQZ2M27O2GQQUYNR6HTIZS","json":"https://pith.science/pith/T3GGFQZ2M27O2GQQUYNR6HTIZS.json","graph_json":"https://pith.science/api/pith-number/T3GGFQZ2M27O2GQQUYNR6HTIZS/graph.json","events_json":"https://pith.science/api/pith-number/T3GGFQZ2M27O2GQQUYNR6HTIZS/events.json","paper":"https://pith.science/paper/T3GGFQZ2"},"agent_actions":{"view_html":"https://pith.science/pith/T3GGFQZ2M27O2GQQUYNR6HTIZS","download_json":"https://pith.science/pith/T3GGFQZ2M27O2GQQUYNR6HTIZS.json","view_paper":"https://pith.science/paper/T3GGFQZ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.01914&json=true","fetch_graph":"https://pith.science/api/pith-number/T3GGFQZ2M27O2GQQUYNR6HTIZS/graph.json","fetch_events":"https://pith.science/api/pith-number/T3GGFQZ2M27O2GQQUYNR6HTIZS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T3GGFQZ2M27O2GQQUYNR6HTIZS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T3GGFQZ2M27O2GQQUYNR6HTIZS/action/storage_attestation","attest_author":"https://pith.science/pith/T3GGFQZ2M27O2GQQUYNR6HTIZS/action/author_attestation","sign_citation":"https://pith.science/pith/T3GGFQZ2M27O2GQQUYNR6HTIZS/action/citation_signature","submit_replication":"https://pith.science/pith/T3GGFQZ2M27O2GQQUYNR6HTIZS/action/replication_record"}},"created_at":"2026-05-18T00:15:55.322667+00:00","updated_at":"2026-05-18T00:15:55.322667+00:00"}