{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:WJEX3YOR2VIVGX4JYS3J4WELL2","short_pith_number":"pith:WJEX3YOR","schema_version":"1.0","canonical_sha256":"b2497de1d1d551535f89c4b69e588b5eaeff91c5d146bcbeb57d4dd0ea302a67","source":{"kind":"arxiv","id":"1410.1826","version":1},"attestation_state":"computed","paper":{"title":"Almost Separable Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Karen Gunderson, Leonardo Baldassini, Matthew Aldridge","submitted_at":"2014-10-07T17:59:46Z","abstract_excerpt":"An $m \\times n$ matrix $\\mathsf{A}$ with column supports $\\{S_i\\}$ is $k$-separable if the disjunctions $\\bigcup_{i \\in \\mathcal{K}} S_i$ are all distinct over all sets $\\mathcal{K}$ of cardinality $k$. While a simple counting bound shows that $m > k \\log_2 n/k$ rows are required for a separable matrix to exist, in fact it is necessary for $m$ to be about a factor of $k$ more than this. In this paper, we consider a weaker definition of `almost $k$-separability', which requires that the disjunctions are `mostly distinct'. We show using a random construction that these matrices exist with $m = O"},"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":"1410.1826","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-07T17:59:46Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"c12276a63636763f416ddd760c2a984b4cf8175cec36b2e6dc66211d13609a95","abstract_canon_sha256":"dad3457fa864aadd232407d5fe220aecb5eb6767fc96141cbf4d7970009d8d38"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:49.437045Z","signature_b64":"HBkeuoS0M6eGWugcSE0LrDtT6Ef7AH372APbqF5wRY/x0A5ck++yQFgVVE5hULTmujgemrCb57wR3Jf6t58PAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2497de1d1d551535f89c4b69e588b5eaeff91c5d146bcbeb57d4dd0ea302a67","last_reissued_at":"2026-05-18T00:29:49.436496Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:49.436496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Almost Separable Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Karen Gunderson, Leonardo Baldassini, Matthew Aldridge","submitted_at":"2014-10-07T17:59:46Z","abstract_excerpt":"An $m \\times n$ matrix $\\mathsf{A}$ with column supports $\\{S_i\\}$ is $k$-separable if the disjunctions $\\bigcup_{i \\in \\mathcal{K}} S_i$ are all distinct over all sets $\\mathcal{K}$ of cardinality $k$. While a simple counting bound shows that $m > k \\log_2 n/k$ rows are required for a separable matrix to exist, in fact it is necessary for $m$ to be about a factor of $k$ more than this. In this paper, we consider a weaker definition of `almost $k$-separability', which requires that the disjunctions are `mostly distinct'. We show using a random construction that these matrices exist with $m = O"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.1826","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1410.1826","created_at":"2026-05-18T00:29:49.436582+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.1826v1","created_at":"2026-05-18T00:29:49.436582+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.1826","created_at":"2026-05-18T00:29:49.436582+00:00"},{"alias_kind":"pith_short_12","alias_value":"WJEX3YOR2VIV","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"WJEX3YOR2VIVGX4J","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"WJEX3YOR","created_at":"2026-05-18T12:28:54.890064+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/WJEX3YOR2VIVGX4JYS3J4WELL2","json":"https://pith.science/pith/WJEX3YOR2VIVGX4JYS3J4WELL2.json","graph_json":"https://pith.science/api/pith-number/WJEX3YOR2VIVGX4JYS3J4WELL2/graph.json","events_json":"https://pith.science/api/pith-number/WJEX3YOR2VIVGX4JYS3J4WELL2/events.json","paper":"https://pith.science/paper/WJEX3YOR"},"agent_actions":{"view_html":"https://pith.science/pith/WJEX3YOR2VIVGX4JYS3J4WELL2","download_json":"https://pith.science/pith/WJEX3YOR2VIVGX4JYS3J4WELL2.json","view_paper":"https://pith.science/paper/WJEX3YOR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.1826&json=true","fetch_graph":"https://pith.science/api/pith-number/WJEX3YOR2VIVGX4JYS3J4WELL2/graph.json","fetch_events":"https://pith.science/api/pith-number/WJEX3YOR2VIVGX4JYS3J4WELL2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WJEX3YOR2VIVGX4JYS3J4WELL2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WJEX3YOR2VIVGX4JYS3J4WELL2/action/storage_attestation","attest_author":"https://pith.science/pith/WJEX3YOR2VIVGX4JYS3J4WELL2/action/author_attestation","sign_citation":"https://pith.science/pith/WJEX3YOR2VIVGX4JYS3J4WELL2/action/citation_signature","submit_replication":"https://pith.science/pith/WJEX3YOR2VIVGX4JYS3J4WELL2/action/replication_record"}},"created_at":"2026-05-18T00:29:49.436582+00:00","updated_at":"2026-05-18T00:29:49.436582+00:00"}