{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:A6GHLWOIVLM7VZ3CRT3GIBL235","short_pith_number":"pith:A6GHLWOI","canonical_record":{"source":{"id":"1602.00481","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-02-01T11:34:54Z","cross_cats_sorted":[],"title_canon_sha256":"87c6ea8ab61dbc1f8e186efe75bdada33468544ff74521c41d967090f566e0ca","abstract_canon_sha256":"36c36afa7cbdee7471258f32cfc4842996d33fa00216fca5ae52f33cced21e2b"},"schema_version":"1.0"},"canonical_sha256":"078c75d9c8aad9fae7628cf664057adf4786018e39272db207302fce7ad9872e","source":{"kind":"arxiv","id":"1602.00481","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.00481","created_at":"2026-05-18T01:21:35Z"},{"alias_kind":"arxiv_version","alias_value":"1602.00481v1","created_at":"2026-05-18T01:21:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00481","created_at":"2026-05-18T01:21:35Z"},{"alias_kind":"pith_short_12","alias_value":"A6GHLWOIVLM7","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"A6GHLWOIVLM7VZ3C","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"A6GHLWOI","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:A6GHLWOIVLM7VZ3CRT3GIBL235","target":"record","payload":{"canonical_record":{"source":{"id":"1602.00481","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-02-01T11:34:54Z","cross_cats_sorted":[],"title_canon_sha256":"87c6ea8ab61dbc1f8e186efe75bdada33468544ff74521c41d967090f566e0ca","abstract_canon_sha256":"36c36afa7cbdee7471258f32cfc4842996d33fa00216fca5ae52f33cced21e2b"},"schema_version":"1.0"},"canonical_sha256":"078c75d9c8aad9fae7628cf664057adf4786018e39272db207302fce7ad9872e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:35.261166Z","signature_b64":"SchDjCES7WqSZxVj+dHKOpmpDVxPYCczjUBSNqb79Q5XBUMJQXcvS2KACy82ciDT1sjkut0oMcGqFta8D7PXBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"078c75d9c8aad9fae7628cf664057adf4786018e39272db207302fce7ad9872e","last_reissued_at":"2026-05-18T01:21:35.260672Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:35.260672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.00481","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:21:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cbtj37rLEL4xr90UrjzYTiqGB4AnlToJ4XUI7ymyLLyAjcL8geThLFcX7SW9ymMKBjAxlOhGe6aKyZoPwcsFBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:40:36.599387Z"},"content_sha256":"31be4fb29e034c9ead9031d9a6b947218c0a422dbfb630893e83fb3a02bf8182","schema_version":"1.0","event_id":"sha256:31be4fb29e034c9ead9031d9a6b947218c0a422dbfb630893e83fb3a02bf8182"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:A6GHLWOIVLM7VZ3CRT3GIBL235","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Symbolic Optimal Reachability in Weighted Timed Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Maximilien Colange, Nicolas Markey, Patricia Bouyer","submitted_at":"2016-02-01T11:34:54Z","abstract_excerpt":"Weighted timed automata have been defined in the early 2000's for modelling resource-consumption or -allocation problems in real-time systems. Optimal reachability is decidable in weighted timed automata, and a symbolic forward algorithm has been developed to solve that problem. This algorithm uses so-called priced zones, an extension of standard zones with cost functions. In order to ensure termination, the algorithm requires clocks to be bounded. For unpriced timed automata, much work has been done to develop sound abstractions adapted to the forward exploration of timed automata, ensuring t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00481","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:21:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v6MSlUszCKrNYVi1gt3T+NuDNF3xQkRfJrLXQhBcnbRYsctfs3HVRfDxf2p8MlYrzmptIQtMqBkizbj5BoxwAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:40:36.599755Z"},"content_sha256":"7b6d9ff45389224da26a72c9cff49b4c423711b478ff5068c2a474394ca20b53","schema_version":"1.0","event_id":"sha256:7b6d9ff45389224da26a72c9cff49b4c423711b478ff5068c2a474394ca20b53"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A6GHLWOIVLM7VZ3CRT3GIBL235/bundle.json","state_url":"https://pith.science/pith/A6GHLWOIVLM7VZ3CRT3GIBL235/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A6GHLWOIVLM7VZ3CRT3GIBL235/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-31T02:40:36Z","links":{"resolver":"https://pith.science/pith/A6GHLWOIVLM7VZ3CRT3GIBL235","bundle":"https://pith.science/pith/A6GHLWOIVLM7VZ3CRT3GIBL235/bundle.json","state":"https://pith.science/pith/A6GHLWOIVLM7VZ3CRT3GIBL235/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A6GHLWOIVLM7VZ3CRT3GIBL235/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:A6GHLWOIVLM7VZ3CRT3GIBL235","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":"36c36afa7cbdee7471258f32cfc4842996d33fa00216fca5ae52f33cced21e2b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-02-01T11:34:54Z","title_canon_sha256":"87c6ea8ab61dbc1f8e186efe75bdada33468544ff74521c41d967090f566e0ca"},"schema_version":"1.0","source":{"id":"1602.00481","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.00481","created_at":"2026-05-18T01:21:35Z"},{"alias_kind":"arxiv_version","alias_value":"1602.00481v1","created_at":"2026-05-18T01:21:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00481","created_at":"2026-05-18T01:21:35Z"},{"alias_kind":"pith_short_12","alias_value":"A6GHLWOIVLM7","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"A6GHLWOIVLM7VZ3C","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"A6GHLWOI","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:7b6d9ff45389224da26a72c9cff49b4c423711b478ff5068c2a474394ca20b53","target":"graph","created_at":"2026-05-18T01:21:35Z","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":"Weighted timed automata have been defined in the early 2000's for modelling resource-consumption or -allocation problems in real-time systems. Optimal reachability is decidable in weighted timed automata, and a symbolic forward algorithm has been developed to solve that problem. This algorithm uses so-called priced zones, an extension of standard zones with cost functions. In order to ensure termination, the algorithm requires clocks to be bounded. For unpriced timed automata, much work has been done to develop sound abstractions adapted to the forward exploration of timed automata, ensuring t","authors_text":"Maximilien Colange, Nicolas Markey, Patricia Bouyer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-02-01T11:34:54Z","title":"Symbolic Optimal Reachability in Weighted Timed Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00481","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:31be4fb29e034c9ead9031d9a6b947218c0a422dbfb630893e83fb3a02bf8182","target":"record","created_at":"2026-05-18T01:21:35Z","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":"36c36afa7cbdee7471258f32cfc4842996d33fa00216fca5ae52f33cced21e2b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-02-01T11:34:54Z","title_canon_sha256":"87c6ea8ab61dbc1f8e186efe75bdada33468544ff74521c41d967090f566e0ca"},"schema_version":"1.0","source":{"id":"1602.00481","kind":"arxiv","version":1}},"canonical_sha256":"078c75d9c8aad9fae7628cf664057adf4786018e39272db207302fce7ad9872e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"078c75d9c8aad9fae7628cf664057adf4786018e39272db207302fce7ad9872e","first_computed_at":"2026-05-18T01:21:35.260672Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:35.260672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SchDjCES7WqSZxVj+dHKOpmpDVxPYCczjUBSNqb79Q5XBUMJQXcvS2KACy82ciDT1sjkut0oMcGqFta8D7PXBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:35.261166Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.00481","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:31be4fb29e034c9ead9031d9a6b947218c0a422dbfb630893e83fb3a02bf8182","sha256:7b6d9ff45389224da26a72c9cff49b4c423711b478ff5068c2a474394ca20b53"],"state_sha256":"0785206f6aa344f0b2048b684682b32b2bc7de39bb3a605e828002d25761dd62"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jJ/ggATpczI3HJYuY5BG6VzYsXm2ws1Vt5f7QhEfrQ+GFS9+8HzpIImjgVvZEUL4J8gzU9Mds1OqlOZAtM/4Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:40:36.602848Z","bundle_sha256":"2530b00c494c076ca9b56bc2519eef0f5876c6028ae65a0edc784f75b80c130f"}}