{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:F64ETCTZXPD7VND7FCK5E5WDJO","short_pith_number":"pith:F64ETCTZ","schema_version":"1.0","canonical_sha256":"2fb8498a79bbc7fab47f2895d276c34ba4a7a3d54ffc2bfdf50adcbe67ace090","source":{"kind":"arxiv","id":"1602.06599","version":1},"attestation_state":"computed","paper":{"title":"Towards Unified Combinatorial Interaction Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Cemal Yilmaz, Hanefi Mercan","submitted_at":"2016-02-21T23:16:00Z","abstract_excerpt":"We believe that we can exploit the benefits of combinatorial interaction testing (CIT) on many \"non-traditional\" combinatorial spaces using many \"non-traditional\" coverage criteria. However, this requires truly flexible CIT approaches. To this end, we introduce Unified Combinatorial Interaction Testing (U-CIT), which enables practitioners to define their own combinatorial spaces and coverage criteria for testing, and present a unified construction approach to compute specific instances of U-CIT objects. We, furthermore, argue that most (if not all) existing CIT objects are a special case of U-"},"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.06599","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2016-02-21T23:16:00Z","cross_cats_sorted":[],"title_canon_sha256":"cab83ca6aec9cd79417fd5717484f88a97d7ba932d84e61cf42608423425e62a","abstract_canon_sha256":"f37456d034f5dfa56b00e74d45d786212b8951dd3f7b8e50229cecf1456e2a1c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:13.592249Z","signature_b64":"GGeI1zjX9fJwpmrFnIA91Bj+DbxWcWs54S0HieTVUkpO2ZiPZpsMP9VPcwn6p+00PEjJ9wxDaeTqTSbibRgLCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fb8498a79bbc7fab47f2895d276c34ba4a7a3d54ffc2bfdf50adcbe67ace090","last_reissued_at":"2026-05-18T01:20:13.591656Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:13.591656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Unified Combinatorial Interaction Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Cemal Yilmaz, Hanefi Mercan","submitted_at":"2016-02-21T23:16:00Z","abstract_excerpt":"We believe that we can exploit the benefits of combinatorial interaction testing (CIT) on many \"non-traditional\" combinatorial spaces using many \"non-traditional\" coverage criteria. However, this requires truly flexible CIT approaches. To this end, we introduce Unified Combinatorial Interaction Testing (U-CIT), which enables practitioners to define their own combinatorial spaces and coverage criteria for testing, and present a unified construction approach to compute specific instances of U-CIT objects. We, furthermore, argue that most (if not all) existing CIT objects are a special case of U-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06599","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":""},"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.06599","created_at":"2026-05-18T01:20:13.591753+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.06599v1","created_at":"2026-05-18T01:20:13.591753+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06599","created_at":"2026-05-18T01:20:13.591753+00:00"},{"alias_kind":"pith_short_12","alias_value":"F64ETCTZXPD7","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"F64ETCTZXPD7VND7","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"F64ETCTZ","created_at":"2026-05-18T12:30:15.759754+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/F64ETCTZXPD7VND7FCK5E5WDJO","json":"https://pith.science/pith/F64ETCTZXPD7VND7FCK5E5WDJO.json","graph_json":"https://pith.science/api/pith-number/F64ETCTZXPD7VND7FCK5E5WDJO/graph.json","events_json":"https://pith.science/api/pith-number/F64ETCTZXPD7VND7FCK5E5WDJO/events.json","paper":"https://pith.science/paper/F64ETCTZ"},"agent_actions":{"view_html":"https://pith.science/pith/F64ETCTZXPD7VND7FCK5E5WDJO","download_json":"https://pith.science/pith/F64ETCTZXPD7VND7FCK5E5WDJO.json","view_paper":"https://pith.science/paper/F64ETCTZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.06599&json=true","fetch_graph":"https://pith.science/api/pith-number/F64ETCTZXPD7VND7FCK5E5WDJO/graph.json","fetch_events":"https://pith.science/api/pith-number/F64ETCTZXPD7VND7FCK5E5WDJO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F64ETCTZXPD7VND7FCK5E5WDJO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F64ETCTZXPD7VND7FCK5E5WDJO/action/storage_attestation","attest_author":"https://pith.science/pith/F64ETCTZXPD7VND7FCK5E5WDJO/action/author_attestation","sign_citation":"https://pith.science/pith/F64ETCTZXPD7VND7FCK5E5WDJO/action/citation_signature","submit_replication":"https://pith.science/pith/F64ETCTZXPD7VND7FCK5E5WDJO/action/replication_record"}},"created_at":"2026-05-18T01:20:13.591753+00:00","updated_at":"2026-05-18T01:20:13.591753+00:00"}