{"as_of":"2026-08-22T13:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7aa7b914d34a2619de28e64f7c2f34bcba3b56cd302975c8bcf0f8d177db3974","coverage":[{"denominator":56,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":56,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T19:12:17.776703Z","state":"measured"},{"denominator":56,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":56,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.17083/citation-record","integrity":"/paper/2607.17083/integrity","json":"/paper/2607.17083/citation-record.json","paper":"/paper/2607.17083"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:12:10.845618Z","title":"Journal of Heuristics28(4), 377–431 (Aug 2022)","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:10.845618Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:75236f4b390551a2ec8b4ed339dfdaa010197e842948853fcf646a82a4887298","observation_id":"0efa085b-4cf7-486a-926e-e026b0cdbc13","resolution":{"observed_at":"2026-08-01T19:12:10.845618Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:12:10.944756Z","title":"In: Aguirre, A.H., Borja, R.M., Garciá, C.A.R","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:10.944756Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:9861c618d5d980fab80168aaef5d212f495cb2efa306d26bae39ad78518af8ec","observation_id":"5294a777-ec9c-4d88-b1ac-670e37e334c8","resolution":{"observed_at":"2026-08-01T19:12:10.944756Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1002/stvr.365","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Software Testing17(3) (2007),https://doi.org/10.1002/stvr.365","venue":"Software Testing Verification and Reliability","work_id":"6241174f-483c-4819-922a-217eac97a41f","year":2007},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:11.056737Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:7a8d28725ddcc6c167435988744381df26704ced27209da142f1ad921a1a844f","observation_id":"08ccc066-664c-4919-bdc0-cbfe5ded23b9","resolution":{"observed_at":"2026-08-01T19:14:12.322689Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:12:11.163500Z","title":"Information and Software Technology48(10), 960– 970 (2006), Advances in Model-based Testing","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:11.163500Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:a2b2edb8766b87f9f270552ecb362d15a6c1c31a05a64ace74dfe60612861eac","observation_id":"0a349885-bcc5-48d7-84c5-e5ef56b66217","resolution":{"observed_at":"2026-08-01T19:12:11.163500Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:12:11.285070Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:11.285070Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:8de7caae0d321a505dc395143c734a9e752009e68fb46574539e3a31e7b6c3b7","observation_id":"61906d7c-2dc8-4417-a351-01532c4d53b7","resolution":{"observed_at":"2026-08-01T19:12:11.285070Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:12:11.412997Z","title":"John Wiley & Sons, New York (2003)","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:11.412997Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:a552132420e0a91e98d1d2bebdec1bde7b57ee617eeb7e396480e72df6211f4e","observation_id":"c084a4f7-e32f-4dc7-95a9-8384b77e99a7","resolution":{"observed_at":"2026-08-01T19:12:11.412997Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/32.605761","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"IEEE Trans","venue":"IEEE Transactions on Software Engineering","work_id":"6e7ca409-50ea-4945-a7d4-8bdf25f8212e","year":1997},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:11.529862Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:9cb4c53a3a5bf6450adf3dec21a919f797b07c063c8d65acf6465d7b9f70b830","observation_id":"ea49cff9-37d3-4f1f-b9df-13d16322b933","resolution":{"observed_at":"2026-08-01T19:14:12.149995Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/52.536462","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"IEEE Software13(5), 83–88 (1996).https://doi","venue":"IEEE Software","work_id":"38629324-df96-4f02-95bd-7251571efb7e","year":1996},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:11.639271Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:d1a8e43431b1689e8ab1d6afb88d301f74820b207b9da24d92b7c37ffdb6645a","observation_id":"010cdd69-8ff2-4848-8f56-bedc34b62431","resolution":{"observed_at":"2026-08-01T19:14:12.008307Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:12:11.753142Z","title":"In: 25th International Conference on Software Engineering,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:11.753142Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:b358f8428074e1aa61a46d3f20c756da9bb14158dedca498a82196329bde66f7","observation_id":"dcda659a-f7b3-4df4-ba8e-1421cbb18564","resolution":{"observed_at":"2026-08-01T19:12:11.753142Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:12:12.045071Z","title":"In: Proceedings of the 2007 International Sym- posium on Software Testing and Analysis","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:12.045071Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:d34533da7f275e0c151d5c02caceb39c56aaf75384f795be4522c9b5b802496a","observation_id":"f0e93fc9-66f0-4633-b747-78becdd72553","resolution":{"observed_at":"2026-08-01T19:12:12.045071Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/tse.2008.50","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"IEEE Transactions on Software Engineering34(5), 633–650 (2008).https://doi.or g/10.1109/TSE.2008.50","venue":"IEEE Transactions on Software Engineering","work_id":"74a72848-8dc2-40ce-99ea-9270ecad8dfa","year":2008},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:12.177613Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:d82f904116e318bc05b1db41c9aaa65e3c7abe1bb8a8ef97b92b29518a1cadb2","observation_id":"ddf5ff66-9102-43fe-87f2-a163af7b15c9","resolution":{"observed_at":"2026-08-01T19:14:11.759662Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:12:12.251187Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:12.251187Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:fa9a59ef079ea8f504ec78b60f28bc1c4f83fb75a89939ffec050d6b46e17888","observation_id":"82b261a9-a1ba-4e78-ac25-d4beec2e6520","resolution":{"observed_at":"2026-08-01T19:12:12.251187Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:12:12.351703Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:12.351703Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:2d70fdb278e5c2d4e144ecdcd1f6af080b867455c401ab58bba4bde149f2f436","observation_id":"ab5e36d5-2bc9-4cef-bb2a-b35c20a4b72f","resolution":{"observed_at":"2026-08-01T19:12:12.351703Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:12:12.476708Z","title":"Theoretical Computer Science410(52), 5403–5414 (2009)","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:12.476708Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:44b6690186b1f39f8a4036e008b0e130669785e36b31a14a0f5c4f9ce79a812a","observation_id":"ee779f14-d645-494f-8fda-7f8e812b9897","resolution":{"observed_at":"2026-08-01T19:12:12.476708Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/icstw.2017.37","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"In: 2017 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW)","venue":null,"work_id":"b66db165-5a4d-4d65-ada2-f99a9f06c635","year":2017},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:12.595364Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:5fbaa49e3a0ff0fa1a8ab9da78304238ae6865b15c4fbadec19f318dd1d50ba1","observation_id":"fb85c4e1-a9dc-49aa-994e-16f26cafda76","resolution":{"observed_at":"2026-08-01T19:14:11.467620Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:12:12.682784Z","title":"Problemy Peredachi Informatskii25, 3 (10 1989)","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:12.682784Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:7bd371d7ba5b71485a2e00925dea48771f6b81dbc1f9e8dcf10f587e0f3ccb0f","observation_id":"0143730a-bc2c-44c1-beb4-4b375517cf55","resolution":{"observed_at":"2026-08-01T19:12:12.682784Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:12:12.810114Z","title":"In: Squillero, G., Sim, K","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:12.810114Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:ca87ef9871ca912f53b759e4b282ddf73647e8c29e99c37f3a9d61ab3a3d6014","observation_id":"fc96ba4f-b04b-43c3-8b25-43bc9aec7cd3","resolution":{"observed_at":"2026-08-01T19:12:12.810114Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10732-020-09462","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:14:11.085254Z","title":"Journal of Heuristics27(1), 229–249 (2021).https://doi.org/10.1007/s10732-020-09462 -w","venue":null,"work_id":"519229aa-4bba-42d7-a82d-512aa799483a","year":2021},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:12.904037Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:4e639b714ee1da10502a5bca40ae7e7110ad4c1c52fa3c334c463f27f3044bce","observation_id":"80b6e0c1-6f47-44af-824b-a04a487dde44","resolution":{"observed_at":"2026-08-01T19:14:11.237432Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:12:13.023811Z","title":"In: 2011 IEEE International Conference on Computer Science and Automation Engineering","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:13.023811Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:8772460815d2ebc1049a824b2b633226af1d3d87417597193ed6d7b089d55188","observation_id":"e0669543-3bc6-41de-ab23-b48468bc93b5","resolution":{"observed_at":"2026-08-01T19:12:13.023811Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:12:13.142156Z","title":"Software Testing, Verification and Reliability15(3) (2005),https://doi.org/10 .1002/stvr.319","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:13.142156Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:09bb8d8118026b6b9a6b570d5fd11d53decc603655ef767cc52e0da444927b74","observation_id":"2133c4bc-7ccb-4bfe-b44c-4248b544c0b8","resolution":{"observed_at":"2026-08-01T19:12:13.142156Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:12:13.248579Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:13.248579Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:418453b7cb6feb222e4e177c7ec09c636449a36cfc6f5e8355bd3a2919e0ffdd","observation_id":"450ef189-fbb5-4208-bbe3-1f91d7e97af4","resolution":{"observed_at":"2026-08-01T19:12:13.248579Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/mc.2015.114","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Computer48(4), 64–72 (2015).https://doi.org/ 10.1109/MC.2015.114 Optimal Combinatorial Testing with Constraints: The Balancing Act 39","venue":"Computer","work_id":"ebc2576b-e5d9-4760-a5e1-bfe3c6b0fbf9","year":2015},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:13.384721Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:8e1d34cd95955d2071b54513e97eb2e56547ff81628a6c39e0925d8cbdce3221","observation_id":"b3e5a19f-e7c1-41e6-bc61-ea95ec41047f","resolution":{"observed_at":"2026-08-01T19:14:10.539403Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.disc.2003","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Discrete Mathematics284(1), 149–156 (2004).https://doi.org/10.1016/j.disc.2003","venue":"Open Access System for Information Sharing (Pohang University of Science and Technology)","work_id":"f8de328b-88d2-4430-93f5-66b601c5a551","year":2004},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:13.467204Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:5cf11aa4c5d2b8d2ede5942f926cb592b517c5341574598b3123c1a455dff748","observation_id":"995969e2-0380-41fa-be28-7471ebabb272","resolution":{"observed_at":"2026-08-01T19:14:10.267875Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:12:13.652567Z","title":"Constraints11, 119–219 (2006)","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:13.652567Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:82e395f52cf08bb931d578031d6118252f909aa08202c04a00a64c58d69bdc7c","observation_id":"5f729929-1951-48eb-94fe-109ce0fb8ef8","resolution":{"observed_at":"2026-08-01T19:12:13.652567Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1712.07081","last_updated":"2017-12-19T18:01:06Z","snapshot_observed_at":"2026-08-18T22:28:25.768596Z","submitted_at":"2017-12-19T18:01:06Z","title":"Column Generation for Interaction Coverage in Combinatorial Software Testing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1712.07081","snapshot_observed_at":"2026-08-01T19:12:13.820528Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:13.820528Z"},"links":{"cited_paper":"/paper/1712.07081","citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:484a4bbab1fa8a12000bdae937a80504d84b930a7f463b9bb3ff39cef199e016","observation_id":"aaaec3cb-1782-465e-9233-cab4383bb2ee","resolution":{"observed_at":"2026-08-01T19:12:13.820528Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:12:13.992460Z","title":"Periodica Mathematica Hungarica3, 19–26 (1973)","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:13.992460Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:05340ab570377977ff5d7a0a70114fe659a208efed91d6ad34790a9d07647c31","observation_id":"e5456aea-8f6e-4db7-8b8c-dcc85a69bac5","resolution":{"observed_at":"2026-08-01T19:12:13.992460Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:12:14.156844Z","title":"Discrete Mathematics 6(3), 255–262 (1973)","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:14.156844Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:78ea5e66707adf2684f7dfa43068b652a7ddbdb956f2df7ef88274506a978b5e","observation_id":"201b549f-078f-42b7-be28-3e9257e48084","resolution":{"observed_at":"2026-08-01T19:12:14.156844Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/sew.2006.26","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"In: 2006 30th An- nual IEEE/NASA Software Engineering Workshop","venue":null,"work_id":"48c10894-5435-4b84-8537-b310cbe5efaa","year":2006},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:14.251972Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:ae4edac747e3671a91dbba019ee1d28d12b262951df638cd1bdc4b9271e74115","observation_id":"47277764-609c-43c9-b660-ed4acb7d2ac0","resolution":{"observed_at":"2026-08-01T19:14:09.984339Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.6028/nist.sp.800-142","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":null,"work_id":"b7dedf46-bf73-49b2-affa-b0b5daa85cae","year":2010},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:14.364148Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:519733be1ed09807139a9827b807fa58533be756321c8d582ef275f8570c9d43","observation_id":"b1cf16f8-2a12-48ee-8ac5-e5db4fde319b","resolution":{"observed_at":"2026-08-01T19:14:09.706092Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:12:14.441499Z","title":"In: 27th Annual NASA Goddard/IEEE Software Engineering Workshop, 2002","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:14.441499Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:490f3d654e4d02ef9b9f317ec65ddffd9d57b22f52fb5d0551920ce55cd9c57b","observation_id":"89490e7f-b701-4ed5-bbf6-435c1cab7cd1","resolution":{"observed_at":"2026-08-01T19:12:14.441499Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/tse.2004.24","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"IEEE Transactions on Software Engineering30(6), 418–421 (2004).https://doi.org/10.1109/TSE.2004.24","venue":"IEEE Transactions on Software Engineering","work_id":"66f508ef-54bb-4adf-9f3f-ddbdbd0e0f9b","year":2004},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:14.520920Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:c9e35599361e862d99bb0b2800ae9d78de1faac09a11bf2e9711f5a2590e7081","observation_id":"bc9c635c-f6a3-4338-ab7d-89db1b3db16d","resolution":{"observed_at":"2026-08-01T19:14:09.498426Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:12:14.643740Z","title":"The Electronic Journal of Combinatorics18(1), 1–30 (2011)","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:14.643740Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:493f1d0cbfb16945f80ba29bbcf4193e7f982b49f5851a8d3c7351501ee035c0","observation_id":"0a47870c-07cf-46f4-8bac-7614ce381896","resolution":{"observed_at":"2026-08-01T19:12:14.643740Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/ecbs.2007.47","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"In: 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (ECBS’07)","venue":null,"work_id":"62d9c485-a7ea-4fb7-b8ea-ab59d756d081","year":2007},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:14.732788Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:7b640c37979f277dcd2505c6c13284559d63600d73f7e2ef8aade7c2d5203726","observation_id":"94646014-a8a6-4b6c-87b0-721e049a9b79","resolution":{"observed_at":"2026-08-01T19:14:09.292958Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1002/stvr.381","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Software Testing, Verification and Reliability18(3), 125–148 (2008).https://doi.org/10.1002/stvr.381","venue":"Software Testing Verification and Reliability","work_id":"d5e51919-1337-4789-a7a0-4a3d64abf044","year":2008},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:14.789225Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:2bf774a26322e3b3a35c190df2c07fe8e0bd09f21ecfa0174c605d09d417bd54","observation_id":"4e99e627-2e0b-4b69-b274-8c6211b1b70b","resolution":{"observed_at":"2026-08-01T19:14:08.849997Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:12:14.892981Z","title":"In: Proceedings Third IEEE International High-Assurance Systems Engineering Symposium (Cat","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:14.892981Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:8cf8b7328094f41a407d6e26918e828bc720419bbf893bfce5f9c98341c94d91","observation_id":"8e01c57c-e2c7-447a-a32b-d1a183da720e","resolution":{"observed_at":"2026-08-01T19:12:14.892981Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/icsm.2013.58","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"In: 2013 IEEE International Conference on Software Maintenance","venue":null,"work_id":"d9d26693-5a9f-4cfb-8c09-0ce0892b2a32","year":2013},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:15.034660Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:f6373fe9ab656dbdd9400460e107b63fc8c0338757ac25c1738eaefc825f64fa","observation_id":"d74a71d4-1e3d-4b8a-9c90-b1bc913275e1","resolution":{"observed_at":"2026-08-01T19:14:08.525573Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:12:15.184903Z","title":"In: 2021 IEEE/ACM 43rd International Conference on Software Engineering (ICSE)","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:15.184903Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:1472d0ae6f377e4c535bf788135fc792e28ef9f689b8734a9647b4b1c5f7532d","observation_id":"49f1815d-d222-4955-bf97-1337800da6ec","resolution":{"observed_at":"2026-08-01T19:12:15.184903Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1806.07723","last_updated":"2018-06-20T13:42:37Z","snapshot_observed_at":"2026-08-14T19:01:27.424858Z","submitted_at":"2018-06-20T13:42:37Z","title":"Combinatorial Testing for Deep Learning Systems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.07723","snapshot_observed_at":"2026-08-01T19:12:15.316405Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:15.316405Z"},"links":{"cited_paper":"/paper/1806.07723","citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:d336f38a5e459dbd9804540d5fafdd0e36f9fc11567fc396151f2ae5b46c8c1b","observation_id":"6145ac5f-9092-456a-8794-64d9ab13f6e0","resolution":{"observed_at":"2026-08-01T19:12:15.316405Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:12:15.459096Z","title":"In: López-Ortiz, A","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:15.459096Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:5e3e5981bf38f5c2b2276c06d85c769af32b9ac1bccca0da5b8592a10e21ae05","observation_id":"01fcbcd7-6995-4921-a60d-b1315438fe84","resolution":{"observed_at":"2026-08-01T19:12:15.459096Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:12:15.604117Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:15.604117Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:4dad775dd731bc7cdbd532d25dd91889948843fdb1776a9e04b4cbbe644e0729","observation_id":"30e7a2cf-f0a7-4885-8be9-7f9437fb95a4","resolution":{"observed_at":"2026-08-01T19:12:15.604117Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:12:15.778840Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:15.778840Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:68a0132b705a9a5977642ace804cde786f19264bb778e0838bbec870a030c279","observation_id":"6e31bb04-f801-44e9-8b14-f10d75c05ea4","resolution":{"observed_at":"2026-08-01T19:12:15.778840Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:12:15.951513Z","title":"ACM Computing Surveys 43(2) (2011).https://doi.org/10.1145/1883612.1883618","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:15.951513Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:a00aa53cdc0e74e42a116bbbb8b517760879eb94b1799534c91d58598ab8aaaf","observation_id":"706a9ce8-ca27-44d1-9e35-5a2314c9525d","resolution":{"observed_at":"2026-08-01T19:12:15.951513Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:12:16.173152Z","title":"Holden-Day (1970)","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:16.173152Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:e185945b54ddd9be8ea1b0c47241e670b81ee5b9fa1a21fa65a4706407281180","observation_id":"5c19b95d-f528-4810-96c2-a792e0db2349","resolution":{"observed_at":"2026-08-01T19:12:16.173152Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:12:16.339886Z","title":"A Tool for Parsimony in the Post-Genomics Era","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:16.339886Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:7642052d1950dcb286ee3b55d04678a8054bf9001cfae49573f563d63f43bb3c","observation_id":"b1762c5f-2e8e-403f-aeb4-3d9b3980db65","resolution":{"observed_at":"2026-08-01T19:12:16.339886Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:12:16.533195Z","title":"IEEE Transactions on ComputersC-32(12), 1145–1150 (1983)","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:16.533195Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:be08075a096b7116612f534fb8ce9802d12abde691d2433ecbd041b383cb7a53","observation_id":"6f883cd2-4bf6-4953-a91c-cb5e0e2de0c2","resolution":{"observed_at":"2026-08-01T19:12:16.533195Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:12:16.754934Z","title":"In: Rossi, F., van Beek, P., Walsh, T","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:16.754934Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:60d45d0bfd1c8f98c36659d8577a856a43d012b5ba2c819b21bd7cc63a84e6ef","observation_id":"3d217ba7-1885-48df-8fe2-b38fc3466bd4","resolution":{"observed_at":"2026-08-01T19:12:16.754934Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1142/s0218539301000","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:14:08.285638Z","title":"International Journal of Reliability, Quality and Safety Engineering08(04), 351–371 (2001).https://doi.org/10.1142/S0218539301000 58X","venue":null,"work_id":"fb20853d-3c6d-4b33-bf07-de3656a0e9c0","year":2001},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:16.839681Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:2199d44826a9fcb4875c348ae58b221f4e60a6dbe56e63471a7c8b45700ee4d6","observation_id":"9a65b051-5b31-482e-a87b-6f66271923a1","resolution":{"observed_at":"2026-08-01T19:14:08.355808Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-0-387-35516-0_4","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"In: Ural, H., Probert, R.L., v","venue":"IFIP advances in information and communication technology","work_id":"9681d5c6-4719-4fa9-a7f2-f7a506cde304","year":2000},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:16.955856Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:303787a5ac82e68919f290ccd396538f117fdea7bef49e0aeab0229aea4853bf","observation_id":"51a0e6c2-cd91-46c9-873e-a2f437e87168","resolution":{"observed_at":"2026-08-01T19:14:08.211933Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1908.02480","last_updated":"2019-08-07T08:07:21Z","snapshot_observed_at":"2026-08-14T14:40:22.635718Z","submitted_at":"2019-08-07T08:07:21Z","title":"A Survey of Constrained Combinatorial Testing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.02480","snapshot_observed_at":"2026-08-01T19:12:17.150146Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:17.150146Z"},"links":{"cited_paper":"/paper/1908.02480","citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:3535039f9261834ee1b1853e672ffd3b4c9c0c57d22840a4d9a45f6da242726e","observation_id":"f6b5d30f-9989-49f0-a70e-0818a854389a","resolution":{"observed_at":"2026-08-01T19:12:17.150146Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:12:17.261521Z","title":"IEEE Transactions on Software Engineering47(11), 2549–2562 (Nov 2021)","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:17.261521Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:08c4a441e82f1909da6e3039c1d91ed50f22d302557122b288b2507ff00463f8","observation_id":"0b692505-85aa-4458-b936-a0405529e355","resolution":{"observed_at":"2026-08-01T19:12:17.261521Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:12:17.321155Z","title":"In: 2021 IEEE International Conference on Information Communication and Software Engineer- ing (ICICSE)","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:17.321155Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:c0eeac7d3bae2ded66ff641705f31659558ce0429dc478c22b93d4d8b6ed6652","observation_id":"ab4dc09d-1a03-41e4-88eb-74489cbf1379","resolution":{"observed_at":"2026-08-01T19:12:17.321155Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/hase.2014.18","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"In: 2014 IEEE 15th Inter- national Symposium on High-Assurance Systems Engineering","venue":null,"work_id":"a0508b76-eafd-4b7b-afa2-4dd34f1f06d6","year":2014},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:17.491153Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:397edd82ae9cf9ff6666d01d759f504e16da0bf541db880bb3e25f5b18cf31c7","observation_id":"b8874136-bd8e-4951-aa0b-ec4274783fb7","resolution":{"observed_at":"2026-08-01T19:14:08.028568Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:12:17.643755Z","title":"In: 2015 IEEE Eighth International Conference on Software Testing, Verification and Validation Workshops (ICSTW)","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:17.643755Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:eb84a012c531bc289c6f7f732e275a30de00d7e79ae8a83196cd50146ff0514c","observation_id":"d68d0028-ee25-47ea-be67-c14bf07f5038","resolution":{"observed_at":"2026-08-01T19:12:17.643755Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:12:17.717555Z","title":"IEEE Transactions on Software Engineering28(2), 183–200 (2002)","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:17.717555Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:239f1a081770352ac9bbbd8283b93b4206aaef02112fe13580d68450104d6d88","observation_id":"78f1a94c-9eda-488a-b651-beb638cb5e2e","resolution":{"observed_at":"2026-08-01T19:12:17.717555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-662-43429-1_4","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"In: Automatic Generation of Com- binatorial Test Data","venue":"SpringerBriefs in computer science","work_id":"cd4fb026-bba3-4e44-b2cc-dda9476bde10","year":2014},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:17.776703Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:ddbc2ba3760de739451eb395e487f571097b396e40d6bfeb2761d0d02db5e123","observation_id":"09c1773d-68d1-4429-aa69-c2614af066e1","resolution":{"observed_at":"2026-08-01T19:14:07.827682Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:12:11.927238Z","title":null,"venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act","version":1},"reference_index":2003,"source":"pdf_text","source_observed_at":"2026-08-01T19:12:11.927238Z"},"links":{"citing_paper":"/paper/2607.17083"},"observation_digest":"sha256:3b59444b59bf7091c528591bd7be8a7c7c8048190251375976689ea46154a61c","observation_id":"657fdd07-5a42-4d46-9ae7-ba772ddba300","resolution":{"observed_at":"2026-08-01T19:12:11.927238Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.17083","last_updated":"2026-07-19T05:26:41Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-22T04:49:16.368248Z","submitted_at":"2026-07-19T05:26:41Z","title":"Optimal Combinatorial Testing with Constraints: The Balancing Act"},"reference_resolution":{"displayed":56,"state_counts":{"malformed_identifier":3,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":35,"verified_exact":18,"verified_fuzzy":0},"total_outbound_references":56},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 56 of 56 outbound references and 0 inbound Pith citation observations for arXiv:2607.17083."}