{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:M7YTFUBYFDUV5BYOUGKA44XS4Q","short_pith_number":"pith:M7YTFUBY","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"},"canonical_sha256":"67f132d03828e95e870ea1940e72f2e4176d5a53a6c58355915f11e2076e015d","source":{"kind":"arxiv","id":"1302.5021","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.5021","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"arxiv_version","alias_value":"1302.5021v1","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.5021","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"pith_short_12","alias_value":"M7YTFUBYFDUV","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"M7YTFUBYFDUV5BYO","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"M7YTFUBY","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:M7YTFUBYFDUV5BYOUGKA44XS4Q","target":"record","payload":{"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"},"canonical_sha256":"67f132d03828e95e870ea1940e72f2e4176d5a53a6c58355915f11e2076e015d","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"},"source_kind":"arxiv","source_id":"1302.5021","source_version":1,"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-18T00:58:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QGFjM0RavDQqtgZiUI8PLvcV9FRxJBTL4I2lxdtQpqMMRnbhM4hJrL1pflzGGWF4klBYl5xTyIBHmqnqUO6mAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:14:28.602213Z"},"content_sha256":"6adcaa60ce4770c3f6e78e374afe7c59d79dcd928092194cd9185109549bb5b2","schema_version":"1.0","event_id":"sha256:6adcaa60ce4770c3f6e78e374afe7c59d79dcd928092194cd9185109549bb5b2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:M7YTFUBYFDUV5BYOUGKA44XS4Q","target":"graph","payload":{"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"},"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-18T00:58:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CkEFoBU7S9UqGTTdfVkT9EAb5SaZKCl0rC//PX144eBQEt+ugGvPHpAYMsdqZjy9unpogQ1VkmG7MjYRo0IhAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:14:28.602619Z"},"content_sha256":"5e24920ea6e9aa2c5cc5364332bb8df53df2ea036139b02a4c7a841aecf31413","schema_version":"1.0","event_id":"sha256:5e24920ea6e9aa2c5cc5364332bb8df53df2ea036139b02a4c7a841aecf31413"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M7YTFUBYFDUV5BYOUGKA44XS4Q/bundle.json","state_url":"https://pith.science/pith/M7YTFUBYFDUV5BYOUGKA44XS4Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M7YTFUBYFDUV5BYOUGKA44XS4Q/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-31T03:14:28Z","links":{"resolver":"https://pith.science/pith/M7YTFUBYFDUV5BYOUGKA44XS4Q","bundle":"https://pith.science/pith/M7YTFUBYFDUV5BYOUGKA44XS4Q/bundle.json","state":"https://pith.science/pith/M7YTFUBYFDUV5BYOUGKA44XS4Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M7YTFUBYFDUV5BYOUGKA44XS4Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:M7YTFUBYFDUV5BYOUGKA44XS4Q","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":"830b17c038fcbb6d76ad5eeb2cd5dd079d5d5632eb279fbe8f61711ca4506159","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-20T16:28:19Z","title_canon_sha256":"c76be93121c9dd8635669ce7c2ae0f5b6ecd3b72135aefd42133596476e56701"},"schema_version":"1.0","source":{"id":"1302.5021","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.5021","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"arxiv_version","alias_value":"1302.5021v1","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.5021","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"pith_short_12","alias_value":"M7YTFUBYFDUV","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"M7YTFUBYFDUV5BYO","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"M7YTFUBY","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:5e24920ea6e9aa2c5cc5364332bb8df53df2ea036139b02a4c7a841aecf31413","target":"graph","created_at":"2026-05-18T00:58:17Z","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":"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","authors_text":"K. Vinodh, N. Prakash, P. Vijay Kumar, S. Sandeep Pradhan, V. Lalitha","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-20T16:28:19Z","title":"Linear Coding Schemes for the Distributed Computation of Subspaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.5021","kind":"arxiv","version":1},"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:6adcaa60ce4770c3f6e78e374afe7c59d79dcd928092194cd9185109549bb5b2","target":"record","created_at":"2026-05-18T00:58:17Z","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":"830b17c038fcbb6d76ad5eeb2cd5dd079d5d5632eb279fbe8f61711ca4506159","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-20T16:28:19Z","title_canon_sha256":"c76be93121c9dd8635669ce7c2ae0f5b6ecd3b72135aefd42133596476e56701"},"schema_version":"1.0","source":{"id":"1302.5021","kind":"arxiv","version":1}},"canonical_sha256":"67f132d03828e95e870ea1940e72f2e4176d5a53a6c58355915f11e2076e015d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67f132d03828e95e870ea1940e72f2e4176d5a53a6c58355915f11e2076e015d","first_computed_at":"2026-05-18T00:58:17.615237Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:17.615237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JNSB6pWp8nmb6cCibw5PNyEmXgVsWrMrgFtRBIb6FQ7K6oEvbF4o5z/vBAZz0rN6MCKHuyJHsyUULayRQIJbAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:17.616022Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.5021","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6adcaa60ce4770c3f6e78e374afe7c59d79dcd928092194cd9185109549bb5b2","sha256:5e24920ea6e9aa2c5cc5364332bb8df53df2ea036139b02a4c7a841aecf31413"],"state_sha256":"17ddf33a0e078e50b4a99cfd9975a94ec7d6e45ef1fee47ba2814b39a371aa26"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DBri8ehZdcTnbM/b0OLGMHMqSF7a8IFGPjtADWDd41O2CWGcA//SY31m2GWcwBMr/+VpWiMTNuel11ToK6qdCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:14:28.606701Z","bundle_sha256":"9255cc9cc4a7a8cd3b75bd9db30b1c57fb3ccd284da04d4f0b2723aa6fdb99e6"}}