{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:F64ETCTZXPD7VND7FCK5E5WDJO","short_pith_number":"pith:F64ETCTZ","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"},"canonical_sha256":"2fb8498a79bbc7fab47f2895d276c34ba4a7a3d54ffc2bfdf50adcbe67ace090","source":{"kind":"arxiv","id":"1602.06599","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.06599","created_at":"2026-05-18T01:20:13Z"},{"alias_kind":"arxiv_version","alias_value":"1602.06599v1","created_at":"2026-05-18T01:20:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06599","created_at":"2026-05-18T01:20:13Z"},{"alias_kind":"pith_short_12","alias_value":"F64ETCTZXPD7","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"F64ETCTZXPD7VND7","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"F64ETCTZ","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:F64ETCTZXPD7VND7FCK5E5WDJO","target":"record","payload":{"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"},"canonical_sha256":"2fb8498a79bbc7fab47f2895d276c34ba4a7a3d54ffc2bfdf50adcbe67ace090","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"},"source_kind":"arxiv","source_id":"1602.06599","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:20:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y/GYaofhbIIZBcQftf6zp1Cir5rJRDAUBh63B+jPeOTeoQoBl9AXqucptQmdOCTMdSqmeLn+CP4vucMNGLARCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T14:57:31.760653Z"},"content_sha256":"2101bd19068b323ea2d710a54b477c9f2bd546965922b748c6d3327a80ad4e1f","schema_version":"1.0","event_id":"sha256:2101bd19068b323ea2d710a54b477c9f2bd546965922b748c6d3327a80ad4e1f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:F64ETCTZXPD7VND7FCK5E5WDJO","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:20:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wMZObmDwMnlQqnkq+vFw1ETJacTBVErxUOb/d9/pGKmTrIL3/acA9mAbrteUjDccrLasSg/LY3iOqlaIXXNuAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T14:57:31.761455Z"},"content_sha256":"8041f861db3d47f689c705d9cc0fdb8cf1635695bde97c9294af904dc616ce32","schema_version":"1.0","event_id":"sha256:8041f861db3d47f689c705d9cc0fdb8cf1635695bde97c9294af904dc616ce32"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F64ETCTZXPD7VND7FCK5E5WDJO/bundle.json","state_url":"https://pith.science/pith/F64ETCTZXPD7VND7FCK5E5WDJO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F64ETCTZXPD7VND7FCK5E5WDJO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T14:57:31Z","links":{"resolver":"https://pith.science/pith/F64ETCTZXPD7VND7FCK5E5WDJO","bundle":"https://pith.science/pith/F64ETCTZXPD7VND7FCK5E5WDJO/bundle.json","state":"https://pith.science/pith/F64ETCTZXPD7VND7FCK5E5WDJO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F64ETCTZXPD7VND7FCK5E5WDJO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:F64ETCTZXPD7VND7FCK5E5WDJO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f37456d034f5dfa56b00e74d45d786212b8951dd3f7b8e50229cecf1456e2a1c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2016-02-21T23:16:00Z","title_canon_sha256":"cab83ca6aec9cd79417fd5717484f88a97d7ba932d84e61cf42608423425e62a"},"schema_version":"1.0","source":{"id":"1602.06599","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.06599","created_at":"2026-05-18T01:20:13Z"},{"alias_kind":"arxiv_version","alias_value":"1602.06599v1","created_at":"2026-05-18T01:20:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06599","created_at":"2026-05-18T01:20:13Z"},{"alias_kind":"pith_short_12","alias_value":"F64ETCTZXPD7","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"F64ETCTZXPD7VND7","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"F64ETCTZ","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:8041f861db3d47f689c705d9cc0fdb8cf1635695bde97c9294af904dc616ce32","target":"graph","created_at":"2026-05-18T01:20:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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-","authors_text":"Cemal Yilmaz, Hanefi Mercan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2016-02-21T23:16:00Z","title":"Towards Unified Combinatorial Interaction Testing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06599","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2101bd19068b323ea2d710a54b477c9f2bd546965922b748c6d3327a80ad4e1f","target":"record","created_at":"2026-05-18T01:20:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f37456d034f5dfa56b00e74d45d786212b8951dd3f7b8e50229cecf1456e2a1c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2016-02-21T23:16:00Z","title_canon_sha256":"cab83ca6aec9cd79417fd5717484f88a97d7ba932d84e61cf42608423425e62a"},"schema_version":"1.0","source":{"id":"1602.06599","kind":"arxiv","version":1}},"canonical_sha256":"2fb8498a79bbc7fab47f2895d276c34ba4a7a3d54ffc2bfdf50adcbe67ace090","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2fb8498a79bbc7fab47f2895d276c34ba4a7a3d54ffc2bfdf50adcbe67ace090","first_computed_at":"2026-05-18T01:20:13.591656Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:13.591656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GGeI1zjX9fJwpmrFnIA91Bj+DbxWcWs54S0HieTVUkpO2ZiPZpsMP9VPcwn6p+00PEjJ9wxDaeTqTSbibRgLCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:13.592249Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.06599","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2101bd19068b323ea2d710a54b477c9f2bd546965922b748c6d3327a80ad4e1f","sha256:8041f861db3d47f689c705d9cc0fdb8cf1635695bde97c9294af904dc616ce32"],"state_sha256":"0b0bb929f87b7024c9c8b936f887415541948eeb42a17b52eaa5487468de7db9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VdKskDmz1e7oSRvLnKK9HK6Yxr2hPbDRrjpu2us1Cmyx12zcJLfZTqurgmS108igKvz8ovtClT4fIYjLhZPJBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T14:57:31.765472Z","bundle_sha256":"5a9d076020c8abbb0db86409852ecdf3b7f5cee44c953c83694dc11bd8c89ffc"}}