{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:6AW2OVR4QVKV7ZXREVPEP375MM","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":"8af903dcf1105f6897ef99ab4b72c6d4ea323cfa3e9eb95565e1da4fe2a864e4","cross_cats_sorted":["cs.DM","math.CO","math.IT","math.NT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-06-25T15:44:37Z","title_canon_sha256":"a8dff0bed0605a37472efa24cc13c04d71c9e6bca896485921f736bae4297b81"},"schema_version":"1.0","source":{"id":"2606.27179","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.27179","created_at":"2026-06-26T01:16:12Z"},{"alias_kind":"arxiv_version","alias_value":"2606.27179v1","created_at":"2026-06-26T01:16:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.27179","created_at":"2026-06-26T01:16:12Z"},{"alias_kind":"pith_short_12","alias_value":"6AW2OVR4QVKV","created_at":"2026-06-26T01:16:12Z"},{"alias_kind":"pith_short_16","alias_value":"6AW2OVR4QVKV7ZXR","created_at":"2026-06-26T01:16:12Z"},{"alias_kind":"pith_short_8","alias_value":"6AW2OVR4","created_at":"2026-06-26T01:16:12Z"}],"graph_snapshots":[{"event_id":"sha256:6d3ee0693e3abfcbdfaed7b48293cba4f72d50740421c79a550bf14376eafae5","target":"graph","created_at":"2026-06-26T01:16: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.27179/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Erasure codes are a core component of most existing large-scale distributed storage systems, ensuring reliability against node failures. Recent work has shown that adapting code parameters to changing node failure rates can lead to significant storage savings. The default approach is to re-encode the data under a new code, which consumes substantial system resources. Code conversion was introduced to reduce this cost. However, existing work has mainly focused on conversions within specific classes of codes. In this paper, we study scalar linear code conversion in the merge regime for arbitrary","authors_text":"Anina Gruica, Benjamin Jany, Stanislav Kruglik","cross_cats":["cs.DM","math.CO","math.IT","math.NT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-06-25T15:44:37Z","title":"Linear Code Conversion in the Merge Regime: General Bounds and Reed--Muller Constructions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.27179","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:0e4e1da821b1de74dfb31df8025a429002e8598edcca619068463e4dfb6f69c1","target":"record","created_at":"2026-06-26T01:16: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":"8af903dcf1105f6897ef99ab4b72c6d4ea323cfa3e9eb95565e1da4fe2a864e4","cross_cats_sorted":["cs.DM","math.CO","math.IT","math.NT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-06-25T15:44:37Z","title_canon_sha256":"a8dff0bed0605a37472efa24cc13c04d71c9e6bca896485921f736bae4297b81"},"schema_version":"1.0","source":{"id":"2606.27179","kind":"arxiv","version":1}},"canonical_sha256":"f02da7563c85555fe6f1255e47effd630a27b1b1c7a4581311c66e522def5188","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f02da7563c85555fe6f1255e47effd630a27b1b1c7a4581311c66e522def5188","first_computed_at":"2026-06-26T01:16:12.687261Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-26T01:16:12.687261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PaJ5CtqwrXbP3SpLOTwr2PM5c3buvqmPD8gM/5/53OpcWYHf9MsIHNKri+0UvE0GV7qtv5oJ3CCTgehAU4b9Cg==","signature_status":"signed_v1","signed_at":"2026-06-26T01:16:12.687658Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.27179","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e4e1da821b1de74dfb31df8025a429002e8598edcca619068463e4dfb6f69c1","sha256:6d3ee0693e3abfcbdfaed7b48293cba4f72d50740421c79a550bf14376eafae5"],"state_sha256":"20bb2489a7de30690b3ca44d3c8a5daa5109f69268659e7b39b9d2a83b6bb97b"}