{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RGTBIC2HHX4CTNVKK436XD3YLH","short_pith_number":"pith:RGTBIC2H","schema_version":"1.0","canonical_sha256":"89a6140b473df829b6aa5737eb8f7859f065c6f40d3a9135fe4d4577383a1922","source":{"kind":"arxiv","id":"1704.02079","version":1},"attestation_state":"computed","paper":{"title":"Codes with Unequal Disjoint Local Erasure Correction Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"GeonU Kim, Jungwoo Lee","submitted_at":"2017-04-07T03:27:38Z","abstract_excerpt":"Recently, locally repairable codes (LRCs) with local erasure correction constraints that are unequal and disjoint have been proposed. In this work, we study the same topic and provide some improved and additional results."},"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":"1704.02079","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-07T03:27:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3fbb22aa0693497d33b6941a6ec6e7bde928ab86b66977ed2585acca82f4d3ca","abstract_canon_sha256":"d0c19558f2a0d1ad21b98e80c6720620010ee6991553451c551c93a7abc32634"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:50.861179Z","signature_b64":"Ouax4orztlnr60fISecqBFkshmaU0aPpxAir1BgM7hjLUgPxWqnxpsMzihZSgpzA6zi+trKgW5/O2FenJGYMBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89a6140b473df829b6aa5737eb8f7859f065c6f40d3a9135fe4d4577383a1922","last_reissued_at":"2026-05-18T00:46:50.860600Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:50.860600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Codes with Unequal Disjoint Local Erasure Correction Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"GeonU Kim, Jungwoo Lee","submitted_at":"2017-04-07T03:27:38Z","abstract_excerpt":"Recently, locally repairable codes (LRCs) with local erasure correction constraints that are unequal and disjoint have been proposed. In this work, we study the same topic and provide some improved and additional results."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02079","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":"1704.02079","created_at":"2026-05-18T00:46:50.860682+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.02079v1","created_at":"2026-05-18T00:46:50.860682+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02079","created_at":"2026-05-18T00:46:50.860682+00:00"},{"alias_kind":"pith_short_12","alias_value":"RGTBIC2HHX4C","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RGTBIC2HHX4CTNVK","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RGTBIC2H","created_at":"2026-05-18T12:31:39.905425+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/RGTBIC2HHX4CTNVKK436XD3YLH","json":"https://pith.science/pith/RGTBIC2HHX4CTNVKK436XD3YLH.json","graph_json":"https://pith.science/api/pith-number/RGTBIC2HHX4CTNVKK436XD3YLH/graph.json","events_json":"https://pith.science/api/pith-number/RGTBIC2HHX4CTNVKK436XD3YLH/events.json","paper":"https://pith.science/paper/RGTBIC2H"},"agent_actions":{"view_html":"https://pith.science/pith/RGTBIC2HHX4CTNVKK436XD3YLH","download_json":"https://pith.science/pith/RGTBIC2HHX4CTNVKK436XD3YLH.json","view_paper":"https://pith.science/paper/RGTBIC2H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.02079&json=true","fetch_graph":"https://pith.science/api/pith-number/RGTBIC2HHX4CTNVKK436XD3YLH/graph.json","fetch_events":"https://pith.science/api/pith-number/RGTBIC2HHX4CTNVKK436XD3YLH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RGTBIC2HHX4CTNVKK436XD3YLH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RGTBIC2HHX4CTNVKK436XD3YLH/action/storage_attestation","attest_author":"https://pith.science/pith/RGTBIC2HHX4CTNVKK436XD3YLH/action/author_attestation","sign_citation":"https://pith.science/pith/RGTBIC2HHX4CTNVKK436XD3YLH/action/citation_signature","submit_replication":"https://pith.science/pith/RGTBIC2HHX4CTNVKK436XD3YLH/action/replication_record"}},"created_at":"2026-05-18T00:46:50.860682+00:00","updated_at":"2026-05-18T00:46:50.860682+00:00"}