{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:PTTLCGP6Z322EFCSDQFP7RPIKD","short_pith_number":"pith:PTTLCGP6","schema_version":"1.0","canonical_sha256":"7ce6b119fecef5a214521c0affc5e850ca39b704abce34a657b305de0b7ffb9b","source":{"kind":"arxiv","id":"1105.0087","version":1},"attestation_state":"computed","paper":{"title":"Higher weights of Grassmann codes in terms of properties of Schubert unions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.CO","math.IT"],"primary_cat":"math.AG","authors_text":"Arunkumar R. Patil, Harish K. Pillai, Sudhir R. Ghorpade, Trygve Johnsen","submitted_at":"2011-04-30T13:41:58Z","abstract_excerpt":"We describe the higher weights of the Grassmann codes $G(2,m)$ over finite fields ${\\mathbb F}_q$ in terms of properties of Schubert unions, and in each case we determine the weight as the minimum of two explicit polynomial expressions in $q$."},"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":"1105.0087","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2011-04-30T13:41:58Z","cross_cats_sorted":["cs.IT","math.CO","math.IT"],"title_canon_sha256":"824c4f86c31041bb49163491b4f6f424fa2b2041088f55b66645ebeeb565e429","abstract_canon_sha256":"655216824007dea39597b47d801d6a46e2e003d2c020dfd53c47d3ae43bab7c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:11.354124Z","signature_b64":"pZCGgb5Zp6+egBd6T4PpX3kIaG1bRBhaO/XfUWvElvKA1HRpAy5gxbYvLc+tvZSx3iSxD3oxESIogHrEOGEfCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ce6b119fecef5a214521c0affc5e850ca39b704abce34a657b305de0b7ffb9b","last_reissued_at":"2026-05-18T04:23:11.353739Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:11.353739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Higher weights of Grassmann codes in terms of properties of Schubert unions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.CO","math.IT"],"primary_cat":"math.AG","authors_text":"Arunkumar R. Patil, Harish K. Pillai, Sudhir R. Ghorpade, Trygve Johnsen","submitted_at":"2011-04-30T13:41:58Z","abstract_excerpt":"We describe the higher weights of the Grassmann codes $G(2,m)$ over finite fields ${\\mathbb F}_q$ in terms of properties of Schubert unions, and in each case we determine the weight as the minimum of two explicit polynomial expressions in $q$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0087","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":"1105.0087","created_at":"2026-05-18T04:23:11.353801+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.0087v1","created_at":"2026-05-18T04:23:11.353801+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0087","created_at":"2026-05-18T04:23:11.353801+00:00"},{"alias_kind":"pith_short_12","alias_value":"PTTLCGP6Z322","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"PTTLCGP6Z322EFCS","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"PTTLCGP6","created_at":"2026-05-18T12:26:39.201973+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/PTTLCGP6Z322EFCSDQFP7RPIKD","json":"https://pith.science/pith/PTTLCGP6Z322EFCSDQFP7RPIKD.json","graph_json":"https://pith.science/api/pith-number/PTTLCGP6Z322EFCSDQFP7RPIKD/graph.json","events_json":"https://pith.science/api/pith-number/PTTLCGP6Z322EFCSDQFP7RPIKD/events.json","paper":"https://pith.science/paper/PTTLCGP6"},"agent_actions":{"view_html":"https://pith.science/pith/PTTLCGP6Z322EFCSDQFP7RPIKD","download_json":"https://pith.science/pith/PTTLCGP6Z322EFCSDQFP7RPIKD.json","view_paper":"https://pith.science/paper/PTTLCGP6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.0087&json=true","fetch_graph":"https://pith.science/api/pith-number/PTTLCGP6Z322EFCSDQFP7RPIKD/graph.json","fetch_events":"https://pith.science/api/pith-number/PTTLCGP6Z322EFCSDQFP7RPIKD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PTTLCGP6Z322EFCSDQFP7RPIKD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PTTLCGP6Z322EFCSDQFP7RPIKD/action/storage_attestation","attest_author":"https://pith.science/pith/PTTLCGP6Z322EFCSDQFP7RPIKD/action/author_attestation","sign_citation":"https://pith.science/pith/PTTLCGP6Z322EFCSDQFP7RPIKD/action/citation_signature","submit_replication":"https://pith.science/pith/PTTLCGP6Z322EFCSDQFP7RPIKD/action/replication_record"}},"created_at":"2026-05-18T04:23:11.353801+00:00","updated_at":"2026-05-18T04:23:11.353801+00:00"}