{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4SWMSBE2WHS63OZND6DJOZF4ZQ","short_pith_number":"pith:4SWMSBE2","schema_version":"1.0","canonical_sha256":"e4acc9049ab1e5edbb2d1f869764bccc0e7251851581f4332d5839fde0bd9175","source":{"kind":"arxiv","id":"1901.05721","version":1},"attestation_state":"computed","paper":{"title":"A Relation Between Weight Enumerating Function and Number of Full Rank Sub-matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"B. Sundar Rajan, Mahesh Babu Vaddi","submitted_at":"2019-01-17T10:37:39Z","abstract_excerpt":"In most of the network coding problems with $k$ messages, the existence of binary network coding solution over $\\mathbb{F}_2$ depends on the existence of adequate sets of $k$-dimensional binary vectors such that each set comprises of linearly independent vectors. In a given $k \\times n$ ($n \\geq k$) binary matrix, there exist ${n}\\choose{k}$ binary sub-matrices of size $k \\times k$. Every possible $k \\times k$ sub-matrix may be of full rank or singular depending on the columns present in the matrix. In this work, for full rank binary matrix $\\mathbf{G}$ of size $k \\times n$ satisfying certain "},"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":"1901.05721","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-17T10:37:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d28f4d4a7967e5b273df4c963b265dd05d93459cf8fd47c886b27ef83c717e13","abstract_canon_sha256":"0d5d6077f3e63566ad2b2212bebf71597e57ade2e1d65b7092359803a0794446"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:06.310548Z","signature_b64":"f751hlARxtLcf5byOqpCBxz28iUXVTo/6jbmzGE4cTzyJstHBj26R9+vEpquWbBRToFzDEAho340xG2pIZbgBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4acc9049ab1e5edbb2d1f869764bccc0e7251851581f4332d5839fde0bd9175","last_reissued_at":"2026-05-17T23:56:06.309832Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:06.309832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Relation Between Weight Enumerating Function and Number of Full Rank Sub-matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"B. Sundar Rajan, Mahesh Babu Vaddi","submitted_at":"2019-01-17T10:37:39Z","abstract_excerpt":"In most of the network coding problems with $k$ messages, the existence of binary network coding solution over $\\mathbb{F}_2$ depends on the existence of adequate sets of $k$-dimensional binary vectors such that each set comprises of linearly independent vectors. In a given $k \\times n$ ($n \\geq k$) binary matrix, there exist ${n}\\choose{k}$ binary sub-matrices of size $k \\times k$. Every possible $k \\times k$ sub-matrix may be of full rank or singular depending on the columns present in the matrix. In this work, for full rank binary matrix $\\mathbf{G}$ of size $k \\times n$ satisfying certain "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05721","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":"1901.05721","created_at":"2026-05-17T23:56:06.309939+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.05721v1","created_at":"2026-05-17T23:56:06.309939+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05721","created_at":"2026-05-17T23:56:06.309939+00:00"},{"alias_kind":"pith_short_12","alias_value":"4SWMSBE2WHS6","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"4SWMSBE2WHS63OZN","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"4SWMSBE2","created_at":"2026-05-18T12:33:10.108867+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/4SWMSBE2WHS63OZND6DJOZF4ZQ","json":"https://pith.science/pith/4SWMSBE2WHS63OZND6DJOZF4ZQ.json","graph_json":"https://pith.science/api/pith-number/4SWMSBE2WHS63OZND6DJOZF4ZQ/graph.json","events_json":"https://pith.science/api/pith-number/4SWMSBE2WHS63OZND6DJOZF4ZQ/events.json","paper":"https://pith.science/paper/4SWMSBE2"},"agent_actions":{"view_html":"https://pith.science/pith/4SWMSBE2WHS63OZND6DJOZF4ZQ","download_json":"https://pith.science/pith/4SWMSBE2WHS63OZND6DJOZF4ZQ.json","view_paper":"https://pith.science/paper/4SWMSBE2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.05721&json=true","fetch_graph":"https://pith.science/api/pith-number/4SWMSBE2WHS63OZND6DJOZF4ZQ/graph.json","fetch_events":"https://pith.science/api/pith-number/4SWMSBE2WHS63OZND6DJOZF4ZQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4SWMSBE2WHS63OZND6DJOZF4ZQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4SWMSBE2WHS63OZND6DJOZF4ZQ/action/storage_attestation","attest_author":"https://pith.science/pith/4SWMSBE2WHS63OZND6DJOZF4ZQ/action/author_attestation","sign_citation":"https://pith.science/pith/4SWMSBE2WHS63OZND6DJOZF4ZQ/action/citation_signature","submit_replication":"https://pith.science/pith/4SWMSBE2WHS63OZND6DJOZF4ZQ/action/replication_record"}},"created_at":"2026-05-17T23:56:06.309939+00:00","updated_at":"2026-05-17T23:56:06.309939+00:00"}