{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XBSVMYTFJMFOABDWCWI5TDSU4I","short_pith_number":"pith:XBSVMYTF","canonical_record":{"source":{"id":"1812.00485","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-02T23:05:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d1b69f0435d7f69c4d44dfd7075675352b63f27e1cf819f8892d73aa515d7fc9","abstract_canon_sha256":"eb55c16b40890d7748a54311312e48748eb3e7eca6dddbec548ab8149ed97f81"},"schema_version":"1.0"},"canonical_sha256":"b8655662654b0ae004761591d98e54e20d39d20b847d8661a2a6c7ff3d5f8843","source":{"kind":"arxiv","id":"1812.00485","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.00485","created_at":"2026-05-17T23:57:46Z"},{"alias_kind":"arxiv_version","alias_value":"1812.00485v2","created_at":"2026-05-17T23:57:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.00485","created_at":"2026-05-17T23:57:46Z"},{"alias_kind":"pith_short_12","alias_value":"XBSVMYTFJMFO","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XBSVMYTFJMFOABDW","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XBSVMYTF","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XBSVMYTFJMFOABDWCWI5TDSU4I","target":"record","payload":{"canonical_record":{"source":{"id":"1812.00485","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-02T23:05:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d1b69f0435d7f69c4d44dfd7075675352b63f27e1cf819f8892d73aa515d7fc9","abstract_canon_sha256":"eb55c16b40890d7748a54311312e48748eb3e7eca6dddbec548ab8149ed97f81"},"schema_version":"1.0"},"canonical_sha256":"b8655662654b0ae004761591d98e54e20d39d20b847d8661a2a6c7ff3d5f8843","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:46.378251Z","signature_b64":"D81ztzp6ZzVMuBMSLjgakq3Vum9CUh+wz4DZU+GhCwtCifeeCEee5vTIOGfsQkHyehr+BnwUmHY/sKD4UnMoBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8655662654b0ae004761591d98e54e20d39d20b847d8661a2a6c7ff3d5f8843","last_reissued_at":"2026-05-17T23:57:46.377643Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:46.377643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.00485","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-17T23:57:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2pwOtMNUxttOHggG9307//FfF1VLk6nqunQH/xlUVmlSpOgOif/04bq112c/RznZioORAy4xP9xfgGctuLrVDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:46:19.626152Z"},"content_sha256":"b75fffd14fb76fb6ac89953a0b4a6ff270ef4ed47f045d4433eb12f272700963","schema_version":"1.0","event_id":"sha256:b75fffd14fb76fb6ac89953a0b4a6ff270ef4ed47f045d4433eb12f272700963"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XBSVMYTFJMFOABDWCWI5TDSU4I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Double and Triple Node-Erasure-Correcting Codes over Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eitan Yaakobi, Lev Yohananov, Yuval Efron","submitted_at":"2018-12-02T23:05:14Z","abstract_excerpt":"In this paper we study array-based codes over graphs for correcting multiple node failures. These codes have applications to neural networks, associative memories, and distributed storage systems. We assume that the information is stored on the edges of a complete undirected graph and a node failure is the event where all the edges in the neighborhood of a given node have been erased. A code over graphs is called $\\rho$-node-erasure-correcting if it allows to reconstruct the erased edges upon the failure of any $\\rho$ nodes or less. We present a binary optimal construction for double-node-eras"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.00485","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-17T23:57:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9m++Lj1QLy/MJeDOuTK8L5Ch43Oe19EovEih5v0AA7nuh8avaRP8Pa79WPBqPl7jBMRqS2wRJ6Aqn48KYbLNAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:46:19.626527Z"},"content_sha256":"75f647a96df63026e27d79c8725ad982a3eef0123cdddfb7c55aa9764b32b1b0","schema_version":"1.0","event_id":"sha256:75f647a96df63026e27d79c8725ad982a3eef0123cdddfb7c55aa9764b32b1b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XBSVMYTFJMFOABDWCWI5TDSU4I/bundle.json","state_url":"https://pith.science/pith/XBSVMYTFJMFOABDWCWI5TDSU4I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XBSVMYTFJMFOABDWCWI5TDSU4I/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-01T06:46:19Z","links":{"resolver":"https://pith.science/pith/XBSVMYTFJMFOABDWCWI5TDSU4I","bundle":"https://pith.science/pith/XBSVMYTFJMFOABDWCWI5TDSU4I/bundle.json","state":"https://pith.science/pith/XBSVMYTFJMFOABDWCWI5TDSU4I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XBSVMYTFJMFOABDWCWI5TDSU4I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XBSVMYTFJMFOABDWCWI5TDSU4I","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":"eb55c16b40890d7748a54311312e48748eb3e7eca6dddbec548ab8149ed97f81","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-02T23:05:14Z","title_canon_sha256":"d1b69f0435d7f69c4d44dfd7075675352b63f27e1cf819f8892d73aa515d7fc9"},"schema_version":"1.0","source":{"id":"1812.00485","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.00485","created_at":"2026-05-17T23:57:46Z"},{"alias_kind":"arxiv_version","alias_value":"1812.00485v2","created_at":"2026-05-17T23:57:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.00485","created_at":"2026-05-17T23:57:46Z"},{"alias_kind":"pith_short_12","alias_value":"XBSVMYTFJMFO","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XBSVMYTFJMFOABDW","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XBSVMYTF","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:75f647a96df63026e27d79c8725ad982a3eef0123cdddfb7c55aa9764b32b1b0","target":"graph","created_at":"2026-05-17T23:57:46Z","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":"In this paper we study array-based codes over graphs for correcting multiple node failures. These codes have applications to neural networks, associative memories, and distributed storage systems. We assume that the information is stored on the edges of a complete undirected graph and a node failure is the event where all the edges in the neighborhood of a given node have been erased. A code over graphs is called $\\rho$-node-erasure-correcting if it allows to reconstruct the erased edges upon the failure of any $\\rho$ nodes or less. We present a binary optimal construction for double-node-eras","authors_text":"Eitan Yaakobi, Lev Yohananov, Yuval Efron","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-02T23:05:14Z","title":"Double and Triple Node-Erasure-Correcting Codes over Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.00485","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:b75fffd14fb76fb6ac89953a0b4a6ff270ef4ed47f045d4433eb12f272700963","target":"record","created_at":"2026-05-17T23:57:46Z","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":"eb55c16b40890d7748a54311312e48748eb3e7eca6dddbec548ab8149ed97f81","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-02T23:05:14Z","title_canon_sha256":"d1b69f0435d7f69c4d44dfd7075675352b63f27e1cf819f8892d73aa515d7fc9"},"schema_version":"1.0","source":{"id":"1812.00485","kind":"arxiv","version":2}},"canonical_sha256":"b8655662654b0ae004761591d98e54e20d39d20b847d8661a2a6c7ff3d5f8843","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8655662654b0ae004761591d98e54e20d39d20b847d8661a2a6c7ff3d5f8843","first_computed_at":"2026-05-17T23:57:46.377643Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:46.377643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D81ztzp6ZzVMuBMSLjgakq3Vum9CUh+wz4DZU+GhCwtCifeeCEee5vTIOGfsQkHyehr+BnwUmHY/sKD4UnMoBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:46.378251Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.00485","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b75fffd14fb76fb6ac89953a0b4a6ff270ef4ed47f045d4433eb12f272700963","sha256:75f647a96df63026e27d79c8725ad982a3eef0123cdddfb7c55aa9764b32b1b0"],"state_sha256":"01b2cc848329d53583705d5b221cea5f19db1fd7c39675fcf7420e7c395bfdd6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xMH4a9HFaBHqDg3gbM7YP5KpKlsCBH8PVQhshkyPvjET1IDMeuJ4gTWWnY2NEF0MxI+qb8fvIKeqyXMK9a2DBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T06:46:19.628673Z","bundle_sha256":"f3faad7fe9c64d9e3a1e193eaf21aeff8ce7a6e99c297969e4fd7b3b8f6a08ef"}}