{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:V7WSNTF46BORBKBRE3PB33I3RX","short_pith_number":"pith:V7WSNTF4","schema_version":"1.0","canonical_sha256":"afed26ccbcf05d10a83126de1ded1b8dedde472a7689c7c279931a980133329e","source":{"kind":"arxiv","id":"1512.01150","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1512.01150","created_at":"2026-05-18T00:52:23.702328+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.01150v2","created_at":"2026-05-18T00:52:23.702328+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.01150","created_at":"2026-05-18T00:52:23.702328+00:00"},{"alias_kind":"pith_short_12","alias_value":"V7WSNTF46BOR","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"V7WSNTF46BORBKBR","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"V7WSNTF4","created_at":"2026-05-18T12:29:44.643036+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V7WSNTF46BORBKBRE3PB33I3RX","json":"https://pith.science/pith/V7WSNTF46BORBKBRE3PB33I3RX.json","graph_json":"https://pith.science/api/pith-number/V7WSNTF46BORBKBRE3PB33I3RX/graph.json","events_json":"https://pith.science/api/pith-number/V7WSNTF46BORBKBRE3PB33I3RX/events.json","paper":"https://pith.science/paper/V7WSNTF4"},"agent_actions":{"view_html":"https://pith.science/pith/V7WSNTF46BORBKBRE3PB33I3RX","download_json":"https://pith.science/pith/V7WSNTF46BORBKBRE3PB33I3RX.json","view_paper":"https://pith.science/paper/V7WSNTF4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.01150&json=true","fetch_graph":"https://pith.science/api/pith-number/V7WSNTF46BORBKBRE3PB33I3RX/graph.json","fetch_events":"https://pith.science/api/pith-number/V7WSNTF46BORBKBRE3PB33I3RX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V7WSNTF46BORBKBRE3PB33I3RX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V7WSNTF46BORBKBRE3PB33I3RX/action/storage_attestation","attest_author":"https://pith.science/pith/V7WSNTF46BORBKBRE3PB33I3RX/action/author_attestation","sign_citation":"https://pith.science/pith/V7WSNTF46BORBKBRE3PB33I3RX/action/citation_signature","submit_replication":"https://pith.science/pith/V7WSNTF46BORBKBRE3PB33I3RX/action/replication_record"}},"created_at":"2026-05-18T00:52:23.702328+00:00","updated_at":"2026-05-18T00:52:23.702328+00:00"}