{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:XQSNA37CCIFJM5N5YECGJABCUM","short_pith_number":"pith:XQSNA37C","canonical_record":{"source":{"id":"1103.5254","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-03-27T22:13:15Z","cross_cats_sorted":[],"title_canon_sha256":"f814913ce9019aac93a4179b25493828780a22057b30e145a8a8cf29d097bdf4","abstract_canon_sha256":"f687f891f8025821888551574fcf69662ccb7014a3f15a40d2ed0162245642bd"},"schema_version":"1.0"},"canonical_sha256":"bc24d06fe2120a9675bdc104648022a30a39bf4575f8e191f3d97b4b3a1f26b0","source":{"kind":"arxiv","id":"1103.5254","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.5254","created_at":"2026-05-18T02:22:11Z"},{"alias_kind":"arxiv_version","alias_value":"1103.5254v3","created_at":"2026-05-18T02:22:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5254","created_at":"2026-05-18T02:22:11Z"},{"alias_kind":"pith_short_12","alias_value":"XQSNA37CCIFJ","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"XQSNA37CCIFJM5N5","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"XQSNA37C","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:XQSNA37CCIFJM5N5YECGJABCUM","target":"record","payload":{"canonical_record":{"source":{"id":"1103.5254","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-03-27T22:13:15Z","cross_cats_sorted":[],"title_canon_sha256":"f814913ce9019aac93a4179b25493828780a22057b30e145a8a8cf29d097bdf4","abstract_canon_sha256":"f687f891f8025821888551574fcf69662ccb7014a3f15a40d2ed0162245642bd"},"schema_version":"1.0"},"canonical_sha256":"bc24d06fe2120a9675bdc104648022a30a39bf4575f8e191f3d97b4b3a1f26b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:11.600293Z","signature_b64":"vS9VyPgQvcMs8LgOLtOm+knr+dOgbzKoff4vdxRrtoSwOshfOhna1pLxjLoopV1fvkhzqZVPVK3l/AEPgAkhCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc24d06fe2120a9675bdc104648022a30a39bf4575f8e191f3d97b4b3a1f26b0","last_reissued_at":"2026-05-18T02:22:11.599739Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:11.599739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.5254","source_version":3,"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-18T02:22:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U8foMmK6BQUMCOTgE6cVpQZFyVUfaJwS1zdaMUEuviOuElcypO2/IvuG3kOf9kYDvp+g7PPnmy6wsEehvvzFCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:56:07.419348Z"},"content_sha256":"dfe5470a49337bb86cbec1a964ffdc71fdaacdbdb5a29f14b6971ed7e03b0cfb","schema_version":"1.0","event_id":"sha256:dfe5470a49337bb86cbec1a964ffdc71fdaacdbdb5a29f14b6971ed7e03b0cfb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:XQSNA37CCIFJM5N5YECGJABCUM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computational Rationalization: The Inverse Equilibrium Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Brian D. Ziebart, J. Andrew Bagnell, Kevin Waugh","submitted_at":"2011-03-27T22:13:15Z","abstract_excerpt":"Modeling the purposeful behavior of imperfect agents from a small number of observations is a challenging task. When restricted to the single-agent decision-theoretic setting, inverse optimal control techniques assume that observed behavior is an approximately optimal solution to an unknown decision problem. These techniques learn a utility function that explains the example behavior and can then be used to accurately predict or imitate future behavior in similar observed or unobserved situations.\n  In this work, we consider similar tasks in competitive and cooperative multi-agent domains. Her"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.5254","kind":"arxiv","version":3},"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-18T02:22:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rzdnQaip/ZO2BSulx7i1ai7pfHefgn3fjzDUR1MPG3CvqMB6IhPblfvmP3rIN+4b4eUCikbfLnOEpfV4NP9DDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:56:07.419701Z"},"content_sha256":"ed8454f2ca72e3f20dc14d76dab20d1fbd53165d6dfc7e59d009bb7c112b8122","schema_version":"1.0","event_id":"sha256:ed8454f2ca72e3f20dc14d76dab20d1fbd53165d6dfc7e59d009bb7c112b8122"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XQSNA37CCIFJM5N5YECGJABCUM/bundle.json","state_url":"https://pith.science/pith/XQSNA37CCIFJM5N5YECGJABCUM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XQSNA37CCIFJM5N5YECGJABCUM/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-05T11:56:07Z","links":{"resolver":"https://pith.science/pith/XQSNA37CCIFJM5N5YECGJABCUM","bundle":"https://pith.science/pith/XQSNA37CCIFJM5N5YECGJABCUM/bundle.json","state":"https://pith.science/pith/XQSNA37CCIFJM5N5YECGJABCUM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XQSNA37CCIFJM5N5YECGJABCUM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:XQSNA37CCIFJM5N5YECGJABCUM","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":"f687f891f8025821888551574fcf69662ccb7014a3f15a40d2ed0162245642bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-03-27T22:13:15Z","title_canon_sha256":"f814913ce9019aac93a4179b25493828780a22057b30e145a8a8cf29d097bdf4"},"schema_version":"1.0","source":{"id":"1103.5254","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.5254","created_at":"2026-05-18T02:22:11Z"},{"alias_kind":"arxiv_version","alias_value":"1103.5254v3","created_at":"2026-05-18T02:22:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5254","created_at":"2026-05-18T02:22:11Z"},{"alias_kind":"pith_short_12","alias_value":"XQSNA37CCIFJ","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"XQSNA37CCIFJM5N5","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"XQSNA37C","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:ed8454f2ca72e3f20dc14d76dab20d1fbd53165d6dfc7e59d009bb7c112b8122","target":"graph","created_at":"2026-05-18T02:22:11Z","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":"Modeling the purposeful behavior of imperfect agents from a small number of observations is a challenging task. When restricted to the single-agent decision-theoretic setting, inverse optimal control techniques assume that observed behavior is an approximately optimal solution to an unknown decision problem. These techniques learn a utility function that explains the example behavior and can then be used to accurately predict or imitate future behavior in similar observed or unobserved situations.\n  In this work, we consider similar tasks in competitive and cooperative multi-agent domains. Her","authors_text":"Brian D. Ziebart, J. Andrew Bagnell, Kevin Waugh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-03-27T22:13:15Z","title":"Computational Rationalization: The Inverse Equilibrium Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.5254","kind":"arxiv","version":3},"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:dfe5470a49337bb86cbec1a964ffdc71fdaacdbdb5a29f14b6971ed7e03b0cfb","target":"record","created_at":"2026-05-18T02:22:11Z","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":"f687f891f8025821888551574fcf69662ccb7014a3f15a40d2ed0162245642bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-03-27T22:13:15Z","title_canon_sha256":"f814913ce9019aac93a4179b25493828780a22057b30e145a8a8cf29d097bdf4"},"schema_version":"1.0","source":{"id":"1103.5254","kind":"arxiv","version":3}},"canonical_sha256":"bc24d06fe2120a9675bdc104648022a30a39bf4575f8e191f3d97b4b3a1f26b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc24d06fe2120a9675bdc104648022a30a39bf4575f8e191f3d97b4b3a1f26b0","first_computed_at":"2026-05-18T02:22:11.599739Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:11.599739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vS9VyPgQvcMs8LgOLtOm+knr+dOgbzKoff4vdxRrtoSwOshfOhna1pLxjLoopV1fvkhzqZVPVK3l/AEPgAkhCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:11.600293Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.5254","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dfe5470a49337bb86cbec1a964ffdc71fdaacdbdb5a29f14b6971ed7e03b0cfb","sha256:ed8454f2ca72e3f20dc14d76dab20d1fbd53165d6dfc7e59d009bb7c112b8122"],"state_sha256":"c2208df9788aa3ed0430ff785a2e2ed0d6f66152c477db5ac04398044532b270"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vpb/ljfaop271jp6xGZvQxNcbY8Y/0tvweDu/Agv1bSsyHhMYIEpnKKHgpdJYTJI8HC3Lv4emiYvDpSAehIkBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T11:56:07.421598Z","bundle_sha256":"14c150bc52987fc5623d12cd4e40e7f1825717741d809798a2526176a7da9ce0"}}