{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:DJVX5OLNASTNGLLAS6RX6T2RQI","short_pith_number":"pith:DJVX5OLN","canonical_record":{"source":{"id":"0911.3256","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-11-17T10:28:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"abcf163b69ca1991fbc30de9476dd70233016a67b785ceb5ff698b2acf642758","abstract_canon_sha256":"1ba8f4a254997fe8bed5ad5273a5d9f238bd2996c1ac76e3fe8ac0e4e3574198"},"schema_version":"1.0"},"canonical_sha256":"1a6b7eb96d04a6d32d6097a37f4f518204ef224052c969e613389f06738ce99e","source":{"kind":"arxiv","id":"0911.3256","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.3256","created_at":"2026-05-18T04:41:44Z"},{"alias_kind":"arxiv_version","alias_value":"0911.3256v2","created_at":"2026-05-18T04:41:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.3256","created_at":"2026-05-18T04:41:44Z"},{"alias_kind":"pith_short_12","alias_value":"DJVX5OLNASTN","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"DJVX5OLNASTNGLLA","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"DJVX5OLN","created_at":"2026-05-18T12:25:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:DJVX5OLNASTNGLLAS6RX6T2RQI","target":"record","payload":{"canonical_record":{"source":{"id":"0911.3256","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-11-17T10:28:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"abcf163b69ca1991fbc30de9476dd70233016a67b785ceb5ff698b2acf642758","abstract_canon_sha256":"1ba8f4a254997fe8bed5ad5273a5d9f238bd2996c1ac76e3fe8ac0e4e3574198"},"schema_version":"1.0"},"canonical_sha256":"1a6b7eb96d04a6d32d6097a37f4f518204ef224052c969e613389f06738ce99e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:44.035484Z","signature_b64":"hJt4A4S/ZYjuWpQDHmV9O5NmWeP2ZjXRLIf/bOn1ppstfAOLUg9pIPPJjUYOOm2Gb579Okd9G8gO4aZxHKpKCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a6b7eb96d04a6d32d6097a37f4f518204ef224052c969e613389f06738ce99e","last_reissued_at":"2026-05-18T04:41:44.035058Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:44.035058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0911.3256","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-18T04:41:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9t717j0dHiAHiEcbNXnjuJPfO2lprYIkLoP5IX33Xc1ebJhyDKbVZ1UtU5loQIc0m0yJbHdxuPuU1dZ7lSBUAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T01:13:39.526141Z"},"content_sha256":"7e9b2b25f0ac111d52563e3fd7f0774b269f9818379b93858cf60d617273dc9a","schema_version":"1.0","event_id":"sha256:7e9b2b25f0ac111d52563e3fd7f0774b269f9818379b93858cf60d617273dc9a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:DJVX5OLNASTNGLLAS6RX6T2RQI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Enumerative Coding for Grassmannian Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Natalia Silberstein, Tuvi Etzion","submitted_at":"2009-11-17T10:28:21Z","abstract_excerpt":"The Grassmannian space $\\Gr$ is the set of all $k-$dimensional subspaces of the vector space~\\smash{$\\F_q^n$}. Recently, codes in the Grassmannian have found an application in network coding. The main goal of this paper is to present efficient enumerative encoding and decoding techniques for the Grassmannian. These coding techniques are based on two different orders for the Grassmannian induced by different representations of $k$-dimensional subspaces of $\\F_q^n$. One enumerative coding method is based on a Ferrers diagram representation and on an order for $\\Gr$ based on this representation. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.3256","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-18T04:41:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AzvwMCf5JTMb4B9dARQCm9L/DqBvEMqAPH6CWKLrx8mqH2EQiVcYl8Qb4C59oZUhsMk1Bx/AasBkpXY6voNdBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T01:13:39.526500Z"},"content_sha256":"a6c52fd573003f4595e065e7a4106f7f3dd91f5ddda99e29e6590cda3ce5d98e","schema_version":"1.0","event_id":"sha256:a6c52fd573003f4595e065e7a4106f7f3dd91f5ddda99e29e6590cda3ce5d98e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DJVX5OLNASTNGLLAS6RX6T2RQI/bundle.json","state_url":"https://pith.science/pith/DJVX5OLNASTNGLLAS6RX6T2RQI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DJVX5OLNASTNGLLAS6RX6T2RQI/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-05-30T01:13:39Z","links":{"resolver":"https://pith.science/pith/DJVX5OLNASTNGLLAS6RX6T2RQI","bundle":"https://pith.science/pith/DJVX5OLNASTNGLLAS6RX6T2RQI/bundle.json","state":"https://pith.science/pith/DJVX5OLNASTNGLLAS6RX6T2RQI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DJVX5OLNASTNGLLAS6RX6T2RQI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:DJVX5OLNASTNGLLAS6RX6T2RQI","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":"1ba8f4a254997fe8bed5ad5273a5d9f238bd2996c1ac76e3fe8ac0e4e3574198","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-11-17T10:28:21Z","title_canon_sha256":"abcf163b69ca1991fbc30de9476dd70233016a67b785ceb5ff698b2acf642758"},"schema_version":"1.0","source":{"id":"0911.3256","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.3256","created_at":"2026-05-18T04:41:44Z"},{"alias_kind":"arxiv_version","alias_value":"0911.3256v2","created_at":"2026-05-18T04:41:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.3256","created_at":"2026-05-18T04:41:44Z"},{"alias_kind":"pith_short_12","alias_value":"DJVX5OLNASTN","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"DJVX5OLNASTNGLLA","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"DJVX5OLN","created_at":"2026-05-18T12:25:59Z"}],"graph_snapshots":[{"event_id":"sha256:a6c52fd573003f4595e065e7a4106f7f3dd91f5ddda99e29e6590cda3ce5d98e","target":"graph","created_at":"2026-05-18T04:41:44Z","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":"The Grassmannian space $\\Gr$ is the set of all $k-$dimensional subspaces of the vector space~\\smash{$\\F_q^n$}. Recently, codes in the Grassmannian have found an application in network coding. The main goal of this paper is to present efficient enumerative encoding and decoding techniques for the Grassmannian. These coding techniques are based on two different orders for the Grassmannian induced by different representations of $k$-dimensional subspaces of $\\F_q^n$. One enumerative coding method is based on a Ferrers diagram representation and on an order for $\\Gr$ based on this representation. ","authors_text":"Natalia Silberstein, Tuvi Etzion","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-11-17T10:28:21Z","title":"Enumerative Coding for Grassmannian Space"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.3256","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:7e9b2b25f0ac111d52563e3fd7f0774b269f9818379b93858cf60d617273dc9a","target":"record","created_at":"2026-05-18T04:41:44Z","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":"1ba8f4a254997fe8bed5ad5273a5d9f238bd2996c1ac76e3fe8ac0e4e3574198","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-11-17T10:28:21Z","title_canon_sha256":"abcf163b69ca1991fbc30de9476dd70233016a67b785ceb5ff698b2acf642758"},"schema_version":"1.0","source":{"id":"0911.3256","kind":"arxiv","version":2}},"canonical_sha256":"1a6b7eb96d04a6d32d6097a37f4f518204ef224052c969e613389f06738ce99e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1a6b7eb96d04a6d32d6097a37f4f518204ef224052c969e613389f06738ce99e","first_computed_at":"2026-05-18T04:41:44.035058Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:41:44.035058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hJt4A4S/ZYjuWpQDHmV9O5NmWeP2ZjXRLIf/bOn1ppstfAOLUg9pIPPJjUYOOm2Gb579Okd9G8gO4aZxHKpKCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:41:44.035484Z","signed_message":"canonical_sha256_bytes"},"source_id":"0911.3256","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e9b2b25f0ac111d52563e3fd7f0774b269f9818379b93858cf60d617273dc9a","sha256:a6c52fd573003f4595e065e7a4106f7f3dd91f5ddda99e29e6590cda3ce5d98e"],"state_sha256":"1cf315b41774e5d9d7c7ed24db3b0808f4483824cbd776f5d8439a123980eb65"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"etdcLqF7uSVBNeVZIpDLr8xcu3IYlaySkG6WZyRF9bYw1CJNa0iPFbx9x163CE9Z0uLod2jtnMqnazlNZeKNBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T01:13:39.528659Z","bundle_sha256":"dd1907525a0602b32bf315db0d947b87e4e460325ee0ebae050fc8fb0dcd3e93"}}