{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NMF3R66X43MMUMSXGJAB23PDQO","short_pith_number":"pith:NMF3R66X","canonical_record":{"source":{"id":"1810.11177","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-26T03:45:22Z","cross_cats_sorted":["cs.AI","cs.RO","stat.ML"],"title_canon_sha256":"28d8348bd72329f1379c334abee9a028dbe06c7268594816af951686e30562b8","abstract_canon_sha256":"693f1d62ca45620802d0f871d50834e40f48b11cd19cbc6c9a20c462a7f6373f"},"schema_version":"1.0"},"canonical_sha256":"6b0bb8fbd7e6d8ca325732401d6de383b968f758f2300169b2e09b71c7ac1ab8","source":{"kind":"arxiv","id":"1810.11177","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11177","created_at":"2026-05-18T00:02:14Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11177v1","created_at":"2026-05-18T00:02:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11177","created_at":"2026-05-18T00:02:14Z"},{"alias_kind":"pith_short_12","alias_value":"NMF3R66X43MM","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NMF3R66X43MMUMSX","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NMF3R66X","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NMF3R66X43MMUMSXGJAB23PDQO","target":"record","payload":{"canonical_record":{"source":{"id":"1810.11177","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-26T03:45:22Z","cross_cats_sorted":["cs.AI","cs.RO","stat.ML"],"title_canon_sha256":"28d8348bd72329f1379c334abee9a028dbe06c7268594816af951686e30562b8","abstract_canon_sha256":"693f1d62ca45620802d0f871d50834e40f48b11cd19cbc6c9a20c462a7f6373f"},"schema_version":"1.0"},"canonical_sha256":"6b0bb8fbd7e6d8ca325732401d6de383b968f758f2300169b2e09b71c7ac1ab8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:14.993468Z","signature_b64":"tetBuu8cPc3ZkCwdYPvWj6mS3QtUJc9pv7MkrJm6GzI9NO28npMRz8+Vd8jz141hQoLmcEM/BByHCNjVDoI3Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b0bb8fbd7e6d8ca325732401d6de383b968f758f2300169b2e09b71c7ac1ab8","last_reissued_at":"2026-05-18T00:02:14.992755Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:14.992755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.11177","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:02:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sBj7bdE1wXnQPmFWMzGhHu6wEagmWMBCSVPrqgf3s/CkEmIPjtnhDW99P8+csqWwnxK7cL82gnQfivFCaD4VBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:47:26.283298Z"},"content_sha256":"0eeaad59b707ef1d48127974e7397948877e54ced456808c7bbdbf88ffe80299","schema_version":"1.0","event_id":"sha256:0eeaad59b707ef1d48127974e7397948877e54ced456808c7bbdbf88ffe80299"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NMF3R66X43MMUMSXGJAB23PDQO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning sparse relational transition models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.RO","stat.ML"],"primary_cat":"cs.LG","authors_text":"Leslie Pack Kaelbling, Victoria Xia, Zi Wang","submitted_at":"2018-10-26T03:45:22Z","abstract_excerpt":"We present a representation for describing transition models in complex uncertain domains using relational rules. For any action, a rule selects a set of relevant objects and computes a distribution over properties of just those objects in the resulting state given their properties in the previous state. An iterative greedy algorithm is used to construct a set of deictic references that determine which objects are relevant in any given state. Feed-forward neural networks are used to learn the transition distribution on the relevant objects' properties. This strategy is demonstrated to be both "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11177","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:02:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C51jAT5wncA5mQU5RTCc/ZCMjgHF0LGhsxZHd+q34IbIEGvbuPecUwk8IAs9jiL9lbbDbJu8Unzbp40yGo6zCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:47:26.283984Z"},"content_sha256":"fb5fc8742ee7cf1839c4d3ea43fce7def2d5905098bf39808629b4d74bbdaf00","schema_version":"1.0","event_id":"sha256:fb5fc8742ee7cf1839c4d3ea43fce7def2d5905098bf39808629b4d74bbdaf00"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NMF3R66X43MMUMSXGJAB23PDQO/bundle.json","state_url":"https://pith.science/pith/NMF3R66X43MMUMSXGJAB23PDQO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NMF3R66X43MMUMSXGJAB23PDQO/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-07T09:47:26Z","links":{"resolver":"https://pith.science/pith/NMF3R66X43MMUMSXGJAB23PDQO","bundle":"https://pith.science/pith/NMF3R66X43MMUMSXGJAB23PDQO/bundle.json","state":"https://pith.science/pith/NMF3R66X43MMUMSXGJAB23PDQO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NMF3R66X43MMUMSXGJAB23PDQO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NMF3R66X43MMUMSXGJAB23PDQO","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":"693f1d62ca45620802d0f871d50834e40f48b11cd19cbc6c9a20c462a7f6373f","cross_cats_sorted":["cs.AI","cs.RO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-26T03:45:22Z","title_canon_sha256":"28d8348bd72329f1379c334abee9a028dbe06c7268594816af951686e30562b8"},"schema_version":"1.0","source":{"id":"1810.11177","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11177","created_at":"2026-05-18T00:02:14Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11177v1","created_at":"2026-05-18T00:02:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11177","created_at":"2026-05-18T00:02:14Z"},{"alias_kind":"pith_short_12","alias_value":"NMF3R66X43MM","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NMF3R66X43MMUMSX","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NMF3R66X","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:fb5fc8742ee7cf1839c4d3ea43fce7def2d5905098bf39808629b4d74bbdaf00","target":"graph","created_at":"2026-05-18T00:02:14Z","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 present a representation for describing transition models in complex uncertain domains using relational rules. For any action, a rule selects a set of relevant objects and computes a distribution over properties of just those objects in the resulting state given their properties in the previous state. An iterative greedy algorithm is used to construct a set of deictic references that determine which objects are relevant in any given state. Feed-forward neural networks are used to learn the transition distribution on the relevant objects' properties. This strategy is demonstrated to be both ","authors_text":"Leslie Pack Kaelbling, Victoria Xia, Zi Wang","cross_cats":["cs.AI","cs.RO","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-26T03:45:22Z","title":"Learning sparse relational transition models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11177","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:0eeaad59b707ef1d48127974e7397948877e54ced456808c7bbdbf88ffe80299","target":"record","created_at":"2026-05-18T00:02:14Z","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":"693f1d62ca45620802d0f871d50834e40f48b11cd19cbc6c9a20c462a7f6373f","cross_cats_sorted":["cs.AI","cs.RO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-26T03:45:22Z","title_canon_sha256":"28d8348bd72329f1379c334abee9a028dbe06c7268594816af951686e30562b8"},"schema_version":"1.0","source":{"id":"1810.11177","kind":"arxiv","version":1}},"canonical_sha256":"6b0bb8fbd7e6d8ca325732401d6de383b968f758f2300169b2e09b71c7ac1ab8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b0bb8fbd7e6d8ca325732401d6de383b968f758f2300169b2e09b71c7ac1ab8","first_computed_at":"2026-05-18T00:02:14.992755Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:14.992755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tetBuu8cPc3ZkCwdYPvWj6mS3QtUJc9pv7MkrJm6GzI9NO28npMRz8+Vd8jz141hQoLmcEM/BByHCNjVDoI3Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:14.993468Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.11177","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0eeaad59b707ef1d48127974e7397948877e54ced456808c7bbdbf88ffe80299","sha256:fb5fc8742ee7cf1839c4d3ea43fce7def2d5905098bf39808629b4d74bbdaf00"],"state_sha256":"d2f216baec881d4f1e1f1244d35e09312647665ee9ba906aca082d3eba3eda95"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PcAMbrf0nWuXLjJxfEKqfn7unrccnLVcAFdjp9L0kw1XV8UXqlstOQfMREWEUiyJWGS+sZHMxRKYGDngQUhCCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T09:47:26.287637Z","bundle_sha256":"f808a493c5d197104badf3b2bc9058d8b512fb569b531d7406b4fbd54c8c6ad7"}}