{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:UOLBFHL6AFDY3FCPAKGYHEDHTZ","short_pith_number":"pith:UOLBFHL6","schema_version":"1.0","canonical_sha256":"a396129d7e01478d944f028d8390679e4847fc5b550afa60830f34e2f11390d6","source":{"kind":"arxiv","id":"2608.00810","version":1},"attestation_state":"computed","paper":{"title":"New Results Towards the Characterization of Service Rate Region of Reed-Muller Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chenyang Yu, Luopeng Sun, Yiwei Zhang","submitted_at":"2026-08-01T18:25:16Z","abstract_excerpt":"The Service Rate Region (SRR) serves as a critical metric for evaluating the concurrent service capacity of distributed storage systems. While several works have characterized the SRR for MDS codes and first order Reed-Muller codes, for high-order Reed-Muller codes the problem becomes way more complicated and only partial results were given by Ly, Soljanin, and Lalitha [IEEE ISIT 2025]. In this paper, we refine the SRR analysis by explicitly characterizing the intersection patterns of recovery sets for high-order Reed-Muller codes, deriving the exact region for the case m=r+1 and providing new"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2608.00810","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-08-01T18:25:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1497c21dce6f3d099f53e704bb1365d2e28824bb4fe3f6b0f3e0c819a44de3bb","abstract_canon_sha256":"ae90213bebdffc4dd0b58393b4576f588960388b959eb37ca48cb69574ff92f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-04T01:55:11.303333Z","signature_b64":"14Kypu1wobr200UsoWfwK3khXSxPJdKxmRUccbj5ZzZ4235+evh+WVX91ykO120V9tyWfZYUCY1RfX67GCR6AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a396129d7e01478d944f028d8390679e4847fc5b550afa60830f34e2f11390d6","last_reissued_at":"2026-08-04T01:55:11.301656Z","signature_status":"signed_v1","first_computed_at":"2026-08-04T01:55:11.301656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Results Towards the Characterization of Service Rate Region of Reed-Muller Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chenyang Yu, Luopeng Sun, Yiwei Zhang","submitted_at":"2026-08-01T18:25:16Z","abstract_excerpt":"The Service Rate Region (SRR) serves as a critical metric for evaluating the concurrent service capacity of distributed storage systems. While several works have characterized the SRR for MDS codes and first order Reed-Muller codes, for high-order Reed-Muller codes the problem becomes way more complicated and only partial results were given by Ly, Soljanin, and Lalitha [IEEE ISIT 2025]. In this paper, we refine the SRR analysis by explicitly characterizing the intersection patterns of recovery sets for high-order Reed-Muller codes, deriving the exact region for the case m=r+1 and providing new"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.00810","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2608.00810/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2608.00810","created_at":"2026-08-04T01:55:11.303012+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.00810v1","created_at":"2026-08-04T01:55:11.303012+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.00810","created_at":"2026-08-04T01:55:11.303012+00:00"},{"alias_kind":"pith_short_12","alias_value":"UOLBFHL6AFDY","created_at":"2026-08-04T01:55:11.303012+00:00"},{"alias_kind":"pith_short_16","alias_value":"UOLBFHL6AFDY3FCP","created_at":"2026-08-04T01:55:11.303012+00:00"},{"alias_kind":"pith_short_8","alias_value":"UOLBFHL6","created_at":"2026-08-04T01:55:11.303012+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UOLBFHL6AFDY3FCPAKGYHEDHTZ","json":"https://pith.science/pith/UOLBFHL6AFDY3FCPAKGYHEDHTZ.json","graph_json":"https://pith.science/api/pith-number/UOLBFHL6AFDY3FCPAKGYHEDHTZ/graph.json","events_json":"https://pith.science/api/pith-number/UOLBFHL6AFDY3FCPAKGYHEDHTZ/events.json","paper":"https://pith.science/paper/UOLBFHL6"},"agent_actions":{"view_html":"https://pith.science/pith/UOLBFHL6AFDY3FCPAKGYHEDHTZ","download_json":"https://pith.science/pith/UOLBFHL6AFDY3FCPAKGYHEDHTZ.json","view_paper":"https://pith.science/paper/UOLBFHL6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.00810&json=true","fetch_graph":"https://pith.science/api/pith-number/UOLBFHL6AFDY3FCPAKGYHEDHTZ/graph.json","fetch_events":"https://pith.science/api/pith-number/UOLBFHL6AFDY3FCPAKGYHEDHTZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UOLBFHL6AFDY3FCPAKGYHEDHTZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UOLBFHL6AFDY3FCPAKGYHEDHTZ/action/storage_attestation","attest_author":"https://pith.science/pith/UOLBFHL6AFDY3FCPAKGYHEDHTZ/action/author_attestation","sign_citation":"https://pith.science/pith/UOLBFHL6AFDY3FCPAKGYHEDHTZ/action/citation_signature","submit_replication":"https://pith.science/pith/UOLBFHL6AFDY3FCPAKGYHEDHTZ/action/replication_record"}},"created_at":"2026-08-04T01:55:11.303012+00:00","updated_at":"2026-08-04T01:55:11.303012+00:00"}