{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:NQ4BOL3YACX5KE2KHCAZUR52NZ","short_pith_number":"pith:NQ4BOL3Y","schema_version":"1.0","canonical_sha256":"6c38172f7800afd5134a38819a47ba6e7b7bbddca3d8d4d7aa675e4e03bc6f37","source":{"kind":"arxiv","id":"1605.00020","version":2},"attestation_state":"computed","paper":{"title":"Locally Repairable Regenerating Code Constructions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chih-Chun Wang, Imad Ahmad","submitted_at":"2016-04-29T20:23:17Z","abstract_excerpt":"In this work, we give locally repairable regenerating code (LRRC) [1]-[3], [5], [6] constructions that can protect the file size promised by the graph analysis of the modified family helper selection (MFHS) scheme [1] at the minimum-bandwidth-regenerating (MBR) point."},"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":"1605.00020","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-29T20:23:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"974b6021294a4cce51874d2ab34670352e5575e8fab67d808d978fa277779107","abstract_canon_sha256":"16ced6a549efd44d6bcee79cec661fa680694d7e48cca6ca8cc9568edc0dfc68"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:33.848726Z","signature_b64":"mYhZ2o3qhzsOqRSOwirj2a5byvO/MPirME7g/cVDlOol8D6tX6ZR9rD8s6LZkAIpnp0QhhaFVlJXjhhbfsu7BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c38172f7800afd5134a38819a47ba6e7b7bbddca3d8d4d7aa675e4e03bc6f37","last_reissued_at":"2026-05-18T01:15:33.848106Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:33.848106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Locally Repairable Regenerating Code Constructions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chih-Chun Wang, Imad Ahmad","submitted_at":"2016-04-29T20:23:17Z","abstract_excerpt":"In this work, we give locally repairable regenerating code (LRRC) [1]-[3], [5], [6] constructions that can protect the file size promised by the graph analysis of the modified family helper selection (MFHS) scheme [1] at the minimum-bandwidth-regenerating (MBR) point."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.00020","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1605.00020","created_at":"2026-05-18T01:15:33.848179+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.00020v2","created_at":"2026-05-18T01:15:33.848179+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00020","created_at":"2026-05-18T01:15:33.848179+00:00"},{"alias_kind":"pith_short_12","alias_value":"NQ4BOL3YACX5","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"NQ4BOL3YACX5KE2K","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"NQ4BOL3Y","created_at":"2026-05-18T12:30:36.002864+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/NQ4BOL3YACX5KE2KHCAZUR52NZ","json":"https://pith.science/pith/NQ4BOL3YACX5KE2KHCAZUR52NZ.json","graph_json":"https://pith.science/api/pith-number/NQ4BOL3YACX5KE2KHCAZUR52NZ/graph.json","events_json":"https://pith.science/api/pith-number/NQ4BOL3YACX5KE2KHCAZUR52NZ/events.json","paper":"https://pith.science/paper/NQ4BOL3Y"},"agent_actions":{"view_html":"https://pith.science/pith/NQ4BOL3YACX5KE2KHCAZUR52NZ","download_json":"https://pith.science/pith/NQ4BOL3YACX5KE2KHCAZUR52NZ.json","view_paper":"https://pith.science/paper/NQ4BOL3Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.00020&json=true","fetch_graph":"https://pith.science/api/pith-number/NQ4BOL3YACX5KE2KHCAZUR52NZ/graph.json","fetch_events":"https://pith.science/api/pith-number/NQ4BOL3YACX5KE2KHCAZUR52NZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NQ4BOL3YACX5KE2KHCAZUR52NZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NQ4BOL3YACX5KE2KHCAZUR52NZ/action/storage_attestation","attest_author":"https://pith.science/pith/NQ4BOL3YACX5KE2KHCAZUR52NZ/action/author_attestation","sign_citation":"https://pith.science/pith/NQ4BOL3YACX5KE2KHCAZUR52NZ/action/citation_signature","submit_replication":"https://pith.science/pith/NQ4BOL3YACX5KE2KHCAZUR52NZ/action/replication_record"}},"created_at":"2026-05-18T01:15:33.848179+00:00","updated_at":"2026-05-18T01:15:33.848179+00:00"}