{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:IZNRXGHMQPVQUNN52TM254WAK7","short_pith_number":"pith:IZNRXGHM","canonical_record":{"source":{"id":"1607.02817","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-11T04:32:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cfa619d355edc29327fdf71b66932d2e0ddeb3be7e877f5308c70bca21060f10","abstract_canon_sha256":"6487e97c00d3e53fae1d7c6b9b4abb63a2683d74b8bf661d7e11861bf59fa781"},"schema_version":"1.0"},"canonical_sha256":"465b1b98ec83eb0a35bdd4d9aef2c057f8b7b65cb1edb1aacb9c80ce9215b544","source":{"kind":"arxiv","id":"1607.02817","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.02817","created_at":"2026-05-18T01:00:19Z"},{"alias_kind":"arxiv_version","alias_value":"1607.02817v3","created_at":"2026-05-18T01:00:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02817","created_at":"2026-05-18T01:00:19Z"},{"alias_kind":"pith_short_12","alias_value":"IZNRXGHMQPVQ","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IZNRXGHMQPVQUNN5","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IZNRXGHM","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:IZNRXGHMQPVQUNN52TM254WAK7","target":"record","payload":{"canonical_record":{"source":{"id":"1607.02817","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-11T04:32:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cfa619d355edc29327fdf71b66932d2e0ddeb3be7e877f5308c70bca21060f10","abstract_canon_sha256":"6487e97c00d3e53fae1d7c6b9b4abb63a2683d74b8bf661d7e11861bf59fa781"},"schema_version":"1.0"},"canonical_sha256":"465b1b98ec83eb0a35bdd4d9aef2c057f8b7b65cb1edb1aacb9c80ce9215b544","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:19.198956Z","signature_b64":"cmEpep8xdT5RNKLmNtOAOqzG3Aul8lGyd2eX+slmKCWs+WzNXYj3at8Kcn+FjUbowhwhzxJYNW0N2+mAqf6tDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"465b1b98ec83eb0a35bdd4d9aef2c057f8b7b65cb1edb1aacb9c80ce9215b544","last_reissued_at":"2026-05-18T01:00:19.198214Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:19.198214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.02817","source_version":3,"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-18T01:00:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"brKB1TI2Iair4iLmYLqI1/LISmEVzSnOqPv+CBHY10yxRGXusQFXxcaRllvOKLkLoXSnPqNIVm4tU3XoBY5WCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:11:10.301039Z"},"content_sha256":"6920475feb8867329f21f26ae5f9cf16b4a75d8c0033e1d2c314c73c4f8f9ac0","schema_version":"1.0","event_id":"sha256:6920475feb8867329f21f26ae5f9cf16b4a75d8c0033e1d2c314c73c4f8f9ac0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:IZNRXGHMQPVQUNN52TM254WAK7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Binary Codes with Locality for Four Erasures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"K. P. Prasanth, P. Vijay Kumar, S. B. Balaji","submitted_at":"2016-07-11T04:32:55Z","abstract_excerpt":"In this paper, codes with locality for four erasures are considered. An upper bound on the rate of codes with locality with sequential recovery from four erasures is derived. The rate bound derived here is field independent. An optimal construction for binary codes meeting this rate bound is also provided. The construction is based on regular graphs of girth $6$ and employs the sequential approach of locally recovering from multiple erasures. An extension of this construction that generates codes which can sequentially recover from five erasures is also presented."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02817","kind":"arxiv","version":3},"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-18T01:00:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XBLKq0IbfFsDZFk8YimpYMWr6z1snnql/QjxwCUn6N9oHBaudD2TS5lvSE5d+N3pwigszFVP0umG444c5rqWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:11:10.301390Z"},"content_sha256":"c53ad04795385aa483bc7028ff464105fcd21e2811d0247260632ddaaf4ff00a","schema_version":"1.0","event_id":"sha256:c53ad04795385aa483bc7028ff464105fcd21e2811d0247260632ddaaf4ff00a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IZNRXGHMQPVQUNN52TM254WAK7/bundle.json","state_url":"https://pith.science/pith/IZNRXGHMQPVQUNN52TM254WAK7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IZNRXGHMQPVQUNN52TM254WAK7/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-02T14:11:10Z","links":{"resolver":"https://pith.science/pith/IZNRXGHMQPVQUNN52TM254WAK7","bundle":"https://pith.science/pith/IZNRXGHMQPVQUNN52TM254WAK7/bundle.json","state":"https://pith.science/pith/IZNRXGHMQPVQUNN52TM254WAK7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IZNRXGHMQPVQUNN52TM254WAK7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IZNRXGHMQPVQUNN52TM254WAK7","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":"6487e97c00d3e53fae1d7c6b9b4abb63a2683d74b8bf661d7e11861bf59fa781","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-11T04:32:55Z","title_canon_sha256":"cfa619d355edc29327fdf71b66932d2e0ddeb3be7e877f5308c70bca21060f10"},"schema_version":"1.0","source":{"id":"1607.02817","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.02817","created_at":"2026-05-18T01:00:19Z"},{"alias_kind":"arxiv_version","alias_value":"1607.02817v3","created_at":"2026-05-18T01:00:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02817","created_at":"2026-05-18T01:00:19Z"},{"alias_kind":"pith_short_12","alias_value":"IZNRXGHMQPVQ","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IZNRXGHMQPVQUNN5","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IZNRXGHM","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:c53ad04795385aa483bc7028ff464105fcd21e2811d0247260632ddaaf4ff00a","target":"graph","created_at":"2026-05-18T01:00:19Z","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":"In this paper, codes with locality for four erasures are considered. An upper bound on the rate of codes with locality with sequential recovery from four erasures is derived. The rate bound derived here is field independent. An optimal construction for binary codes meeting this rate bound is also provided. The construction is based on regular graphs of girth $6$ and employs the sequential approach of locally recovering from multiple erasures. An extension of this construction that generates codes which can sequentially recover from five erasures is also presented.","authors_text":"K. P. Prasanth, P. Vijay Kumar, S. B. Balaji","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-11T04:32:55Z","title":"Binary Codes with Locality for Four Erasures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02817","kind":"arxiv","version":3},"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:6920475feb8867329f21f26ae5f9cf16b4a75d8c0033e1d2c314c73c4f8f9ac0","target":"record","created_at":"2026-05-18T01:00:19Z","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":"6487e97c00d3e53fae1d7c6b9b4abb63a2683d74b8bf661d7e11861bf59fa781","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-11T04:32:55Z","title_canon_sha256":"cfa619d355edc29327fdf71b66932d2e0ddeb3be7e877f5308c70bca21060f10"},"schema_version":"1.0","source":{"id":"1607.02817","kind":"arxiv","version":3}},"canonical_sha256":"465b1b98ec83eb0a35bdd4d9aef2c057f8b7b65cb1edb1aacb9c80ce9215b544","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"465b1b98ec83eb0a35bdd4d9aef2c057f8b7b65cb1edb1aacb9c80ce9215b544","first_computed_at":"2026-05-18T01:00:19.198214Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:19.198214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cmEpep8xdT5RNKLmNtOAOqzG3Aul8lGyd2eX+slmKCWs+WzNXYj3at8Kcn+FjUbowhwhzxJYNW0N2+mAqf6tDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:19.198956Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.02817","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6920475feb8867329f21f26ae5f9cf16b4a75d8c0033e1d2c314c73c4f8f9ac0","sha256:c53ad04795385aa483bc7028ff464105fcd21e2811d0247260632ddaaf4ff00a"],"state_sha256":"b9e17fb2ef9dc07e7705a71603af32e0dafeb2f61faf441a1b582a88119061bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y6Tvrm8LbtcAlct7WaVVMo+aNWcvkVQu4XaFoEsRsZTQ2gygdxkev1WyYYqIWfHzJD8xrRrRMNOWxYWk3TAxBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T14:11:10.303217Z","bundle_sha256":"e3735eb6150734961be88759af97a6e6973485f460a331b01e2688c034b929a8"}}