{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:TVDSBR2A3GOKIZ55I3ULL7MYXA","short_pith_number":"pith:TVDSBR2A","canonical_record":{"source":{"id":"1903.07752","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-18T22:54:38Z","cross_cats_sorted":[],"title_canon_sha256":"0626e88265965a0142685158cc5f34cf5c0de8100d3f2949ddc0aee011697722","abstract_canon_sha256":"f74a10edd4719a1be4b3e882f115c08e0214d9dc269cae18940cf0e9380267e4"},"schema_version":"1.0"},"canonical_sha256":"9d4720c740d99ca467bd46e8b5fd98b83bbd0920894368306997d6080219080b","source":{"kind":"arxiv","id":"1903.07752","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.07752","created_at":"2026-05-17T23:50:54Z"},{"alias_kind":"arxiv_version","alias_value":"1903.07752v1","created_at":"2026-05-17T23:50:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07752","created_at":"2026-05-17T23:50:54Z"},{"alias_kind":"pith_short_12","alias_value":"TVDSBR2A3GOK","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"TVDSBR2A3GOKIZ55","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"TVDSBR2A","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:TVDSBR2A3GOKIZ55I3ULL7MYXA","target":"record","payload":{"canonical_record":{"source":{"id":"1903.07752","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-18T22:54:38Z","cross_cats_sorted":[],"title_canon_sha256":"0626e88265965a0142685158cc5f34cf5c0de8100d3f2949ddc0aee011697722","abstract_canon_sha256":"f74a10edd4719a1be4b3e882f115c08e0214d9dc269cae18940cf0e9380267e4"},"schema_version":"1.0"},"canonical_sha256":"9d4720c740d99ca467bd46e8b5fd98b83bbd0920894368306997d6080219080b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:54.109454Z","signature_b64":"6QvPEGMGkHFe8M2nL3lcfnHRvtW0JmQXVHIzrXMXi4VUBzBIrLVMSlFBRZpqRw4wjQUh+TqAs+M7RqVoJ1/KCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d4720c740d99ca467bd46e8b5fd98b83bbd0920894368306997d6080219080b","last_reissued_at":"2026-05-17T23:50:54.108765Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:54.108765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.07752","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-17T23:50:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cq16LUAm0vTalBumuly6nRYCP/LQm5k0p6fn+OV0JewPOuVRXUwLBLqp6uBrl6I26Koq2kpuzgPbM4gUADr/DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:27:49.292593Z"},"content_sha256":"10a4d75dac4e1408f28506f38ab108fdb246ff9ffd1b47551ad93ca18210f5dc","schema_version":"1.0","event_id":"sha256:10a4d75dac4e1408f28506f38ab108fdb246ff9ffd1b47551ad93ca18210f5dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:TVDSBR2A3GOKIZ55I3ULL7MYXA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Incentive Design for Temporal Logic Objectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Lillian J. Ratliff, Melkior Ornik, Ufuk Topcu, Vijay Gupta, Yagiz Savas","submitted_at":"2019-03-18T22:54:38Z","abstract_excerpt":"We study the problem of designing an optimal sequence of incentives that a principal should offer to an agent so that the agent's optimal behavior under the incentives realizes the principal's objective expressed as a temporal logic formula. We consider an agent with a finite decision horizon and model its decision-making process as a Markov decision process (MDP). Under certain assumptions, we present a polynomial-time algorithm to synthesize an incentive sequence that minimizes the cost to the principal. We show that if the underlying MDP has only deterministic transitions, the principal can"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07752","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-17T23:50:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dP98YFUZtEhIg5Ov/DwIoPmJRSCUdY4HAKzZ+VsL9zdwHWsYzce8fIKbOVwk8jehJu19m5HGk5oAKAySrrHWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:27:49.293283Z"},"content_sha256":"620d26e6a011e01d4fd84e0099659e45c6c398368ed697c0a5a2b6fa39503738","schema_version":"1.0","event_id":"sha256:620d26e6a011e01d4fd84e0099659e45c6c398368ed697c0a5a2b6fa39503738"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TVDSBR2A3GOKIZ55I3ULL7MYXA/bundle.json","state_url":"https://pith.science/pith/TVDSBR2A3GOKIZ55I3ULL7MYXA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TVDSBR2A3GOKIZ55I3ULL7MYXA/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-31T08:27:49Z","links":{"resolver":"https://pith.science/pith/TVDSBR2A3GOKIZ55I3ULL7MYXA","bundle":"https://pith.science/pith/TVDSBR2A3GOKIZ55I3ULL7MYXA/bundle.json","state":"https://pith.science/pith/TVDSBR2A3GOKIZ55I3ULL7MYXA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TVDSBR2A3GOKIZ55I3ULL7MYXA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TVDSBR2A3GOKIZ55I3ULL7MYXA","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":"f74a10edd4719a1be4b3e882f115c08e0214d9dc269cae18940cf0e9380267e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-18T22:54:38Z","title_canon_sha256":"0626e88265965a0142685158cc5f34cf5c0de8100d3f2949ddc0aee011697722"},"schema_version":"1.0","source":{"id":"1903.07752","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.07752","created_at":"2026-05-17T23:50:54Z"},{"alias_kind":"arxiv_version","alias_value":"1903.07752v1","created_at":"2026-05-17T23:50:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07752","created_at":"2026-05-17T23:50:54Z"},{"alias_kind":"pith_short_12","alias_value":"TVDSBR2A3GOK","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"TVDSBR2A3GOKIZ55","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"TVDSBR2A","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:620d26e6a011e01d4fd84e0099659e45c6c398368ed697c0a5a2b6fa39503738","target":"graph","created_at":"2026-05-17T23:50:54Z","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":"We study the problem of designing an optimal sequence of incentives that a principal should offer to an agent so that the agent's optimal behavior under the incentives realizes the principal's objective expressed as a temporal logic formula. We consider an agent with a finite decision horizon and model its decision-making process as a Markov decision process (MDP). Under certain assumptions, we present a polynomial-time algorithm to synthesize an incentive sequence that minimizes the cost to the principal. We show that if the underlying MDP has only deterministic transitions, the principal can","authors_text":"Lillian J. Ratliff, Melkior Ornik, Ufuk Topcu, Vijay Gupta, Yagiz Savas","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-18T22:54:38Z","title":"Incentive Design for Temporal Logic Objectives"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07752","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:10a4d75dac4e1408f28506f38ab108fdb246ff9ffd1b47551ad93ca18210f5dc","target":"record","created_at":"2026-05-17T23:50:54Z","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":"f74a10edd4719a1be4b3e882f115c08e0214d9dc269cae18940cf0e9380267e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-18T22:54:38Z","title_canon_sha256":"0626e88265965a0142685158cc5f34cf5c0de8100d3f2949ddc0aee011697722"},"schema_version":"1.0","source":{"id":"1903.07752","kind":"arxiv","version":1}},"canonical_sha256":"9d4720c740d99ca467bd46e8b5fd98b83bbd0920894368306997d6080219080b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d4720c740d99ca467bd46e8b5fd98b83bbd0920894368306997d6080219080b","first_computed_at":"2026-05-17T23:50:54.108765Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:54.108765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6QvPEGMGkHFe8M2nL3lcfnHRvtW0JmQXVHIzrXMXi4VUBzBIrLVMSlFBRZpqRw4wjQUh+TqAs+M7RqVoJ1/KCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:54.109454Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.07752","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:10a4d75dac4e1408f28506f38ab108fdb246ff9ffd1b47551ad93ca18210f5dc","sha256:620d26e6a011e01d4fd84e0099659e45c6c398368ed697c0a5a2b6fa39503738"],"state_sha256":"077a4c3185b8c245f8164736eb235809947412580d5423662875dcf74b172aed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EkbDqTS6OqOAgpXQdpB8Z82MrnrFW3oCsd0XfmnKFetP1XPcU8Xp1BBfdk7MlJgzOlT1Q1N2WjFBDwGCEplrCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T08:27:49.297856Z","bundle_sha256":"478cbac9e7fa956227c996011daf04c80d028ab65610a11882f8bb0ef46fe4b8"}}