{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:M7YTFUBYFDUV5BYOUGKA44XS4Q","short_pith_number":"pith:M7YTFUBY","schema_version":"1.0","canonical_sha256":"67f132d03828e95e870ea1940e72f2e4176d5a53a6c58355915f11e2076e015d","source":{"kind":"arxiv","id":"1302.5021","version":1},"attestation_state":"computed","paper":{"title":"Linear Coding Schemes for the Distributed Computation of Subspaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"K. Vinodh, N. Prakash, P. Vijay Kumar, S. Sandeep Pradhan, V. Lalitha","submitted_at":"2013-02-20T16:28:19Z","abstract_excerpt":"Let $X_1, ..., X_m$ be a set of $m$ statistically dependent sources over the common alphabet $\\mathbb{F}_q$, that are linearly independent when considered as functions over the sample space. We consider a distributed function computation setting in which the receiver is interested in the lossless computation of the elements of an $s$-dimensional subspace $W$ spanned by the elements of the row vector $[X_1, \\ldots, X_m]\\Gamma$ in which the $(m \\times s)$ matrix $\\Gamma$ has rank $s$. A sequence of three increasingly refined approaches is presented, all based on linear encoders.\n  The first appr"},"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":"1302.5021","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-20T16:28:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c76be93121c9dd8635669ce7c2ae0f5b6ecd3b72135aefd42133596476e56701","abstract_canon_sha256":"830b17c038fcbb6d76ad5eeb2cd5dd079d5d5632eb279fbe8f61711ca4506159"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:17.616022Z","signature_b64":"JNSB6pWp8nmb6cCibw5PNyEmXgVsWrMrgFtRBIb6FQ7K6oEvbF4o5z/vBAZz0rN6MCKHuyJHsyUULayRQIJbAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67f132d03828e95e870ea1940e72f2e4176d5a53a6c58355915f11e2076e015d","last_reissued_at":"2026-05-18T00:58:17.615237Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:17.615237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Coding Schemes for the Distributed Computation of Subspaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"K. Vinodh, N. Prakash, P. Vijay Kumar, S. Sandeep Pradhan, V. Lalitha","submitted_at":"2013-02-20T16:28:19Z","abstract_excerpt":"Let $X_1, ..., X_m$ be a set of $m$ statistically dependent sources over the common alphabet $\\mathbb{F}_q$, that are linearly independent when considered as functions over the sample space. We consider a distributed function computation setting in which the receiver is interested in the lossless computation of the elements of an $s$-dimensional subspace $W$ spanned by the elements of the row vector $[X_1, \\ldots, X_m]\\Gamma$ in which the $(m \\times s)$ matrix $\\Gamma$ has rank $s$. A sequence of three increasingly refined approaches is presented, all based on linear encoders.\n  The first appr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.5021","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1302.5021","created_at":"2026-05-18T00:58:17.615368+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.5021v1","created_at":"2026-05-18T00:58:17.615368+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.5021","created_at":"2026-05-18T00:58:17.615368+00:00"},{"alias_kind":"pith_short_12","alias_value":"M7YTFUBYFDUV","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"M7YTFUBYFDUV5BYO","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"M7YTFUBY","created_at":"2026-05-18T12:27:51.066281+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/M7YTFUBYFDUV5BYOUGKA44XS4Q","json":"https://pith.science/pith/M7YTFUBYFDUV5BYOUGKA44XS4Q.json","graph_json":"https://pith.science/api/pith-number/M7YTFUBYFDUV5BYOUGKA44XS4Q/graph.json","events_json":"https://pith.science/api/pith-number/M7YTFUBYFDUV5BYOUGKA44XS4Q/events.json","paper":"https://pith.science/paper/M7YTFUBY"},"agent_actions":{"view_html":"https://pith.science/pith/M7YTFUBYFDUV5BYOUGKA44XS4Q","download_json":"https://pith.science/pith/M7YTFUBYFDUV5BYOUGKA44XS4Q.json","view_paper":"https://pith.science/paper/M7YTFUBY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.5021&json=true","fetch_graph":"https://pith.science/api/pith-number/M7YTFUBYFDUV5BYOUGKA44XS4Q/graph.json","fetch_events":"https://pith.science/api/pith-number/M7YTFUBYFDUV5BYOUGKA44XS4Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M7YTFUBYFDUV5BYOUGKA44XS4Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M7YTFUBYFDUV5BYOUGKA44XS4Q/action/storage_attestation","attest_author":"https://pith.science/pith/M7YTFUBYFDUV5BYOUGKA44XS4Q/action/author_attestation","sign_citation":"https://pith.science/pith/M7YTFUBYFDUV5BYOUGKA44XS4Q/action/citation_signature","submit_replication":"https://pith.science/pith/M7YTFUBYFDUV5BYOUGKA44XS4Q/action/replication_record"}},"created_at":"2026-05-18T00:58:17.615368+00:00","updated_at":"2026-05-18T00:58:17.615368+00:00"}