{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RAQDPSP4KGW2AXP2FIXSEKTJO6","short_pith_number":"pith:RAQDPSP4","canonical_record":{"source":{"id":"1710.10532","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-10-28T22:01:55Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"4b61995495ca8bd655d41267b7f6a209f5a6b16c8ea60593866476050f4ecced","abstract_canon_sha256":"994a356ca6b31fdb9b62f7b999b2c8cc8580f612c4b654799ba6d6738f9db392"},"schema_version":"1.0"},"canonical_sha256":"882037c9fc51ada05dfa2a2f222a6977a63211faed5f920ab82a9fb47fc382e7","source":{"kind":"arxiv","id":"1710.10532","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.10532","created_at":"2026-05-18T00:31:35Z"},{"alias_kind":"arxiv_version","alias_value":"1710.10532v1","created_at":"2026-05-18T00:31:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10532","created_at":"2026-05-18T00:31:35Z"},{"alias_kind":"pith_short_12","alias_value":"RAQDPSP4KGW2","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RAQDPSP4KGW2AXP2","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RAQDPSP4","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RAQDPSP4KGW2AXP2FIXSEKTJO6","target":"record","payload":{"canonical_record":{"source":{"id":"1710.10532","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-10-28T22:01:55Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"4b61995495ca8bd655d41267b7f6a209f5a6b16c8ea60593866476050f4ecced","abstract_canon_sha256":"994a356ca6b31fdb9b62f7b999b2c8cc8580f612c4b654799ba6d6738f9db392"},"schema_version":"1.0"},"canonical_sha256":"882037c9fc51ada05dfa2a2f222a6977a63211faed5f920ab82a9fb47fc382e7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:35.454455Z","signature_b64":"ZS5//QJtxohWusH9/0+9YYyAdjdrvbTpXc1cUK4wv0KjRYrbgbagdZr0pxsl/ThS37OqKlPjnXbtZplzh+ssBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"882037c9fc51ada05dfa2a2f222a6977a63211faed5f920ab82a9fb47fc382e7","last_reissued_at":"2026-05-18T00:31:35.453819Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:35.453819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.10532","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-18T00:31:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q0IpXQ/sY0iJopxTM34EOZChz3GycgWqkBGg8WpAa//mezR1AoSXMtaDChakkyRaXMkOlxNFiASzE46rkwPvDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:00:20.175204Z"},"content_sha256":"bc1f6eeddb64a44608d9acbc14075257323cf8ebf5530b1941a88833d3479854","schema_version":"1.0","event_id":"sha256:bc1f6eeddb64a44608d9acbc14075257323cf8ebf5530b1941a88833d3479854"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RAQDPSP4KGW2AXP2FIXSEKTJO6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Interpretable Apprenticeship Learning with Temporal Logic Specifications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.SY","authors_text":"Daniel Kasenberg, Matthias Scheutz","submitted_at":"2017-10-28T22:01:55Z","abstract_excerpt":"Recent work has addressed using formulas in linear temporal logic (LTL) as specifications for agents planning in Markov Decision Processes (MDPs). We consider the inverse problem: inferring an LTL specification from demonstrated behavior trajectories in MDPs. We formulate this as a multiobjective optimization problem, and describe state-based (\"what actually happened\") and action-based (\"what the agent expected to happen\") objective functions based on a notion of \"violation cost\". We demonstrate the efficacy of the approach by employing genetic programming to solve this problem in two simple d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10532","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-18T00:31:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zj1FlrsiIQAO3k00O5SM7CuvJlbK/AhNiBpcv0nIsc+FV6aCzCutI9mMQeMcNPJlg/fblsm1pEO6q1/Ys43fAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:00:20.175571Z"},"content_sha256":"8cdc8f932458b83d81906c2433b6b19e87c5f2af37f2cdf5086e8a6de05fa650","schema_version":"1.0","event_id":"sha256:8cdc8f932458b83d81906c2433b6b19e87c5f2af37f2cdf5086e8a6de05fa650"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RAQDPSP4KGW2AXP2FIXSEKTJO6/bundle.json","state_url":"https://pith.science/pith/RAQDPSP4KGW2AXP2FIXSEKTJO6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RAQDPSP4KGW2AXP2FIXSEKTJO6/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-11T10:00:20Z","links":{"resolver":"https://pith.science/pith/RAQDPSP4KGW2AXP2FIXSEKTJO6","bundle":"https://pith.science/pith/RAQDPSP4KGW2AXP2FIXSEKTJO6/bundle.json","state":"https://pith.science/pith/RAQDPSP4KGW2AXP2FIXSEKTJO6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RAQDPSP4KGW2AXP2FIXSEKTJO6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RAQDPSP4KGW2AXP2FIXSEKTJO6","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":"994a356ca6b31fdb9b62f7b999b2c8cc8580f612c4b654799ba6d6738f9db392","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-10-28T22:01:55Z","title_canon_sha256":"4b61995495ca8bd655d41267b7f6a209f5a6b16c8ea60593866476050f4ecced"},"schema_version":"1.0","source":{"id":"1710.10532","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.10532","created_at":"2026-05-18T00:31:35Z"},{"alias_kind":"arxiv_version","alias_value":"1710.10532v1","created_at":"2026-05-18T00:31:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10532","created_at":"2026-05-18T00:31:35Z"},{"alias_kind":"pith_short_12","alias_value":"RAQDPSP4KGW2","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RAQDPSP4KGW2AXP2","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RAQDPSP4","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:8cdc8f932458b83d81906c2433b6b19e87c5f2af37f2cdf5086e8a6de05fa650","target":"graph","created_at":"2026-05-18T00:31: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":"Recent work has addressed using formulas in linear temporal logic (LTL) as specifications for agents planning in Markov Decision Processes (MDPs). We consider the inverse problem: inferring an LTL specification from demonstrated behavior trajectories in MDPs. We formulate this as a multiobjective optimization problem, and describe state-based (\"what actually happened\") and action-based (\"what the agent expected to happen\") objective functions based on a notion of \"violation cost\". We demonstrate the efficacy of the approach by employing genetic programming to solve this problem in two simple d","authors_text":"Daniel Kasenberg, Matthias Scheutz","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-10-28T22:01:55Z","title":"Interpretable Apprenticeship Learning with Temporal Logic Specifications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10532","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:bc1f6eeddb64a44608d9acbc14075257323cf8ebf5530b1941a88833d3479854","target":"record","created_at":"2026-05-18T00:31: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":"994a356ca6b31fdb9b62f7b999b2c8cc8580f612c4b654799ba6d6738f9db392","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-10-28T22:01:55Z","title_canon_sha256":"4b61995495ca8bd655d41267b7f6a209f5a6b16c8ea60593866476050f4ecced"},"schema_version":"1.0","source":{"id":"1710.10532","kind":"arxiv","version":1}},"canonical_sha256":"882037c9fc51ada05dfa2a2f222a6977a63211faed5f920ab82a9fb47fc382e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"882037c9fc51ada05dfa2a2f222a6977a63211faed5f920ab82a9fb47fc382e7","first_computed_at":"2026-05-18T00:31:35.453819Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:35.453819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZS5//QJtxohWusH9/0+9YYyAdjdrvbTpXc1cUK4wv0KjRYrbgbagdZr0pxsl/ThS37OqKlPjnXbtZplzh+ssBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:35.454455Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.10532","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc1f6eeddb64a44608d9acbc14075257323cf8ebf5530b1941a88833d3479854","sha256:8cdc8f932458b83d81906c2433b6b19e87c5f2af37f2cdf5086e8a6de05fa650"],"state_sha256":"37bc5cb233b7a4bc7b0e7680051abd0b67671dd0be7adced881ad418f56b3424"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dy+AMHtlCEUrXQkY5usurc0dmuDs/zmaMcdeoMP9KAPWCGQTKo3scd03XxtuLcr2iAlCNeEfCGt5hHdTWJWKDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T10:00:20.177757Z","bundle_sha256":"068a06e1a7b9df8ce7c9a70f3d0aa1e00efd4e8fd9b6a6cd2954b2d37a5360d9"}}