{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:4SWMSBE2WHS63OZND6DJOZF4ZQ","short_pith_number":"pith:4SWMSBE2","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"},"canonical_sha256":"e4acc9049ab1e5edbb2d1f869764bccc0e7251851581f4332d5839fde0bd9175","source":{"kind":"arxiv","id":"1901.05721","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.05721","created_at":"2026-05-17T23:56:06Z"},{"alias_kind":"arxiv_version","alias_value":"1901.05721v1","created_at":"2026-05-17T23:56:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05721","created_at":"2026-05-17T23:56:06Z"},{"alias_kind":"pith_short_12","alias_value":"4SWMSBE2WHS6","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4SWMSBE2WHS63OZN","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4SWMSBE2","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:4SWMSBE2WHS63OZND6DJOZF4ZQ","target":"record","payload":{"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"},"canonical_sha256":"e4acc9049ab1e5edbb2d1f869764bccc0e7251851581f4332d5839fde0bd9175","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"},"source_kind":"arxiv","source_id":"1901.05721","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-17T23:56:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gOnSe5V8z5jZ6bIsNWRvMeS8vZP79S6VdT5TzYjyAThv4zdb+2+Y4a7DaGpLw1JnlxTJ908WvpuZhdQNqKn2AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:18:21.951825Z"},"content_sha256":"1dbce3291771dd67a771de596463c7e573633d75a3f3c76f618e3f27c9be38c1","schema_version":"1.0","event_id":"sha256:1dbce3291771dd67a771de596463c7e573633d75a3f3c76f618e3f27c9be38c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:4SWMSBE2WHS63OZND6DJOZF4ZQ","target":"graph","payload":{"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"},"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-17T23:56:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4CYsSK0Av5S4E9A/esPfy3D8FP50r45Hz9GTS1jn31DHbvexyFYAPRXEFvxOCX6xL+x6B0HDWjtJRKg6y83uDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:18:21.952179Z"},"content_sha256":"c942d5510209fa7fcc98407718342e6a272447ec4fefe1a957bfe1a354e8c928","schema_version":"1.0","event_id":"sha256:c942d5510209fa7fcc98407718342e6a272447ec4fefe1a957bfe1a354e8c928"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4SWMSBE2WHS63OZND6DJOZF4ZQ/bundle.json","state_url":"https://pith.science/pith/4SWMSBE2WHS63OZND6DJOZF4ZQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4SWMSBE2WHS63OZND6DJOZF4ZQ/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-06-04T18:18:21Z","links":{"resolver":"https://pith.science/pith/4SWMSBE2WHS63OZND6DJOZF4ZQ","bundle":"https://pith.science/pith/4SWMSBE2WHS63OZND6DJOZF4ZQ/bundle.json","state":"https://pith.science/pith/4SWMSBE2WHS63OZND6DJOZF4ZQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4SWMSBE2WHS63OZND6DJOZF4ZQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4SWMSBE2WHS63OZND6DJOZF4ZQ","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":"0d5d6077f3e63566ad2b2212bebf71597e57ade2e1d65b7092359803a0794446","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-17T10:37:39Z","title_canon_sha256":"d28f4d4a7967e5b273df4c963b265dd05d93459cf8fd47c886b27ef83c717e13"},"schema_version":"1.0","source":{"id":"1901.05721","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.05721","created_at":"2026-05-17T23:56:06Z"},{"alias_kind":"arxiv_version","alias_value":"1901.05721v1","created_at":"2026-05-17T23:56:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05721","created_at":"2026-05-17T23:56:06Z"},{"alias_kind":"pith_short_12","alias_value":"4SWMSBE2WHS6","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4SWMSBE2WHS63OZN","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4SWMSBE2","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:c942d5510209fa7fcc98407718342e6a272447ec4fefe1a957bfe1a354e8c928","target":"graph","created_at":"2026-05-17T23:56:06Z","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":"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 ","authors_text":"B. Sundar Rajan, Mahesh Babu Vaddi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-17T10:37:39Z","title":"A Relation Between Weight Enumerating Function and Number of Full Rank Sub-matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05721","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:1dbce3291771dd67a771de596463c7e573633d75a3f3c76f618e3f27c9be38c1","target":"record","created_at":"2026-05-17T23:56:06Z","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":"0d5d6077f3e63566ad2b2212bebf71597e57ade2e1d65b7092359803a0794446","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-17T10:37:39Z","title_canon_sha256":"d28f4d4a7967e5b273df4c963b265dd05d93459cf8fd47c886b27ef83c717e13"},"schema_version":"1.0","source":{"id":"1901.05721","kind":"arxiv","version":1}},"canonical_sha256":"e4acc9049ab1e5edbb2d1f869764bccc0e7251851581f4332d5839fde0bd9175","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4acc9049ab1e5edbb2d1f869764bccc0e7251851581f4332d5839fde0bd9175","first_computed_at":"2026-05-17T23:56:06.309832Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:06.309832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f751hlARxtLcf5byOqpCBxz28iUXVTo/6jbmzGE4cTzyJstHBj26R9+vEpquWbBRToFzDEAho340xG2pIZbgBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:06.310548Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.05721","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1dbce3291771dd67a771de596463c7e573633d75a3f3c76f618e3f27c9be38c1","sha256:c942d5510209fa7fcc98407718342e6a272447ec4fefe1a957bfe1a354e8c928"],"state_sha256":"ab001ae5d9e65fe672645b825a6ab85d47848500e8b33a702c45e0359fd01e44"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"et7Q4anezYfOkLnRNn4J9NADj5JvcbHzEx6YSsirDW+gmhoui05FRlOkpEUfInouNlVMWE6cPukoYHq/LtRrCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T18:18:21.954174Z","bundle_sha256":"7dfb9debacd7f9aaf7d1e7121356c489d7b26d7024e5f4825b389d0caf53ca3d"}}