{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:74AMLNTIQIY7Z4BSMJP4HPWKPI","short_pith_number":"pith:74AMLNTI","canonical_record":{"source":{"id":"1806.07822","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-20T16:15:54Z","cross_cats_sorted":["cs.AI","cs.CV","cs.RO","stat.ML"],"title_canon_sha256":"979f4f769317ff85c6677f0a1c5a2cec456800572e6020f204c2536780da2a19","abstract_canon_sha256":"ea2d4eac039857c8089e17cee10f405e95112a09ed06b6cabbced95a61e47d3a"},"schema_version":"1.0"},"canonical_sha256":"ff00c5b6688231fcf032625fc3beca7a17a641d965f84be3308cfb7831b7c8aa","source":{"kind":"arxiv","id":"1806.07822","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.07822","created_at":"2026-05-18T00:05:21Z"},{"alias_kind":"arxiv_version","alias_value":"1806.07822v2","created_at":"2026-05-18T00:05:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07822","created_at":"2026-05-18T00:05:21Z"},{"alias_kind":"pith_short_12","alias_value":"74AMLNTIQIY7","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"74AMLNTIQIY7Z4BS","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"74AMLNTI","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:74AMLNTIQIY7Z4BSMJP4HPWKPI","target":"record","payload":{"canonical_record":{"source":{"id":"1806.07822","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-20T16:15:54Z","cross_cats_sorted":["cs.AI","cs.CV","cs.RO","stat.ML"],"title_canon_sha256":"979f4f769317ff85c6677f0a1c5a2cec456800572e6020f204c2536780da2a19","abstract_canon_sha256":"ea2d4eac039857c8089e17cee10f405e95112a09ed06b6cabbced95a61e47d3a"},"schema_version":"1.0"},"canonical_sha256":"ff00c5b6688231fcf032625fc3beca7a17a641d965f84be3308cfb7831b7c8aa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:21.513844Z","signature_b64":"CDfj7CIQ+/XK761PVG81zoAg/8TxOr1OZ5nlSQr7S9l4pEGOPEdPwoULlgOJwno3LYC9n7cbDBHj1aGN4Vo/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff00c5b6688231fcf032625fc3beca7a17a641d965f84be3308cfb7831b7c8aa","last_reissued_at":"2026-05-18T00:05:21.513185Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:21.513185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.07822","source_version":2,"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:05:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XvekgP72MHJLJRwkSGvkKvnvm4bUvh9EEbxvDDMpNH2fprf7LvMcGbgBH5J0ys/usYo23eYdwLWXRpV/OMFyCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:15:19.501532Z"},"content_sha256":"81a4599c41c6771ec0a23bd3c2e18fb2cdef009c3ff4e0fd39b89de4fd087864","schema_version":"1.0","event_id":"sha256:81a4599c41c6771ec0a23bd3c2e18fb2cdef009c3ff4e0fd39b89de4fd087864"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:74AMLNTIQIY7Z4BSMJP4HPWKPI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Neural Parsers with Deterministic Differentiable Imitation Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV","cs.RO","stat.ML"],"primary_cat":"cs.LG","authors_text":"Katharina Muelling, Kris M. Kitani, Nicholas Rhinehart, Tanmay Shankar","submitted_at":"2018-06-20T16:15:54Z","abstract_excerpt":"We explore the problem of learning to decompose spatial tasks into segments, as exemplified by the problem of a painting robot covering a large object. Inspired by the ability of classical decision tree algorithms to construct structured partitions of their input spaces, we formulate the problem of decomposing objects into segments as a parsing approach. We make the insight that the derivation of a parse-tree that decomposes the object into segments closely resembles a decision tree constructed by ID3, which can be done when the ground-truth available. We learn to imitate an expert parsing ora"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.07822","kind":"arxiv","version":2},"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:05:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uCx1z8jbN1tNxY/5EAJxbJRf5qSpg3MgXrvkL2bSY9m/+LHVFo9Zrp9/m7whQ6/SPRxDFX/b6ZJgKJ64gk+QCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:15:19.501886Z"},"content_sha256":"bdf8b57e9f9b925166fe037ab2a24b464eb9844f105a28b50e24bc8cae7b3d65","schema_version":"1.0","event_id":"sha256:bdf8b57e9f9b925166fe037ab2a24b464eb9844f105a28b50e24bc8cae7b3d65"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/74AMLNTIQIY7Z4BSMJP4HPWKPI/bundle.json","state_url":"https://pith.science/pith/74AMLNTIQIY7Z4BSMJP4HPWKPI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/74AMLNTIQIY7Z4BSMJP4HPWKPI/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-30T14:15:19Z","links":{"resolver":"https://pith.science/pith/74AMLNTIQIY7Z4BSMJP4HPWKPI","bundle":"https://pith.science/pith/74AMLNTIQIY7Z4BSMJP4HPWKPI/bundle.json","state":"https://pith.science/pith/74AMLNTIQIY7Z4BSMJP4HPWKPI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/74AMLNTIQIY7Z4BSMJP4HPWKPI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:74AMLNTIQIY7Z4BSMJP4HPWKPI","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":"ea2d4eac039857c8089e17cee10f405e95112a09ed06b6cabbced95a61e47d3a","cross_cats_sorted":["cs.AI","cs.CV","cs.RO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-20T16:15:54Z","title_canon_sha256":"979f4f769317ff85c6677f0a1c5a2cec456800572e6020f204c2536780da2a19"},"schema_version":"1.0","source":{"id":"1806.07822","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.07822","created_at":"2026-05-18T00:05:21Z"},{"alias_kind":"arxiv_version","alias_value":"1806.07822v2","created_at":"2026-05-18T00:05:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07822","created_at":"2026-05-18T00:05:21Z"},{"alias_kind":"pith_short_12","alias_value":"74AMLNTIQIY7","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"74AMLNTIQIY7Z4BS","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"74AMLNTI","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:bdf8b57e9f9b925166fe037ab2a24b464eb9844f105a28b50e24bc8cae7b3d65","target":"graph","created_at":"2026-05-18T00:05:21Z","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 explore the problem of learning to decompose spatial tasks into segments, as exemplified by the problem of a painting robot covering a large object. Inspired by the ability of classical decision tree algorithms to construct structured partitions of their input spaces, we formulate the problem of decomposing objects into segments as a parsing approach. We make the insight that the derivation of a parse-tree that decomposes the object into segments closely resembles a decision tree constructed by ID3, which can be done when the ground-truth available. We learn to imitate an expert parsing ora","authors_text":"Katharina Muelling, Kris M. Kitani, Nicholas Rhinehart, Tanmay Shankar","cross_cats":["cs.AI","cs.CV","cs.RO","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-20T16:15:54Z","title":"Learning Neural Parsers with Deterministic Differentiable Imitation Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.07822","kind":"arxiv","version":2},"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:81a4599c41c6771ec0a23bd3c2e18fb2cdef009c3ff4e0fd39b89de4fd087864","target":"record","created_at":"2026-05-18T00:05:21Z","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":"ea2d4eac039857c8089e17cee10f405e95112a09ed06b6cabbced95a61e47d3a","cross_cats_sorted":["cs.AI","cs.CV","cs.RO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-20T16:15:54Z","title_canon_sha256":"979f4f769317ff85c6677f0a1c5a2cec456800572e6020f204c2536780da2a19"},"schema_version":"1.0","source":{"id":"1806.07822","kind":"arxiv","version":2}},"canonical_sha256":"ff00c5b6688231fcf032625fc3beca7a17a641d965f84be3308cfb7831b7c8aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff00c5b6688231fcf032625fc3beca7a17a641d965f84be3308cfb7831b7c8aa","first_computed_at":"2026-05-18T00:05:21.513185Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:21.513185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CDfj7CIQ+/XK761PVG81zoAg/8TxOr1OZ5nlSQr7S9l4pEGOPEdPwoULlgOJwno3LYC9n7cbDBHj1aGN4Vo/Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:21.513844Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.07822","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:81a4599c41c6771ec0a23bd3c2e18fb2cdef009c3ff4e0fd39b89de4fd087864","sha256:bdf8b57e9f9b925166fe037ab2a24b464eb9844f105a28b50e24bc8cae7b3d65"],"state_sha256":"3a2d22320a87bb3cd46d94f343e357fcfffc077d2d7d4371d3ef9533f25ec24f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lBm/UUCtVcrcRCt9w+4s37VLJ7TmU2UJ7QH7XRff+72Go3uU7bF0sXUTnCYoWDRxFT97vIS7z+Wwi99E+gFWBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T14:15:19.504036Z","bundle_sha256":"bbff1f322d3032f9df90701965ca1f13cfc4febcda79b5ed79f4db5a6afc544f"}}