{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:DOX2JW5WEMSDK5ESZRUZNWG7ND","short_pith_number":"pith:DOX2JW5W","canonical_record":{"source":{"id":"1903.08218","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-03-19T19:08:32Z","cross_cats_sorted":[],"title_canon_sha256":"504c895ff53cc6c5353073cc003f1eb6f37aa897bde2e18c375a74c2f38f5d73","abstract_canon_sha256":"f23c0e2b034166aabd3e6bfd9d991e4470f125f69b2502951a0dc7ea98c42654"},"schema_version":"1.0"},"canonical_sha256":"1bafa4dbb62324357492cc6996d8df68f82a00f84550143b15daac3cf6471df8","source":{"kind":"arxiv","id":"1903.08218","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.08218","created_at":"2026-05-17T23:50:50Z"},{"alias_kind":"arxiv_version","alias_value":"1903.08218v1","created_at":"2026-05-17T23:50:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.08218","created_at":"2026-05-17T23:50:50Z"},{"alias_kind":"pith_short_12","alias_value":"DOX2JW5WEMSD","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DOX2JW5WEMSDK5ES","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DOX2JW5W","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:DOX2JW5WEMSDK5ESZRUZNWG7ND","target":"record","payload":{"canonical_record":{"source":{"id":"1903.08218","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-03-19T19:08:32Z","cross_cats_sorted":[],"title_canon_sha256":"504c895ff53cc6c5353073cc003f1eb6f37aa897bde2e18c375a74c2f38f5d73","abstract_canon_sha256":"f23c0e2b034166aabd3e6bfd9d991e4470f125f69b2502951a0dc7ea98c42654"},"schema_version":"1.0"},"canonical_sha256":"1bafa4dbb62324357492cc6996d8df68f82a00f84550143b15daac3cf6471df8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:50.021031Z","signature_b64":"QY4SvvTFrGtRqGZf1mK0Rl094TY+yTb70RBijGJ9KZJplfa+G7SlZGRM5YAegiHDVgO33ag92RCxFOrbKBwACQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bafa4dbb62324357492cc6996d8df68f82a00f84550143b15daac3cf6471df8","last_reissued_at":"2026-05-17T23:50:50.020228Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:50.020228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.08218","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:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bCw88MdKf7FO7uQtMms6GnLAAq1EzofiKfgvvBPvAO5iyvelxdNlRRh9LK2y4FXz+KAp7tMYR1ucPmOMwRXDCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:59:05.771048Z"},"content_sha256":"66fafc712b837524cc683f24f1cce2cdd40cdeffe98fe1978396f80da1f29ca5","schema_version":"1.0","event_id":"sha256:66fafc712b837524cc683f24f1cce2cdd40cdeffe98fe1978396f80da1f29ca5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:DOX2JW5WEMSDK5ESZRUZNWG7ND","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Why Couldn't You do that? Explaining Unsolvability of Classical Planning Problems in the Presence of Plan Advice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"David Smith, Sarath Sreedharan, Siddharth Srivastava, Subbarao Kambhampati","submitted_at":"2019-03-19T19:08:32Z","abstract_excerpt":"Explainable planning is widely accepted as a prerequisite for autonomous agents to successfully work with humans. While there has been a lot of research on generating explanations of solutions to planning problems, explaining the absence of solutions remains an open and under-studied problem, even though such situations can be the hardest to understand or debug. In this paper, we show that hierarchical abstractions can be used to efficiently generate reasons for unsolvability of planning problems. In contrast to related work on computing certificates of unsolvability, we show that these method"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.08218","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:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CRe4aMcrVoHSuW+OcBQEAJxcTOFpB5w66VTf52Bvb/ewwoX7MzdTE/hCd4vi8eo9QIaafpYCsOM17CzAhL96Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:59:05.771399Z"},"content_sha256":"bdca7ff5e5f0926ac724263786637f0e14ab4b7c7d5626cdf8b7d6d978f1e6fe","schema_version":"1.0","event_id":"sha256:bdca7ff5e5f0926ac724263786637f0e14ab4b7c7d5626cdf8b7d6d978f1e6fe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DOX2JW5WEMSDK5ESZRUZNWG7ND/bundle.json","state_url":"https://pith.science/pith/DOX2JW5WEMSDK5ESZRUZNWG7ND/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DOX2JW5WEMSDK5ESZRUZNWG7ND/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-02T17:59:05Z","links":{"resolver":"https://pith.science/pith/DOX2JW5WEMSDK5ESZRUZNWG7ND","bundle":"https://pith.science/pith/DOX2JW5WEMSDK5ESZRUZNWG7ND/bundle.json","state":"https://pith.science/pith/DOX2JW5WEMSDK5ESZRUZNWG7ND/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DOX2JW5WEMSDK5ESZRUZNWG7ND/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:DOX2JW5WEMSDK5ESZRUZNWG7ND","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":"f23c0e2b034166aabd3e6bfd9d991e4470f125f69b2502951a0dc7ea98c42654","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-03-19T19:08:32Z","title_canon_sha256":"504c895ff53cc6c5353073cc003f1eb6f37aa897bde2e18c375a74c2f38f5d73"},"schema_version":"1.0","source":{"id":"1903.08218","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.08218","created_at":"2026-05-17T23:50:50Z"},{"alias_kind":"arxiv_version","alias_value":"1903.08218v1","created_at":"2026-05-17T23:50:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.08218","created_at":"2026-05-17T23:50:50Z"},{"alias_kind":"pith_short_12","alias_value":"DOX2JW5WEMSD","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DOX2JW5WEMSDK5ES","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DOX2JW5W","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:bdca7ff5e5f0926ac724263786637f0e14ab4b7c7d5626cdf8b7d6d978f1e6fe","target":"graph","created_at":"2026-05-17T23:50:50Z","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":"Explainable planning is widely accepted as a prerequisite for autonomous agents to successfully work with humans. While there has been a lot of research on generating explanations of solutions to planning problems, explaining the absence of solutions remains an open and under-studied problem, even though such situations can be the hardest to understand or debug. In this paper, we show that hierarchical abstractions can be used to efficiently generate reasons for unsolvability of planning problems. In contrast to related work on computing certificates of unsolvability, we show that these method","authors_text":"David Smith, Sarath Sreedharan, Siddharth Srivastava, Subbarao Kambhampati","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-03-19T19:08:32Z","title":"Why Couldn't You do that? Explaining Unsolvability of Classical Planning Problems in the Presence of Plan Advice"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.08218","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:66fafc712b837524cc683f24f1cce2cdd40cdeffe98fe1978396f80da1f29ca5","target":"record","created_at":"2026-05-17T23:50:50Z","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":"f23c0e2b034166aabd3e6bfd9d991e4470f125f69b2502951a0dc7ea98c42654","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-03-19T19:08:32Z","title_canon_sha256":"504c895ff53cc6c5353073cc003f1eb6f37aa897bde2e18c375a74c2f38f5d73"},"schema_version":"1.0","source":{"id":"1903.08218","kind":"arxiv","version":1}},"canonical_sha256":"1bafa4dbb62324357492cc6996d8df68f82a00f84550143b15daac3cf6471df8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1bafa4dbb62324357492cc6996d8df68f82a00f84550143b15daac3cf6471df8","first_computed_at":"2026-05-17T23:50:50.020228Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:50.020228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QY4SvvTFrGtRqGZf1mK0Rl094TY+yTb70RBijGJ9KZJplfa+G7SlZGRM5YAegiHDVgO33ag92RCxFOrbKBwACQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:50.021031Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.08218","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:66fafc712b837524cc683f24f1cce2cdd40cdeffe98fe1978396f80da1f29ca5","sha256:bdca7ff5e5f0926ac724263786637f0e14ab4b7c7d5626cdf8b7d6d978f1e6fe"],"state_sha256":"d594db5f9652e2dd6946d84d9fecf3dfcd4e2410d6252d8d7e157c06aab0613d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mjiCODArNfPqocSIhRr6raFrLt7c5w4LHRfUhdkL2ec3sxwu+SooVCMx8aAuFBK+7VYGWmDR2/DvF2EWIGEJDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T17:59:05.773512Z","bundle_sha256":"0c3ec0025be5fbb5d2fd710102b988d29f809d9ccaceed0705a0d08c23390c11"}}