{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OCYR2LO4NNJYKE4TR6DEZW4442","short_pith_number":"pith:OCYR2LO4","canonical_record":{"source":{"id":"1801.02329","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-08T07:50:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fb6607bc8bfbec74924d70ab84e3e9dd5dbaa6bda83368246dba97ba87b29cf9","abstract_canon_sha256":"8da20c377419244b9a673fbb8012cf098006c998c6bd83c4d0fb331d9bf00495"},"schema_version":"1.0"},"canonical_sha256":"70b11d2ddc6b538513938f864cdb9ce6aef3652000808fc4225c6e871751c287","source":{"kind":"arxiv","id":"1801.02329","version":7},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02329","created_at":"2026-05-17T23:54:28Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02329v7","created_at":"2026-05-17T23:54:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02329","created_at":"2026-05-17T23:54:28Z"},{"alias_kind":"pith_short_12","alias_value":"OCYR2LO4NNJY","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OCYR2LO4NNJYKE4T","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OCYR2LO4","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OCYR2LO4NNJYKE4TR6DEZW4442","target":"record","payload":{"canonical_record":{"source":{"id":"1801.02329","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-08T07:50:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fb6607bc8bfbec74924d70ab84e3e9dd5dbaa6bda83368246dba97ba87b29cf9","abstract_canon_sha256":"8da20c377419244b9a673fbb8012cf098006c998c6bd83c4d0fb331d9bf00495"},"schema_version":"1.0"},"canonical_sha256":"70b11d2ddc6b538513938f864cdb9ce6aef3652000808fc4225c6e871751c287","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:28.347735Z","signature_b64":"FqhgyVQZS1fA9DZX+4p9d/KWY7uzjHGWzbYMdz26q01/RiHQetG8WNcJniSiuABa2Xi5Qwq5Qe4wL+jsUwZkAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70b11d2ddc6b538513938f864cdb9ce6aef3652000808fc4225c6e871751c287","last_reissued_at":"2026-05-17T23:54:28.346513Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:28.346513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.02329","source_version":7,"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:54:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f/yZKpKcBMZiVIYi5pTZOKNaVrUSRHRFzu7/B2KpbqBL4FA49I+bMrVglr4i8oIo0SwFUL7FnZKod+H6EFfjCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T21:13:12.493614Z"},"content_sha256":"497f4fe0c5502c537fd8e95c7feb62f974ea3cdc0d2898bdfa9cdb1a3845b148","schema_version":"1.0","event_id":"sha256:497f4fe0c5502c537fd8e95c7feb62f974ea3cdc0d2898bdfa9cdb1a3845b148"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OCYR2LO4NNJYKE4TR6DEZW4442","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Grassmannian Codes with New Distance Measures for Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hui Zhang, Tuvi Etzion","submitted_at":"2018-01-08T07:50:13Z","abstract_excerpt":"Grassmannian codes are known to be useful in error-correction for random network coding. Recently, they were used to prove that vector network codes outperform scalar linear network codes, on multicast networks, with respect to the alphabet size. The multicast networks which were used for this purpose are generalized combination networks. In both the scalar and the vector network coding solutions, the subspace distance is used as the distance measure for the codes which solve the network coding problem in the generalized combination networks. In this work we show that the subspace distance can"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02329","kind":"arxiv","version":7},"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:54:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HR3DQVeyQTAbIa+T55hPq4Gx/Ragtqn+SleLQs7njCsNoieoHn+8j/mZkSS6g4KPECeOVTkJN5h1otVAqV98Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T21:13:12.494327Z"},"content_sha256":"602c7bc633e890440c7351632664172db194d4d38618b13e0c01bb0968e62f09","schema_version":"1.0","event_id":"sha256:602c7bc633e890440c7351632664172db194d4d38618b13e0c01bb0968e62f09"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OCYR2LO4NNJYKE4TR6DEZW4442/bundle.json","state_url":"https://pith.science/pith/OCYR2LO4NNJYKE4TR6DEZW4442/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OCYR2LO4NNJYKE4TR6DEZW4442/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-29T21:13:12Z","links":{"resolver":"https://pith.science/pith/OCYR2LO4NNJYKE4TR6DEZW4442","bundle":"https://pith.science/pith/OCYR2LO4NNJYKE4TR6DEZW4442/bundle.json","state":"https://pith.science/pith/OCYR2LO4NNJYKE4TR6DEZW4442/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OCYR2LO4NNJYKE4TR6DEZW4442/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OCYR2LO4NNJYKE4TR6DEZW4442","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":"8da20c377419244b9a673fbb8012cf098006c998c6bd83c4d0fb331d9bf00495","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-08T07:50:13Z","title_canon_sha256":"fb6607bc8bfbec74924d70ab84e3e9dd5dbaa6bda83368246dba97ba87b29cf9"},"schema_version":"1.0","source":{"id":"1801.02329","kind":"arxiv","version":7}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02329","created_at":"2026-05-17T23:54:28Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02329v7","created_at":"2026-05-17T23:54:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02329","created_at":"2026-05-17T23:54:28Z"},{"alias_kind":"pith_short_12","alias_value":"OCYR2LO4NNJY","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OCYR2LO4NNJYKE4T","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OCYR2LO4","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:602c7bc633e890440c7351632664172db194d4d38618b13e0c01bb0968e62f09","target":"graph","created_at":"2026-05-17T23:54:28Z","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":"Grassmannian codes are known to be useful in error-correction for random network coding. Recently, they were used to prove that vector network codes outperform scalar linear network codes, on multicast networks, with respect to the alphabet size. The multicast networks which were used for this purpose are generalized combination networks. In both the scalar and the vector network coding solutions, the subspace distance is used as the distance measure for the codes which solve the network coding problem in the generalized combination networks. In this work we show that the subspace distance can","authors_text":"Hui Zhang, Tuvi Etzion","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-08T07:50:13Z","title":"Grassmannian Codes with New Distance Measures for Network Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02329","kind":"arxiv","version":7},"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:497f4fe0c5502c537fd8e95c7feb62f974ea3cdc0d2898bdfa9cdb1a3845b148","target":"record","created_at":"2026-05-17T23:54:28Z","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":"8da20c377419244b9a673fbb8012cf098006c998c6bd83c4d0fb331d9bf00495","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-08T07:50:13Z","title_canon_sha256":"fb6607bc8bfbec74924d70ab84e3e9dd5dbaa6bda83368246dba97ba87b29cf9"},"schema_version":"1.0","source":{"id":"1801.02329","kind":"arxiv","version":7}},"canonical_sha256":"70b11d2ddc6b538513938f864cdb9ce6aef3652000808fc4225c6e871751c287","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"70b11d2ddc6b538513938f864cdb9ce6aef3652000808fc4225c6e871751c287","first_computed_at":"2026-05-17T23:54:28.346513Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:28.346513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FqhgyVQZS1fA9DZX+4p9d/KWY7uzjHGWzbYMdz26q01/RiHQetG8WNcJniSiuABa2Xi5Qwq5Qe4wL+jsUwZkAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:28.347735Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.02329","source_kind":"arxiv","source_version":7}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:497f4fe0c5502c537fd8e95c7feb62f974ea3cdc0d2898bdfa9cdb1a3845b148","sha256:602c7bc633e890440c7351632664172db194d4d38618b13e0c01bb0968e62f09"],"state_sha256":"f216dcaf516252d123f19e3283670bb4df665376aedd97bbf207eccf6df6521d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xMfSYLdH75hbALxbABKNT6nAwZhlIrQ+jbgny75CFXiIEJ21CUCxt1EkXOq8YOkcpD7Cm7EKi1ioO9pkymL6Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T21:13:12.497883Z","bundle_sha256":"aa1b42124ff7dbcba7b24deb494af72f0e204b4eb7c64e1cece1a8d3359d819f"}}