{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:UMYV34BHBAUMCPD3C55HZGKVHQ","short_pith_number":"pith:UMYV34BH","schema_version":"1.0","canonical_sha256":"a3315df0270828c13c7b177a7c99553c39447b0e97585fe58164bfbfa108c777","source":{"kind":"arxiv","id":"1907.08352","version":1},"attestation_state":"computed","paper":{"title":"Representation Learning for Classical Planning from Partially Observed Traces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Hai Wan, Hankui Hankz Zhuo, Jinxia Lin, Yanan Liu, Zhanhao Xiao","submitted_at":"2019-07-19T02:53:09Z","abstract_excerpt":"Specifying a complete domain model is time-consuming, which has been a bottleneck of AI planning technique application in many real-world scenarios. Most classical domain-model learning approaches output a domain model in the form of the declarative planning language, such as STRIPS or PDDL, and solve new planning instances by invoking an existing planner. However, planning in such a representation is sensitive to the accuracy of the learned domain model which probably cannot be used to solve real planning problems. In this paper, to represent domain models in a vectorization representation wa"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1907.08352","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-07-19T02:53:09Z","cross_cats_sorted":[],"title_canon_sha256":"948fe01e255ed65cd7c4a62d145e8d2d5de4bfee3c28052c8e74667fd0e939ed","abstract_canon_sha256":"e6094b8e9f212ffce41763eaa8516fad6b18de141dd46186b175d9dd8a68c1b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:10.117837Z","signature_b64":"agzaOaNftpYA7t+LaH/uro/oD9W3+rwxtwwiPHCTKnE3lMhT2mFgMOGEjeA7x4jVfsdeASNycndbEl+48XejAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3315df0270828c13c7b177a7c99553c39447b0e97585fe58164bfbfa108c777","last_reissued_at":"2026-05-17T23:40:10.117355Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:10.117355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Representation Learning for Classical Planning from Partially Observed Traces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Hai Wan, Hankui Hankz Zhuo, Jinxia Lin, Yanan Liu, Zhanhao Xiao","submitted_at":"2019-07-19T02:53:09Z","abstract_excerpt":"Specifying a complete domain model is time-consuming, which has been a bottleneck of AI planning technique application in many real-world scenarios. Most classical domain-model learning approaches output a domain model in the form of the declarative planning language, such as STRIPS or PDDL, and solve new planning instances by invoking an existing planner. However, planning in such a representation is sensitive to the accuracy of the learned domain model which probably cannot be used to solve real planning problems. In this paper, to represent domain models in a vectorization representation wa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08352","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.08352","created_at":"2026-05-17T23:40:10.117430+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.08352v1","created_at":"2026-05-17T23:40:10.117430+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08352","created_at":"2026-05-17T23:40:10.117430+00:00"},{"alias_kind":"pith_short_12","alias_value":"UMYV34BHBAUM","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"UMYV34BHBAUMCPD3","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"UMYV34BH","created_at":"2026-05-18T12:33:30.264802+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UMYV34BHBAUMCPD3C55HZGKVHQ","json":"https://pith.science/pith/UMYV34BHBAUMCPD3C55HZGKVHQ.json","graph_json":"https://pith.science/api/pith-number/UMYV34BHBAUMCPD3C55HZGKVHQ/graph.json","events_json":"https://pith.science/api/pith-number/UMYV34BHBAUMCPD3C55HZGKVHQ/events.json","paper":"https://pith.science/paper/UMYV34BH"},"agent_actions":{"view_html":"https://pith.science/pith/UMYV34BHBAUMCPD3C55HZGKVHQ","download_json":"https://pith.science/pith/UMYV34BHBAUMCPD3C55HZGKVHQ.json","view_paper":"https://pith.science/paper/UMYV34BH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.08352&json=true","fetch_graph":"https://pith.science/api/pith-number/UMYV34BHBAUMCPD3C55HZGKVHQ/graph.json","fetch_events":"https://pith.science/api/pith-number/UMYV34BHBAUMCPD3C55HZGKVHQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UMYV34BHBAUMCPD3C55HZGKVHQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UMYV34BHBAUMCPD3C55HZGKVHQ/action/storage_attestation","attest_author":"https://pith.science/pith/UMYV34BHBAUMCPD3C55HZGKVHQ/action/author_attestation","sign_citation":"https://pith.science/pith/UMYV34BHBAUMCPD3C55HZGKVHQ/action/citation_signature","submit_replication":"https://pith.science/pith/UMYV34BHBAUMCPD3C55HZGKVHQ/action/replication_record"}},"created_at":"2026-05-17T23:40:10.117430+00:00","updated_at":"2026-05-17T23:40:10.117430+00:00"}