{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ODTQR3FPEGTXCAPVDHEYYV74PI","short_pith_number":"pith:ODTQR3FP","schema_version":"1.0","canonical_sha256":"70e708ecaf21a77101f519c98c57fc7a005a4515393b0b9e34d6d4cbf28d7652","source":{"kind":"arxiv","id":"1801.06503","version":1},"attestation_state":"computed","paper":{"title":"Global overview of Imitation Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Alexandre Attia, Sharone Dayan","submitted_at":"2018-01-19T17:40:09Z","abstract_excerpt":"Imitation Learning is a sequential task where the learner tries to mimic an expert's action in order to achieve the best performance. Several algorithms have been proposed recently for this task. In this project, we aim at proposing a wide review of these algorithms, presenting their main features and comparing them on their performance and their regret bounds."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1801.06503","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-01-19T17:40:09Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"68e1d15b39967a2439ecfeefd67a409fbb95387d034f9a38a8df57764e3d4bbe","abstract_canon_sha256":"40a4cf3eb87b232987415a62d2c73f9fbe360239de216f8d201aec012ab6f773"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:29.840269Z","signature_b64":"vX7OEpHegg/BIPWnIsN2JBg9oiz1GsTsABkHIdDLQwjm6EEODjDzCSGmJB/TitlcJJji+H321zstdQJMvzKUDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70e708ecaf21a77101f519c98c57fc7a005a4515393b0b9e34d6d4cbf28d7652","last_reissued_at":"2026-05-18T00:25:29.839570Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:29.839570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Global overview of Imitation Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Alexandre Attia, Sharone Dayan","submitted_at":"2018-01-19T17:40:09Z","abstract_excerpt":"Imitation Learning is a sequential task where the learner tries to mimic an expert's action in order to achieve the best performance. Several algorithms have been proposed recently for this task. In this project, we aim at proposing a wide review of these algorithms, presenting their main features and comparing them on their performance and their regret bounds."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.06503","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1801.06503","created_at":"2026-05-18T00:25:29.839688+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.06503v1","created_at":"2026-05-18T00:25:29.839688+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.06503","created_at":"2026-05-18T00:25:29.839688+00:00"},{"alias_kind":"pith_short_12","alias_value":"ODTQR3FPEGTX","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"ODTQR3FPEGTXCAPV","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"ODTQR3FP","created_at":"2026-05-18T12:32:43.782077+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.15012","citing_title":"Boosting Reinforcement Learning with Verifiable Rewards via Randomly Selected Few-Shot Guidance","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ODTQR3FPEGTXCAPVDHEYYV74PI","json":"https://pith.science/pith/ODTQR3FPEGTXCAPVDHEYYV74PI.json","graph_json":"https://pith.science/api/pith-number/ODTQR3FPEGTXCAPVDHEYYV74PI/graph.json","events_json":"https://pith.science/api/pith-number/ODTQR3FPEGTXCAPVDHEYYV74PI/events.json","paper":"https://pith.science/paper/ODTQR3FP"},"agent_actions":{"view_html":"https://pith.science/pith/ODTQR3FPEGTXCAPVDHEYYV74PI","download_json":"https://pith.science/pith/ODTQR3FPEGTXCAPVDHEYYV74PI.json","view_paper":"https://pith.science/paper/ODTQR3FP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.06503&json=true","fetch_graph":"https://pith.science/api/pith-number/ODTQR3FPEGTXCAPVDHEYYV74PI/graph.json","fetch_events":"https://pith.science/api/pith-number/ODTQR3FPEGTXCAPVDHEYYV74PI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ODTQR3FPEGTXCAPVDHEYYV74PI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ODTQR3FPEGTXCAPVDHEYYV74PI/action/storage_attestation","attest_author":"https://pith.science/pith/ODTQR3FPEGTXCAPVDHEYYV74PI/action/author_attestation","sign_citation":"https://pith.science/pith/ODTQR3FPEGTXCAPVDHEYYV74PI/action/citation_signature","submit_replication":"https://pith.science/pith/ODTQR3FPEGTXCAPVDHEYYV74PI/action/replication_record"}},"created_at":"2026-05-18T00:25:29.839688+00:00","updated_at":"2026-05-18T00:25:29.839688+00:00"}