{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7PIPURKRUXTKG4L4Q74YO5BU2C","short_pith_number":"pith:7PIPURKR","canonical_record":{"source":{"id":"1609.08265","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-27T05:46:33Z","cross_cats_sorted":["math.AG","math.IT"],"title_canon_sha256":"90703d84f858f73b44977775fab27265b73c5a84ac2e96653159e5295d3f9a3c","abstract_canon_sha256":"f84734761c667d3234dd35f7f6d8ed1017f569944f8f897d9721f90bcd1a623d"},"schema_version":"1.0"},"canonical_sha256":"fbd0fa4551a5e6a3717c87f9877434d088720ebe62b971eb95a11ede3002f94b","source":{"kind":"arxiv","id":"1609.08265","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.08265","created_at":"2026-05-18T00:25:02Z"},{"alias_kind":"arxiv_version","alias_value":"1609.08265v2","created_at":"2026-05-18T00:25:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08265","created_at":"2026-05-18T00:25:02Z"},{"alias_kind":"pith_short_12","alias_value":"7PIPURKRUXTK","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7PIPURKRUXTKG4L4","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7PIPURKR","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7PIPURKRUXTKG4L4Q74YO5BU2C","target":"record","payload":{"canonical_record":{"source":{"id":"1609.08265","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-27T05:46:33Z","cross_cats_sorted":["math.AG","math.IT"],"title_canon_sha256":"90703d84f858f73b44977775fab27265b73c5a84ac2e96653159e5295d3f9a3c","abstract_canon_sha256":"f84734761c667d3234dd35f7f6d8ed1017f569944f8f897d9721f90bcd1a623d"},"schema_version":"1.0"},"canonical_sha256":"fbd0fa4551a5e6a3717c87f9877434d088720ebe62b971eb95a11ede3002f94b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:02.191076Z","signature_b64":"zj1XEG7pprpKB6e/X0fXrEHkR+ygxMM5iJebmfLT8Az7cPsgOgOrIvR/a1VTkZc60X4lqJcDsRGZyGH+ihNECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fbd0fa4551a5e6a3717c87f9877434d088720ebe62b971eb95a11ede3002f94b","last_reissued_at":"2026-05-18T00:25:02.190654Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:02.190654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.08265","source_version":2,"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:25:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7XjxGEIk3HkSc2LkfbkwHZ1ij3f/kPjbdsqkUeS9+VbgGvO4DgIwJmw50uPVCSVLhl403ut96RXuXrbQSWtJDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T23:18:36.294199Z"},"content_sha256":"30417997d2ab943128676248b7036d9c75704e101e7c25414497e4e05f9df923","schema_version":"1.0","event_id":"sha256:30417997d2ab943128676248b7036d9c75704e101e7c25414497e4e05f9df923"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7PIPURKRUXTKG4L4Q74YO5BU2C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum Distance and the Minimum Weight Codewords of Schubert Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG","math.IT"],"primary_cat":"cs.IT","authors_text":"Prasant Singh, Sudhir R. Ghorpade","submitted_at":"2016-09-27T05:46:33Z","abstract_excerpt":"We consider linear codes associated to Schubert varieties in Grassmannians. A formula for the minimum distance of these codes was conjectured in 2000 and after having been established in various special cases, it was proved in 2008 by Xiang. We give an alternative proof of this formula. Further, we propose a characterization of the minimum weight codewords of Schubert codes by introducing the notion of Schubert decomposable elements of certain exterior powers. It is shown that codewords corresponding to Schubert decomposable elements are of minimum weight and also that the converse is true in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.08265","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"},"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:25:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L1Wes8lxF4yBDLl50cBPHL/XUhYHerpqpVEdD8eLPkLtyZ1DJgSqy5InU5WMHO+1aUKfGCTEqhKiLqpOfjeDCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T23:18:36.294574Z"},"content_sha256":"b6063403c8154ba1b57278989c99b70b8b6392aed0bb142c8b13f74e291cff5c","schema_version":"1.0","event_id":"sha256:b6063403c8154ba1b57278989c99b70b8b6392aed0bb142c8b13f74e291cff5c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7PIPURKRUXTKG4L4Q74YO5BU2C/bundle.json","state_url":"https://pith.science/pith/7PIPURKRUXTKG4L4Q74YO5BU2C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7PIPURKRUXTKG4L4Q74YO5BU2C/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-28T23:18:36Z","links":{"resolver":"https://pith.science/pith/7PIPURKRUXTKG4L4Q74YO5BU2C","bundle":"https://pith.science/pith/7PIPURKRUXTKG4L4Q74YO5BU2C/bundle.json","state":"https://pith.science/pith/7PIPURKRUXTKG4L4Q74YO5BU2C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7PIPURKRUXTKG4L4Q74YO5BU2C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7PIPURKRUXTKG4L4Q74YO5BU2C","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":"f84734761c667d3234dd35f7f6d8ed1017f569944f8f897d9721f90bcd1a623d","cross_cats_sorted":["math.AG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-27T05:46:33Z","title_canon_sha256":"90703d84f858f73b44977775fab27265b73c5a84ac2e96653159e5295d3f9a3c"},"schema_version":"1.0","source":{"id":"1609.08265","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.08265","created_at":"2026-05-18T00:25:02Z"},{"alias_kind":"arxiv_version","alias_value":"1609.08265v2","created_at":"2026-05-18T00:25:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08265","created_at":"2026-05-18T00:25:02Z"},{"alias_kind":"pith_short_12","alias_value":"7PIPURKRUXTK","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7PIPURKRUXTKG4L4","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7PIPURKR","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:b6063403c8154ba1b57278989c99b70b8b6392aed0bb142c8b13f74e291cff5c","target":"graph","created_at":"2026-05-18T00:25:02Z","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":"We consider linear codes associated to Schubert varieties in Grassmannians. A formula for the minimum distance of these codes was conjectured in 2000 and after having been established in various special cases, it was proved in 2008 by Xiang. We give an alternative proof of this formula. Further, we propose a characterization of the minimum weight codewords of Schubert codes by introducing the notion of Schubert decomposable elements of certain exterior powers. It is shown that codewords corresponding to Schubert decomposable elements are of minimum weight and also that the converse is true in ","authors_text":"Prasant Singh, Sudhir R. Ghorpade","cross_cats":["math.AG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-27T05:46:33Z","title":"Minimum Distance and the Minimum Weight Codewords of Schubert Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.08265","kind":"arxiv","version":2},"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:30417997d2ab943128676248b7036d9c75704e101e7c25414497e4e05f9df923","target":"record","created_at":"2026-05-18T00:25:02Z","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":"f84734761c667d3234dd35f7f6d8ed1017f569944f8f897d9721f90bcd1a623d","cross_cats_sorted":["math.AG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-27T05:46:33Z","title_canon_sha256":"90703d84f858f73b44977775fab27265b73c5a84ac2e96653159e5295d3f9a3c"},"schema_version":"1.0","source":{"id":"1609.08265","kind":"arxiv","version":2}},"canonical_sha256":"fbd0fa4551a5e6a3717c87f9877434d088720ebe62b971eb95a11ede3002f94b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fbd0fa4551a5e6a3717c87f9877434d088720ebe62b971eb95a11ede3002f94b","first_computed_at":"2026-05-18T00:25:02.190654Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:02.190654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zj1XEG7pprpKB6e/X0fXrEHkR+ygxMM5iJebmfLT8Az7cPsgOgOrIvR/a1VTkZc60X4lqJcDsRGZyGH+ihNECQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:02.191076Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.08265","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:30417997d2ab943128676248b7036d9c75704e101e7c25414497e4e05f9df923","sha256:b6063403c8154ba1b57278989c99b70b8b6392aed0bb142c8b13f74e291cff5c"],"state_sha256":"807835bf07b2d2640c039ba993f27eab0062423714809ab150e25ef67fdec1d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fs9GW5NCqbjlyN3mNZxyFB3b+LxuhCdZ6ybvZt3bHPfUfDLBtXpfkt9QPCaIQ7sgWzZuyCmjiqYDRtTZk/p8CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T23:18:36.297196Z","bundle_sha256":"34c7675e54df3f45ce247efeecd65487050a8544229f006224456db6473d417e"}}