{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QVO3GVGP47WCXJF6COSUR33IJH","short_pith_number":"pith:QVO3GVGP","canonical_record":{"source":{"id":"1705.02639","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-07T15:47:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cdc75e2fdf410b23a925fc37c1b28ea614cf7427b4934d54e26d699bbc688bb3","abstract_canon_sha256":"42f42455e9e5d204092481552dfc0f0f48d1dee57084346d9e90ad1e0181b99f"},"schema_version":"1.0"},"canonical_sha256":"855db354cfe7ec2ba4be13a548ef6849c1fe1efbd529387bb7f97dd88405dd37","source":{"kind":"arxiv","id":"1705.02639","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02639","created_at":"2026-05-18T00:43:47Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02639v2","created_at":"2026-05-18T00:43:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02639","created_at":"2026-05-18T00:43:47Z"},{"alias_kind":"pith_short_12","alias_value":"QVO3GVGP47WC","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QVO3GVGP47WCXJF6","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QVO3GVGP","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QVO3GVGP47WCXJF6COSUR33IJH","target":"record","payload":{"canonical_record":{"source":{"id":"1705.02639","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-07T15:47:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cdc75e2fdf410b23a925fc37c1b28ea614cf7427b4934d54e26d699bbc688bb3","abstract_canon_sha256":"42f42455e9e5d204092481552dfc0f0f48d1dee57084346d9e90ad1e0181b99f"},"schema_version":"1.0"},"canonical_sha256":"855db354cfe7ec2ba4be13a548ef6849c1fe1efbd529387bb7f97dd88405dd37","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:47.875015Z","signature_b64":"Ll0q5Swztz9Y2sIiLOqmBTW707WflxvWz8vVGLjjfALxvikd2V7CViPtaZvaLBZXnodK8OmPkInqEV+S4BaLCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"855db354cfe7ec2ba4be13a548ef6849c1fe1efbd529387bb7f97dd88405dd37","last_reissued_at":"2026-05-18T00:43:47.874566Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:47.874566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.02639","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:43:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9o7ZqWWZgu3WDuFCRrFVH+H5hkhKnf5q6RoIfe+pxI/DUzbeVRADkAe6HDyl55nxWQfRSMlpo+TfRbOqPzCrCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:07:05.322409Z"},"content_sha256":"51c2660a06a874de56116c407a98cd40f8b577a6345931663994ff178391e624","schema_version":"1.0","event_id":"sha256:51c2660a06a874de56116c407a98cd40f8b577a6345931663994ff178391e624"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QVO3GVGP47WCXJF6COSUR33IJH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Codes for Graph Erasures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eitan Yaakobi, Lev Yohananov","submitted_at":"2017-05-07T15:47:51Z","abstract_excerpt":"Motivated by systems where the information is represented by a graph, such as neural networks, associative memories, and distributed systems, we present in this work a new class of codes, called codes over graphs. Under this paradigm, the information is stored on the edges of an undirected graph, and a code over graphs is a set of graphs. A node failure is the event where all edges in the neighborhood of the failed node have been erased. We say that a code over graphs can tolerate $\\rho$ node failures if it can correct the erased edges of any $\\rho$ failed nodes in the graph. While the constru"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02639","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:43:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZsN9FO1MGLQUdnbEPufB/u8HjQ2h64Yn7IIzo6i2+ZbujsDJ5N1mGu75//ohv/hDgZxVLVeqtnMMcBmdTuNhCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:07:05.322762Z"},"content_sha256":"901033e9b02b68b12fda8210bdda3e2fd3f7a79e9b961fa4aad2a5cbfe07cb14","schema_version":"1.0","event_id":"sha256:901033e9b02b68b12fda8210bdda3e2fd3f7a79e9b961fa4aad2a5cbfe07cb14"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QVO3GVGP47WCXJF6COSUR33IJH/bundle.json","state_url":"https://pith.science/pith/QVO3GVGP47WCXJF6COSUR33IJH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QVO3GVGP47WCXJF6COSUR33IJH/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-05T14:07:05Z","links":{"resolver":"https://pith.science/pith/QVO3GVGP47WCXJF6COSUR33IJH","bundle":"https://pith.science/pith/QVO3GVGP47WCXJF6COSUR33IJH/bundle.json","state":"https://pith.science/pith/QVO3GVGP47WCXJF6COSUR33IJH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QVO3GVGP47WCXJF6COSUR33IJH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QVO3GVGP47WCXJF6COSUR33IJH","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":"42f42455e9e5d204092481552dfc0f0f48d1dee57084346d9e90ad1e0181b99f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-07T15:47:51Z","title_canon_sha256":"cdc75e2fdf410b23a925fc37c1b28ea614cf7427b4934d54e26d699bbc688bb3"},"schema_version":"1.0","source":{"id":"1705.02639","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02639","created_at":"2026-05-18T00:43:47Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02639v2","created_at":"2026-05-18T00:43:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02639","created_at":"2026-05-18T00:43:47Z"},{"alias_kind":"pith_short_12","alias_value":"QVO3GVGP47WC","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QVO3GVGP47WCXJF6","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QVO3GVGP","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:901033e9b02b68b12fda8210bdda3e2fd3f7a79e9b961fa4aad2a5cbfe07cb14","target":"graph","created_at":"2026-05-18T00:43:47Z","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":"Motivated by systems where the information is represented by a graph, such as neural networks, associative memories, and distributed systems, we present in this work a new class of codes, called codes over graphs. Under this paradigm, the information is stored on the edges of an undirected graph, and a code over graphs is a set of graphs. A node failure is the event where all edges in the neighborhood of the failed node have been erased. We say that a code over graphs can tolerate $\\rho$ node failures if it can correct the erased edges of any $\\rho$ failed nodes in the graph. While the constru","authors_text":"Eitan Yaakobi, Lev Yohananov","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-07T15:47:51Z","title":"Codes for Graph Erasures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02639","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:51c2660a06a874de56116c407a98cd40f8b577a6345931663994ff178391e624","target":"record","created_at":"2026-05-18T00:43:47Z","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":"42f42455e9e5d204092481552dfc0f0f48d1dee57084346d9e90ad1e0181b99f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-07T15:47:51Z","title_canon_sha256":"cdc75e2fdf410b23a925fc37c1b28ea614cf7427b4934d54e26d699bbc688bb3"},"schema_version":"1.0","source":{"id":"1705.02639","kind":"arxiv","version":2}},"canonical_sha256":"855db354cfe7ec2ba4be13a548ef6849c1fe1efbd529387bb7f97dd88405dd37","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"855db354cfe7ec2ba4be13a548ef6849c1fe1efbd529387bb7f97dd88405dd37","first_computed_at":"2026-05-18T00:43:47.874566Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:47.874566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ll0q5Swztz9Y2sIiLOqmBTW707WflxvWz8vVGLjjfALxvikd2V7CViPtaZvaLBZXnodK8OmPkInqEV+S4BaLCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:47.875015Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.02639","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51c2660a06a874de56116c407a98cd40f8b577a6345931663994ff178391e624","sha256:901033e9b02b68b12fda8210bdda3e2fd3f7a79e9b961fa4aad2a5cbfe07cb14"],"state_sha256":"1e36dc68e11397064555be65a94d94ff0012160902423e34caf1f7869fe3e1f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"do91b+N6KAkqjK2L03I87VEtPmOESPraKK9Nv2J62CS8QiC1FUC4fNPNLqTOSAX1cPZhR91ZjBMpvZ2bf8FGAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T14:07:05.324648Z","bundle_sha256":"82a1a7c7176f6318a062a898f9e4f6fbf9c23d34b8e2059d01a89c00eff5f15a"}}