{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VONCAL6F4JFZDVWOZMBW4D37TZ","short_pith_number":"pith:VONCAL6F","schema_version":"1.0","canonical_sha256":"ab9a202fc5e24b91d6cecb036e0f7f9e57aecf911464f74e75d2bd07ca596abe","source":{"kind":"arxiv","id":"1501.07544","version":2},"attestation_state":"computed","paper":{"title":"When Does an Ensemble of Matrices with Randomly Scaled Rows Lose Rank?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Aly El Gamal, A. Salman Avestimehr, Navid Naderializadeh","submitted_at":"2015-01-29T19:05:32Z","abstract_excerpt":"We consider the problem of determining rank loss conditions for a concatenation of full-rank matrices, such that each row of the composing matrices is scaled by a random coefficient. This problem has applications in wireless interference management and recommendation systems. We determine necessary and sufficient conditions for the design of each matrix, such that the random ensemble will almost surely lose rank by a certain amount. The result is proved by converting the problem to determining rank loss conditions for the union of some specific matroids, and then using tools from matroid and g"},"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":"1501.07544","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-29T19:05:32Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"589bef607e86dc2713916edb3561b9f41571d223871bb957697ae6571da3ab64","abstract_canon_sha256":"bb81d3e3488dc876a0009dd1b35cdf436b20636ca1adf805cec855adbc19e02a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:13.360481Z","signature_b64":"Cmu6PLyV3aVA9MzJVo4EUycE6LLBDomQdDvkzih621y3Ebs81n6ycF/7TXJDRIlHwlx7UpgPclUBJwjQwn64Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab9a202fc5e24b91d6cecb036e0f7f9e57aecf911464f74e75d2bd07ca596abe","last_reissued_at":"2026-05-18T02:18:13.360116Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:13.360116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"When Does an Ensemble of Matrices with Randomly Scaled Rows Lose Rank?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Aly El Gamal, A. Salman Avestimehr, Navid Naderializadeh","submitted_at":"2015-01-29T19:05:32Z","abstract_excerpt":"We consider the problem of determining rank loss conditions for a concatenation of full-rank matrices, such that each row of the composing matrices is scaled by a random coefficient. This problem has applications in wireless interference management and recommendation systems. We determine necessary and sufficient conditions for the design of each matrix, such that the random ensemble will almost surely lose rank by a certain amount. The result is proved by converting the problem to determining rank loss conditions for the union of some specific matroids, and then using tools from matroid and g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07544","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":"1501.07544","created_at":"2026-05-18T02:18:13.360167+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.07544v2","created_at":"2026-05-18T02:18:13.360167+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07544","created_at":"2026-05-18T02:18:13.360167+00:00"},{"alias_kind":"pith_short_12","alias_value":"VONCAL6F4JFZ","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"VONCAL6F4JFZDVWO","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"VONCAL6F","created_at":"2026-05-18T12:29:47.479230+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/VONCAL6F4JFZDVWOZMBW4D37TZ","json":"https://pith.science/pith/VONCAL6F4JFZDVWOZMBW4D37TZ.json","graph_json":"https://pith.science/api/pith-number/VONCAL6F4JFZDVWOZMBW4D37TZ/graph.json","events_json":"https://pith.science/api/pith-number/VONCAL6F4JFZDVWOZMBW4D37TZ/events.json","paper":"https://pith.science/paper/VONCAL6F"},"agent_actions":{"view_html":"https://pith.science/pith/VONCAL6F4JFZDVWOZMBW4D37TZ","download_json":"https://pith.science/pith/VONCAL6F4JFZDVWOZMBW4D37TZ.json","view_paper":"https://pith.science/paper/VONCAL6F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.07544&json=true","fetch_graph":"https://pith.science/api/pith-number/VONCAL6F4JFZDVWOZMBW4D37TZ/graph.json","fetch_events":"https://pith.science/api/pith-number/VONCAL6F4JFZDVWOZMBW4D37TZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VONCAL6F4JFZDVWOZMBW4D37TZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VONCAL6F4JFZDVWOZMBW4D37TZ/action/storage_attestation","attest_author":"https://pith.science/pith/VONCAL6F4JFZDVWOZMBW4D37TZ/action/author_attestation","sign_citation":"https://pith.science/pith/VONCAL6F4JFZDVWOZMBW4D37TZ/action/citation_signature","submit_replication":"https://pith.science/pith/VONCAL6F4JFZDVWOZMBW4D37TZ/action/replication_record"}},"created_at":"2026-05-18T02:18:13.360167+00:00","updated_at":"2026-05-18T02:18:13.360167+00:00"}