{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QPSD3QXGOTCR2R4STFE2452OPY","short_pith_number":"pith:QPSD3QXG","schema_version":"1.0","canonical_sha256":"83e43dc2e674c51d47929949ae774e7e12cf87fc4960f25fb834f5cfc178e363","source":{"kind":"arxiv","id":"1910.07151","version":2},"attestation_state":"computed","paper":{"title":"Parallel Exploration via Negatively Correlated Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.NE","authors_text":"Ke Tang, Peng Yang, Qi Yang, Xin Yao","submitted_at":"2019-10-16T03:30:29Z","abstract_excerpt":"Effective exploration is a key to successful search. The recently proposed Negatively Correlated Search (NCS) tries to achieve this by parallel exploration, where a set of search processes are driven to be negatively correlated so that different promising areas of the search space can be visited simultaneously. Various applications have verified the advantages of such novel search behaviors. Nevertheless, the mathematical understandings are still lacking as the previous NCS was mostly devised by intuition. In this paper, a more principled NCS is presented, explaining that the parallel explorat"},"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":"1910.07151","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-10-16T03:30:29Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"2087111a7cb30b1463b0cd08405bbf6f2682f656fb5b6ae6a476c9849df9dfa6","abstract_canon_sha256":"9718efa12325ad0694297d95823cb8d7b46d404684bbaa44a61aa602e927f75a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:53:27.256278Z","signature_b64":"28/qJGxAJKJirdMbem3sjO8ToahBCS1+ggZyJK/fKc8fncJr5MMTd5pLNUphxqn+JqU4Dt7Hx0OuE/wLwz+KDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83e43dc2e674c51d47929949ae774e7e12cf87fc4960f25fb834f5cfc178e363","last_reissued_at":"2026-07-05T06:53:27.255815Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:53:27.255815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel Exploration via Negatively Correlated Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.NE","authors_text":"Ke Tang, Peng Yang, Qi Yang, Xin Yao","submitted_at":"2019-10-16T03:30:29Z","abstract_excerpt":"Effective exploration is a key to successful search. The recently proposed Negatively Correlated Search (NCS) tries to achieve this by parallel exploration, where a set of search processes are driven to be negatively correlated so that different promising areas of the search space can be visited simultaneously. Various applications have verified the advantages of such novel search behaviors. Nevertheless, the mathematical understandings are still lacking as the previous NCS was mostly devised by intuition. In this paper, a more principled NCS is presented, explaining that the parallel explorat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.07151","kind":"arxiv","version":2},"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/1910.07151/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":"1910.07151","created_at":"2026-07-05T06:53:27.255873+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.07151v2","created_at":"2026-07-05T06:53:27.255873+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.07151","created_at":"2026-07-05T06:53:27.255873+00:00"},{"alias_kind":"pith_short_12","alias_value":"QPSD3QXGOTCR","created_at":"2026-07-05T06:53:27.255873+00:00"},{"alias_kind":"pith_short_16","alias_value":"QPSD3QXGOTCR2R4S","created_at":"2026-07-05T06:53:27.255873+00:00"},{"alias_kind":"pith_short_8","alias_value":"QPSD3QXG","created_at":"2026-07-05T06:53:27.255873+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QPSD3QXGOTCR2R4STFE2452OPY","json":"https://pith.science/pith/QPSD3QXGOTCR2R4STFE2452OPY.json","graph_json":"https://pith.science/api/pith-number/QPSD3QXGOTCR2R4STFE2452OPY/graph.json","events_json":"https://pith.science/api/pith-number/QPSD3QXGOTCR2R4STFE2452OPY/events.json","paper":"https://pith.science/paper/QPSD3QXG"},"agent_actions":{"view_html":"https://pith.science/pith/QPSD3QXGOTCR2R4STFE2452OPY","download_json":"https://pith.science/pith/QPSD3QXGOTCR2R4STFE2452OPY.json","view_paper":"https://pith.science/paper/QPSD3QXG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.07151&json=true","fetch_graph":"https://pith.science/api/pith-number/QPSD3QXGOTCR2R4STFE2452OPY/graph.json","fetch_events":"https://pith.science/api/pith-number/QPSD3QXGOTCR2R4STFE2452OPY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QPSD3QXGOTCR2R4STFE2452OPY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QPSD3QXGOTCR2R4STFE2452OPY/action/storage_attestation","attest_author":"https://pith.science/pith/QPSD3QXGOTCR2R4STFE2452OPY/action/author_attestation","sign_citation":"https://pith.science/pith/QPSD3QXGOTCR2R4STFE2452OPY/action/citation_signature","submit_replication":"https://pith.science/pith/QPSD3QXGOTCR2R4STFE2452OPY/action/replication_record"}},"created_at":"2026-07-05T06:53:27.255873+00:00","updated_at":"2026-07-05T06:53:27.255873+00:00"}