{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DZXWQO2YPO5YN4EJIRTP62AUWK","short_pith_number":"pith:DZXWQO2Y","schema_version":"1.0","canonical_sha256":"1e6f683b587bbb86f0894466ff6814b288a9aa6881171281ea89135c5b758d20","source":{"kind":"arxiv","id":"1805.02989","version":1},"attestation_state":"computed","paper":{"title":"On Secure Exact-repair Regenerating Codes with a Single Pareto Optimal Point","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fangwei Ye, Kenneth W. Shum, Raymond W. Yeung, Shiqiu Liu","submitted_at":"2018-05-08T12:57:08Z","abstract_excerpt":"The problem of exact-repair regenerating codes against eavesdropping attack is studied. The eavesdropping model we consider is that the eavesdropper has the capability to observe the data involved in the repair of a subset of $\\ell$ nodes. An $(n,k,d,\\ell)$ secure exact-repair regenerating code is an $(n,k,d)$ exact-repair regenerating code that is secure under this eavesdropping model. It has been shown that for some parameters $(n,k,d,\\ell)$, the associated optimal storage-bandwidth tradeoff curve, which has one corner point, can be determined. The focus of this paper is on characterizing su"},"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":"1805.02989","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-08T12:57:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"068a606f4c5098854afd88c51454b81d758cf8bb18a566f09d602acf1b70a853","abstract_canon_sha256":"a903a9791df773c302183c05bab3815c06699ce63561ec6671dbc19c08e2d760"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:34.998299Z","signature_b64":"rOwvfc7Wrtq3PzeefjJCnyfi2nwGBQdSKuxFvOoDeMLsD9KVCNr4tC0/cXPBUz8pdqXYmgAtb8jyhgRTpsnqBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e6f683b587bbb86f0894466ff6814b288a9aa6881171281ea89135c5b758d20","last_reissued_at":"2026-05-18T00:16:34.997681Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:34.997681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Secure Exact-repair Regenerating Codes with a Single Pareto Optimal Point","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fangwei Ye, Kenneth W. Shum, Raymond W. Yeung, Shiqiu Liu","submitted_at":"2018-05-08T12:57:08Z","abstract_excerpt":"The problem of exact-repair regenerating codes against eavesdropping attack is studied. The eavesdropping model we consider is that the eavesdropper has the capability to observe the data involved in the repair of a subset of $\\ell$ nodes. An $(n,k,d,\\ell)$ secure exact-repair regenerating code is an $(n,k,d)$ exact-repair regenerating code that is secure under this eavesdropping model. It has been shown that for some parameters $(n,k,d,\\ell)$, the associated optimal storage-bandwidth tradeoff curve, which has one corner point, can be determined. The focus of this paper is on characterizing su"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02989","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":"1805.02989","created_at":"2026-05-18T00:16:34.997766+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.02989v1","created_at":"2026-05-18T00:16:34.997766+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02989","created_at":"2026-05-18T00:16:34.997766+00:00"},{"alias_kind":"pith_short_12","alias_value":"DZXWQO2YPO5Y","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DZXWQO2YPO5YN4EJ","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DZXWQO2Y","created_at":"2026-05-18T12:32:19.392346+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/DZXWQO2YPO5YN4EJIRTP62AUWK","json":"https://pith.science/pith/DZXWQO2YPO5YN4EJIRTP62AUWK.json","graph_json":"https://pith.science/api/pith-number/DZXWQO2YPO5YN4EJIRTP62AUWK/graph.json","events_json":"https://pith.science/api/pith-number/DZXWQO2YPO5YN4EJIRTP62AUWK/events.json","paper":"https://pith.science/paper/DZXWQO2Y"},"agent_actions":{"view_html":"https://pith.science/pith/DZXWQO2YPO5YN4EJIRTP62AUWK","download_json":"https://pith.science/pith/DZXWQO2YPO5YN4EJIRTP62AUWK.json","view_paper":"https://pith.science/paper/DZXWQO2Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.02989&json=true","fetch_graph":"https://pith.science/api/pith-number/DZXWQO2YPO5YN4EJIRTP62AUWK/graph.json","fetch_events":"https://pith.science/api/pith-number/DZXWQO2YPO5YN4EJIRTP62AUWK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DZXWQO2YPO5YN4EJIRTP62AUWK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DZXWQO2YPO5YN4EJIRTP62AUWK/action/storage_attestation","attest_author":"https://pith.science/pith/DZXWQO2YPO5YN4EJIRTP62AUWK/action/author_attestation","sign_citation":"https://pith.science/pith/DZXWQO2YPO5YN4EJIRTP62AUWK/action/citation_signature","submit_replication":"https://pith.science/pith/DZXWQO2YPO5YN4EJIRTP62AUWK/action/replication_record"}},"created_at":"2026-05-18T00:16:34.997766+00:00","updated_at":"2026-05-18T00:16:34.997766+00:00"}