{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:66433V7HEIHJU3IAU3O7R2EQU6","short_pith_number":"pith:66433V7H","canonical_record":{"source":{"id":"1805.03338","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-09T01:12:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6f6fb64935e0c6588844e57a1ba9f9afcc30e29102b345656e38e8cdd39d671d","abstract_canon_sha256":"8e929d7948dec854d25f5353fb683bea3d57db7a96d4da114ec71863e96f005d"},"schema_version":"1.0"},"canonical_sha256":"f7b9bdd7e7220e9a6d00a6ddf8e890a7a42186b24cc7642c051194aecd1be834","source":{"kind":"arxiv","id":"1805.03338","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03338","created_at":"2026-05-18T00:02:10Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03338v2","created_at":"2026-05-18T00:02:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03338","created_at":"2026-05-18T00:02:10Z"},{"alias_kind":"pith_short_12","alias_value":"66433V7HEIHJ","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"66433V7HEIHJU3IA","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"66433V7H","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:66433V7HEIHJU3IAU3O7R2EQU6","target":"record","payload":{"canonical_record":{"source":{"id":"1805.03338","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-09T01:12:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6f6fb64935e0c6588844e57a1ba9f9afcc30e29102b345656e38e8cdd39d671d","abstract_canon_sha256":"8e929d7948dec854d25f5353fb683bea3d57db7a96d4da114ec71863e96f005d"},"schema_version":"1.0"},"canonical_sha256":"f7b9bdd7e7220e9a6d00a6ddf8e890a7a42186b24cc7642c051194aecd1be834","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:10.063509Z","signature_b64":"NGFIUtPwMDdQKa1eKjXSNOFfOOVHhbOAANCcEU4HDutCuf97m8y/EfpRCnsm6OTNGbmSj5YrOeShVEVwaE6VAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7b9bdd7e7220e9a6d00a6ddf8e890a7a42186b24cc7642c051194aecd1be834","last_reissued_at":"2026-05-18T00:02:10.062769Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:10.062769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.03338","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-18T00:02:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TbitNNhIS7SeCjM/2bK6kSCRy/htPIW4jFZPyJytOeeXN7OLGiJqT2PtvYrizra1KWRnaH1e+1ynu0u/Nu56CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T09:14:39.068186Z"},"content_sha256":"b3908d4649fac077945f1276360fee09ff61a2b934320a3309cd7f37fda00721","schema_version":"1.0","event_id":"sha256:b3908d4649fac077945f1276360fee09ff61a2b934320a3309cd7f37fda00721"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:66433V7HEIHJU3IAU3O7R2EQU6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Optimal Achievable Rates for Linear Computation With Random Homologous Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Pinar Sen, Sung Hoon Lim, Young-Han Kim","submitted_at":"2018-05-09T01:12:57Z","abstract_excerpt":"The problem of computing a linear combination of sources over a multiple access channel is studied. Inner and outer bounds on the optimal tradeoff between the communication rates are established when encoding is restricted to random ensembles of homologous codes, namely, structured nested coset codes from the same generator matrix and individual shaping functions, but when decoding is optimized with respect to the realization of the encoders. For the special case in which the desired linear combination is \"matched\" to the structure of the multiple access channel in a natural sense, these inner"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03338","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-18T00:02:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lkTNjlIPHc8i38CLGacaWYRLqIA9vDY+YRydcZTJtBfH85OBDyy6R6vwDqrCUs2Gj0ZErqC/Oi6jw203LyGXCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T09:14:39.068544Z"},"content_sha256":"7bc6b67de0fbe67ef96373327ec205328b6260a3427262fe4bfc93af8638855e","schema_version":"1.0","event_id":"sha256:7bc6b67de0fbe67ef96373327ec205328b6260a3427262fe4bfc93af8638855e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/66433V7HEIHJU3IAU3O7R2EQU6/bundle.json","state_url":"https://pith.science/pith/66433V7HEIHJU3IAU3O7R2EQU6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/66433V7HEIHJU3IAU3O7R2EQU6/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-06-04T09:14:39Z","links":{"resolver":"https://pith.science/pith/66433V7HEIHJU3IAU3O7R2EQU6","bundle":"https://pith.science/pith/66433V7HEIHJU3IAU3O7R2EQU6/bundle.json","state":"https://pith.science/pith/66433V7HEIHJU3IAU3O7R2EQU6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/66433V7HEIHJU3IAU3O7R2EQU6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:66433V7HEIHJU3IAU3O7R2EQU6","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":"8e929d7948dec854d25f5353fb683bea3d57db7a96d4da114ec71863e96f005d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-09T01:12:57Z","title_canon_sha256":"6f6fb64935e0c6588844e57a1ba9f9afcc30e29102b345656e38e8cdd39d671d"},"schema_version":"1.0","source":{"id":"1805.03338","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03338","created_at":"2026-05-18T00:02:10Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03338v2","created_at":"2026-05-18T00:02:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03338","created_at":"2026-05-18T00:02:10Z"},{"alias_kind":"pith_short_12","alias_value":"66433V7HEIHJ","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"66433V7HEIHJU3IA","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"66433V7H","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:7bc6b67de0fbe67ef96373327ec205328b6260a3427262fe4bfc93af8638855e","target":"graph","created_at":"2026-05-18T00:02:10Z","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":"The problem of computing a linear combination of sources over a multiple access channel is studied. Inner and outer bounds on the optimal tradeoff between the communication rates are established when encoding is restricted to random ensembles of homologous codes, namely, structured nested coset codes from the same generator matrix and individual shaping functions, but when decoding is optimized with respect to the realization of the encoders. For the special case in which the desired linear combination is \"matched\" to the structure of the multiple access channel in a natural sense, these inner","authors_text":"Pinar Sen, Sung Hoon Lim, Young-Han Kim","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-09T01:12:57Z","title":"On the Optimal Achievable Rates for Linear Computation With Random Homologous Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03338","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:b3908d4649fac077945f1276360fee09ff61a2b934320a3309cd7f37fda00721","target":"record","created_at":"2026-05-18T00:02:10Z","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":"8e929d7948dec854d25f5353fb683bea3d57db7a96d4da114ec71863e96f005d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-09T01:12:57Z","title_canon_sha256":"6f6fb64935e0c6588844e57a1ba9f9afcc30e29102b345656e38e8cdd39d671d"},"schema_version":"1.0","source":{"id":"1805.03338","kind":"arxiv","version":2}},"canonical_sha256":"f7b9bdd7e7220e9a6d00a6ddf8e890a7a42186b24cc7642c051194aecd1be834","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7b9bdd7e7220e9a6d00a6ddf8e890a7a42186b24cc7642c051194aecd1be834","first_computed_at":"2026-05-18T00:02:10.062769Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:10.062769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NGFIUtPwMDdQKa1eKjXSNOFfOOVHhbOAANCcEU4HDutCuf97m8y/EfpRCnsm6OTNGbmSj5YrOeShVEVwaE6VAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:10.063509Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.03338","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3908d4649fac077945f1276360fee09ff61a2b934320a3309cd7f37fda00721","sha256:7bc6b67de0fbe67ef96373327ec205328b6260a3427262fe4bfc93af8638855e"],"state_sha256":"1d87deabf2b916d4372edf1b90a04157b9886f9f2da7e9ef1b4e5a2cffec82cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+LpkbPfJcQV7XmXWiYu+pY5T22gqV86cubw1M0QP11F2SUY4UQd8m5WodEDqDE7tXAGN0B7YJbTDW6sJCwc3BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T09:14:39.070513Z","bundle_sha256":"b3ad35913e1c5c3f21138d08b54b607a3338c440331d18c5ea3ff18837ace21d"}}