{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:7PRSJ5THCP7ZTQ4VT7XZMO65GO","short_pith_number":"pith:7PRSJ5TH","schema_version":"1.0","canonical_sha256":"fbe324f66713ff99c3959fef963bdd3387b3534233bb89bedd819f37ace3aa95","source":{"kind":"arxiv","id":"2101.03893","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2101.03893","created_at":"2026-07-05T02:05:55.132555+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.03893v1","created_at":"2026-07-05T02:05:55.132555+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.03893","created_at":"2026-07-05T02:05:55.132555+00:00"},{"alias_kind":"pith_short_12","alias_value":"7PRSJ5THCP7Z","created_at":"2026-07-05T02:05:55.132555+00:00"},{"alias_kind":"pith_short_16","alias_value":"7PRSJ5THCP7ZTQ4V","created_at":"2026-07-05T02:05:55.132555+00:00"},{"alias_kind":"pith_short_8","alias_value":"7PRSJ5TH","created_at":"2026-07-05T02:05:55.132555+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/7PRSJ5THCP7ZTQ4VT7XZMO65GO","json":"https://pith.science/pith/7PRSJ5THCP7ZTQ4VT7XZMO65GO.json","graph_json":"https://pith.science/api/pith-number/7PRSJ5THCP7ZTQ4VT7XZMO65GO/graph.json","events_json":"https://pith.science/api/pith-number/7PRSJ5THCP7ZTQ4VT7XZMO65GO/events.json","paper":"https://pith.science/paper/7PRSJ5TH"},"agent_actions":{"view_html":"https://pith.science/pith/7PRSJ5THCP7ZTQ4VT7XZMO65GO","download_json":"https://pith.science/pith/7PRSJ5THCP7ZTQ4VT7XZMO65GO.json","view_paper":"https://pith.science/paper/7PRSJ5TH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.03893&json=true","fetch_graph":"https://pith.science/api/pith-number/7PRSJ5THCP7ZTQ4VT7XZMO65GO/graph.json","fetch_events":"https://pith.science/api/pith-number/7PRSJ5THCP7ZTQ4VT7XZMO65GO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7PRSJ5THCP7ZTQ4VT7XZMO65GO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7PRSJ5THCP7ZTQ4VT7XZMO65GO/action/storage_attestation","attest_author":"https://pith.science/pith/7PRSJ5THCP7ZTQ4VT7XZMO65GO/action/author_attestation","sign_citation":"https://pith.science/pith/7PRSJ5THCP7ZTQ4VT7XZMO65GO/action/citation_signature","submit_replication":"https://pith.science/pith/7PRSJ5THCP7ZTQ4VT7XZMO65GO/action/replication_record"}},"created_at":"2026-07-05T02:05:55.132555+00:00","updated_at":"2026-07-05T02:05:55.132555+00:00"}