{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:OEOXHLC7VRXGKMWS2M42QM25CG","short_pith_number":"pith:OEOXHLC7","canonical_record":{"source":{"id":"1901.06915","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-21T13:02:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2b0631f018ad078ea995504eb58cac137a3493b85c6b2575a1b805f97fc0782c","abstract_canon_sha256":"c2a973299d97b8546c78540d99f85859f1feea6e1bdcc6b739a135cecf39f0d1"},"schema_version":"1.0"},"canonical_sha256":"711d73ac5fac6e6532d2d339a8335d11880de4060514967a75bea59909617dde","source":{"kind":"arxiv","id":"1901.06915","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.06915","created_at":"2026-05-17T23:53:08Z"},{"alias_kind":"arxiv_version","alias_value":"1901.06915v2","created_at":"2026-05-17T23:53:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.06915","created_at":"2026-05-17T23:53:08Z"},{"alias_kind":"pith_short_12","alias_value":"OEOXHLC7VRXG","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OEOXHLC7VRXGKMWS","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OEOXHLC7","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:OEOXHLC7VRXGKMWS2M42QM25CG","target":"record","payload":{"canonical_record":{"source":{"id":"1901.06915","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-21T13:02:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2b0631f018ad078ea995504eb58cac137a3493b85c6b2575a1b805f97fc0782c","abstract_canon_sha256":"c2a973299d97b8546c78540d99f85859f1feea6e1bdcc6b739a135cecf39f0d1"},"schema_version":"1.0"},"canonical_sha256":"711d73ac5fac6e6532d2d339a8335d11880de4060514967a75bea59909617dde","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:08.817262Z","signature_b64":"IQhujHLPh3Cz3VWhx7u0zjXhraFeLGBCVPAgLs7K3E80FKY2YrYMeB+qTR6i8e/R2cktPFxZCNwlOrcNOpXsDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"711d73ac5fac6e6532d2d339a8335d11880de4060514967a75bea59909617dde","last_reissued_at":"2026-05-17T23:53:08.816734Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:08.816734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.06915","source_version":2,"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-17T23:53:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EpbY1QWxfq9UtLxmNAqvx36RWJtfvnpdu1n+epymXgNKRMqZ8TXHlyXaqTjM47eVC5/2P9+fGGQdbcbiZnmYDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:40:31.529115Z"},"content_sha256":"d4061bfdc7fbf71a3e9136b398189fed42d941f009b8e47c46d75ce9e869c5a7","schema_version":"1.0","event_id":"sha256:d4061bfdc7fbf71a3e9136b398189fed42d941f009b8e47c46d75ce9e869c5a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:OEOXHLC7VRXGKMWS2M42QM25CG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Bounds on the Field Size for Maximally Recoverable Codes Instantiating Grid-like Topologies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gennian Ge, Jingxue Ma, Xiangliang Kong","submitted_at":"2019-01-21T13:02:16Z","abstract_excerpt":"In recent years, the rapidly increasing amounts of data created and processed through the internet resulted in distributed storage systems employing erasure coding based schemes. Aiming to balance the tradeoff between data recovery for correlated failures and efficient encoding and decoding, distributed storage systems employing maximally recoverable codes came up. Unifying a number of topologies considered both in theory and practice, Gopalan et al. \\cite{Gopalan2017} initiated the study of maximally recoverable codes for grid-like topologies.\n  In this paper, we focus on the maximally recove"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.06915","kind":"arxiv","version":2},"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-17T23:53:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CtsATb0y+uRXV+j6vos5+r9HX4nkixBAmJStLJXSCtxkC7T+XBAAvuzM1BJtn+8BDMAAKvUkzqt04tDA7bCnCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:40:31.529809Z"},"content_sha256":"9b730897462647fd40d80bfb4ec8ff145f3bb72e5c8e36850ac250a9bc096dc4","schema_version":"1.0","event_id":"sha256:9b730897462647fd40d80bfb4ec8ff145f3bb72e5c8e36850ac250a9bc096dc4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OEOXHLC7VRXGKMWS2M42QM25CG/bundle.json","state_url":"https://pith.science/pith/OEOXHLC7VRXGKMWS2M42QM25CG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OEOXHLC7VRXGKMWS2M42QM25CG/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-05-25T17:40:31Z","links":{"resolver":"https://pith.science/pith/OEOXHLC7VRXGKMWS2M42QM25CG","bundle":"https://pith.science/pith/OEOXHLC7VRXGKMWS2M42QM25CG/bundle.json","state":"https://pith.science/pith/OEOXHLC7VRXGKMWS2M42QM25CG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OEOXHLC7VRXGKMWS2M42QM25CG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:OEOXHLC7VRXGKMWS2M42QM25CG","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":"c2a973299d97b8546c78540d99f85859f1feea6e1bdcc6b739a135cecf39f0d1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-21T13:02:16Z","title_canon_sha256":"2b0631f018ad078ea995504eb58cac137a3493b85c6b2575a1b805f97fc0782c"},"schema_version":"1.0","source":{"id":"1901.06915","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.06915","created_at":"2026-05-17T23:53:08Z"},{"alias_kind":"arxiv_version","alias_value":"1901.06915v2","created_at":"2026-05-17T23:53:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.06915","created_at":"2026-05-17T23:53:08Z"},{"alias_kind":"pith_short_12","alias_value":"OEOXHLC7VRXG","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OEOXHLC7VRXGKMWS","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OEOXHLC7","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:9b730897462647fd40d80bfb4ec8ff145f3bb72e5c8e36850ac250a9bc096dc4","target":"graph","created_at":"2026-05-17T23:53:08Z","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 recent years, the rapidly increasing amounts of data created and processed through the internet resulted in distributed storage systems employing erasure coding based schemes. Aiming to balance the tradeoff between data recovery for correlated failures and efficient encoding and decoding, distributed storage systems employing maximally recoverable codes came up. Unifying a number of topologies considered both in theory and practice, Gopalan et al. \\cite{Gopalan2017} initiated the study of maximally recoverable codes for grid-like topologies.\n  In this paper, we focus on the maximally recove","authors_text":"Gennian Ge, Jingxue Ma, Xiangliang Kong","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-21T13:02:16Z","title":"New Bounds on the Field Size for Maximally Recoverable Codes Instantiating Grid-like Topologies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.06915","kind":"arxiv","version":2},"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:d4061bfdc7fbf71a3e9136b398189fed42d941f009b8e47c46d75ce9e869c5a7","target":"record","created_at":"2026-05-17T23:53:08Z","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":"c2a973299d97b8546c78540d99f85859f1feea6e1bdcc6b739a135cecf39f0d1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-21T13:02:16Z","title_canon_sha256":"2b0631f018ad078ea995504eb58cac137a3493b85c6b2575a1b805f97fc0782c"},"schema_version":"1.0","source":{"id":"1901.06915","kind":"arxiv","version":2}},"canonical_sha256":"711d73ac5fac6e6532d2d339a8335d11880de4060514967a75bea59909617dde","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"711d73ac5fac6e6532d2d339a8335d11880de4060514967a75bea59909617dde","first_computed_at":"2026-05-17T23:53:08.816734Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:08.816734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IQhujHLPh3Cz3VWhx7u0zjXhraFeLGBCVPAgLs7K3E80FKY2YrYMeB+qTR6i8e/R2cktPFxZCNwlOrcNOpXsDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:08.817262Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.06915","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d4061bfdc7fbf71a3e9136b398189fed42d941f009b8e47c46d75ce9e869c5a7","sha256:9b730897462647fd40d80bfb4ec8ff145f3bb72e5c8e36850ac250a9bc096dc4"],"state_sha256":"cef12aa659e5cf7d35d6bae3d0c70a6e376ceb5e9c2d6bb5875df29f6fcea062"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1oIvOVhfvBl2aIh2QjWfqKw2PNTJLwkOVgo0XT+wxTZNGDXvtCrrs0H9ooaA7xZ1WKce8Us19hgLi3TfTQY2CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:40:31.533166Z","bundle_sha256":"a29857101f18f97967e1ff58153a8a838b18efb18cc8c549bbfb562ee61dece3"}}