{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NI6YR3MN2N27CJOBBY3PN5ZTZZ","short_pith_number":"pith:NI6YR3MN","canonical_record":{"source":{"id":"1709.04701","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-14T11:11:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bec95c0999ea040c1abc9362b79c0b0efa5ab3f620e778497c7b52d7bd766d47","abstract_canon_sha256":"82416a6650dfeaee421ae259e226202cc2f042f048c61001efd6baf5816b5333"},"schema_version":"1.0"},"canonical_sha256":"6a3d88ed8dd375f125c10e36f6f733ce7054faa9392919dff448ccaef5a5cb17","source":{"kind":"arxiv","id":"1709.04701","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.04701","created_at":"2026-05-18T00:35:10Z"},{"alias_kind":"arxiv_version","alias_value":"1709.04701v1","created_at":"2026-05-18T00:35:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04701","created_at":"2026-05-18T00:35:10Z"},{"alias_kind":"pith_short_12","alias_value":"NI6YR3MN2N27","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NI6YR3MN2N27CJOB","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NI6YR3MN","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NI6YR3MN2N27CJOBBY3PN5ZTZZ","target":"record","payload":{"canonical_record":{"source":{"id":"1709.04701","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-14T11:11:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bec95c0999ea040c1abc9362b79c0b0efa5ab3f620e778497c7b52d7bd766d47","abstract_canon_sha256":"82416a6650dfeaee421ae259e226202cc2f042f048c61001efd6baf5816b5333"},"schema_version":"1.0"},"canonical_sha256":"6a3d88ed8dd375f125c10e36f6f733ce7054faa9392919dff448ccaef5a5cb17","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:10.389631Z","signature_b64":"b1sH75OYS210z9WXsHp0D7QGG2Cyc9chBDESBPufh4MpOd3QQY6F72cPd8baXkQ7+yVxaLpbCvBwVyFgRYciDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a3d88ed8dd375f125c10e36f6f733ce7054faa9392919dff448ccaef5a5cb17","last_reissued_at":"2026-05-18T00:35:10.389187Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:10.389187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.04701","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-05-18T00:35:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AnS1oJZ3hAwlLhQ/k8zg4kYHNACRXqaQlSOXcEODi1IFQExMnoUEyNzd7k+eO5wymIA+1K9tskUoOF10tRuFBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:54:23.668965Z"},"content_sha256":"a4c7be3d867a3ba9d72be65a64fc0368f9ceb2141405c0c4e7862cd94664c1cf","schema_version":"1.0","event_id":"sha256:a4c7be3d867a3ba9d72be65a64fc0368f9ceb2141405c0c4e7862cd94664c1cf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NI6YR3MN2N27CJOBBY3PN5ZTZZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Codes for Erasures over Directed 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","submitted_at":"2017-09-14T11:11:33Z","abstract_excerpt":"In this work we continue the study of a new class of codes, called \\emph{codes over graphs}. Here we consider storage systems where the information is stored on the edges of a complete directed graph with $n$ nodes. The failure model we consider is of \\emph{node failures} which are erasures of all edges, both incoming and outgoing, connected to the failed node. It is said that a code over graphs is a \\textit{$\\rho$-node-erasure-correcting code} if it can correct the failure of any $\\rho$ nodes in the graphs of the code. While the construction of such optimal codes is an easy task if the field "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04701","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":""},"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:35:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"70F6WDhMbuXVOsgg7hMjL9BYnI2nioyyln48uZrp738hjXw9Y2jWjCRXADF5Q/9CtrHz0xxAryTLW+378i5OCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:54:23.669330Z"},"content_sha256":"f6183a5d43e0f1fac5bd6005bc545ccb82a0ea2d5d9e2b09846ecf23d415a014","schema_version":"1.0","event_id":"sha256:f6183a5d43e0f1fac5bd6005bc545ccb82a0ea2d5d9e2b09846ecf23d415a014"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NI6YR3MN2N27CJOBBY3PN5ZTZZ/bundle.json","state_url":"https://pith.science/pith/NI6YR3MN2N27CJOBBY3PN5ZTZZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NI6YR3MN2N27CJOBBY3PN5ZTZZ/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-05T12:54:23Z","links":{"resolver":"https://pith.science/pith/NI6YR3MN2N27CJOBBY3PN5ZTZZ","bundle":"https://pith.science/pith/NI6YR3MN2N27CJOBBY3PN5ZTZZ/bundle.json","state":"https://pith.science/pith/NI6YR3MN2N27CJOBBY3PN5ZTZZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NI6YR3MN2N27CJOBBY3PN5ZTZZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NI6YR3MN2N27CJOBBY3PN5ZTZZ","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":"82416a6650dfeaee421ae259e226202cc2f042f048c61001efd6baf5816b5333","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-14T11:11:33Z","title_canon_sha256":"bec95c0999ea040c1abc9362b79c0b0efa5ab3f620e778497c7b52d7bd766d47"},"schema_version":"1.0","source":{"id":"1709.04701","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.04701","created_at":"2026-05-18T00:35:10Z"},{"alias_kind":"arxiv_version","alias_value":"1709.04701v1","created_at":"2026-05-18T00:35:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04701","created_at":"2026-05-18T00:35:10Z"},{"alias_kind":"pith_short_12","alias_value":"NI6YR3MN2N27","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NI6YR3MN2N27CJOB","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NI6YR3MN","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:f6183a5d43e0f1fac5bd6005bc545ccb82a0ea2d5d9e2b09846ecf23d415a014","target":"graph","created_at":"2026-05-18T00:35:10Z","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 work we continue the study of a new class of codes, called \\emph{codes over graphs}. Here we consider storage systems where the information is stored on the edges of a complete directed graph with $n$ nodes. The failure model we consider is of \\emph{node failures} which are erasures of all edges, both incoming and outgoing, connected to the failed node. It is said that a code over graphs is a \\textit{$\\rho$-node-erasure-correcting code} if it can correct the failure of any $\\rho$ nodes in the graphs of the code. While the construction of such optimal codes is an easy task if the field ","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-09-14T11:11:33Z","title":"Codes for Erasures over Directed Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04701","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:a4c7be3d867a3ba9d72be65a64fc0368f9ceb2141405c0c4e7862cd94664c1cf","target":"record","created_at":"2026-05-18T00:35:10Z","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":"82416a6650dfeaee421ae259e226202cc2f042f048c61001efd6baf5816b5333","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-14T11:11:33Z","title_canon_sha256":"bec95c0999ea040c1abc9362b79c0b0efa5ab3f620e778497c7b52d7bd766d47"},"schema_version":"1.0","source":{"id":"1709.04701","kind":"arxiv","version":1}},"canonical_sha256":"6a3d88ed8dd375f125c10e36f6f733ce7054faa9392919dff448ccaef5a5cb17","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a3d88ed8dd375f125c10e36f6f733ce7054faa9392919dff448ccaef5a5cb17","first_computed_at":"2026-05-18T00:35:10.389187Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:10.389187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b1sH75OYS210z9WXsHp0D7QGG2Cyc9chBDESBPufh4MpOd3QQY6F72cPd8baXkQ7+yVxaLpbCvBwVyFgRYciDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:10.389631Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.04701","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4c7be3d867a3ba9d72be65a64fc0368f9ceb2141405c0c4e7862cd94664c1cf","sha256:f6183a5d43e0f1fac5bd6005bc545ccb82a0ea2d5d9e2b09846ecf23d415a014"],"state_sha256":"dc0e47555bb79b44508c1632c6dccd3ec8ff69b2e22f0555f767de8a609e76dd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tUUH+3HLsnfpOxEhM1FeH9Sd+uWvOAS8bKfEa/WnQJ9AfQT8wtTQxRAStq/kg4Nup15BaIvmXz4LTJE2jTTPBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T12:54:23.671271Z","bundle_sha256":"7204d06bd65dc9040cf12a303fb0313d73502049e6b35d2cac26e044df6f34e7"}}