{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:XILQXZ7QQZNV4YEOCW3N3EYFZZ","short_pith_number":"pith:XILQXZ7Q","canonical_record":{"source":{"id":"1304.5159","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-04-18T15:11:25Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"62f90bde5943a96a02aadce5b125d67becf184e7f5b5849a02f38032e53e11ab","abstract_canon_sha256":"7284116236c7e912164017853c60a9293fe77cf4d7cfefa4b8a8109ab1d1c77a"},"schema_version":"1.0"},"canonical_sha256":"ba170be7f0865b5e608e15b6dd9305ce74bf0cb70bae53b8e1f76915b37ce642","source":{"kind":"arxiv","id":"1304.5159","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5159","created_at":"2026-05-18T03:27:41Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5159v1","created_at":"2026-05-18T03:27:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5159","created_at":"2026-05-18T03:27:41Z"},{"alias_kind":"pith_short_12","alias_value":"XILQXZ7QQZNV","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XILQXZ7QQZNV4YEO","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XILQXZ7Q","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:XILQXZ7QQZNV4YEOCW3N3EYFZZ","target":"record","payload":{"canonical_record":{"source":{"id":"1304.5159","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-04-18T15:11:25Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"62f90bde5943a96a02aadce5b125d67becf184e7f5b5849a02f38032e53e11ab","abstract_canon_sha256":"7284116236c7e912164017853c60a9293fe77cf4d7cfefa4b8a8109ab1d1c77a"},"schema_version":"1.0"},"canonical_sha256":"ba170be7f0865b5e608e15b6dd9305ce74bf0cb70bae53b8e1f76915b37ce642","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:41.598349Z","signature_b64":"WB0GpbZoq/HCgiLSqqArEkXsKakmqLGzQYux0eY2NoxlVFxvz06SAXjFJ0mfQkauLSWZ03gCMARz7aD1PDlRDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba170be7f0865b5e608e15b6dd9305ce74bf0cb70bae53b8e1f76915b37ce642","last_reissued_at":"2026-05-18T03:27:41.597758Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:41.597758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.5159","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-18T03:27:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sY/PO9CaYa4mKnl7nchqLBPfKkT5sbtPi87YbfFNM3Qx/ZmJIuABEVtIqg+WxzBQg7muBiT17xVhGhNmwyFrDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:29:53.467691Z"},"content_sha256":"32b3301926dbc9b593a86b8ee0e62301c0e1858f31124da62d7a28a995629380","schema_version":"1.0","event_id":"sha256:32b3301926dbc9b593a86b8ee0e62301c0e1858f31124da62d7a28a995629380"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:XILQXZ7QQZNV4YEOCW3N3EYFZZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Interactive POMDP Lite: Towards Practical Planning to Predict and Exploit Intentions for Interacting with Self-Interested Agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.AI","authors_text":"Kian Hsiang Low, Trong Nghia Hoang","submitted_at":"2013-04-18T15:11:25Z","abstract_excerpt":"A key challenge in non-cooperative multi-agent systems is that of developing efficient planning algorithms for intelligent agents to interact and perform effectively among boundedly rational, self-interested agents (e.g., humans). The practicality of existing works addressing this challenge is being undermined due to either the restrictive assumptions of the other agents' behavior, the failure in accounting for their rationality, or the prohibitively expensive cost of modeling and predicting their intentions. To boost the practicality of research in this field, we investigate how intention pre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5159","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-18T03:27:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JKk2y9rgvbhkbxMxoIg+1un+rJz56LGxDwYHYDXfMU2XgbfawS7O0yMNMFSQOjSQmi+PX4oL1je5v0Y/0NveAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:29:53.468037Z"},"content_sha256":"21ce8296210f9aeb11a9652a2fbb4e94a4467dc3e1aadc60746c570437304cad","schema_version":"1.0","event_id":"sha256:21ce8296210f9aeb11a9652a2fbb4e94a4467dc3e1aadc60746c570437304cad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XILQXZ7QQZNV4YEOCW3N3EYFZZ/bundle.json","state_url":"https://pith.science/pith/XILQXZ7QQZNV4YEOCW3N3EYFZZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XILQXZ7QQZNV4YEOCW3N3EYFZZ/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-09T16:29:53Z","links":{"resolver":"https://pith.science/pith/XILQXZ7QQZNV4YEOCW3N3EYFZZ","bundle":"https://pith.science/pith/XILQXZ7QQZNV4YEOCW3N3EYFZZ/bundle.json","state":"https://pith.science/pith/XILQXZ7QQZNV4YEOCW3N3EYFZZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XILQXZ7QQZNV4YEOCW3N3EYFZZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XILQXZ7QQZNV4YEOCW3N3EYFZZ","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":"7284116236c7e912164017853c60a9293fe77cf4d7cfefa4b8a8109ab1d1c77a","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-04-18T15:11:25Z","title_canon_sha256":"62f90bde5943a96a02aadce5b125d67becf184e7f5b5849a02f38032e53e11ab"},"schema_version":"1.0","source":{"id":"1304.5159","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5159","created_at":"2026-05-18T03:27:41Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5159v1","created_at":"2026-05-18T03:27:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5159","created_at":"2026-05-18T03:27:41Z"},{"alias_kind":"pith_short_12","alias_value":"XILQXZ7QQZNV","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XILQXZ7QQZNV4YEO","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XILQXZ7Q","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:21ce8296210f9aeb11a9652a2fbb4e94a4467dc3e1aadc60746c570437304cad","target":"graph","created_at":"2026-05-18T03:27:41Z","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":"A key challenge in non-cooperative multi-agent systems is that of developing efficient planning algorithms for intelligent agents to interact and perform effectively among boundedly rational, self-interested agents (e.g., humans). The practicality of existing works addressing this challenge is being undermined due to either the restrictive assumptions of the other agents' behavior, the failure in accounting for their rationality, or the prohibitively expensive cost of modeling and predicting their intentions. To boost the practicality of research in this field, we investigate how intention pre","authors_text":"Kian Hsiang Low, Trong Nghia Hoang","cross_cats":["cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-04-18T15:11:25Z","title":"Interactive POMDP Lite: Towards Practical Planning to Predict and Exploit Intentions for Interacting with Self-Interested Agents"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5159","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:32b3301926dbc9b593a86b8ee0e62301c0e1858f31124da62d7a28a995629380","target":"record","created_at":"2026-05-18T03:27:41Z","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":"7284116236c7e912164017853c60a9293fe77cf4d7cfefa4b8a8109ab1d1c77a","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-04-18T15:11:25Z","title_canon_sha256":"62f90bde5943a96a02aadce5b125d67becf184e7f5b5849a02f38032e53e11ab"},"schema_version":"1.0","source":{"id":"1304.5159","kind":"arxiv","version":1}},"canonical_sha256":"ba170be7f0865b5e608e15b6dd9305ce74bf0cb70bae53b8e1f76915b37ce642","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ba170be7f0865b5e608e15b6dd9305ce74bf0cb70bae53b8e1f76915b37ce642","first_computed_at":"2026-05-18T03:27:41.597758Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:41.597758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WB0GpbZoq/HCgiLSqqArEkXsKakmqLGzQYux0eY2NoxlVFxvz06SAXjFJ0mfQkauLSWZ03gCMARz7aD1PDlRDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:41.598349Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.5159","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:32b3301926dbc9b593a86b8ee0e62301c0e1858f31124da62d7a28a995629380","sha256:21ce8296210f9aeb11a9652a2fbb4e94a4467dc3e1aadc60746c570437304cad"],"state_sha256":"912c00bfa0fe9c4d581c3ae07fe89e1d3da6b6a8d1f79e1acebad965cea6ac37"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G02H7uhuk3VLoZAAQocVSThh2/xKq4Ewej3hwsF02KffZdPz26YTxEvlCQC8l7tkVVqkmTl7hQYUnrt8gHH3BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T16:29:53.470182Z","bundle_sha256":"9416e5c5e5ee0f9e632e753e08f872cbd9e35eed00d51f86c987a70773d80bc2"}}