{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:KDQCS3Q7JUC4YIC22L4SWYHAVS","short_pith_number":"pith:KDQCS3Q7","canonical_record":{"source":{"id":"1904.07480","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2019-04-16T05:59:06Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"9940c5e3e23ece8c654f899451cb64c1a4a1e8d227807de1e7a5cf38b04d17c0","abstract_canon_sha256":"786ccd80c2563d491365a0c210d3cd3d6c30a8b06007cb8f43a51ecfd0b99591"},"schema_version":"1.0"},"canonical_sha256":"50e0296e1f4d05cc205ad2f92b60e0ac9e3eea9a62ecdb4543a44df883d3e362","source":{"kind":"arxiv","id":"1904.07480","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.07480","created_at":"2026-05-17T23:48:25Z"},{"alias_kind":"arxiv_version","alias_value":"1904.07480v1","created_at":"2026-05-17T23:48:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.07480","created_at":"2026-05-17T23:48:25Z"},{"alias_kind":"pith_short_12","alias_value":"KDQCS3Q7JUC4","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KDQCS3Q7JUC4YIC2","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KDQCS3Q7","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:KDQCS3Q7JUC4YIC22L4SWYHAVS","target":"record","payload":{"canonical_record":{"source":{"id":"1904.07480","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2019-04-16T05:59:06Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"9940c5e3e23ece8c654f899451cb64c1a4a1e8d227807de1e7a5cf38b04d17c0","abstract_canon_sha256":"786ccd80c2563d491365a0c210d3cd3d6c30a8b06007cb8f43a51ecfd0b99591"},"schema_version":"1.0"},"canonical_sha256":"50e0296e1f4d05cc205ad2f92b60e0ac9e3eea9a62ecdb4543a44df883d3e362","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:25.121258Z","signature_b64":"ArWAOkNwyGJq7C8f9fLe2+j91t6dzCL7iJv4oD2P+iMcgNRHo0qD7uR8RFIQiWc/kQ0XDpkZlhoQo+JbSiF+Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50e0296e1f4d05cc205ad2f92b60e0ac9e3eea9a62ecdb4543a44df883d3e362","last_reissued_at":"2026-05-17T23:48:25.120549Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:25.120549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.07480","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-17T23:48:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ur3M0vlyyRpCeubSlqb7yGrADjnehAPbJFqtzmM19Z4Ub7TwMzUdnnpyHTSMHA2DM7eFx5VfUYi1mX1xWSqzDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:37:43.433493Z"},"content_sha256":"922207066ceb4ca7c95a946808b2815fa776403541101065e4ebae3f210ed0ca","schema_version":"1.0","event_id":"sha256:922207066ceb4ca7c95a946808b2815fa776403541101065e4ebae3f210ed0ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:KDQCS3Q7JUC4YIC22L4SWYHAVS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding minimum locating arrays using a CSP solver","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.SE","authors_text":"Hideharu Kojima, Hiroyuki Nakagawa, Tatsuhiro Tsuchiya, Tatsuya Konishi","submitted_at":"2019-04-16T05:59:06Z","abstract_excerpt":"Combinatorial interaction testing is an efficient software testing strategy. If all interactions among test parameters or factors needed to be covered, the size of a required test suite would be prohibitively large. In contrast, this strategy only requires covering $t$-wise interactions where $t$ is typically very small. As a result, it becomes possible to significantly reduce test suite size. Locating arrays aim to enhance the ability of combinatorial interaction testing. In particular, $(\\overline{1}, t)$-locating arrays can not only execute all $t$-way interactions but also identify, if any"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.07480","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-17T23:48:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JjXUX4tTJXTbs7yl37tNiTnHJoQch/RRAFl/Rl0Xw/RvIR01OdnchQWqVtLvNwC8ZavxZX7e9B4pGDefNtbwDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:37:43.434150Z"},"content_sha256":"5d44fa1c3788e02a98fa9ead122552979db8e5bc50bc2e70d4802482a69d1849","schema_version":"1.0","event_id":"sha256:5d44fa1c3788e02a98fa9ead122552979db8e5bc50bc2e70d4802482a69d1849"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KDQCS3Q7JUC4YIC22L4SWYHAVS/bundle.json","state_url":"https://pith.science/pith/KDQCS3Q7JUC4YIC22L4SWYHAVS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KDQCS3Q7JUC4YIC22L4SWYHAVS/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-09T08:37:43Z","links":{"resolver":"https://pith.science/pith/KDQCS3Q7JUC4YIC22L4SWYHAVS","bundle":"https://pith.science/pith/KDQCS3Q7JUC4YIC22L4SWYHAVS/bundle.json","state":"https://pith.science/pith/KDQCS3Q7JUC4YIC22L4SWYHAVS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KDQCS3Q7JUC4YIC22L4SWYHAVS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KDQCS3Q7JUC4YIC22L4SWYHAVS","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":"786ccd80c2563d491365a0c210d3cd3d6c30a8b06007cb8f43a51ecfd0b99591","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2019-04-16T05:59:06Z","title_canon_sha256":"9940c5e3e23ece8c654f899451cb64c1a4a1e8d227807de1e7a5cf38b04d17c0"},"schema_version":"1.0","source":{"id":"1904.07480","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.07480","created_at":"2026-05-17T23:48:25Z"},{"alias_kind":"arxiv_version","alias_value":"1904.07480v1","created_at":"2026-05-17T23:48:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.07480","created_at":"2026-05-17T23:48:25Z"},{"alias_kind":"pith_short_12","alias_value":"KDQCS3Q7JUC4","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KDQCS3Q7JUC4YIC2","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KDQCS3Q7","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:5d44fa1c3788e02a98fa9ead122552979db8e5bc50bc2e70d4802482a69d1849","target":"graph","created_at":"2026-05-17T23:48:25Z","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":"Combinatorial interaction testing is an efficient software testing strategy. If all interactions among test parameters or factors needed to be covered, the size of a required test suite would be prohibitively large. In contrast, this strategy only requires covering $t$-wise interactions where $t$ is typically very small. As a result, it becomes possible to significantly reduce test suite size. Locating arrays aim to enhance the ability of combinatorial interaction testing. In particular, $(\\overline{1}, t)$-locating arrays can not only execute all $t$-way interactions but also identify, if any","authors_text":"Hideharu Kojima, Hiroyuki Nakagawa, Tatsuhiro Tsuchiya, Tatsuya Konishi","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2019-04-16T05:59:06Z","title":"Finding minimum locating arrays using a CSP solver"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.07480","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:922207066ceb4ca7c95a946808b2815fa776403541101065e4ebae3f210ed0ca","target":"record","created_at":"2026-05-17T23:48:25Z","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":"786ccd80c2563d491365a0c210d3cd3d6c30a8b06007cb8f43a51ecfd0b99591","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2019-04-16T05:59:06Z","title_canon_sha256":"9940c5e3e23ece8c654f899451cb64c1a4a1e8d227807de1e7a5cf38b04d17c0"},"schema_version":"1.0","source":{"id":"1904.07480","kind":"arxiv","version":1}},"canonical_sha256":"50e0296e1f4d05cc205ad2f92b60e0ac9e3eea9a62ecdb4543a44df883d3e362","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"50e0296e1f4d05cc205ad2f92b60e0ac9e3eea9a62ecdb4543a44df883d3e362","first_computed_at":"2026-05-17T23:48:25.120549Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:25.120549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ArWAOkNwyGJq7C8f9fLe2+j91t6dzCL7iJv4oD2P+iMcgNRHo0qD7uR8RFIQiWc/kQ0XDpkZlhoQo+JbSiF+Cg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:25.121258Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.07480","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:922207066ceb4ca7c95a946808b2815fa776403541101065e4ebae3f210ed0ca","sha256:5d44fa1c3788e02a98fa9ead122552979db8e5bc50bc2e70d4802482a69d1849"],"state_sha256":"af71ed77c3a0e5a4a9650669f35ebd029bb1b26f77d4c5b68a33e61e693bc716"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aGL158ClTuJPkM6CROwqWXyaw/g44A6JzGgoF6TQ6Twde+jHIEESLRNLa25XPKCpnUxRxkY19TtwHdksVouYAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T08:37:43.437907Z","bundle_sha256":"f70d187a2ae2a337c2ec1a5bd3d6792f5d7d449f8659571c106b6a4d5408ab64"}}