{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:YRLMFBSZE26KTPHDY4TCA43HSG","short_pith_number":"pith:YRLMFBSZ","schema_version":"1.0","canonical_sha256":"c456c2865926bca9bce3c72620736791b4cd3a681f5224d6fbd2fbeb6e4e0517","source":{"kind":"arxiv","id":"2607.17083","version":1},"attestation_state":"computed","paper":{"title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Changkun Guan, Hunter Gehman, John Hooker, Marcel Schoppers, Mikey Ferguson, Sumit Dhar, Thiago Serra","submitted_at":"2026-07-19T05:26:41Z","abstract_excerpt":"Imagine that you are in front of a cockpit with several on-off buttons. If you were to thoroughly test it, you would need to try a prohibitive number of configurations. But since most bugs in practice can be isolated to interactions among few components, having tests that cover every possible pairwise configuration is a good start. However, this is a problem that goes from easy to NP-hard as soon as some pairwise configurations are forbidden. In this paper, we revisit unconstrained combinatorial testing with pairwise coverage on binary parameters and contrast it with the constrained case, show"},"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":"2607.17083","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-07-19T05:26:41Z","cross_cats_sorted":[],"title_canon_sha256":"f727e7d57c8ed963d55540ffe98f77ae5643621f96a7aafeeb1d34aa29db4d9f","abstract_canon_sha256":"fb6e11d0501ff1a26d53c18d2783a0fafcd759d9b7bb3eae51080236c386a4eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-21T01:21:14.025756Z","signature_b64":"+eE3l5c3A7z/QA+6gEnB4lkZ/cUjCR0UHzJ+gobK+9qOnKdhzDfc25x9BSA2uX5uCOCQNrZxx/M6l8qAJrIPBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c456c2865926bca9bce3c72620736791b4cd3a681f5224d6fbd2fbeb6e4e0517","last_reissued_at":"2026-07-21T01:21:14.024888Z","signature_status":"signed_v1","first_computed_at":"2026-07-21T01:21:14.024888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Changkun Guan, Hunter Gehman, John Hooker, Marcel Schoppers, Mikey Ferguson, Sumit Dhar, Thiago Serra","submitted_at":"2026-07-19T05:26:41Z","abstract_excerpt":"Imagine that you are in front of a cockpit with several on-off buttons. If you were to thoroughly test it, you would need to try a prohibitive number of configurations. But since most bugs in practice can be isolated to interactions among few components, having tests that cover every possible pairwise configuration is a good start. However, this is a problem that goes from easy to NP-hard as soon as some pairwise configurations are forbidden. In this paper, we revisit unconstrained combinatorial testing with pairwise coverage on binary parameters and contrast it with the constrained case, show"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.17083","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/2607.17083/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":"2607.17083","created_at":"2026-07-21T01:21:14.025339+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.17083v1","created_at":"2026-07-21T01:21:14.025339+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.17083","created_at":"2026-07-21T01:21:14.025339+00:00"},{"alias_kind":"pith_short_12","alias_value":"YRLMFBSZE26K","created_at":"2026-07-21T01:21:14.025339+00:00"},{"alias_kind":"pith_short_16","alias_value":"YRLMFBSZE26KTPHD","created_at":"2026-07-21T01:21:14.025339+00:00"},{"alias_kind":"pith_short_8","alias_value":"YRLMFBSZ","created_at":"2026-07-21T01:21:14.025339+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/YRLMFBSZE26KTPHDY4TCA43HSG","json":"https://pith.science/pith/YRLMFBSZE26KTPHDY4TCA43HSG.json","graph_json":"https://pith.science/api/pith-number/YRLMFBSZE26KTPHDY4TCA43HSG/graph.json","events_json":"https://pith.science/api/pith-number/YRLMFBSZE26KTPHDY4TCA43HSG/events.json","paper":"https://pith.science/paper/YRLMFBSZ"},"agent_actions":{"view_html":"https://pith.science/pith/YRLMFBSZE26KTPHDY4TCA43HSG","download_json":"https://pith.science/pith/YRLMFBSZE26KTPHDY4TCA43HSG.json","view_paper":"https://pith.science/paper/YRLMFBSZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.17083&json=true","fetch_graph":"https://pith.science/api/pith-number/YRLMFBSZE26KTPHDY4TCA43HSG/graph.json","fetch_events":"https://pith.science/api/pith-number/YRLMFBSZE26KTPHDY4TCA43HSG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YRLMFBSZE26KTPHDY4TCA43HSG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YRLMFBSZE26KTPHDY4TCA43HSG/action/storage_attestation","attest_author":"https://pith.science/pith/YRLMFBSZE26KTPHDY4TCA43HSG/action/author_attestation","sign_citation":"https://pith.science/pith/YRLMFBSZE26KTPHDY4TCA43HSG/action/citation_signature","submit_replication":"https://pith.science/pith/YRLMFBSZE26KTPHDY4TCA43HSG/action/replication_record"}},"created_at":"2026-07-21T01:21:14.025339+00:00","updated_at":"2026-07-21T01:21:14.025339+00:00"}