{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HT3KQP4SNO5NLQQ6BD4T4YIQ3I","short_pith_number":"pith:HT3KQP4S","schema_version":"1.0","canonical_sha256":"3cf6a83f926bbad5c21e08f93e6110da39801f34b14d61605829fb9b109e8f32","source":{"kind":"arxiv","id":"1602.02052","version":3},"attestation_state":"computed","paper":{"title":"A Comparison of 10 Sampling Algorithms for Configurable Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Christian K\\\"astner, Fl\\'avio Medeiros, M\\'arcio Ribeiro, Rohit Gheyi, Sven Apel","submitted_at":"2016-02-05T15:06:50Z","abstract_excerpt":"Almost every software system provides configuration options to tailor the system to the target platform and application scenario. Often, this configurability renders the analysis of every individual system configuration infeasible. To address this problem, researchers have proposed a diverse set of sampling algorithms. We present a comparative study of 10 state-of-the-art sampling algorithms regarding their fault-detection capability and size of sample sets. The former is important to improve software quality and the latter to reduce the time of analysis. In a nutshell, we found that sampling "},"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":"1602.02052","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2016-02-05T15:06:50Z","cross_cats_sorted":[],"title_canon_sha256":"e6e8f47ed00ae246a63b9828fcf9a1322f915c9ad40697c29188ca3a3d81188f","abstract_canon_sha256":"00afd1e718074a0ca646207a97433979227455ff8a66f0fa7e0dfb32f0262713"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:38.177985Z","signature_b64":"r5yFjzfMalNUchc7c0lLUBFDLBelWYqi8n8+RtiQ+HtXHT+HmI/qd4njjdkwmfSyc+dzujk3nlisrFJBbpc2Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cf6a83f926bbad5c21e08f93e6110da39801f34b14d61605829fb9b109e8f32","last_reissued_at":"2026-05-18T01:20:38.177461Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:38.177461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Comparison of 10 Sampling Algorithms for Configurable Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Christian K\\\"astner, Fl\\'avio Medeiros, M\\'arcio Ribeiro, Rohit Gheyi, Sven Apel","submitted_at":"2016-02-05T15:06:50Z","abstract_excerpt":"Almost every software system provides configuration options to tailor the system to the target platform and application scenario. Often, this configurability renders the analysis of every individual system configuration infeasible. To address this problem, researchers have proposed a diverse set of sampling algorithms. We present a comparative study of 10 state-of-the-art sampling algorithms regarding their fault-detection capability and size of sample sets. The former is important to improve software quality and the latter to reduce the time of analysis. In a nutshell, we found that sampling "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02052","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":""},"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":"1602.02052","created_at":"2026-05-18T01:20:38.177539+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.02052v3","created_at":"2026-05-18T01:20:38.177539+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02052","created_at":"2026-05-18T01:20:38.177539+00:00"},{"alias_kind":"pith_short_12","alias_value":"HT3KQP4SNO5N","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"HT3KQP4SNO5NLQQ6","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"HT3KQP4S","created_at":"2026-05-18T12:30:22.444734+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/HT3KQP4SNO5NLQQ6BD4T4YIQ3I","json":"https://pith.science/pith/HT3KQP4SNO5NLQQ6BD4T4YIQ3I.json","graph_json":"https://pith.science/api/pith-number/HT3KQP4SNO5NLQQ6BD4T4YIQ3I/graph.json","events_json":"https://pith.science/api/pith-number/HT3KQP4SNO5NLQQ6BD4T4YIQ3I/events.json","paper":"https://pith.science/paper/HT3KQP4S"},"agent_actions":{"view_html":"https://pith.science/pith/HT3KQP4SNO5NLQQ6BD4T4YIQ3I","download_json":"https://pith.science/pith/HT3KQP4SNO5NLQQ6BD4T4YIQ3I.json","view_paper":"https://pith.science/paper/HT3KQP4S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.02052&json=true","fetch_graph":"https://pith.science/api/pith-number/HT3KQP4SNO5NLQQ6BD4T4YIQ3I/graph.json","fetch_events":"https://pith.science/api/pith-number/HT3KQP4SNO5NLQQ6BD4T4YIQ3I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HT3KQP4SNO5NLQQ6BD4T4YIQ3I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HT3KQP4SNO5NLQQ6BD4T4YIQ3I/action/storage_attestation","attest_author":"https://pith.science/pith/HT3KQP4SNO5NLQQ6BD4T4YIQ3I/action/author_attestation","sign_citation":"https://pith.science/pith/HT3KQP4SNO5NLQQ6BD4T4YIQ3I/action/citation_signature","submit_replication":"https://pith.science/pith/HT3KQP4SNO5NLQQ6BD4T4YIQ3I/action/replication_record"}},"created_at":"2026-05-18T01:20:38.177539+00:00","updated_at":"2026-05-18T01:20:38.177539+00:00"}