{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5YVYYJUUKCF5P776JBCQ7QDIKS","short_pith_number":"pith:5YVYYJUU","canonical_record":{"source":{"id":"1705.05005","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-14T17:18:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f496b07579b05f02c79c22153ba65795f8dd975afaab0d7c0a48d930856d42c7","abstract_canon_sha256":"7dd5b6cedfbafd0c13d2514f4dbaf8ee23880df394b4ddc3ec7830b7a7e4380c"},"schema_version":"1.0"},"canonical_sha256":"ee2b8c2694508bd7fffe48450fc06854abb5e851747cbae0983187f51804cab6","source":{"kind":"arxiv","id":"1705.05005","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.05005","created_at":"2026-05-18T00:44:33Z"},{"alias_kind":"arxiv_version","alias_value":"1705.05005v1","created_at":"2026-05-18T00:44:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05005","created_at":"2026-05-18T00:44:33Z"},{"alias_kind":"pith_short_12","alias_value":"5YVYYJUUKCF5","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"5YVYYJUUKCF5P776","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"5YVYYJUU","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5YVYYJUUKCF5P776JBCQ7QDIKS","target":"record","payload":{"canonical_record":{"source":{"id":"1705.05005","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-14T17:18:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f496b07579b05f02c79c22153ba65795f8dd975afaab0d7c0a48d930856d42c7","abstract_canon_sha256":"7dd5b6cedfbafd0c13d2514f4dbaf8ee23880df394b4ddc3ec7830b7a7e4380c"},"schema_version":"1.0"},"canonical_sha256":"ee2b8c2694508bd7fffe48450fc06854abb5e851747cbae0983187f51804cab6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:33.086159Z","signature_b64":"dXnilVUY09H1sbBc0zCPK9d0aqiFn4Nw29ydgZ7EBrQwXdbr4YPmDZfvOmqVTxYezofs4yiu3PihRIWaNSxpBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee2b8c2694508bd7fffe48450fc06854abb5e851747cbae0983187f51804cab6","last_reissued_at":"2026-05-18T00:44:33.085698Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:33.085698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.05005","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:44:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ICm6nbOQ5gX/SDQ5N1Q/u6I2tZAuaVapyY7iemP3ZTo2Nesr4xaw002TXBtOOX2gwSx7lH9hkIkBeGvdS+EpAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T04:14:47.850356Z"},"content_sha256":"f0bda3da82c15ce162129d44e6b67955f6f3600b1d98c9d02df8e724c3dd1eff","schema_version":"1.0","event_id":"sha256:f0bda3da82c15ce162129d44e6b67955f6f3600b1d98c9d02df8e724c3dd1eff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5YVYYJUUKCF5P776JBCQ7QDIKS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Irregular Recovery and Unequal Locality for Locally Recoverable Codes with Availability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andrew Thangaraj, Sourbh Bhadane","submitted_at":"2017-05-14T17:18:17Z","abstract_excerpt":"A code is said to be a Locally Recoverable Code (LRC) with availability if every coordinate can be recovered from multiple disjoint sets of other coordinates called recovering sets. The vector of sizes of recovering sets of a coordinate is called its recovery profile. In this work, we consider LRCs with availability under two different settings: (1) irregular recovery: non-constant recovery profile that remains fixed for all coordinates, (2) unequal locality: regular recovery profile that can vary with coordinates. For each setting, we derive bounds for the minimum distance that generalize pre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05005","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:44:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MGPiFE672Rvu91JmJNY7ecnKMzoTDyNQTtniuNJBNZMc0K77PLztnrD+v1JKgPVuVQg4N7ntQJ1ETqjCHpVFAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T04:14:47.850804Z"},"content_sha256":"827b406521e1629a924c69735bac87accc940559d75eefe878a20e5b06928859","schema_version":"1.0","event_id":"sha256:827b406521e1629a924c69735bac87accc940559d75eefe878a20e5b06928859"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5YVYYJUUKCF5P776JBCQ7QDIKS/bundle.json","state_url":"https://pith.science/pith/5YVYYJUUKCF5P776JBCQ7QDIKS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5YVYYJUUKCF5P776JBCQ7QDIKS/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-08T04:14:47Z","links":{"resolver":"https://pith.science/pith/5YVYYJUUKCF5P776JBCQ7QDIKS","bundle":"https://pith.science/pith/5YVYYJUUKCF5P776JBCQ7QDIKS/bundle.json","state":"https://pith.science/pith/5YVYYJUUKCF5P776JBCQ7QDIKS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5YVYYJUUKCF5P776JBCQ7QDIKS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5YVYYJUUKCF5P776JBCQ7QDIKS","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":"7dd5b6cedfbafd0c13d2514f4dbaf8ee23880df394b4ddc3ec7830b7a7e4380c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-14T17:18:17Z","title_canon_sha256":"f496b07579b05f02c79c22153ba65795f8dd975afaab0d7c0a48d930856d42c7"},"schema_version":"1.0","source":{"id":"1705.05005","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.05005","created_at":"2026-05-18T00:44:33Z"},{"alias_kind":"arxiv_version","alias_value":"1705.05005v1","created_at":"2026-05-18T00:44:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05005","created_at":"2026-05-18T00:44:33Z"},{"alias_kind":"pith_short_12","alias_value":"5YVYYJUUKCF5","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"5YVYYJUUKCF5P776","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"5YVYYJUU","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:827b406521e1629a924c69735bac87accc940559d75eefe878a20e5b06928859","target":"graph","created_at":"2026-05-18T00:44:33Z","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":"A code is said to be a Locally Recoverable Code (LRC) with availability if every coordinate can be recovered from multiple disjoint sets of other coordinates called recovering sets. The vector of sizes of recovering sets of a coordinate is called its recovery profile. In this work, we consider LRCs with availability under two different settings: (1) irregular recovery: non-constant recovery profile that remains fixed for all coordinates, (2) unequal locality: regular recovery profile that can vary with coordinates. For each setting, we derive bounds for the minimum distance that generalize pre","authors_text":"Andrew Thangaraj, Sourbh Bhadane","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-14T17:18:17Z","title":"Irregular Recovery and Unequal Locality for Locally Recoverable Codes with Availability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05005","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:f0bda3da82c15ce162129d44e6b67955f6f3600b1d98c9d02df8e724c3dd1eff","target":"record","created_at":"2026-05-18T00:44:33Z","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":"7dd5b6cedfbafd0c13d2514f4dbaf8ee23880df394b4ddc3ec7830b7a7e4380c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-14T17:18:17Z","title_canon_sha256":"f496b07579b05f02c79c22153ba65795f8dd975afaab0d7c0a48d930856d42c7"},"schema_version":"1.0","source":{"id":"1705.05005","kind":"arxiv","version":1}},"canonical_sha256":"ee2b8c2694508bd7fffe48450fc06854abb5e851747cbae0983187f51804cab6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee2b8c2694508bd7fffe48450fc06854abb5e851747cbae0983187f51804cab6","first_computed_at":"2026-05-18T00:44:33.085698Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:33.085698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dXnilVUY09H1sbBc0zCPK9d0aqiFn4Nw29ydgZ7EBrQwXdbr4YPmDZfvOmqVTxYezofs4yiu3PihRIWaNSxpBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:33.086159Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.05005","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0bda3da82c15ce162129d44e6b67955f6f3600b1d98c9d02df8e724c3dd1eff","sha256:827b406521e1629a924c69735bac87accc940559d75eefe878a20e5b06928859"],"state_sha256":"1a0d45aed20b1631e0ad08c689590adc44ef168fb28f48f6a761343e36c4c541"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WNx84CentpgG/yU1zGFlz16ubh2XimrbrZiSLe97eOvTMLmsqFk3aBiuJQvyCjqlZ4hd0d0FxToNkuTckPCaCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T04:14:47.853482Z","bundle_sha256":"bbecd893dd36bed4899e5f0dc75d2fcfa4d45b0cfc078275ce7e3188a2ad8be2"}}