{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:U3JS734F4A6LBXZNLRUE5M4LKA","short_pith_number":"pith:U3JS734F","schema_version":"1.0","canonical_sha256":"a6d32fef85e03cb0df2d5c684eb38b500d4459ce9acac05a55ed901522641dc1","source":{"kind":"arxiv","id":"2106.05648","version":3},"attestation_state":"computed","paper":{"title":"Unsupervised Behaviour Discovery with Quality-Diversity Optimisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.RO"],"primary_cat":"cs.NE","authors_text":"Antoine Cully, Luca Grillotti","submitted_at":"2021-06-10T10:40:18Z","abstract_excerpt":"Quality-Diversity algorithms refer to a class of evolutionary algorithms designed to find a collection of diverse and high-performing solutions to a given problem. In robotics, such algorithms can be used for generating a collection of controllers covering most of the possible behaviours of a robot. To do so, these algorithms associate a behavioural descriptor to each of these behaviours. Each behavioural descriptor is used for estimating the novelty of one behaviour compared to the others. In most existing algorithms, the behavioural descriptor needs to be hand-coded, thus requiring prior kno"},"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":"2106.05648","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2021-06-10T10:40:18Z","cross_cats_sorted":["cs.AI","cs.LG","cs.RO"],"title_canon_sha256":"0ab92678e8808689995918603bc82848269cb0bc1d9a6da54f5e963f47e369ea","abstract_canon_sha256":"77ce7dcaf17930157d1c10a583417d269c3cf2de69372e0981d239f5d5bdefbf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:57:26.944228Z","signature_b64":"0XS4U98y7ErenBkp1wR1C+eBMTsd3QC2nFp/Te1q9DPo6lMA9lFIVQMj1dMuSt1Do543eUuCfuJVHVFYN3clDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6d32fef85e03cb0df2d5c684eb38b500d4459ce9acac05a55ed901522641dc1","last_reissued_at":"2026-07-05T03:57:26.943803Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:57:26.943803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unsupervised Behaviour Discovery with Quality-Diversity Optimisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.RO"],"primary_cat":"cs.NE","authors_text":"Antoine Cully, Luca Grillotti","submitted_at":"2021-06-10T10:40:18Z","abstract_excerpt":"Quality-Diversity algorithms refer to a class of evolutionary algorithms designed to find a collection of diverse and high-performing solutions to a given problem. In robotics, such algorithms can be used for generating a collection of controllers covering most of the possible behaviours of a robot. To do so, these algorithms associate a behavioural descriptor to each of these behaviours. Each behavioural descriptor is used for estimating the novelty of one behaviour compared to the others. In most existing algorithms, the behavioural descriptor needs to be hand-coded, thus requiring prior kno"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.05648","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2106.05648/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2106.05648","created_at":"2026-07-05T03:57:26.943863+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.05648v3","created_at":"2026-07-05T03:57:26.943863+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.05648","created_at":"2026-07-05T03:57:26.943863+00:00"},{"alias_kind":"pith_short_12","alias_value":"U3JS734F4A6L","created_at":"2026-07-05T03:57:26.943863+00:00"},{"alias_kind":"pith_short_16","alias_value":"U3JS734F4A6LBXZN","created_at":"2026-07-05T03:57:26.943863+00:00"},{"alias_kind":"pith_short_8","alias_value":"U3JS734F","created_at":"2026-07-05T03:57:26.943863+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2309.16797","citing_title":"Promptbreeder: Self-Referential Self-Improvement Via Prompt Evolution","ref_index":122,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U3JS734F4A6LBXZNLRUE5M4LKA","json":"https://pith.science/pith/U3JS734F4A6LBXZNLRUE5M4LKA.json","graph_json":"https://pith.science/api/pith-number/U3JS734F4A6LBXZNLRUE5M4LKA/graph.json","events_json":"https://pith.science/api/pith-number/U3JS734F4A6LBXZNLRUE5M4LKA/events.json","paper":"https://pith.science/paper/U3JS734F"},"agent_actions":{"view_html":"https://pith.science/pith/U3JS734F4A6LBXZNLRUE5M4LKA","download_json":"https://pith.science/pith/U3JS734F4A6LBXZNLRUE5M4LKA.json","view_paper":"https://pith.science/paper/U3JS734F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.05648&json=true","fetch_graph":"https://pith.science/api/pith-number/U3JS734F4A6LBXZNLRUE5M4LKA/graph.json","fetch_events":"https://pith.science/api/pith-number/U3JS734F4A6LBXZNLRUE5M4LKA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U3JS734F4A6LBXZNLRUE5M4LKA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U3JS734F4A6LBXZNLRUE5M4LKA/action/storage_attestation","attest_author":"https://pith.science/pith/U3JS734F4A6LBXZNLRUE5M4LKA/action/author_attestation","sign_citation":"https://pith.science/pith/U3JS734F4A6LBXZNLRUE5M4LKA/action/citation_signature","submit_replication":"https://pith.science/pith/U3JS734F4A6LBXZNLRUE5M4LKA/action/replication_record"}},"created_at":"2026-07-05T03:57:26.943863+00:00","updated_at":"2026-07-05T03:57:26.943863+00:00"}