{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:G5LKDMOLGNPD54I2R74KCGWQ7P","short_pith_number":"pith:G5LKDMOL","canonical_record":{"source":{"id":"1803.08966","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-03-23T20:14:51Z","cross_cats_sorted":["cs.CL","cs.FL"],"title_canon_sha256":"0c37748437cc97c6ff5eb11f87538b7bd1a6e6429ec371d2da6db232d609f72a","abstract_canon_sha256":"22d769189a8353a272372052cd85ac5e1470170d4b802affae588abfdb0ab2dd"},"schema_version":"1.0"},"canonical_sha256":"3756a1b1cb335e3ef11a8ff8a11ad0fbc4afc4c1df933207c71bba2cecf79abf","source":{"kind":"arxiv","id":"1803.08966","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.08966","created_at":"2026-05-18T00:20:13Z"},{"alias_kind":"arxiv_version","alias_value":"1803.08966v1","created_at":"2026-05-18T00:20:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.08966","created_at":"2026-05-18T00:20:13Z"},{"alias_kind":"pith_short_12","alias_value":"G5LKDMOLGNPD","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"G5LKDMOLGNPD54I2","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"G5LKDMOL","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:G5LKDMOLGNPD54I2R74KCGWQ7P","target":"record","payload":{"canonical_record":{"source":{"id":"1803.08966","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-03-23T20:14:51Z","cross_cats_sorted":["cs.CL","cs.FL"],"title_canon_sha256":"0c37748437cc97c6ff5eb11f87538b7bd1a6e6429ec371d2da6db232d609f72a","abstract_canon_sha256":"22d769189a8353a272372052cd85ac5e1470170d4b802affae588abfdb0ab2dd"},"schema_version":"1.0"},"canonical_sha256":"3756a1b1cb335e3ef11a8ff8a11ad0fbc4afc4c1df933207c71bba2cecf79abf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:13.118658Z","signature_b64":"M7DkiCVSuau0UzZOwT6+HAQaqmnDS21SKbUdRysXtGZ5W2cCr7cR5BdaXsVZ0KcXcxLJrKCNH3/1DpqKnxjeAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3756a1b1cb335e3ef11a8ff8a11ad0fbc4afc4c1df933207c71bba2cecf79abf","last_reissued_at":"2026-05-18T00:20:13.118095Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:13.118095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.08966","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:20:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Thanv/ILSR3I54AiEHkYMxJvXPgJVJwDenRfeUncV2bB/UHjbiN3atOcMEq+2Qba9XYPxc4w3GdzQIpLiGMDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:39:51.053654Z"},"content_sha256":"a600eb4e0f690dc82eba93dade655e4288f7617f4c724498d0f41b27e94172ff","schema_version":"1.0","event_id":"sha256:a600eb4e0f690dc82eba93dade655e4288f7617f4c724498d0f41b27e94172ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:G5LKDMOLGNPD54I2R74KCGWQ7P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counterexamples for Robotic Planning Explained in Structured Language","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.FL"],"primary_cat":"cs.RO","authors_text":"Kai-Wei Chang, Lu Feng, Mahsa Ghasemi, Ufuk Topcu","submitted_at":"2018-03-23T20:14:51Z","abstract_excerpt":"Automated techniques such as model checking have been used to verify models of robotic mission plans based on Markov decision processes (MDPs) and generate counterexamples that may help diagnose requirement violations. However, such artifacts may be too complex for humans to understand, because existing representations of counterexamples typically include a large number of paths or a complex automaton. To help improve the interpretability of counterexamples, we define a notion of explainable counterexample, which includes a set of structured natural language sentences to describe the robotic b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.08966","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:20:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"epS/LJ116JChbanm9yGQmfY/vFoqWKd1mqfb0SZqqnb804EcWE7KkEulourWvFScP8KyGWuIUcY/415C6qVvDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:39:51.054513Z"},"content_sha256":"206a927d49f6d7f6ecedf7800b875eb72dfa609074e67236b799d73a74910402","schema_version":"1.0","event_id":"sha256:206a927d49f6d7f6ecedf7800b875eb72dfa609074e67236b799d73a74910402"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G5LKDMOLGNPD54I2R74KCGWQ7P/bundle.json","state_url":"https://pith.science/pith/G5LKDMOLGNPD54I2R74KCGWQ7P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G5LKDMOLGNPD54I2R74KCGWQ7P/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-01T02:39:51Z","links":{"resolver":"https://pith.science/pith/G5LKDMOLGNPD54I2R74KCGWQ7P","bundle":"https://pith.science/pith/G5LKDMOLGNPD54I2R74KCGWQ7P/bundle.json","state":"https://pith.science/pith/G5LKDMOLGNPD54I2R74KCGWQ7P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G5LKDMOLGNPD54I2R74KCGWQ7P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:G5LKDMOLGNPD54I2R74KCGWQ7P","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":"22d769189a8353a272372052cd85ac5e1470170d4b802affae588abfdb0ab2dd","cross_cats_sorted":["cs.CL","cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-03-23T20:14:51Z","title_canon_sha256":"0c37748437cc97c6ff5eb11f87538b7bd1a6e6429ec371d2da6db232d609f72a"},"schema_version":"1.0","source":{"id":"1803.08966","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.08966","created_at":"2026-05-18T00:20:13Z"},{"alias_kind":"arxiv_version","alias_value":"1803.08966v1","created_at":"2026-05-18T00:20:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.08966","created_at":"2026-05-18T00:20:13Z"},{"alias_kind":"pith_short_12","alias_value":"G5LKDMOLGNPD","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"G5LKDMOLGNPD54I2","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"G5LKDMOL","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:206a927d49f6d7f6ecedf7800b875eb72dfa609074e67236b799d73a74910402","target":"graph","created_at":"2026-05-18T00:20:13Z","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":"Automated techniques such as model checking have been used to verify models of robotic mission plans based on Markov decision processes (MDPs) and generate counterexamples that may help diagnose requirement violations. However, such artifacts may be too complex for humans to understand, because existing representations of counterexamples typically include a large number of paths or a complex automaton. To help improve the interpretability of counterexamples, we define a notion of explainable counterexample, which includes a set of structured natural language sentences to describe the robotic b","authors_text":"Kai-Wei Chang, Lu Feng, Mahsa Ghasemi, Ufuk Topcu","cross_cats":["cs.CL","cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-03-23T20:14:51Z","title":"Counterexamples for Robotic Planning Explained in Structured Language"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.08966","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:a600eb4e0f690dc82eba93dade655e4288f7617f4c724498d0f41b27e94172ff","target":"record","created_at":"2026-05-18T00:20:13Z","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":"22d769189a8353a272372052cd85ac5e1470170d4b802affae588abfdb0ab2dd","cross_cats_sorted":["cs.CL","cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-03-23T20:14:51Z","title_canon_sha256":"0c37748437cc97c6ff5eb11f87538b7bd1a6e6429ec371d2da6db232d609f72a"},"schema_version":"1.0","source":{"id":"1803.08966","kind":"arxiv","version":1}},"canonical_sha256":"3756a1b1cb335e3ef11a8ff8a11ad0fbc4afc4c1df933207c71bba2cecf79abf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3756a1b1cb335e3ef11a8ff8a11ad0fbc4afc4c1df933207c71bba2cecf79abf","first_computed_at":"2026-05-18T00:20:13.118095Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:13.118095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M7DkiCVSuau0UzZOwT6+HAQaqmnDS21SKbUdRysXtGZ5W2cCr7cR5BdaXsVZ0KcXcxLJrKCNH3/1DpqKnxjeAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:13.118658Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.08966","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a600eb4e0f690dc82eba93dade655e4288f7617f4c724498d0f41b27e94172ff","sha256:206a927d49f6d7f6ecedf7800b875eb72dfa609074e67236b799d73a74910402"],"state_sha256":"b9923ac8a985f81e58037c0c838248ae50279099990526d70dd99fd5a7e4cc63"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bp6vBKI+i0YPh3OsPsTOQvgDraNQDFmaOZderpfjYDQi/ErSN5O6Zhu9o8TVBuDs4hfsZG9TVYIrDNCQy8DABQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T02:39:51.058179Z","bundle_sha256":"dcd4d8b3c476c20a8d521c7b41fcd56c18e87e6ae8128749ccf47dcdddb3e251"}}