{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WJEX3YOR2VIVGX4JYS3J4WELL2","short_pith_number":"pith:WJEX3YOR","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"},"canonical_sha256":"b2497de1d1d551535f89c4b69e588b5eaeff91c5d146bcbeb57d4dd0ea302a67","source":{"kind":"arxiv","id":"1410.1826","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.1826","created_at":"2026-05-18T00:29:49Z"},{"alias_kind":"arxiv_version","alias_value":"1410.1826v1","created_at":"2026-05-18T00:29:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.1826","created_at":"2026-05-18T00:29:49Z"},{"alias_kind":"pith_short_12","alias_value":"WJEX3YOR2VIV","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WJEX3YOR2VIVGX4J","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WJEX3YOR","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WJEX3YOR2VIVGX4JYS3J4WELL2","target":"record","payload":{"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"},"canonical_sha256":"b2497de1d1d551535f89c4b69e588b5eaeff91c5d146bcbeb57d4dd0ea302a67","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"},"source_kind":"arxiv","source_id":"1410.1826","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-18T00:29:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o5Y1k7CS6HWHAWjtLzhvlxoqJaaMDXfBObwjxAVhwD/36JqsosDXnljjuB0hYyavNPPJN+yu+HIqRT6obIWsAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:38:20.345152Z"},"content_sha256":"26b1bb6d47813f24ecc502b033d3c8fc4cb8674301bba323ae7f0874a54d649a","schema_version":"1.0","event_id":"sha256:26b1bb6d47813f24ecc502b033d3c8fc4cb8674301bba323ae7f0874a54d649a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WJEX3YOR2VIVGX4JYS3J4WELL2","target":"graph","payload":{"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"},"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:29:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hb58f+bZAG8KgrkVkqyIzTC1Xl5MdI0D/OHhZoDAs7hjCMyDNm2Dzt2x3QsQ1Lq88prRcthfYNn6RRU8w6ftDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:38:20.345556Z"},"content_sha256":"33df8ab7f8fb4843d21b519ecc1f863b566e18f1b0e61512b38cda035115fe56","schema_version":"1.0","event_id":"sha256:33df8ab7f8fb4843d21b519ecc1f863b566e18f1b0e61512b38cda035115fe56"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WJEX3YOR2VIVGX4JYS3J4WELL2/bundle.json","state_url":"https://pith.science/pith/WJEX3YOR2VIVGX4JYS3J4WELL2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WJEX3YOR2VIVGX4JYS3J4WELL2/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-28T23:38:20Z","links":{"resolver":"https://pith.science/pith/WJEX3YOR2VIVGX4JYS3J4WELL2","bundle":"https://pith.science/pith/WJEX3YOR2VIVGX4JYS3J4WELL2/bundle.json","state":"https://pith.science/pith/WJEX3YOR2VIVGX4JYS3J4WELL2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WJEX3YOR2VIVGX4JYS3J4WELL2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WJEX3YOR2VIVGX4JYS3J4WELL2","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":"dad3457fa864aadd232407d5fe220aecb5eb6767fc96141cbf4d7970009d8d38","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-07T17:59:46Z","title_canon_sha256":"c12276a63636763f416ddd760c2a984b4cf8175cec36b2e6dc66211d13609a95"},"schema_version":"1.0","source":{"id":"1410.1826","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.1826","created_at":"2026-05-18T00:29:49Z"},{"alias_kind":"arxiv_version","alias_value":"1410.1826v1","created_at":"2026-05-18T00:29:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.1826","created_at":"2026-05-18T00:29:49Z"},{"alias_kind":"pith_short_12","alias_value":"WJEX3YOR2VIV","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WJEX3YOR2VIVGX4J","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WJEX3YOR","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:33df8ab7f8fb4843d21b519ecc1f863b566e18f1b0e61512b38cda035115fe56","target":"graph","created_at":"2026-05-18T00:29:49Z","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":"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","authors_text":"Karen Gunderson, Leonardo Baldassini, Matthew Aldridge","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-07T17:59:46Z","title":"Almost Separable Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.1826","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:26b1bb6d47813f24ecc502b033d3c8fc4cb8674301bba323ae7f0874a54d649a","target":"record","created_at":"2026-05-18T00:29:49Z","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":"dad3457fa864aadd232407d5fe220aecb5eb6767fc96141cbf4d7970009d8d38","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-07T17:59:46Z","title_canon_sha256":"c12276a63636763f416ddd760c2a984b4cf8175cec36b2e6dc66211d13609a95"},"schema_version":"1.0","source":{"id":"1410.1826","kind":"arxiv","version":1}},"canonical_sha256":"b2497de1d1d551535f89c4b69e588b5eaeff91c5d146bcbeb57d4dd0ea302a67","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b2497de1d1d551535f89c4b69e588b5eaeff91c5d146bcbeb57d4dd0ea302a67","first_computed_at":"2026-05-18T00:29:49.436496Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:49.436496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HBkeuoS0M6eGWugcSE0LrDtT6Ef7AH372APbqF5wRY/x0A5ck++yQFgVVE5hULTmujgemrCb57wR3Jf6t58PAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:49.437045Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.1826","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:26b1bb6d47813f24ecc502b033d3c8fc4cb8674301bba323ae7f0874a54d649a","sha256:33df8ab7f8fb4843d21b519ecc1f863b566e18f1b0e61512b38cda035115fe56"],"state_sha256":"b661fbbd25ea007c2aa0d6f865247ee9b0f5f9a412dc74823660ad21bfb4606f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ew4fAlzbD6cOi7/eKh7KibMcLMs5KMKZuJjhike8Wg9bG04MLy58YCBiSy/rR55q7oJOi7rvTXu+ud3gjI1MAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T23:38:20.348983Z","bundle_sha256":"a2adc5d04c6d0dd4dfab24b83bc496d915894ad697b03a7b3722771e5dc17641"}}