{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:TOODDXOOVGOWSF5OWHGB2ZYNPO","short_pith_number":"pith:TOODDXOO","canonical_record":{"source":{"id":"2106.06445","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-06-11T15:02:11Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"2f4460302b661ebb3c38971ab4ed36ebbdbca62615394474ca6f9f589b4aab6d","abstract_canon_sha256":"17b8feca96812befdeb7135b18a9aa779385a4e6c6e4e5606e33a93c51c56e56"},"schema_version":"1.0"},"canonical_sha256":"9b9c31ddcea99d6917aeb1cc1d670d7b88f815d89fbfa16f0a865a825f81b7d7","source":{"kind":"arxiv","id":"2106.06445","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.06445","created_at":"2026-07-05T02:52:16Z"},{"alias_kind":"arxiv_version","alias_value":"2106.06445v2","created_at":"2026-07-05T02:52:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.06445","created_at":"2026-07-05T02:52:16Z"},{"alias_kind":"pith_short_12","alias_value":"TOODDXOOVGOW","created_at":"2026-07-05T02:52:16Z"},{"alias_kind":"pith_short_16","alias_value":"TOODDXOOVGOWSF5O","created_at":"2026-07-05T02:52:16Z"},{"alias_kind":"pith_short_8","alias_value":"TOODDXOO","created_at":"2026-07-05T02:52:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:TOODDXOOVGOWSF5OWHGB2ZYNPO","target":"record","payload":{"canonical_record":{"source":{"id":"2106.06445","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-06-11T15:02:11Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"2f4460302b661ebb3c38971ab4ed36ebbdbca62615394474ca6f9f589b4aab6d","abstract_canon_sha256":"17b8feca96812befdeb7135b18a9aa779385a4e6c6e4e5606e33a93c51c56e56"},"schema_version":"1.0"},"canonical_sha256":"9b9c31ddcea99d6917aeb1cc1d670d7b88f815d89fbfa16f0a865a825f81b7d7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:52:16.696739Z","signature_b64":"5mMuYLqekvWPWoqPwz54jFyJxWA573YSBB6vO5/1O3pDIoqVffJsVAPwYRkL4madFLHLWXODFVDeHA0so+AoBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b9c31ddcea99d6917aeb1cc1d670d7b88f815d89fbfa16f0a865a825f81b7d7","last_reissued_at":"2026-07-05T02:52:16.696326Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:52:16.696326Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2106.06445","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-07-05T02:52:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J3wkmNyq2w9+bRTjE8wVg+rBJ1fI63grW0wDn68BKpkR1CRuv+F9HP+1+OtPkWuCsFXjLLMk5tdonlW5V0I8AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-15T07:47:37.760895Z"},"content_sha256":"72c09c9dd56ef4b4cf983da00d039a35690b11c703319465260837b2c1b845d8","schema_version":"1.0","event_id":"sha256:72c09c9dd56ef4b4cf983da00d039a35690b11c703319465260837b2c1b845d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:TOODDXOOVGOWSF5OWHGB2ZYNPO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coded-InvNet for Resilient Prediction Serving Systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Kangwook Lee, Tuan Dinh","submitted_at":"2021-06-11T15:02:11Z","abstract_excerpt":"Inspired by a new coded computation algorithm for invertible functions, we propose Coded-InvNet a new approach to design resilient prediction serving systems that can gracefully handle stragglers or node failures. Coded-InvNet leverages recent findings in the deep learning literature such as invertible neural networks, Manifold Mixup, and domain translation algorithms, identifying interesting research directions that span across machine learning and systems. Our experimental results show that Coded-InvNet can outperform existing approaches, especially when the compute resource overhead is as l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.06445","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2106.06445/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:52:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sbonOeFZWC4fiHQBudGG1z+yp9W1Rg4zxtVol99miZ+wCR2w3nrXDIe5ylQFLqoGF+6csBRo02j1DxxBtXh/Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-15T07:47:37.761266Z"},"content_sha256":"066799f8c193c44b0929cebfc9ecc4319ea6f309471eff7043a7882402d54c13","schema_version":"1.0","event_id":"sha256:066799f8c193c44b0929cebfc9ecc4319ea6f309471eff7043a7882402d54c13"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TOODDXOOVGOWSF5OWHGB2ZYNPO/bundle.json","state_url":"https://pith.science/pith/TOODDXOOVGOWSF5OWHGB2ZYNPO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TOODDXOOVGOWSF5OWHGB2ZYNPO/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-07-15T07:47:37Z","links":{"resolver":"https://pith.science/pith/TOODDXOOVGOWSF5OWHGB2ZYNPO","bundle":"https://pith.science/pith/TOODDXOOVGOWSF5OWHGB2ZYNPO/bundle.json","state":"https://pith.science/pith/TOODDXOOVGOWSF5OWHGB2ZYNPO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TOODDXOOVGOWSF5OWHGB2ZYNPO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:TOODDXOOVGOWSF5OWHGB2ZYNPO","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":"17b8feca96812befdeb7135b18a9aa779385a4e6c6e4e5606e33a93c51c56e56","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-06-11T15:02:11Z","title_canon_sha256":"2f4460302b661ebb3c38971ab4ed36ebbdbca62615394474ca6f9f589b4aab6d"},"schema_version":"1.0","source":{"id":"2106.06445","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.06445","created_at":"2026-07-05T02:52:16Z"},{"alias_kind":"arxiv_version","alias_value":"2106.06445v2","created_at":"2026-07-05T02:52:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.06445","created_at":"2026-07-05T02:52:16Z"},{"alias_kind":"pith_short_12","alias_value":"TOODDXOOVGOW","created_at":"2026-07-05T02:52:16Z"},{"alias_kind":"pith_short_16","alias_value":"TOODDXOOVGOWSF5O","created_at":"2026-07-05T02:52:16Z"},{"alias_kind":"pith_short_8","alias_value":"TOODDXOO","created_at":"2026-07-05T02:52:16Z"}],"graph_snapshots":[{"event_id":"sha256:066799f8c193c44b0929cebfc9ecc4319ea6f309471eff7043a7882402d54c13","target":"graph","created_at":"2026-07-05T02:52:16Z","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/2106.06445/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Inspired by a new coded computation algorithm for invertible functions, we propose Coded-InvNet a new approach to design resilient prediction serving systems that can gracefully handle stragglers or node failures. Coded-InvNet leverages recent findings in the deep learning literature such as invertible neural networks, Manifold Mixup, and domain translation algorithms, identifying interesting research directions that span across machine learning and systems. Our experimental results show that Coded-InvNet can outperform existing approaches, especially when the compute resource overhead is as l","authors_text":"Kangwook Lee, Tuan Dinh","cross_cats":["cs.DC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-06-11T15:02:11Z","title":"Coded-InvNet for Resilient Prediction Serving Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.06445","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:72c09c9dd56ef4b4cf983da00d039a35690b11c703319465260837b2c1b845d8","target":"record","created_at":"2026-07-05T02:52:16Z","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":"17b8feca96812befdeb7135b18a9aa779385a4e6c6e4e5606e33a93c51c56e56","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-06-11T15:02:11Z","title_canon_sha256":"2f4460302b661ebb3c38971ab4ed36ebbdbca62615394474ca6f9f589b4aab6d"},"schema_version":"1.0","source":{"id":"2106.06445","kind":"arxiv","version":2}},"canonical_sha256":"9b9c31ddcea99d6917aeb1cc1d670d7b88f815d89fbfa16f0a865a825f81b7d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b9c31ddcea99d6917aeb1cc1d670d7b88f815d89fbfa16f0a865a825f81b7d7","first_computed_at":"2026-07-05T02:52:16.696326Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:52:16.696326Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5mMuYLqekvWPWoqPwz54jFyJxWA573YSBB6vO5/1O3pDIoqVffJsVAPwYRkL4madFLHLWXODFVDeHA0so+AoBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:52:16.696739Z","signed_message":"canonical_sha256_bytes"},"source_id":"2106.06445","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72c09c9dd56ef4b4cf983da00d039a35690b11c703319465260837b2c1b845d8","sha256:066799f8c193c44b0929cebfc9ecc4319ea6f309471eff7043a7882402d54c13"],"state_sha256":"1a5bab5244fb7e671a8b7418befcf9e60a5ab8b8c96a58af94278e4bead564de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FQ576hGY8+6sbhlKCORjxomo3IMR0NRnvFfMOKSxem85SmieYwaLUAaAyNtIFP7sP39akz6tv4HSIHnhF2dFCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-15T07:47:37.763429Z","bundle_sha256":"b6ba17b0fa439a4d2bc34903257e7a199b02e2e53218e182647b41cbb2fbcfc9"}}