{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:3DCYUJA2WKTDQRU3NCLS4QQBZA","short_pith_number":"pith:3DCYUJA2","canonical_record":{"source":{"id":"1611.03852","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-11T20:53:45Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"3cca2b439fe0c7ddd95f395b667fbc3c7703a0cf9f9930bbaca99cebec0664b6","abstract_canon_sha256":"ac8cb84c19f90a3d2ff6dae607f26fce9d227446646859e55f110c7f5bed7893"},"schema_version":"1.0"},"canonical_sha256":"d8c58a241ab2a638469b68972e4201c837f310a73979865788fad3918ca34ff2","source":{"kind":"arxiv","id":"1611.03852","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.03852","created_at":"2026-05-18T00:56:45Z"},{"alias_kind":"arxiv_version","alias_value":"1611.03852v3","created_at":"2026-05-18T00:56:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03852","created_at":"2026-05-18T00:56:45Z"},{"alias_kind":"pith_short_12","alias_value":"3DCYUJA2WKTD","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3DCYUJA2WKTDQRU3","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3DCYUJA2","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:3DCYUJA2WKTDQRU3NCLS4QQBZA","target":"record","payload":{"canonical_record":{"source":{"id":"1611.03852","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-11T20:53:45Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"3cca2b439fe0c7ddd95f395b667fbc3c7703a0cf9f9930bbaca99cebec0664b6","abstract_canon_sha256":"ac8cb84c19f90a3d2ff6dae607f26fce9d227446646859e55f110c7f5bed7893"},"schema_version":"1.0"},"canonical_sha256":"d8c58a241ab2a638469b68972e4201c837f310a73979865788fad3918ca34ff2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:45.101291Z","signature_b64":"LTd6X8pk+XLCfpzehDc5Mlh9kcjalRN0AHH9gUWMBtrpzzn8uzhbUtN8K7X1u8fc+1OBLJDV0Gewi+UHxMlKCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8c58a241ab2a638469b68972e4201c837f310a73979865788fad3918ca34ff2","last_reissued_at":"2026-05-18T00:56:45.100625Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:45.100625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.03852","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-18T00:56:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qlGSplgsCdxQia7h/lKCt6derG9MiEHp90nSQEKKdft147w7SfLsqa39wS0OPqEAru+MM+cd42qjJJYI6YtmDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T08:15:25.716247Z"},"content_sha256":"570e497f2ec81fe2d7e57a1596fcd0979dc8bf25523cf3b4e173150888dbcdc5","schema_version":"1.0","event_id":"sha256:570e497f2ec81fe2d7e57a1596fcd0979dc8bf25523cf3b4e173150888dbcdc5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:3DCYUJA2WKTDQRU3NCLS4QQBZA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Connection between Generative Adversarial Networks, Inverse Reinforcement Learning, and Energy-Based Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Chelsea Finn, Paul Christiano, Pieter Abbeel, Sergey Levine","submitted_at":"2016-11-11T20:53:45Z","abstract_excerpt":"Generative adversarial networks (GANs) are a recently proposed class of generative models in which a generator is trained to optimize a cost function that is being simultaneously learned by a discriminator. While the idea of learning cost functions is relatively new to the field of generative modeling, learning costs has long been studied in control and reinforcement learning (RL) domains, typically for imitation learning from demonstrations. In these fields, learning cost function underlying observed behavior is known as inverse reinforcement learning (IRL) or inverse optimal control. While a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03852","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-18T00:56:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IAOGcdiuDmrd8Nc+qfC0H40kPr6i9/v5IVvbeY4/lsZl0b8AYtAKufRIZcNuq/4IkrgMIEpK1hRpkfb2saIFDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T08:15:25.716614Z"},"content_sha256":"8800edfe21ca5b8d25ec82930d7e4ca966f5f4092e87f99bbb0318e3bc32484f","schema_version":"1.0","event_id":"sha256:8800edfe21ca5b8d25ec82930d7e4ca966f5f4092e87f99bbb0318e3bc32484f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3DCYUJA2WKTDQRU3NCLS4QQBZA/bundle.json","state_url":"https://pith.science/pith/3DCYUJA2WKTDQRU3NCLS4QQBZA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3DCYUJA2WKTDQRU3NCLS4QQBZA/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-02T08:15:25Z","links":{"resolver":"https://pith.science/pith/3DCYUJA2WKTDQRU3NCLS4QQBZA","bundle":"https://pith.science/pith/3DCYUJA2WKTDQRU3NCLS4QQBZA/bundle.json","state":"https://pith.science/pith/3DCYUJA2WKTDQRU3NCLS4QQBZA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3DCYUJA2WKTDQRU3NCLS4QQBZA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3DCYUJA2WKTDQRU3NCLS4QQBZA","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":"ac8cb84c19f90a3d2ff6dae607f26fce9d227446646859e55f110c7f5bed7893","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-11T20:53:45Z","title_canon_sha256":"3cca2b439fe0c7ddd95f395b667fbc3c7703a0cf9f9930bbaca99cebec0664b6"},"schema_version":"1.0","source":{"id":"1611.03852","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.03852","created_at":"2026-05-18T00:56:45Z"},{"alias_kind":"arxiv_version","alias_value":"1611.03852v3","created_at":"2026-05-18T00:56:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03852","created_at":"2026-05-18T00:56:45Z"},{"alias_kind":"pith_short_12","alias_value":"3DCYUJA2WKTD","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3DCYUJA2WKTDQRU3","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3DCYUJA2","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:8800edfe21ca5b8d25ec82930d7e4ca966f5f4092e87f99bbb0318e3bc32484f","target":"graph","created_at":"2026-05-18T00:56:45Z","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":"Generative adversarial networks (GANs) are a recently proposed class of generative models in which a generator is trained to optimize a cost function that is being simultaneously learned by a discriminator. While the idea of learning cost functions is relatively new to the field of generative modeling, learning costs has long been studied in control and reinforcement learning (RL) domains, typically for imitation learning from demonstrations. In these fields, learning cost function underlying observed behavior is known as inverse reinforcement learning (IRL) or inverse optimal control. While a","authors_text":"Chelsea Finn, Paul Christiano, Pieter Abbeel, Sergey Levine","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-11T20:53:45Z","title":"A Connection between Generative Adversarial Networks, Inverse Reinforcement Learning, and Energy-Based Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03852","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:570e497f2ec81fe2d7e57a1596fcd0979dc8bf25523cf3b4e173150888dbcdc5","target":"record","created_at":"2026-05-18T00:56:45Z","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":"ac8cb84c19f90a3d2ff6dae607f26fce9d227446646859e55f110c7f5bed7893","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-11T20:53:45Z","title_canon_sha256":"3cca2b439fe0c7ddd95f395b667fbc3c7703a0cf9f9930bbaca99cebec0664b6"},"schema_version":"1.0","source":{"id":"1611.03852","kind":"arxiv","version":3}},"canonical_sha256":"d8c58a241ab2a638469b68972e4201c837f310a73979865788fad3918ca34ff2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d8c58a241ab2a638469b68972e4201c837f310a73979865788fad3918ca34ff2","first_computed_at":"2026-05-18T00:56:45.100625Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:45.100625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LTd6X8pk+XLCfpzehDc5Mlh9kcjalRN0AHH9gUWMBtrpzzn8uzhbUtN8K7X1u8fc+1OBLJDV0Gewi+UHxMlKCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:45.101291Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.03852","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:570e497f2ec81fe2d7e57a1596fcd0979dc8bf25523cf3b4e173150888dbcdc5","sha256:8800edfe21ca5b8d25ec82930d7e4ca966f5f4092e87f99bbb0318e3bc32484f"],"state_sha256":"2102b34aa42f58fc182dc814c026a212c12482446de574604eda47e7d9cd11a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H3YrnzljKOpbfTA6U6rE8J0RrpWPo5yklTBuYbw9jhGYNrKs8LwdDMkoRTetTho7i6QUUqyJMIUPhfmrmf+fCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T08:15:25.718756Z","bundle_sha256":"31e2faebf563adcb8f803a7a39a555113a83a9caaec0348e3dc6ef42da6f2309"}}