{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7MUBNGJWJ26RGJAINCDQ2IN2G2","short_pith_number":"pith:7MUBNGJW","canonical_record":{"source":{"id":"1606.06730","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-21T04:01:39Z","cross_cats_sorted":["cs.DM","cs.SE","math.CO"],"title_canon_sha256":"fe2a6b6c74bf51e192aa48f6d596ec38da8729b7077765bd1ed25fe0b8595d40","abstract_canon_sha256":"e3f3312c32df6366f51047e7e7e69d3eeb695bcc52b9d408c1ed8ee6ef4dad45"},"schema_version":"1.0"},"canonical_sha256":"fb281699364ebd13240868870d21ba36b520f4b6108d86788adcd14dea651908","source":{"kind":"arxiv","id":"1606.06730","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.06730","created_at":"2026-05-18T01:12:01Z"},{"alias_kind":"arxiv_version","alias_value":"1606.06730v1","created_at":"2026-05-18T01:12:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06730","created_at":"2026-05-18T01:12:01Z"},{"alias_kind":"pith_short_12","alias_value":"7MUBNGJWJ26R","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7MUBNGJWJ26RGJAI","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7MUBNGJW","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7MUBNGJWJ26RGJAINCDQ2IN2G2","target":"record","payload":{"canonical_record":{"source":{"id":"1606.06730","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-21T04:01:39Z","cross_cats_sorted":["cs.DM","cs.SE","math.CO"],"title_canon_sha256":"fe2a6b6c74bf51e192aa48f6d596ec38da8729b7077765bd1ed25fe0b8595d40","abstract_canon_sha256":"e3f3312c32df6366f51047e7e7e69d3eeb695bcc52b9d408c1ed8ee6ef4dad45"},"schema_version":"1.0"},"canonical_sha256":"fb281699364ebd13240868870d21ba36b520f4b6108d86788adcd14dea651908","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:01.209071Z","signature_b64":"aN6OCwFSNailNDijSB7ylUYXc27Io6bKCTGK0iu7ulqls4kRWQgPLdzWMQyKt/A4lztjDVPA5g9lfEm4YO6UAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb281699364ebd13240868870d21ba36b520f4b6108d86788adcd14dea651908","last_reissued_at":"2026-05-18T01:12:01.208663Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:01.208663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.06730","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:12:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tNR+0YKomq0K48pt3k5f0GpBebMDB3raQUVcTYuv8ZzszzYRN7bvCSYDgkeDosQxzOdHGNlu+wT8Ytetb2ncCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T08:06:40.806441Z"},"content_sha256":"5d732969c2ac594b3ea0be8bad9f39233f21552d8056f6341a40b7e0367ad2fb","schema_version":"1.0","event_id":"sha256:5d732969c2ac594b3ea0be8bad9f39233f21552d8056f6341a40b7e0367ad2fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7MUBNGJWJ26RGJAINCDQ2IN2G2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Two-stage algorithms for covering array construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.SE","math.CO"],"primary_cat":"cs.DS","authors_text":"Charles J. Colbourn, Kaushik Sarkar","submitted_at":"2016-06-21T04:01:39Z","abstract_excerpt":"Modern software systems often consist of many different components, each with a number of options. Although unit tests may reveal faulty options for individual components, functionally correct components may interact in unforeseen ways to cause a fault. Covering arrays are used to test for interactions among components systematically. A two-stage framework, providing a number of concrete algorithms, is developed for the efficient construction of covering arrays. %Our framework divides the construction in two stages. In the first stage, a time and memory efficient randomized algorithm covers mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06730","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:12:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CVn6ZzedugOwlqwuhLPIKs+xGEKAonIRR9md3GHGwlKoOXCoZKIKEzluqETfhC0VxFo5t+bIw6IdQbfuqfD2CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T08:06:40.807158Z"},"content_sha256":"9d7fd07a05e8ab0361ade758516dac622a3aa2c681e51e1aac06662546475f20","schema_version":"1.0","event_id":"sha256:9d7fd07a05e8ab0361ade758516dac622a3aa2c681e51e1aac06662546475f20"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7MUBNGJWJ26RGJAINCDQ2IN2G2/bundle.json","state_url":"https://pith.science/pith/7MUBNGJWJ26RGJAINCDQ2IN2G2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7MUBNGJWJ26RGJAINCDQ2IN2G2/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-05-19T08:06:40Z","links":{"resolver":"https://pith.science/pith/7MUBNGJWJ26RGJAINCDQ2IN2G2","bundle":"https://pith.science/pith/7MUBNGJWJ26RGJAINCDQ2IN2G2/bundle.json","state":"https://pith.science/pith/7MUBNGJWJ26RGJAINCDQ2IN2G2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7MUBNGJWJ26RGJAINCDQ2IN2G2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7MUBNGJWJ26RGJAINCDQ2IN2G2","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":"e3f3312c32df6366f51047e7e7e69d3eeb695bcc52b9d408c1ed8ee6ef4dad45","cross_cats_sorted":["cs.DM","cs.SE","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-21T04:01:39Z","title_canon_sha256":"fe2a6b6c74bf51e192aa48f6d596ec38da8729b7077765bd1ed25fe0b8595d40"},"schema_version":"1.0","source":{"id":"1606.06730","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.06730","created_at":"2026-05-18T01:12:01Z"},{"alias_kind":"arxiv_version","alias_value":"1606.06730v1","created_at":"2026-05-18T01:12:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06730","created_at":"2026-05-18T01:12:01Z"},{"alias_kind":"pith_short_12","alias_value":"7MUBNGJWJ26R","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7MUBNGJWJ26RGJAI","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7MUBNGJW","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:9d7fd07a05e8ab0361ade758516dac622a3aa2c681e51e1aac06662546475f20","target":"graph","created_at":"2026-05-18T01:12:01Z","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":"Modern software systems often consist of many different components, each with a number of options. Although unit tests may reveal faulty options for individual components, functionally correct components may interact in unforeseen ways to cause a fault. Covering arrays are used to test for interactions among components systematically. A two-stage framework, providing a number of concrete algorithms, is developed for the efficient construction of covering arrays. %Our framework divides the construction in two stages. In the first stage, a time and memory efficient randomized algorithm covers mo","authors_text":"Charles J. Colbourn, Kaushik Sarkar","cross_cats":["cs.DM","cs.SE","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-21T04:01:39Z","title":"Two-stage algorithms for covering array construction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06730","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:5d732969c2ac594b3ea0be8bad9f39233f21552d8056f6341a40b7e0367ad2fb","target":"record","created_at":"2026-05-18T01:12:01Z","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":"e3f3312c32df6366f51047e7e7e69d3eeb695bcc52b9d408c1ed8ee6ef4dad45","cross_cats_sorted":["cs.DM","cs.SE","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-21T04:01:39Z","title_canon_sha256":"fe2a6b6c74bf51e192aa48f6d596ec38da8729b7077765bd1ed25fe0b8595d40"},"schema_version":"1.0","source":{"id":"1606.06730","kind":"arxiv","version":1}},"canonical_sha256":"fb281699364ebd13240868870d21ba36b520f4b6108d86788adcd14dea651908","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb281699364ebd13240868870d21ba36b520f4b6108d86788adcd14dea651908","first_computed_at":"2026-05-18T01:12:01.208663Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:01.208663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aN6OCwFSNailNDijSB7ylUYXc27Io6bKCTGK0iu7ulqls4kRWQgPLdzWMQyKt/A4lztjDVPA5g9lfEm4YO6UAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:01.209071Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.06730","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d732969c2ac594b3ea0be8bad9f39233f21552d8056f6341a40b7e0367ad2fb","sha256:9d7fd07a05e8ab0361ade758516dac622a3aa2c681e51e1aac06662546475f20"],"state_sha256":"7444fc4cdd211c9d48d7b02096cba8bebee394457d9104fb7e2a8de6136748f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DnrdMkpnYW8mAip/UKZoYy59tenqqsR61S9DPZPBhKA8UKJnIppIsvkhSAN3QrVLLUDoopRcYryGWWR89p3sCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T08:06:40.810260Z","bundle_sha256":"8ca509e625262c1daa57aec290687a1238a884148df1d2fbd6a001b8953008bd"}}