{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:E6LFFS7KCPTSOROR6KMF5QOQMO","short_pith_number":"pith:E6LFFS7K","schema_version":"1.0","canonical_sha256":"279652cbea13e72745d1f2985ec1d063811c344aeef211af6a6c2d8fb43e1680","source":{"kind":"arxiv","id":"1707.02163","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1707.02163","created_at":"2026-05-17T23:57:07.832259+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.02163v2","created_at":"2026-05-17T23:57:07.832259+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02163","created_at":"2026-05-17T23:57:07.832259+00:00"},{"alias_kind":"pith_short_12","alias_value":"E6LFFS7KCPTS","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"E6LFFS7KCPTSOROR","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"E6LFFS7K","created_at":"2026-05-18T12:31:12.930513+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/E6LFFS7KCPTSOROR6KMF5QOQMO","json":"https://pith.science/pith/E6LFFS7KCPTSOROR6KMF5QOQMO.json","graph_json":"https://pith.science/api/pith-number/E6LFFS7KCPTSOROR6KMF5QOQMO/graph.json","events_json":"https://pith.science/api/pith-number/E6LFFS7KCPTSOROR6KMF5QOQMO/events.json","paper":"https://pith.science/paper/E6LFFS7K"},"agent_actions":{"view_html":"https://pith.science/pith/E6LFFS7KCPTSOROR6KMF5QOQMO","download_json":"https://pith.science/pith/E6LFFS7KCPTSOROR6KMF5QOQMO.json","view_paper":"https://pith.science/paper/E6LFFS7K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.02163&json=true","fetch_graph":"https://pith.science/api/pith-number/E6LFFS7KCPTSOROR6KMF5QOQMO/graph.json","fetch_events":"https://pith.science/api/pith-number/E6LFFS7KCPTSOROR6KMF5QOQMO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E6LFFS7KCPTSOROR6KMF5QOQMO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E6LFFS7KCPTSOROR6KMF5QOQMO/action/storage_attestation","attest_author":"https://pith.science/pith/E6LFFS7KCPTSOROR6KMF5QOQMO/action/author_attestation","sign_citation":"https://pith.science/pith/E6LFFS7KCPTSOROR6KMF5QOQMO/action/citation_signature","submit_replication":"https://pith.science/pith/E6LFFS7KCPTSOROR6KMF5QOQMO/action/replication_record"}},"created_at":"2026-05-17T23:57:07.832259+00:00","updated_at":"2026-05-17T23:57:07.832259+00:00"}