{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:KHTVKSDJHCQRPUT7Z3H4NVXBRU","short_pith_number":"pith:KHTVKSDJ","canonical_record":{"source":{"id":"1201.3498","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-01-17T12:46:55Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"6e7f75b65ebc7704db02d80c054671e5bbec5b554bec9deb705099033003e1a2","abstract_canon_sha256":"74103542d1567b51a6da6f4dc27e7a780e4fd2ee94d440cae99c5e9834a6d570"},"schema_version":"1.0"},"canonical_sha256":"51e755486938a117d27fcecfc6d6e18d1cb7d830aa1aaf0d58e54684713ddbe1","source":{"kind":"arxiv","id":"1201.3498","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.3498","created_at":"2026-05-18T03:36:37Z"},{"alias_kind":"arxiv_version","alias_value":"1201.3498v3","created_at":"2026-05-18T03:36:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.3498","created_at":"2026-05-18T03:36:37Z"},{"alias_kind":"pith_short_12","alias_value":"KHTVKSDJHCQR","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KHTVKSDJHCQRPUT7","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KHTVKSDJ","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:KHTVKSDJHCQRPUT7Z3H4NVXBRU","target":"record","payload":{"canonical_record":{"source":{"id":"1201.3498","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-01-17T12:46:55Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"6e7f75b65ebc7704db02d80c054671e5bbec5b554bec9deb705099033003e1a2","abstract_canon_sha256":"74103542d1567b51a6da6f4dc27e7a780e4fd2ee94d440cae99c5e9834a6d570"},"schema_version":"1.0"},"canonical_sha256":"51e755486938a117d27fcecfc6d6e18d1cb7d830aa1aaf0d58e54684713ddbe1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:37.009748Z","signature_b64":"vnJlCEec/Vt4FSuJ0dQUmYpeDx7Wh4hLEmvpxJeaSq7zEdJGAhhBkfbs82K0/Gwv3WC/qGr0zJaQpEakLX16Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51e755486938a117d27fcecfc6d6e18d1cb7d830aa1aaf0d58e54684713ddbe1","last_reissued_at":"2026-05-18T03:36:37.009217Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:37.009217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.3498","source_version":3,"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-18T03:36:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X42AvH99Mjibn8A02kdrIt9nfgISi7CKCB+rkq2N91CL+xiuTeLpTgRTwO5P6V1rwzJVV3tvkCjnyaJJVL5/Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:43:13.100595Z"},"content_sha256":"a6ca1a04b0fd95a8070fcb93122fb7f30860a75a6ffe7f6432b36361de6f8a3e","schema_version":"1.0","event_id":"sha256:a6ca1a04b0fd95a8070fcb93122fb7f30860a75a6ffe7f6432b36361de6f8a3e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:KHTVKSDJHCQRPUT7Z3H4NVXBRU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Faster Algorithm for Solving One-Clock Priced Timed Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.GT","authors_text":"Peter Bro Miltersen, Rasmus Ibsen-Jensen, Thomas Dueholm Hansen","submitted_at":"2012-01-17T12:46:55Z","abstract_excerpt":"One-clock priced timed games is a class of two-player, zero-sum, continuous-time games that was defined and thoroughly studied in previous works. We show that one-clock priced timed games can be solved in time m 12^n n^(O(1)), where n is the number of states and m is the number of actions. The best previously known time bound for solving one-clock priced timed games was 2^(O(n^2+m)), due to Rutkowski. For our improvement, we introduce and study a new algorithm for solving one-clock priced timed games, based on the sweep-line technique from computational geometry and the strategy iteration para"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.3498","kind":"arxiv","version":3},"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-18T03:36:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sSbW3LDPB+rT2ZEYdZBbJXVvahxn3PqXN6QHDNHOb0/oh9yfonljnnHO8KhMgJP3troUsFADP77qVcL3SV6MCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:43:13.100946Z"},"content_sha256":"e1ebe48e89298955a6e3227a58adbf8324e300c0060d6d1a0abd959f9d7af1af","schema_version":"1.0","event_id":"sha256:e1ebe48e89298955a6e3227a58adbf8324e300c0060d6d1a0abd959f9d7af1af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KHTVKSDJHCQRPUT7Z3H4NVXBRU/bundle.json","state_url":"https://pith.science/pith/KHTVKSDJHCQRPUT7Z3H4NVXBRU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KHTVKSDJHCQRPUT7Z3H4NVXBRU/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-06-05T01:43:13Z","links":{"resolver":"https://pith.science/pith/KHTVKSDJHCQRPUT7Z3H4NVXBRU","bundle":"https://pith.science/pith/KHTVKSDJHCQRPUT7Z3H4NVXBRU/bundle.json","state":"https://pith.science/pith/KHTVKSDJHCQRPUT7Z3H4NVXBRU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KHTVKSDJHCQRPUT7Z3H4NVXBRU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:KHTVKSDJHCQRPUT7Z3H4NVXBRU","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":"74103542d1567b51a6da6f4dc27e7a780e4fd2ee94d440cae99c5e9834a6d570","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-01-17T12:46:55Z","title_canon_sha256":"6e7f75b65ebc7704db02d80c054671e5bbec5b554bec9deb705099033003e1a2"},"schema_version":"1.0","source":{"id":"1201.3498","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.3498","created_at":"2026-05-18T03:36:37Z"},{"alias_kind":"arxiv_version","alias_value":"1201.3498v3","created_at":"2026-05-18T03:36:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.3498","created_at":"2026-05-18T03:36:37Z"},{"alias_kind":"pith_short_12","alias_value":"KHTVKSDJHCQR","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KHTVKSDJHCQRPUT7","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KHTVKSDJ","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:e1ebe48e89298955a6e3227a58adbf8324e300c0060d6d1a0abd959f9d7af1af","target":"graph","created_at":"2026-05-18T03:36:37Z","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":"One-clock priced timed games is a class of two-player, zero-sum, continuous-time games that was defined and thoroughly studied in previous works. We show that one-clock priced timed games can be solved in time m 12^n n^(O(1)), where n is the number of states and m is the number of actions. The best previously known time bound for solving one-clock priced timed games was 2^(O(n^2+m)), due to Rutkowski. For our improvement, we introduce and study a new algorithm for solving one-clock priced timed games, based on the sweep-line technique from computational geometry and the strategy iteration para","authors_text":"Peter Bro Miltersen, Rasmus Ibsen-Jensen, Thomas Dueholm Hansen","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-01-17T12:46:55Z","title":"A Faster Algorithm for Solving One-Clock Priced Timed Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.3498","kind":"arxiv","version":3},"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:a6ca1a04b0fd95a8070fcb93122fb7f30860a75a6ffe7f6432b36361de6f8a3e","target":"record","created_at":"2026-05-18T03:36:37Z","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":"74103542d1567b51a6da6f4dc27e7a780e4fd2ee94d440cae99c5e9834a6d570","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-01-17T12:46:55Z","title_canon_sha256":"6e7f75b65ebc7704db02d80c054671e5bbec5b554bec9deb705099033003e1a2"},"schema_version":"1.0","source":{"id":"1201.3498","kind":"arxiv","version":3}},"canonical_sha256":"51e755486938a117d27fcecfc6d6e18d1cb7d830aa1aaf0d58e54684713ddbe1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51e755486938a117d27fcecfc6d6e18d1cb7d830aa1aaf0d58e54684713ddbe1","first_computed_at":"2026-05-18T03:36:37.009217Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:37.009217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vnJlCEec/Vt4FSuJ0dQUmYpeDx7Wh4hLEmvpxJeaSq7zEdJGAhhBkfbs82K0/Gwv3WC/qGr0zJaQpEakLX16Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:37.009748Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.3498","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a6ca1a04b0fd95a8070fcb93122fb7f30860a75a6ffe7f6432b36361de6f8a3e","sha256:e1ebe48e89298955a6e3227a58adbf8324e300c0060d6d1a0abd959f9d7af1af"],"state_sha256":"ff5b9e004f4a66812dfbbed8dad36678bdc49a3a5399b0e40b737d60431a836a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JxAaUinVd9+mGTsxopVdkCTnjefH/gJfV2Py1pxt1b7ii9zSc77SVFe0RLRiHVwkoGU5ZPbALBVT9WDzsVsPBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T01:43:13.103242Z","bundle_sha256":"712c62cf564af7824d20367826f4c21bc84b7201572f1294f2532f45ea5d7cdb"}}