{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:7PRSJ5THCP7ZTQ4VT7XZMO65GO","short_pith_number":"pith:7PRSJ5TH","canonical_record":{"source":{"id":"2101.03893","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2020-12-15T21:25:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"33e2695fc7dc5e6b1df8de1895c52a43ebb7c54152d4b42d413b44d7987d67f8","abstract_canon_sha256":"be2ce5bc2e47dcf68e7dd0c234be3ef32473da237b5250d769c10ab6096e7981"},"schema_version":"1.0"},"canonical_sha256":"fbe324f66713ff99c3959fef963bdd3387b3534233bb89bedd819f37ace3aa95","source":{"kind":"arxiv","id":"2101.03893","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.03893","created_at":"2026-07-05T02:05:55Z"},{"alias_kind":"arxiv_version","alias_value":"2101.03893v1","created_at":"2026-07-05T02:05:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.03893","created_at":"2026-07-05T02:05:55Z"},{"alias_kind":"pith_short_12","alias_value":"7PRSJ5THCP7Z","created_at":"2026-07-05T02:05:55Z"},{"alias_kind":"pith_short_16","alias_value":"7PRSJ5THCP7ZTQ4V","created_at":"2026-07-05T02:05:55Z"},{"alias_kind":"pith_short_8","alias_value":"7PRSJ5TH","created_at":"2026-07-05T02:05:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:7PRSJ5THCP7ZTQ4VT7XZMO65GO","target":"record","payload":{"canonical_record":{"source":{"id":"2101.03893","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2020-12-15T21:25:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"33e2695fc7dc5e6b1df8de1895c52a43ebb7c54152d4b42d413b44d7987d67f8","abstract_canon_sha256":"be2ce5bc2e47dcf68e7dd0c234be3ef32473da237b5250d769c10ab6096e7981"},"schema_version":"1.0"},"canonical_sha256":"fbe324f66713ff99c3959fef963bdd3387b3534233bb89bedd819f37ace3aa95","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:05:55.132887Z","signature_b64":"6Cdp0HcIaIXLov2rEWm1mIW0xp749TJSDVcJq3o7nGYPFCHaoA29OMmQzAO2laz8Zetay5zl9d+4rSVPuT4dDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fbe324f66713ff99c3959fef963bdd3387b3534233bb89bedd819f37ace3aa95","last_reissued_at":"2026-07-05T02:05:55.132484Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:05:55.132484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2101.03893","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-07-05T02:05:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lTPCz6F/ZuCR03SBREjtuXiRge3b4bQcJn5mplcF6TNFltZ4ZGh6GRKXe1mPkAbQFk/W5KqI1hJrj9PC36L2AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T20:52:55.618287Z"},"content_sha256":"e9ddfd4b0da3ba148fbc6ce6cb2251f9afdaf2e1f8596fcf93590a5f692a633a","schema_version":"1.0","event_id":"sha256:e9ddfd4b0da3ba148fbc6ce6cb2251f9afdaf2e1f8596fcf93590a5f692a633a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:7PRSJ5THCP7ZTQ4VT7XZMO65GO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Neural Network Coding","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amit Solomon, Litian Liu, Muriel Medard, Salman Salamatian","submitted_at":"2020-12-15T21:25:32Z","abstract_excerpt":"In this paper we introduce Neural Network Coding(NNC), a data-driven approach to joint source and network coding. In NNC, the encoders at each source and intermediate node, as well as the decoder at each destination node, are neural networks which are all trained jointly for the task of communicating correlated sources through a network of noisy point-to-point links. The NNC scheme is application-specific and makes use of a training set of data, instead of making assumptions on the source statistics. In addition, it can adapt to any arbitrary network topology and power constraint. We show empi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.03893","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2101.03893/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T02:05:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wmViZbYzCh5w/alTtZpqG1ldzIhHZR2153TRVZygeiF3YaUlZIKd1LMuBkuc40Xw9RHBK+tRS6OFnBZIwLTvCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T20:52:55.618810Z"},"content_sha256":"1eb938ae9c99fd1fdd16f7b991b2acf754c9840681a1974eb1a9eff8b1ef9afb","schema_version":"1.0","event_id":"sha256:1eb938ae9c99fd1fdd16f7b991b2acf754c9840681a1974eb1a9eff8b1ef9afb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7PRSJ5THCP7ZTQ4VT7XZMO65GO/bundle.json","state_url":"https://pith.science/pith/7PRSJ5THCP7ZTQ4VT7XZMO65GO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7PRSJ5THCP7ZTQ4VT7XZMO65GO/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-08-05T20:52:55Z","links":{"resolver":"https://pith.science/pith/7PRSJ5THCP7ZTQ4VT7XZMO65GO","bundle":"https://pith.science/pith/7PRSJ5THCP7ZTQ4VT7XZMO65GO/bundle.json","state":"https://pith.science/pith/7PRSJ5THCP7ZTQ4VT7XZMO65GO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7PRSJ5THCP7ZTQ4VT7XZMO65GO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:7PRSJ5THCP7ZTQ4VT7XZMO65GO","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":"be2ce5bc2e47dcf68e7dd0c234be3ef32473da237b5250d769c10ab6096e7981","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2020-12-15T21:25:32Z","title_canon_sha256":"33e2695fc7dc5e6b1df8de1895c52a43ebb7c54152d4b42d413b44d7987d67f8"},"schema_version":"1.0","source":{"id":"2101.03893","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.03893","created_at":"2026-07-05T02:05:55Z"},{"alias_kind":"arxiv_version","alias_value":"2101.03893v1","created_at":"2026-07-05T02:05:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.03893","created_at":"2026-07-05T02:05:55Z"},{"alias_kind":"pith_short_12","alias_value":"7PRSJ5THCP7Z","created_at":"2026-07-05T02:05:55Z"},{"alias_kind":"pith_short_16","alias_value":"7PRSJ5THCP7ZTQ4V","created_at":"2026-07-05T02:05:55Z"},{"alias_kind":"pith_short_8","alias_value":"7PRSJ5TH","created_at":"2026-07-05T02:05:55Z"}],"graph_snapshots":[{"event_id":"sha256:1eb938ae9c99fd1fdd16f7b991b2acf754c9840681a1974eb1a9eff8b1ef9afb","target":"graph","created_at":"2026-07-05T02:05:55Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2101.03893/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper we introduce Neural Network Coding(NNC), a data-driven approach to joint source and network coding. In NNC, the encoders at each source and intermediate node, as well as the decoder at each destination node, are neural networks which are all trained jointly for the task of communicating correlated sources through a network of noisy point-to-point links. The NNC scheme is application-specific and makes use of a training set of data, instead of making assumptions on the source statistics. In addition, it can adapt to any arbitrary network topology and power constraint. We show empi","authors_text":"Amit Solomon, Litian Liu, Muriel Medard, Salman Salamatian","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2020-12-15T21:25:32Z","title":"Neural Network Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.03893","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:e9ddfd4b0da3ba148fbc6ce6cb2251f9afdaf2e1f8596fcf93590a5f692a633a","target":"record","created_at":"2026-07-05T02:05:55Z","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":"be2ce5bc2e47dcf68e7dd0c234be3ef32473da237b5250d769c10ab6096e7981","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2020-12-15T21:25:32Z","title_canon_sha256":"33e2695fc7dc5e6b1df8de1895c52a43ebb7c54152d4b42d413b44d7987d67f8"},"schema_version":"1.0","source":{"id":"2101.03893","kind":"arxiv","version":1}},"canonical_sha256":"fbe324f66713ff99c3959fef963bdd3387b3534233bb89bedd819f37ace3aa95","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fbe324f66713ff99c3959fef963bdd3387b3534233bb89bedd819f37ace3aa95","first_computed_at":"2026-07-05T02:05:55.132484Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:05:55.132484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6Cdp0HcIaIXLov2rEWm1mIW0xp749TJSDVcJq3o7nGYPFCHaoA29OMmQzAO2laz8Zetay5zl9d+4rSVPuT4dDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:05:55.132887Z","signed_message":"canonical_sha256_bytes"},"source_id":"2101.03893","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e9ddfd4b0da3ba148fbc6ce6cb2251f9afdaf2e1f8596fcf93590a5f692a633a","sha256:1eb938ae9c99fd1fdd16f7b991b2acf754c9840681a1974eb1a9eff8b1ef9afb"],"state_sha256":"d3991da762db5039306592a9a080af1036ffb892da92998c048ff472f619ebd7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aNeQw7q0oVVOF2NtSxeG67TobuS2iOEfFOZc1ZYImghzZ4Dieuo9Izc4Gw5nST/ID32DG1K+H6B8/o12+5vWDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T20:52:55.623635Z","bundle_sha256":"1d640a1869ba3289fcee470b14d67770da372fa9e78a7f0c876b4cb87862e265"}}