{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:VGA3IEYSRRKAQGKY4HSHZ6NLDH","short_pith_number":"pith:VGA3IEYS","schema_version":"1.0","canonical_sha256":"a981b413128c54081958e1e47cf9ab19c2f8c758ac199d18bb48eefd31fc13eb","source":{"kind":"arxiv","id":"2410.17907","version":5},"attestation_state":"computed","paper":{"title":"Adaptive Random Testing with Q-grams: The Illusion Comes True","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Matteo Biagiola, Paolo Tonella, Robert Feldt","submitted_at":"2024-10-23T14:26:51Z","abstract_excerpt":"Adaptive Random Testing (ART) has faced criticism, particularly for its computational inefficiency, as highlighted by Arcuri and Briand. Their analysis clarified how ART requires a quadratic number of distance computations as the number of test executions increases, which limits its scalability in scenarios requiring extensive testing to uncover faults. Simulation results support this, showing that the computational overhead of these distance calculations often outweighs ART's benefits. While various ART variants have attempted to reduce these costs, they frequently do so at the expense of fau"},"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":"2410.17907","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2024-10-23T14:26:51Z","cross_cats_sorted":[],"title_canon_sha256":"1a412eb5db7b9b8bf5cc4772d700e1a9525bdb3dbbe23adf6b9f2cd6bf1015d8","abstract_canon_sha256":"c6364b3c618d1bfa478fa6c9a834771dec9e6b41285ae17ded54621226da0416"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:18:10.664139Z","signature_b64":"hFrHt+py6SMjV5GpntE3bZgKiOgL9xuAe2TzfK8cJ7kTAupqqI0E8SP+iBdCR3Ry7GDUCqBqPvnC3oqPpC/DAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a981b413128c54081958e1e47cf9ab19c2f8c758ac199d18bb48eefd31fc13eb","last_reissued_at":"2026-07-05T10:18:10.663616Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:18:10.663616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Random Testing with Q-grams: The Illusion Comes True","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Matteo Biagiola, Paolo Tonella, Robert Feldt","submitted_at":"2024-10-23T14:26:51Z","abstract_excerpt":"Adaptive Random Testing (ART) has faced criticism, particularly for its computational inefficiency, as highlighted by Arcuri and Briand. Their analysis clarified how ART requires a quadratic number of distance computations as the number of test executions increases, which limits its scalability in scenarios requiring extensive testing to uncover faults. Simulation results support this, showing that the computational overhead of these distance calculations often outweighs ART's benefits. While various ART variants have attempted to reduce these costs, they frequently do so at the expense of fau"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.17907","kind":"arxiv","version":5},"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/2410.17907/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":"2410.17907","created_at":"2026-07-05T10:18:10.663682+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.17907v5","created_at":"2026-07-05T10:18:10.663682+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.17907","created_at":"2026-07-05T10:18:10.663682+00:00"},{"alias_kind":"pith_short_12","alias_value":"VGA3IEYSRRKA","created_at":"2026-07-05T10:18:10.663682+00:00"},{"alias_kind":"pith_short_16","alias_value":"VGA3IEYSRRKAQGKY","created_at":"2026-07-05T10:18:10.663682+00:00"},{"alias_kind":"pith_short_8","alias_value":"VGA3IEYS","created_at":"2026-07-05T10:18:10.663682+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.13480","citing_title":"Adaptive Testing for LLM-Based Applications: A Diversity-based Approach","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VGA3IEYSRRKAQGKY4HSHZ6NLDH","json":"https://pith.science/pith/VGA3IEYSRRKAQGKY4HSHZ6NLDH.json","graph_json":"https://pith.science/api/pith-number/VGA3IEYSRRKAQGKY4HSHZ6NLDH/graph.json","events_json":"https://pith.science/api/pith-number/VGA3IEYSRRKAQGKY4HSHZ6NLDH/events.json","paper":"https://pith.science/paper/VGA3IEYS"},"agent_actions":{"view_html":"https://pith.science/pith/VGA3IEYSRRKAQGKY4HSHZ6NLDH","download_json":"https://pith.science/pith/VGA3IEYSRRKAQGKY4HSHZ6NLDH.json","view_paper":"https://pith.science/paper/VGA3IEYS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.17907&json=true","fetch_graph":"https://pith.science/api/pith-number/VGA3IEYSRRKAQGKY4HSHZ6NLDH/graph.json","fetch_events":"https://pith.science/api/pith-number/VGA3IEYSRRKAQGKY4HSHZ6NLDH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VGA3IEYSRRKAQGKY4HSHZ6NLDH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VGA3IEYSRRKAQGKY4HSHZ6NLDH/action/storage_attestation","attest_author":"https://pith.science/pith/VGA3IEYSRRKAQGKY4HSHZ6NLDH/action/author_attestation","sign_citation":"https://pith.science/pith/VGA3IEYSRRKAQGKY4HSHZ6NLDH/action/citation_signature","submit_replication":"https://pith.science/pith/VGA3IEYSRRKAQGKY4HSHZ6NLDH/action/replication_record"}},"created_at":"2026-07-05T10:18:10.663682+00:00","updated_at":"2026-07-05T10:18:10.663682+00:00"}