{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NI6YR3MN2N27CJOBBY3PN5ZTZZ","short_pith_number":"pith:NI6YR3MN","schema_version":"1.0","canonical_sha256":"6a3d88ed8dd375f125c10e36f6f733ce7054faa9392919dff448ccaef5a5cb17","source":{"kind":"arxiv","id":"1709.04701","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1709.04701","created_at":"2026-05-18T00:35:10.389248+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.04701v1","created_at":"2026-05-18T00:35:10.389248+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04701","created_at":"2026-05-18T00:35:10.389248+00:00"},{"alias_kind":"pith_short_12","alias_value":"NI6YR3MN2N27","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"NI6YR3MN2N27CJOB","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"NI6YR3MN","created_at":"2026-05-18T12:31:31.346846+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/NI6YR3MN2N27CJOBBY3PN5ZTZZ","json":"https://pith.science/pith/NI6YR3MN2N27CJOBBY3PN5ZTZZ.json","graph_json":"https://pith.science/api/pith-number/NI6YR3MN2N27CJOBBY3PN5ZTZZ/graph.json","events_json":"https://pith.science/api/pith-number/NI6YR3MN2N27CJOBBY3PN5ZTZZ/events.json","paper":"https://pith.science/paper/NI6YR3MN"},"agent_actions":{"view_html":"https://pith.science/pith/NI6YR3MN2N27CJOBBY3PN5ZTZZ","download_json":"https://pith.science/pith/NI6YR3MN2N27CJOBBY3PN5ZTZZ.json","view_paper":"https://pith.science/paper/NI6YR3MN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.04701&json=true","fetch_graph":"https://pith.science/api/pith-number/NI6YR3MN2N27CJOBBY3PN5ZTZZ/graph.json","fetch_events":"https://pith.science/api/pith-number/NI6YR3MN2N27CJOBBY3PN5ZTZZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NI6YR3MN2N27CJOBBY3PN5ZTZZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NI6YR3MN2N27CJOBBY3PN5ZTZZ/action/storage_attestation","attest_author":"https://pith.science/pith/NI6YR3MN2N27CJOBBY3PN5ZTZZ/action/author_attestation","sign_citation":"https://pith.science/pith/NI6YR3MN2N27CJOBBY3PN5ZTZZ/action/citation_signature","submit_replication":"https://pith.science/pith/NI6YR3MN2N27CJOBBY3PN5ZTZZ/action/replication_record"}},"created_at":"2026-05-18T00:35:10.389248+00:00","updated_at":"2026-05-18T00:35:10.389248+00:00"}