{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7VSNGA6BYCJ3LOV2BGDQWC3NDZ","short_pith_number":"pith:7VSNGA6B","canonical_record":{"source":{"id":"1703.00838","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-03-02T15:53:19Z","cross_cats_sorted":[],"title_canon_sha256":"657757e3c9813efd73e5f6c61deefd66b12a4db5c6bc086da722eba7f5311c22","abstract_canon_sha256":"fb12374b9d8116be483950b56767485f4654acde82d8c6a3640bd56898540b1e"},"schema_version":"1.0"},"canonical_sha256":"fd64d303c1c093b5baba09870b0b6d1e6eda714fabb86724734b01197553a50e","source":{"kind":"arxiv","id":"1703.00838","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.00838","created_at":"2026-05-18T00:49:40Z"},{"alias_kind":"arxiv_version","alias_value":"1703.00838v1","created_at":"2026-05-18T00:49:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00838","created_at":"2026-05-18T00:49:40Z"},{"alias_kind":"pith_short_12","alias_value":"7VSNGA6BYCJ3","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7VSNGA6BYCJ3LOV2","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7VSNGA6B","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7VSNGA6BYCJ3LOV2BGDQWC3NDZ","target":"record","payload":{"canonical_record":{"source":{"id":"1703.00838","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-03-02T15:53:19Z","cross_cats_sorted":[],"title_canon_sha256":"657757e3c9813efd73e5f6c61deefd66b12a4db5c6bc086da722eba7f5311c22","abstract_canon_sha256":"fb12374b9d8116be483950b56767485f4654acde82d8c6a3640bd56898540b1e"},"schema_version":"1.0"},"canonical_sha256":"fd64d303c1c093b5baba09870b0b6d1e6eda714fabb86724734b01197553a50e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:40.653577Z","signature_b64":"N98sdFH/NhTE8nJ/KUMDHYhAx28syOdHJ18qktmF/SeEiacMSqdxnEphp16t19SDbQu4VhnVZIPvbquNgZ/mBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd64d303c1c093b5baba09870b0b6d1e6eda714fabb86724734b01197553a50e","last_reissued_at":"2026-05-18T00:49:40.653000Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:40.653000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.00838","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:49:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cuoL3IF60GTEfxwwGMYJSQ6+GLgueQtK7c0wwPBxnGmhvcnmXtyA+1HRjNDNvUcl3a836Ey77Htea4KXHmJwCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:46:09.870465Z"},"content_sha256":"7b7aed4a124cab5be5bc3e7f136d8bc7cc67624dad93df59abd040a7a41191f9","schema_version":"1.0","event_id":"sha256:7b7aed4a124cab5be5bc3e7f136d8bc7cc67624dad93df59abd040a7a41191f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7VSNGA6BYCJ3LOV2BGDQWC3NDZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SLIM: Semi-Lazy Inference Mechanism for Plan Recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Retuh Mirsky, Ya'akov (Kobi) Gal","submitted_at":"2017-03-02T15:53:19Z","abstract_excerpt":"Plan Recognition algorithms require to recognize a complete hierarchy explaining the agent's actions and goals. While the output of such algorithms is informative to the recognizer, the cost of its calculation is high in run-time, space, and completeness. Moreover, performing plan recognition online requires the observing agent to reason about future actions that have not yet been seen and maintain a set of hypotheses to support all possible options. This paper presents a new and efficient algorithm for online plan recognition called SLIM (Semi-Lazy Inference Mechanism). It combines both a bot"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00838","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:49:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w2jKtVmcp//d8zFonJJD1DQhnnLnlJNAXZA90me9DXc6lZwuGY05E0WtUlrhdTsRQe7mb41XePQfZRR4XSJHBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:46:09.870806Z"},"content_sha256":"a03e648a8d4b1abe55a1cd23ffde2d5954a9ebb38b2528705a50c3ad047cd535","schema_version":"1.0","event_id":"sha256:a03e648a8d4b1abe55a1cd23ffde2d5954a9ebb38b2528705a50c3ad047cd535"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7VSNGA6BYCJ3LOV2BGDQWC3NDZ/bundle.json","state_url":"https://pith.science/pith/7VSNGA6BYCJ3LOV2BGDQWC3NDZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7VSNGA6BYCJ3LOV2BGDQWC3NDZ/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-07-07T10:46:09Z","links":{"resolver":"https://pith.science/pith/7VSNGA6BYCJ3LOV2BGDQWC3NDZ","bundle":"https://pith.science/pith/7VSNGA6BYCJ3LOV2BGDQWC3NDZ/bundle.json","state":"https://pith.science/pith/7VSNGA6BYCJ3LOV2BGDQWC3NDZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7VSNGA6BYCJ3LOV2BGDQWC3NDZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7VSNGA6BYCJ3LOV2BGDQWC3NDZ","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":"fb12374b9d8116be483950b56767485f4654acde82d8c6a3640bd56898540b1e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-03-02T15:53:19Z","title_canon_sha256":"657757e3c9813efd73e5f6c61deefd66b12a4db5c6bc086da722eba7f5311c22"},"schema_version":"1.0","source":{"id":"1703.00838","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.00838","created_at":"2026-05-18T00:49:40Z"},{"alias_kind":"arxiv_version","alias_value":"1703.00838v1","created_at":"2026-05-18T00:49:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00838","created_at":"2026-05-18T00:49:40Z"},{"alias_kind":"pith_short_12","alias_value":"7VSNGA6BYCJ3","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7VSNGA6BYCJ3LOV2","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7VSNGA6B","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:a03e648a8d4b1abe55a1cd23ffde2d5954a9ebb38b2528705a50c3ad047cd535","target":"graph","created_at":"2026-05-18T00:49:40Z","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":"Plan Recognition algorithms require to recognize a complete hierarchy explaining the agent's actions and goals. While the output of such algorithms is informative to the recognizer, the cost of its calculation is high in run-time, space, and completeness. Moreover, performing plan recognition online requires the observing agent to reason about future actions that have not yet been seen and maintain a set of hypotheses to support all possible options. This paper presents a new and efficient algorithm for online plan recognition called SLIM (Semi-Lazy Inference Mechanism). It combines both a bot","authors_text":"Retuh Mirsky, Ya'akov (Kobi) Gal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-03-02T15:53:19Z","title":"SLIM: Semi-Lazy Inference Mechanism for Plan Recognition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00838","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:7b7aed4a124cab5be5bc3e7f136d8bc7cc67624dad93df59abd040a7a41191f9","target":"record","created_at":"2026-05-18T00:49:40Z","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":"fb12374b9d8116be483950b56767485f4654acde82d8c6a3640bd56898540b1e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-03-02T15:53:19Z","title_canon_sha256":"657757e3c9813efd73e5f6c61deefd66b12a4db5c6bc086da722eba7f5311c22"},"schema_version":"1.0","source":{"id":"1703.00838","kind":"arxiv","version":1}},"canonical_sha256":"fd64d303c1c093b5baba09870b0b6d1e6eda714fabb86724734b01197553a50e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd64d303c1c093b5baba09870b0b6d1e6eda714fabb86724734b01197553a50e","first_computed_at":"2026-05-18T00:49:40.653000Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:40.653000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N98sdFH/NhTE8nJ/KUMDHYhAx28syOdHJ18qktmF/SeEiacMSqdxnEphp16t19SDbQu4VhnVZIPvbquNgZ/mBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:40.653577Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.00838","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b7aed4a124cab5be5bc3e7f136d8bc7cc67624dad93df59abd040a7a41191f9","sha256:a03e648a8d4b1abe55a1cd23ffde2d5954a9ebb38b2528705a50c3ad047cd535"],"state_sha256":"09be0b2ad15720c598beb4c6e494d404b10f3e4aac0c0f4b3871b4148d7329e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YP6JDYocrolPEw+P49hjBFmy4DVR7S8RLEbjDCRnWBE9M6tBAdv+DpESNIeqg1clJzlvgppynMkT/0HpWm4rDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T10:46:09.872659Z","bundle_sha256":"66db10562cec9ffa9b356d333e47d6e20327e1529c5fbc5c18dc751306c74c2f"}}