{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:CLL5GINAAZUSEZMIBIDNOINKFH","short_pith_number":"pith:CLL5GINA","schema_version":"1.0","canonical_sha256":"12d7d321a006692265880a06d721aa29c6506f621d9b3ca19e16c9884668674b","source":{"kind":"arxiv","id":"1305.4580","version":1},"attestation_state":"computed","paper":{"title":"Reconstruction and Repair Degree of Fractional Repetition Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Krishna Gopal Benerjee, Manish K. Gupta, Nikhil Agrawal","submitted_at":"2013-05-20T17:21:30Z","abstract_excerpt":"Given a Fractional Repetition code, finding the reconstruction and repair degree in a distributed storage system is an important problem. In this work, we present algorithms for computing the reconstruction and repair degree of fractional repetition codes."},"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":"1305.4580","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-20T17:21:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a078efe4cf983e17692b962609480037aad4a78d1d86a2c308ce611716113202","abstract_canon_sha256":"a68ef36e328178cd3abe6e733ac6c6b75a0f685d2c9ff0485df9504cfe6b090d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:16.644937Z","signature_b64":"7WxIR4xi1XIOv3eZKf11Ttlg05eW85OydjpSLNa4wCY89/FK76azl9sW0uEdmNNO8Nt6fwDfKtYO/HpHUxLpAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12d7d321a006692265880a06d721aa29c6506f621d9b3ca19e16c9884668674b","last_reissued_at":"2026-05-18T03:25:16.644186Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:16.644186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reconstruction and Repair Degree of Fractional Repetition Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Krishna Gopal Benerjee, Manish K. Gupta, Nikhil Agrawal","submitted_at":"2013-05-20T17:21:30Z","abstract_excerpt":"Given a Fractional Repetition code, finding the reconstruction and repair degree in a distributed storage system is an important problem. In this work, we present algorithms for computing the reconstruction and repair degree of fractional repetition codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4580","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":"1305.4580","created_at":"2026-05-18T03:25:16.644312+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.4580v1","created_at":"2026-05-18T03:25:16.644312+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4580","created_at":"2026-05-18T03:25:16.644312+00:00"},{"alias_kind":"pith_short_12","alias_value":"CLL5GINAAZUS","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"CLL5GINAAZUSEZMI","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"CLL5GINA","created_at":"2026-05-18T12:27:40.988391+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/CLL5GINAAZUSEZMIBIDNOINKFH","json":"https://pith.science/pith/CLL5GINAAZUSEZMIBIDNOINKFH.json","graph_json":"https://pith.science/api/pith-number/CLL5GINAAZUSEZMIBIDNOINKFH/graph.json","events_json":"https://pith.science/api/pith-number/CLL5GINAAZUSEZMIBIDNOINKFH/events.json","paper":"https://pith.science/paper/CLL5GINA"},"agent_actions":{"view_html":"https://pith.science/pith/CLL5GINAAZUSEZMIBIDNOINKFH","download_json":"https://pith.science/pith/CLL5GINAAZUSEZMIBIDNOINKFH.json","view_paper":"https://pith.science/paper/CLL5GINA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.4580&json=true","fetch_graph":"https://pith.science/api/pith-number/CLL5GINAAZUSEZMIBIDNOINKFH/graph.json","fetch_events":"https://pith.science/api/pith-number/CLL5GINAAZUSEZMIBIDNOINKFH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CLL5GINAAZUSEZMIBIDNOINKFH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CLL5GINAAZUSEZMIBIDNOINKFH/action/storage_attestation","attest_author":"https://pith.science/pith/CLL5GINAAZUSEZMIBIDNOINKFH/action/author_attestation","sign_citation":"https://pith.science/pith/CLL5GINAAZUSEZMIBIDNOINKFH/action/citation_signature","submit_replication":"https://pith.science/pith/CLL5GINAAZUSEZMIBIDNOINKFH/action/replication_record"}},"created_at":"2026-05-18T03:25:16.644312+00:00","updated_at":"2026-05-18T03:25:16.644312+00:00"}