{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:V7WSNTF46BORBKBRE3PB33I3RX","short_pith_number":"pith:V7WSNTF4","canonical_record":{"source":{"id":"1512.01150","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-12-03T16:44:39Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"28d97614e2b9fc523f6f0b586325b0c9c5026f794eba5e8665f9e8795e876a07","abstract_canon_sha256":"bd7a269afbb26cee2d07253adb3b63ac6675471d22a59cb15f2cd85a2ba46ddc"},"schema_version":"1.0"},"canonical_sha256":"afed26ccbcf05d10a83126de1ded1b8dedde472a7689c7c279931a980133329e","source":{"kind":"arxiv","id":"1512.01150","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.01150","created_at":"2026-05-18T00:52:23Z"},{"alias_kind":"arxiv_version","alias_value":"1512.01150v2","created_at":"2026-05-18T00:52:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.01150","created_at":"2026-05-18T00:52:23Z"},{"alias_kind":"pith_short_12","alias_value":"V7WSNTF46BOR","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"V7WSNTF46BORBKBR","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"V7WSNTF4","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:V7WSNTF46BORBKBRE3PB33I3RX","target":"record","payload":{"canonical_record":{"source":{"id":"1512.01150","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-12-03T16:44:39Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"28d97614e2b9fc523f6f0b586325b0c9c5026f794eba5e8665f9e8795e876a07","abstract_canon_sha256":"bd7a269afbb26cee2d07253adb3b63ac6675471d22a59cb15f2cd85a2ba46ddc"},"schema_version":"1.0"},"canonical_sha256":"afed26ccbcf05d10a83126de1ded1b8dedde472a7689c7c279931a980133329e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:23.702850Z","signature_b64":"jfWc/k3c4c060h12k6f/jbAWPpIMHqnrSmkUgiREqDmPue6tFl4crqWnBXbx+t7SQwsnzZZsramhYn8xZ7AlCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"afed26ccbcf05d10a83126de1ded1b8dedde472a7689c7c279931a980133329e","last_reissued_at":"2026-05-18T00:52:23.702227Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:23.702227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.01150","source_version":2,"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-18T00:52:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RikWXy7CIG0FbBWZyLOMimVKhUepQFqDvWaafGkzIiJD+AWalOf+X2VXFRV4bOq/2JtM0fcWUwFtoPBzxX+DCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:06:16.980590Z"},"content_sha256":"435d09a0a3769c9d8ef187f3bd7f2e60aa07ec2f0de0ff0572c53524a69bfb69","schema_version":"1.0","event_id":"sha256:435d09a0a3769c9d8ef187f3bd7f2e60aa07ec2f0de0ff0572c53524a69bfb69"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:V7WSNTF46BORBKBRE3PB33I3RX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exploiting Hidden Structure in Selecting Dimensions that Distinguish Vectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DM","authors_text":"Manuel Sorge, Ren\\'e van Bevern, Rolf Niedermeier, Vincent Froese","submitted_at":"2015-12-03T16:44:39Z","abstract_excerpt":"The NP-hard Distinct Vectors problem asks to delete as many columns as possible from a matrix such that all rows in the resulting matrix are still pairwise distinct. Our main result is that, for binary matrices, there is a complexity dichotomy for Distinct Vectors based on the maximum (H) and the minimum (h) pairwise Hamming distance between matrix rows: Distinct Vectors can be solved in polynomial time if H <= 2 ceil(h/2) + 1, and is NP-complete otherwise. Moreover, we explore connections of Distinct Vectors to hitting sets, thereby providing several fixed-parameter tractability and intractab"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.01150","kind":"arxiv","version":2},"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-18T00:52:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KeONZKQ39K+pTOtYGHJLEpLTlBnBlK9UdtRWL22ywS3rdeQPexBv/VWXjCPM5tE16u1Y55MoZYoafkubXWCaAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:06:16.981240Z"},"content_sha256":"35f25c8e7900f0b8d22b29fb71ed79c341d7da75a4e7033d8efc6d63af47b6db","schema_version":"1.0","event_id":"sha256:35f25c8e7900f0b8d22b29fb71ed79c341d7da75a4e7033d8efc6d63af47b6db"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V7WSNTF46BORBKBRE3PB33I3RX/bundle.json","state_url":"https://pith.science/pith/V7WSNTF46BORBKBRE3PB33I3RX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V7WSNTF46BORBKBRE3PB33I3RX/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-07T14:06:16Z","links":{"resolver":"https://pith.science/pith/V7WSNTF46BORBKBRE3PB33I3RX","bundle":"https://pith.science/pith/V7WSNTF46BORBKBRE3PB33I3RX/bundle.json","state":"https://pith.science/pith/V7WSNTF46BORBKBRE3PB33I3RX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V7WSNTF46BORBKBRE3PB33I3RX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:V7WSNTF46BORBKBRE3PB33I3RX","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":"bd7a269afbb26cee2d07253adb3b63ac6675471d22a59cb15f2cd85a2ba46ddc","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-12-03T16:44:39Z","title_canon_sha256":"28d97614e2b9fc523f6f0b586325b0c9c5026f794eba5e8665f9e8795e876a07"},"schema_version":"1.0","source":{"id":"1512.01150","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.01150","created_at":"2026-05-18T00:52:23Z"},{"alias_kind":"arxiv_version","alias_value":"1512.01150v2","created_at":"2026-05-18T00:52:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.01150","created_at":"2026-05-18T00:52:23Z"},{"alias_kind":"pith_short_12","alias_value":"V7WSNTF46BOR","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"V7WSNTF46BORBKBR","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"V7WSNTF4","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:35f25c8e7900f0b8d22b29fb71ed79c341d7da75a4e7033d8efc6d63af47b6db","target":"graph","created_at":"2026-05-18T00:52:23Z","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":"The NP-hard Distinct Vectors problem asks to delete as many columns as possible from a matrix such that all rows in the resulting matrix are still pairwise distinct. Our main result is that, for binary matrices, there is a complexity dichotomy for Distinct Vectors based on the maximum (H) and the minimum (h) pairwise Hamming distance between matrix rows: Distinct Vectors can be solved in polynomial time if H <= 2 ceil(h/2) + 1, and is NP-complete otherwise. Moreover, we explore connections of Distinct Vectors to hitting sets, thereby providing several fixed-parameter tractability and intractab","authors_text":"Manuel Sorge, Ren\\'e van Bevern, Rolf Niedermeier, Vincent Froese","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-12-03T16:44:39Z","title":"Exploiting Hidden Structure in Selecting Dimensions that Distinguish Vectors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.01150","kind":"arxiv","version":2},"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:435d09a0a3769c9d8ef187f3bd7f2e60aa07ec2f0de0ff0572c53524a69bfb69","target":"record","created_at":"2026-05-18T00:52:23Z","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":"bd7a269afbb26cee2d07253adb3b63ac6675471d22a59cb15f2cd85a2ba46ddc","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-12-03T16:44:39Z","title_canon_sha256":"28d97614e2b9fc523f6f0b586325b0c9c5026f794eba5e8665f9e8795e876a07"},"schema_version":"1.0","source":{"id":"1512.01150","kind":"arxiv","version":2}},"canonical_sha256":"afed26ccbcf05d10a83126de1ded1b8dedde472a7689c7c279931a980133329e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"afed26ccbcf05d10a83126de1ded1b8dedde472a7689c7c279931a980133329e","first_computed_at":"2026-05-18T00:52:23.702227Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:23.702227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jfWc/k3c4c060h12k6f/jbAWPpIMHqnrSmkUgiREqDmPue6tFl4crqWnBXbx+t7SQwsnzZZsramhYn8xZ7AlCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:23.702850Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.01150","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:435d09a0a3769c9d8ef187f3bd7f2e60aa07ec2f0de0ff0572c53524a69bfb69","sha256:35f25c8e7900f0b8d22b29fb71ed79c341d7da75a4e7033d8efc6d63af47b6db"],"state_sha256":"96691d209e2adfc2ad3708ef12cdef734782240da4a7dbdd9eefee800404f88d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zMMyEgWFdKOs3vZa1SKU/f5Qd76s0C54lcuA7aFG4hCRRYkyoJd43VN9ivaO9P9P8/dc05IwrU2IsCLJhIU3CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T14:06:16.984506Z","bundle_sha256":"dfa560a03259887dd29497cbccd4e280d44429f3fd418605fccbe21830c28452"}}