{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:M75O3SDHX5TL4PMJWMLP4IZY3U","short_pith_number":"pith:M75O3SDH","schema_version":"1.0","canonical_sha256":"67faedc867bf66be3d89b316fe2338dd2e850ed5f03967910262171b18deec38","source":{"kind":"arxiv","id":"2109.07698","version":1},"attestation_state":"computed","paper":{"title":"Handling Noise in Search-Based Scenario Generation for Autonomous Driving Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Paolo Arcaini, Stefan Klikovits","submitted_at":"2021-09-16T03:40:52Z","abstract_excerpt":"This paper presents the first evaluation of k-nearest neighbours-Averaging (kNN-Avg) on a real-world case study. kNN-Avg is a novel technique that tackles the challenges of noisy multi-objective optimisation (MOO). Existing studies suggest the use of repetition to overcome noise. In contrast, kNN-Avg approximates these repetitions and exploits previous executions, thereby avoiding the cost of re-running. We use kNN-Avg for the scenario generation of a real-world autonomous driving system (ADS) and show that it is better than the noisy baseline. Furthermore, we compare it to the repetition-meth"},"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":"2109.07698","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2021-09-16T03:40:52Z","cross_cats_sorted":[],"title_canon_sha256":"256d7f7ce6ab50e6ee5509e8a4a0019356c775b7051121aeb7a743ce22cadbbd","abstract_canon_sha256":"bb408dcd202fce8c79d39fd967cdcc84aef13594f649117f0868d20c92394e72"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:15:00.033561Z","signature_b64":"+vzotGZ2qoF6RXPjay+xcQLSC6JCKTm8U7sn6hEKaq3K8yg0LuxmdHMr/IAEmg5DWUBgAui4XW98fmns0RV3AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67faedc867bf66be3d89b316fe2338dd2e850ed5f03967910262171b18deec38","last_reissued_at":"2026-07-05T03:15:00.033150Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:15:00.033150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Handling Noise in Search-Based Scenario Generation for Autonomous Driving Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Paolo Arcaini, Stefan Klikovits","submitted_at":"2021-09-16T03:40:52Z","abstract_excerpt":"This paper presents the first evaluation of k-nearest neighbours-Averaging (kNN-Avg) on a real-world case study. kNN-Avg is a novel technique that tackles the challenges of noisy multi-objective optimisation (MOO). Existing studies suggest the use of repetition to overcome noise. In contrast, kNN-Avg approximates these repetitions and exploits previous executions, thereby avoiding the cost of re-running. We use kNN-Avg for the scenario generation of a real-world autonomous driving system (ADS) and show that it is better than the noisy baseline. Furthermore, we compare it to the repetition-meth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.07698","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2109.07698/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":"2109.07698","created_at":"2026-07-05T03:15:00.033210+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.07698v1","created_at":"2026-07-05T03:15:00.033210+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.07698","created_at":"2026-07-05T03:15:00.033210+00:00"},{"alias_kind":"pith_short_12","alias_value":"M75O3SDHX5TL","created_at":"2026-07-05T03:15:00.033210+00:00"},{"alias_kind":"pith_short_16","alias_value":"M75O3SDHX5TL4PMJ","created_at":"2026-07-05T03:15:00.033210+00:00"},{"alias_kind":"pith_short_8","alias_value":"M75O3SDH","created_at":"2026-07-05T03:15:00.033210+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/M75O3SDHX5TL4PMJWMLP4IZY3U","json":"https://pith.science/pith/M75O3SDHX5TL4PMJWMLP4IZY3U.json","graph_json":"https://pith.science/api/pith-number/M75O3SDHX5TL4PMJWMLP4IZY3U/graph.json","events_json":"https://pith.science/api/pith-number/M75O3SDHX5TL4PMJWMLP4IZY3U/events.json","paper":"https://pith.science/paper/M75O3SDH"},"agent_actions":{"view_html":"https://pith.science/pith/M75O3SDHX5TL4PMJWMLP4IZY3U","download_json":"https://pith.science/pith/M75O3SDHX5TL4PMJWMLP4IZY3U.json","view_paper":"https://pith.science/paper/M75O3SDH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.07698&json=true","fetch_graph":"https://pith.science/api/pith-number/M75O3SDHX5TL4PMJWMLP4IZY3U/graph.json","fetch_events":"https://pith.science/api/pith-number/M75O3SDHX5TL4PMJWMLP4IZY3U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M75O3SDHX5TL4PMJWMLP4IZY3U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M75O3SDHX5TL4PMJWMLP4IZY3U/action/storage_attestation","attest_author":"https://pith.science/pith/M75O3SDHX5TL4PMJWMLP4IZY3U/action/author_attestation","sign_citation":"https://pith.science/pith/M75O3SDHX5TL4PMJWMLP4IZY3U/action/citation_signature","submit_replication":"https://pith.science/pith/M75O3SDHX5TL4PMJWMLP4IZY3U/action/replication_record"}},"created_at":"2026-07-05T03:15:00.033210+00:00","updated_at":"2026-07-05T03:15:00.033210+00:00"}