{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:E6LFFS7KCPTSOROR6KMF5QOQMO","short_pith_number":"pith:E6LFFS7K","canonical_record":{"source":{"id":"1707.02163","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-07T13:25:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7ac7bd3d32322ae2eb13c57f5dbacc7dc38ec3dc79b5944c5ad5f9eaa8413e6c","abstract_canon_sha256":"9ea9ea7bab568ce15700b8c97f60ca54ce6c3eac3439e24afe8fc7ad21ec7ec8"},"schema_version":"1.0"},"canonical_sha256":"279652cbea13e72745d1f2985ec1d063811c344aeef211af6a6c2d8fb43e1680","source":{"kind":"arxiv","id":"1707.02163","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.02163","created_at":"2026-05-17T23:57:07Z"},{"alias_kind":"arxiv_version","alias_value":"1707.02163v2","created_at":"2026-05-17T23:57:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02163","created_at":"2026-05-17T23:57:07Z"},{"alias_kind":"pith_short_12","alias_value":"E6LFFS7KCPTS","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"E6LFFS7KCPTSOROR","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"E6LFFS7K","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:E6LFFS7KCPTSOROR6KMF5QOQMO","target":"record","payload":{"canonical_record":{"source":{"id":"1707.02163","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-07T13:25:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7ac7bd3d32322ae2eb13c57f5dbacc7dc38ec3dc79b5944c5ad5f9eaa8413e6c","abstract_canon_sha256":"9ea9ea7bab568ce15700b8c97f60ca54ce6c3eac3439e24afe8fc7ad21ec7ec8"},"schema_version":"1.0"},"canonical_sha256":"279652cbea13e72745d1f2985ec1d063811c344aeef211af6a6c2d8fb43e1680","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:07.832651Z","signature_b64":"WQ6istuAc/fsEiKufvXNFbNxrKg2HPw4qOhV2+52UR/rpogctN+G5Z2lyAXaXQMqa+xLQykIga/B7HvWAJ6YDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"279652cbea13e72745d1f2985ec1d063811c344aeef211af6a6c2d8fb43e1680","last_reissued_at":"2026-05-17T23:57:07.832171Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:07.832171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.02163","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-17T23:57:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JaKwQdmMfNB4lCkeeJ96d0e79+j30LYlWH57Hj1IrNNMKH3B+XkCiJIjl7mam3eb31PkpzHNGDeSwKPm1uTtAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T16:30:56.130476Z"},"content_sha256":"93cf1fed1ad6ad87d06b07ae26c76842ef34c657ed179d20d58664a99f88676f","schema_version":"1.0","event_id":"sha256:93cf1fed1ad6ad87d06b07ae26c76842ef34c657ed179d20d58664a99f88676f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:E6LFFS7KCPTSOROR6KMF5QOQMO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Circular-shift Linear Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hanqi Tang, Keping Long, Qifu Tyler Sun, Xiaolong Yang, Zongpeng Li","submitted_at":"2017-07-07T13:25:48Z","abstract_excerpt":"We study a class of linear network coding (LNC) schemes, called circular-shift LNC, whose encoding operations consist of only circular-shifts and bit-wise additions (XOR). Formulated as a special vector linear code over GF($2$), an $L$-dimensional circular-shift linear code of degree $\\delta$ restricts its local encoding kernels to be the summation of at most $\\delta$ cyclic permutation matrices of size $L$. We show that on a general network, for a certain block length $L$, every scalar linear solution over GF($2^{L-1}$) can induce an $L$-dimensional circular-shift linear solution with 1-bit r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02163","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-17T23:57:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lL+ArgiYjaTp4urSIxel+1D9BYcXKrDd78QjMvjdcPOYsryIj00TtHPXAVZL7GTVJekhLoUJ+sZo5R94ouZeDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T16:30:56.131104Z"},"content_sha256":"edaeb4331d4061dbbc516dfba88202d044a270f68740c928cc8ff3767772c4b2","schema_version":"1.0","event_id":"sha256:edaeb4331d4061dbbc516dfba88202d044a270f68740c928cc8ff3767772c4b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E6LFFS7KCPTSOROR6KMF5QOQMO/bundle.json","state_url":"https://pith.science/pith/E6LFFS7KCPTSOROR6KMF5QOQMO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E6LFFS7KCPTSOROR6KMF5QOQMO/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-22T16:30:56Z","links":{"resolver":"https://pith.science/pith/E6LFFS7KCPTSOROR6KMF5QOQMO","bundle":"https://pith.science/pith/E6LFFS7KCPTSOROR6KMF5QOQMO/bundle.json","state":"https://pith.science/pith/E6LFFS7KCPTSOROR6KMF5QOQMO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E6LFFS7KCPTSOROR6KMF5QOQMO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:E6LFFS7KCPTSOROR6KMF5QOQMO","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":"9ea9ea7bab568ce15700b8c97f60ca54ce6c3eac3439e24afe8fc7ad21ec7ec8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-07T13:25:48Z","title_canon_sha256":"7ac7bd3d32322ae2eb13c57f5dbacc7dc38ec3dc79b5944c5ad5f9eaa8413e6c"},"schema_version":"1.0","source":{"id":"1707.02163","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.02163","created_at":"2026-05-17T23:57:07Z"},{"alias_kind":"arxiv_version","alias_value":"1707.02163v2","created_at":"2026-05-17T23:57:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02163","created_at":"2026-05-17T23:57:07Z"},{"alias_kind":"pith_short_12","alias_value":"E6LFFS7KCPTS","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"E6LFFS7KCPTSOROR","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"E6LFFS7K","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:edaeb4331d4061dbbc516dfba88202d044a270f68740c928cc8ff3767772c4b2","target":"graph","created_at":"2026-05-17T23:57:07Z","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 study a class of linear network coding (LNC) schemes, called circular-shift LNC, whose encoding operations consist of only circular-shifts and bit-wise additions (XOR). Formulated as a special vector linear code over GF($2$), an $L$-dimensional circular-shift linear code of degree $\\delta$ restricts its local encoding kernels to be the summation of at most $\\delta$ cyclic permutation matrices of size $L$. We show that on a general network, for a certain block length $L$, every scalar linear solution over GF($2^{L-1}$) can induce an $L$-dimensional circular-shift linear solution with 1-bit r","authors_text":"Hanqi Tang, Keping Long, Qifu Tyler Sun, Xiaolong Yang, Zongpeng Li","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-07T13:25:48Z","title":"Circular-shift Linear Network Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02163","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:93cf1fed1ad6ad87d06b07ae26c76842ef34c657ed179d20d58664a99f88676f","target":"record","created_at":"2026-05-17T23:57:07Z","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":"9ea9ea7bab568ce15700b8c97f60ca54ce6c3eac3439e24afe8fc7ad21ec7ec8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-07T13:25:48Z","title_canon_sha256":"7ac7bd3d32322ae2eb13c57f5dbacc7dc38ec3dc79b5944c5ad5f9eaa8413e6c"},"schema_version":"1.0","source":{"id":"1707.02163","kind":"arxiv","version":2}},"canonical_sha256":"279652cbea13e72745d1f2985ec1d063811c344aeef211af6a6c2d8fb43e1680","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"279652cbea13e72745d1f2985ec1d063811c344aeef211af6a6c2d8fb43e1680","first_computed_at":"2026-05-17T23:57:07.832171Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:07.832171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WQ6istuAc/fsEiKufvXNFbNxrKg2HPw4qOhV2+52UR/rpogctN+G5Z2lyAXaXQMqa+xLQykIga/B7HvWAJ6YDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:07.832651Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.02163","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:93cf1fed1ad6ad87d06b07ae26c76842ef34c657ed179d20d58664a99f88676f","sha256:edaeb4331d4061dbbc516dfba88202d044a270f68740c928cc8ff3767772c4b2"],"state_sha256":"b30f805ddcd38dafa01b01c166ce7b75773bc71313e2f330ddbafdb985f0078f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d/KBpmaF3pQDSRRHzSN1TntDj0wCx4+fV6ysKwmIIIf+H3buol63n7Fco3/Ag23o2YPijZ0HI0FWRNXGClwzCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T16:30:56.134071Z","bundle_sha256":"84f52e4769e0255139f1c9ee5cb4335f04188003e48d9c92ff05d54bc627a20a"}}