{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:C3DQMKNPXQYVPLLLKMSARX6GZP","short_pith_number":"pith:C3DQMKNP","canonical_record":{"source":{"id":"1503.02196","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-07T18:01:08Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"95438a20b5fd66bcb83060ad5f7048f6ee04c6d81b32b5d057c216923242a0aa","abstract_canon_sha256":"8ee1028ef5b95307bed8b8325ac0b9544f2a16c21cda8724b5a7a0656c6fa0a8"},"schema_version":"1.0"},"canonical_sha256":"16c70629afbc3157ad6b532408dfc6cbe27c56970f79a58be9e8e98dc116990e","source":{"kind":"arxiv","id":"1503.02196","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02196","created_at":"2026-05-18T00:25:02Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02196v1","created_at":"2026-05-18T00:25:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02196","created_at":"2026-05-18T00:25:02Z"},{"alias_kind":"pith_short_12","alias_value":"C3DQMKNPXQYV","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"C3DQMKNPXQYVPLLL","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"C3DQMKNP","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:C3DQMKNPXQYVPLLLKMSARX6GZP","target":"record","payload":{"canonical_record":{"source":{"id":"1503.02196","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-07T18:01:08Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"95438a20b5fd66bcb83060ad5f7048f6ee04c6d81b32b5d057c216923242a0aa","abstract_canon_sha256":"8ee1028ef5b95307bed8b8325ac0b9544f2a16c21cda8724b5a7a0656c6fa0a8"},"schema_version":"1.0"},"canonical_sha256":"16c70629afbc3157ad6b532408dfc6cbe27c56970f79a58be9e8e98dc116990e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:02.468787Z","signature_b64":"mmq1rVMZXZyfooosSBnuJWHYXfa1vftSdceoEu9BSGZg7igarCn8yZnW+BZqGxPE/TLe9RnGj1JK2iq6owVLCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16c70629afbc3157ad6b532408dfc6cbe27c56970f79a58be9e8e98dc116990e","last_reissued_at":"2026-05-18T00:25:02.468310Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:02.468310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.02196","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-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":"RGzU/oi4EZ11xq7h0wG8FK5Rlb9T3/rUsebYxeAxtZhDl9EEKra+yFrH2oC5cEdYuiKTsarSZQ0sxdzCF/ZQDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T18:48:27.505671Z"},"content_sha256":"584d22fa20e010c1cb0642fea5251540b7c0272386a7500e774a15a190764c59","schema_version":"1.0","event_id":"sha256:584d22fa20e010c1cb0642fea5251540b7c0272386a7500e774a15a190764c59"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:C3DQMKNPXQYVPLLLKMSARX6GZP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Higher Weights of Affine Grassmann Codes and Their Duals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Mrinmoy Datta, Sudhir R. Ghorpade","submitted_at":"2015-03-07T18:01:08Z","abstract_excerpt":"We consider the question of determining the higher weights or the generalized Hamming weights of affine Grassmann codes and their duals. Several initial as well as terminal higher weights of affine Grassmann codes of an arbitrary level are determined explicitly. In the case of duals of these codes, we give a formula for many initial as well as terminal higher weights. As a special case, we obtain an alternative simpler proof of the formula of Beelen et al for the minimum distance of the dual of an affine Grasmann code."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02196","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-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":"uwER/6C2dPeUUm3FQcQY61UA4D3aSyQ+Q2pxg2A9a3W6ROMKSx1306DfJVtg532EmYfA2KMNac5mJv4qscacAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T18:48:27.506044Z"},"content_sha256":"0b6701bd282492991cee653628e50a68652356f4b0f11023c6bab8188dd430ab","schema_version":"1.0","event_id":"sha256:0b6701bd282492991cee653628e50a68652356f4b0f11023c6bab8188dd430ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C3DQMKNPXQYVPLLLKMSARX6GZP/bundle.json","state_url":"https://pith.science/pith/C3DQMKNPXQYVPLLLKMSARX6GZP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C3DQMKNPXQYVPLLLKMSARX6GZP/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-25T18:48:27Z","links":{"resolver":"https://pith.science/pith/C3DQMKNPXQYVPLLLKMSARX6GZP","bundle":"https://pith.science/pith/C3DQMKNPXQYVPLLLKMSARX6GZP/bundle.json","state":"https://pith.science/pith/C3DQMKNPXQYVPLLLKMSARX6GZP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C3DQMKNPXQYVPLLLKMSARX6GZP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:C3DQMKNPXQYVPLLLKMSARX6GZP","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":"8ee1028ef5b95307bed8b8325ac0b9544f2a16c21cda8724b5a7a0656c6fa0a8","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-07T18:01:08Z","title_canon_sha256":"95438a20b5fd66bcb83060ad5f7048f6ee04c6d81b32b5d057c216923242a0aa"},"schema_version":"1.0","source":{"id":"1503.02196","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02196","created_at":"2026-05-18T00:25:02Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02196v1","created_at":"2026-05-18T00:25:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02196","created_at":"2026-05-18T00:25:02Z"},{"alias_kind":"pith_short_12","alias_value":"C3DQMKNPXQYV","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"C3DQMKNPXQYVPLLL","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"C3DQMKNP","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:0b6701bd282492991cee653628e50a68652356f4b0f11023c6bab8188dd430ab","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 the question of determining the higher weights or the generalized Hamming weights of affine Grassmann codes and their duals. Several initial as well as terminal higher weights of affine Grassmann codes of an arbitrary level are determined explicitly. In the case of duals of these codes, we give a formula for many initial as well as terminal higher weights. As a special case, we obtain an alternative simpler proof of the formula of Beelen et al for the minimum distance of the dual of an affine Grasmann code.","authors_text":"Mrinmoy Datta, Sudhir R. Ghorpade","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-07T18:01:08Z","title":"Higher Weights of Affine Grassmann Codes and Their Duals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02196","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:584d22fa20e010c1cb0642fea5251540b7c0272386a7500e774a15a190764c59","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":"8ee1028ef5b95307bed8b8325ac0b9544f2a16c21cda8724b5a7a0656c6fa0a8","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-07T18:01:08Z","title_canon_sha256":"95438a20b5fd66bcb83060ad5f7048f6ee04c6d81b32b5d057c216923242a0aa"},"schema_version":"1.0","source":{"id":"1503.02196","kind":"arxiv","version":1}},"canonical_sha256":"16c70629afbc3157ad6b532408dfc6cbe27c56970f79a58be9e8e98dc116990e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"16c70629afbc3157ad6b532408dfc6cbe27c56970f79a58be9e8e98dc116990e","first_computed_at":"2026-05-18T00:25:02.468310Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:02.468310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mmq1rVMZXZyfooosSBnuJWHYXfa1vftSdceoEu9BSGZg7igarCn8yZnW+BZqGxPE/TLe9RnGj1JK2iq6owVLCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:02.468787Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.02196","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:584d22fa20e010c1cb0642fea5251540b7c0272386a7500e774a15a190764c59","sha256:0b6701bd282492991cee653628e50a68652356f4b0f11023c6bab8188dd430ab"],"state_sha256":"fa061fc8652196d2df97924f8e082e31305ac5bb21337cbdb345705a83983c2c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IpjCLJDxbUIsNxSWD9hSmVBkmsS0wNtIi9x1/DLoUwfT6q15w0+Gdb3j6YjBWDD29jWkRT/JnbRf/3psAtMvDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T18:48:27.508077Z","bundle_sha256":"e992525c0d251d4dd470b91ad8c5c239748b146ee42dcc61ecf41604ee51a2ca"}}