{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:6CC6IPSZCABT6FAFDLI5VFQ5AH","short_pith_number":"pith:6CC6IPSZ","canonical_record":{"source":{"id":"1101.0085","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-30T13:40:13Z","cross_cats_sorted":["cs.DC","math.CO","math.IT"],"title_canon_sha256":"c5123152bd076d83398e72199a41bb92b8aaff72d2d5f61960f19e67c3b4c1e4","abstract_canon_sha256":"67283e2f85323fcec659fc3abe841e8ddd5e08637d0b02e58542ad3a51a15201"},"schema_version":"1.0"},"canonical_sha256":"f085e43e5910033f14051ad1da961d01fa4cd137ffa681b9ae8e4efbe126ea28","source":{"kind":"arxiv","id":"1101.0085","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.0085","created_at":"2026-05-18T04:22:39Z"},{"alias_kind":"arxiv_version","alias_value":"1101.0085v3","created_at":"2026-05-18T04:22:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.0085","created_at":"2026-05-18T04:22:39Z"},{"alias_kind":"pith_short_12","alias_value":"6CC6IPSZCABT","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"6CC6IPSZCABT6FAF","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"6CC6IPSZ","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:6CC6IPSZCABT6FAFDLI5VFQ5AH","target":"record","payload":{"canonical_record":{"source":{"id":"1101.0085","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-30T13:40:13Z","cross_cats_sorted":["cs.DC","math.CO","math.IT"],"title_canon_sha256":"c5123152bd076d83398e72199a41bb92b8aaff72d2d5f61960f19e67c3b4c1e4","abstract_canon_sha256":"67283e2f85323fcec659fc3abe841e8ddd5e08637d0b02e58542ad3a51a15201"},"schema_version":"1.0"},"canonical_sha256":"f085e43e5910033f14051ad1da961d01fa4cd137ffa681b9ae8e4efbe126ea28","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:39.922307Z","signature_b64":"GEb8c4g70KTpmVXjCorHuRZu26/xvTO0JG06pQdxKGVkv37gNyhAqJ7MTpz9EhTYKB4bdrHmjlDteVSlGp/uBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f085e43e5910033f14051ad1da961d01fa4cd137ffa681b9ae8e4efbe126ea28","last_reissued_at":"2026-05-18T04:22:39.921913Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:39.921913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.0085","source_version":3,"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-18T04:22:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BD5+Enkjt4RuJs6W7oV07n1ljodEQHuxztbu/XdDpYlTv9zfVJqj1AYIpaAMRzXbvkLn515HR9kybVEImdxrCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:18:28.440778Z"},"content_sha256":"5e62e1fa03e22e8218c71a71dc4d65a99398cb19d414c77488eecb9659ceaadd","schema_version":"1.0","event_id":"sha256:5e62e1fa03e22e8218c71a71dc4d65a99398cb19d414c77488eecb9659ceaadd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:6CC6IPSZCABT6FAFDLI5VFQ5AH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear Codes, Target Function Classes, and Network Computing Capacity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Kenneth Zeger, Massimo Franceschetti, Nikhil Karamchandani, Rathinakumar Appuswamy","submitted_at":"2010-12-30T13:40:13Z","abstract_excerpt":"We study the use of linear codes for network computing in single-receiver networks with various classes of target functions of the source messages. Such classes include reducible, injective, semi-injective, and linear target functions over finite fields. Computing capacity bounds and achievability are given with respect to these target function classes for network codes that use routing, linear coding, or nonlinear coding."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.0085","kind":"arxiv","version":3},"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-18T04:22:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TvPstrmv085A9n7ofy/dH0ThXqy2Brsy9Uhz77zeJPNYzUBbTcBK720ScZXDyuPaIPfg9EP9Ww9uR+BWuG14Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:18:28.441368Z"},"content_sha256":"b029a1837e61bf6f59abee4cec8247d2cd2e034a53b79adbbc93f465706f98bd","schema_version":"1.0","event_id":"sha256:b029a1837e61bf6f59abee4cec8247d2cd2e034a53b79adbbc93f465706f98bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6CC6IPSZCABT6FAFDLI5VFQ5AH/bundle.json","state_url":"https://pith.science/pith/6CC6IPSZCABT6FAFDLI5VFQ5AH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6CC6IPSZCABT6FAFDLI5VFQ5AH/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-27T23:18:28Z","links":{"resolver":"https://pith.science/pith/6CC6IPSZCABT6FAFDLI5VFQ5AH","bundle":"https://pith.science/pith/6CC6IPSZCABT6FAFDLI5VFQ5AH/bundle.json","state":"https://pith.science/pith/6CC6IPSZCABT6FAFDLI5VFQ5AH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6CC6IPSZCABT6FAFDLI5VFQ5AH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:6CC6IPSZCABT6FAFDLI5VFQ5AH","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":"67283e2f85323fcec659fc3abe841e8ddd5e08637d0b02e58542ad3a51a15201","cross_cats_sorted":["cs.DC","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-30T13:40:13Z","title_canon_sha256":"c5123152bd076d83398e72199a41bb92b8aaff72d2d5f61960f19e67c3b4c1e4"},"schema_version":"1.0","source":{"id":"1101.0085","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.0085","created_at":"2026-05-18T04:22:39Z"},{"alias_kind":"arxiv_version","alias_value":"1101.0085v3","created_at":"2026-05-18T04:22:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.0085","created_at":"2026-05-18T04:22:39Z"},{"alias_kind":"pith_short_12","alias_value":"6CC6IPSZCABT","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"6CC6IPSZCABT6FAF","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"6CC6IPSZ","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:b029a1837e61bf6f59abee4cec8247d2cd2e034a53b79adbbc93f465706f98bd","target":"graph","created_at":"2026-05-18T04:22:39Z","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 the use of linear codes for network computing in single-receiver networks with various classes of target functions of the source messages. Such classes include reducible, injective, semi-injective, and linear target functions over finite fields. Computing capacity bounds and achievability are given with respect to these target function classes for network codes that use routing, linear coding, or nonlinear coding.","authors_text":"Kenneth Zeger, Massimo Franceschetti, Nikhil Karamchandani, Rathinakumar Appuswamy","cross_cats":["cs.DC","math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-30T13:40:13Z","title":"Linear Codes, Target Function Classes, and Network Computing Capacity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.0085","kind":"arxiv","version":3},"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:5e62e1fa03e22e8218c71a71dc4d65a99398cb19d414c77488eecb9659ceaadd","target":"record","created_at":"2026-05-18T04:22:39Z","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":"67283e2f85323fcec659fc3abe841e8ddd5e08637d0b02e58542ad3a51a15201","cross_cats_sorted":["cs.DC","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-30T13:40:13Z","title_canon_sha256":"c5123152bd076d83398e72199a41bb92b8aaff72d2d5f61960f19e67c3b4c1e4"},"schema_version":"1.0","source":{"id":"1101.0085","kind":"arxiv","version":3}},"canonical_sha256":"f085e43e5910033f14051ad1da961d01fa4cd137ffa681b9ae8e4efbe126ea28","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f085e43e5910033f14051ad1da961d01fa4cd137ffa681b9ae8e4efbe126ea28","first_computed_at":"2026-05-18T04:22:39.921913Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:22:39.921913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GEb8c4g70KTpmVXjCorHuRZu26/xvTO0JG06pQdxKGVkv37gNyhAqJ7MTpz9EhTYKB4bdrHmjlDteVSlGp/uBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:22:39.922307Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.0085","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e62e1fa03e22e8218c71a71dc4d65a99398cb19d414c77488eecb9659ceaadd","sha256:b029a1837e61bf6f59abee4cec8247d2cd2e034a53b79adbbc93f465706f98bd"],"state_sha256":"c48c563ab4b89c0f6b5c96474aac1b67d135215d0ddc796aaf9308794dccc8f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kKZNP1GojdfOwodVjk63k0foB23FCja6jLauLshxBz/la6RebHMUhSc1HiHyZe98fgFE4SeDfeyFlHA4yBnLAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:18:28.443862Z","bundle_sha256":"c27ad2e0b0faefd06ce50f73be8e69092817e9ddd9b72bc1c5049e11191c91c9"}}