{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7PWZRHEXTSKHN6HK6HJG3WX5ZM","short_pith_number":"pith:7PWZRHEX","canonical_record":{"source":{"id":"1808.04539","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-14T05:47:46Z","cross_cats_sorted":["cs.CC","cs.DM","math.IT","math.NT"],"title_canon_sha256":"533246958cacd615e522aa12009588ecee2caa7618174c5e1671dfbbbf9f2974","abstract_canon_sha256":"91d793da115c04e785854f126e2a44a23379ff6f528765f1c4d0543ed70735c0"},"schema_version":"1.0"},"canonical_sha256":"fbed989c979c9476f8eaf1d26ddafdcb306da303bd3a8da2d33714d514029d26","source":{"kind":"arxiv","id":"1808.04539","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04539","created_at":"2026-05-18T00:08:12Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04539v1","created_at":"2026-05-18T00:08:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04539","created_at":"2026-05-18T00:08:12Z"},{"alias_kind":"pith_short_12","alias_value":"7PWZRHEXTSKH","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7PWZRHEXTSKHN6HK","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7PWZRHEX","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7PWZRHEXTSKHN6HK6HJG3WX5ZM","target":"record","payload":{"canonical_record":{"source":{"id":"1808.04539","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-14T05:47:46Z","cross_cats_sorted":["cs.CC","cs.DM","math.IT","math.NT"],"title_canon_sha256":"533246958cacd615e522aa12009588ecee2caa7618174c5e1671dfbbbf9f2974","abstract_canon_sha256":"91d793da115c04e785854f126e2a44a23379ff6f528765f1c4d0543ed70735c0"},"schema_version":"1.0"},"canonical_sha256":"fbed989c979c9476f8eaf1d26ddafdcb306da303bd3a8da2d33714d514029d26","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:12.232040Z","signature_b64":"/tnB7UGt/JMrD7N7yO7IlIlU7w3sbniy6XIT0DvRDq0fl7EF2ILdDr+Nj+2knWaErznoC3tK9P7Iw9mIRZ43Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fbed989c979c9476f8eaf1d26ddafdcb306da303bd3a8da2d33714d514029d26","last_reissued_at":"2026-05-18T00:08:12.231537Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:12.231537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.04539","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:08:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RubQcGQwP/VSdburHvF5Vnb6reauaZXASctmnUyCfr/VsrfwgDdhntNgMCLpG9BgKaN+eFgb3o4lBDm02tS+Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:44:09.301572Z"},"content_sha256":"d22b326fcdcf73ba7218d715a5518623a4c5580963aedc37261403c6eefb61b9","schema_version":"1.0","event_id":"sha256:d22b326fcdcf73ba7218d715a5518623a4c5580963aedc37261403c6eefb61b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7PWZRHEXTSKHN6HK6HJG3WX5ZM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constructions of maximally recoverable local reconstruction codes via function fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.IT","math.NT"],"primary_cat":"cs.IT","authors_text":"Chaoping Xing, Lingfei Jin, Venkatesan Guruswami","submitted_at":"2018-08-14T05:47:46Z","abstract_excerpt":"Local Reconstruction Codes (LRCs) allow for recovery from a small number of erasures in a local manner based on just a few other codeword symbols. A maximally recoverable (MR) LRC offers the best possible blend of such local and global fault tolerance, guaranteeing recovery from all erasure patterns which are information-theoretically correctable given the presence of local recovery groups. In an $(n,r,h,a)$-LRC, the $n$ codeword symbols are partitioned into $r$ disjoint groups each of which include $a$ local parity checks capable of locally correcting $a$ erasures.\n  MR LRCs have received muc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04539","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:08:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+4dqJzi38/ViToE58pxJYmxJv7jzZEe3QmPSGj+fzk24p6JsrzLShjYJ+9Q5Bl9H4+30ZFWd26WRci32oxYIBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:44:09.302362Z"},"content_sha256":"71270b5a4c473c59c081e9ca9f0e4ec8e2e7af30d7fdbfea402ea77560fe2836","schema_version":"1.0","event_id":"sha256:71270b5a4c473c59c081e9ca9f0e4ec8e2e7af30d7fdbfea402ea77560fe2836"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7PWZRHEXTSKHN6HK6HJG3WX5ZM/bundle.json","state_url":"https://pith.science/pith/7PWZRHEXTSKHN6HK6HJG3WX5ZM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7PWZRHEXTSKHN6HK6HJG3WX5ZM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-07T21:44:09Z","links":{"resolver":"https://pith.science/pith/7PWZRHEXTSKHN6HK6HJG3WX5ZM","bundle":"https://pith.science/pith/7PWZRHEXTSKHN6HK6HJG3WX5ZM/bundle.json","state":"https://pith.science/pith/7PWZRHEXTSKHN6HK6HJG3WX5ZM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7PWZRHEXTSKHN6HK6HJG3WX5ZM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7PWZRHEXTSKHN6HK6HJG3WX5ZM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"91d793da115c04e785854f126e2a44a23379ff6f528765f1c4d0543ed70735c0","cross_cats_sorted":["cs.CC","cs.DM","math.IT","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-14T05:47:46Z","title_canon_sha256":"533246958cacd615e522aa12009588ecee2caa7618174c5e1671dfbbbf9f2974"},"schema_version":"1.0","source":{"id":"1808.04539","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04539","created_at":"2026-05-18T00:08:12Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04539v1","created_at":"2026-05-18T00:08:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04539","created_at":"2026-05-18T00:08:12Z"},{"alias_kind":"pith_short_12","alias_value":"7PWZRHEXTSKH","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7PWZRHEXTSKHN6HK","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7PWZRHEX","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:71270b5a4c473c59c081e9ca9f0e4ec8e2e7af30d7fdbfea402ea77560fe2836","target":"graph","created_at":"2026-05-18T00:08:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Local Reconstruction Codes (LRCs) allow for recovery from a small number of erasures in a local manner based on just a few other codeword symbols. A maximally recoverable (MR) LRC offers the best possible blend of such local and global fault tolerance, guaranteeing recovery from all erasure patterns which are information-theoretically correctable given the presence of local recovery groups. In an $(n,r,h,a)$-LRC, the $n$ codeword symbols are partitioned into $r$ disjoint groups each of which include $a$ local parity checks capable of locally correcting $a$ erasures.\n  MR LRCs have received muc","authors_text":"Chaoping Xing, Lingfei Jin, Venkatesan Guruswami","cross_cats":["cs.CC","cs.DM","math.IT","math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-14T05:47:46Z","title":"Constructions of maximally recoverable local reconstruction codes via function fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04539","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d22b326fcdcf73ba7218d715a5518623a4c5580963aedc37261403c6eefb61b9","target":"record","created_at":"2026-05-18T00:08:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"91d793da115c04e785854f126e2a44a23379ff6f528765f1c4d0543ed70735c0","cross_cats_sorted":["cs.CC","cs.DM","math.IT","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-14T05:47:46Z","title_canon_sha256":"533246958cacd615e522aa12009588ecee2caa7618174c5e1671dfbbbf9f2974"},"schema_version":"1.0","source":{"id":"1808.04539","kind":"arxiv","version":1}},"canonical_sha256":"fbed989c979c9476f8eaf1d26ddafdcb306da303bd3a8da2d33714d514029d26","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fbed989c979c9476f8eaf1d26ddafdcb306da303bd3a8da2d33714d514029d26","first_computed_at":"2026-05-18T00:08:12.231537Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:12.231537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/tnB7UGt/JMrD7N7yO7IlIlU7w3sbniy6XIT0DvRDq0fl7EF2ILdDr+Nj+2knWaErznoC3tK9P7Iw9mIRZ43Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:12.232040Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.04539","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d22b326fcdcf73ba7218d715a5518623a4c5580963aedc37261403c6eefb61b9","sha256:71270b5a4c473c59c081e9ca9f0e4ec8e2e7af30d7fdbfea402ea77560fe2836"],"state_sha256":"2b81d739431f3e839b7e6504f6e585c897094af8c5b28cc584c2f18cf41e00e2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XQaZohu2giUmDyBOOPeSSmU+zVAlq7PJxagfrzxG1CTZsSoV4phO+QMI3kSnOz2ra3hQfsEdL5lgbGMJ9IxBDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T21:44:09.306115Z","bundle_sha256":"3ee140d5105ab9271c42dc12c7fdc45aa6d493213a9655a429cd9a6fe8dcaf5b"}}