{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:HL7VAWW5MFSI2EH5MYL27SCTL4","short_pith_number":"pith:HL7VAWW5","schema_version":"1.0","canonical_sha256":"3aff505add61648d10fd6617afc8535f0339be68d54e67efd8d180592f202d17","source":{"kind":"arxiv","id":"2607.03857","version":1},"attestation_state":"computed","paper":{"title":"Function-Correcting Codes for Sum-Rank Metric","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"B. Sundar Rajan, Santhi Kumari Kammila","submitted_at":"2026-07-04T12:51:23Z","abstract_excerpt":"Function-Correcting Codes (FCCs) are a class of codes designed to protect the evaluation of a specific function of a message against channel errors at a higher level than the level of protection for the message, while requiring significantly less redundancy than conventional error-correcting codes. In this paper, we study function-correcting codes under the sum-rank metric, which is a natural generalization of both the Hamming metric and the rank-metric and also we derive general upper and lower bounds on the optimal redundancy of FCCs in the sum-rank metric. In particular, we establish a Plot"},"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":"2607.03857","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-07-04T12:51:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"986fbed97bed213c1b1d118fab70ee6589fdc2a0b3c55f7ebb3e840843a0e37c","abstract_canon_sha256":"a31ce70132e83a0d203609ad8227ed8a869098532f2f55250d63976a294e6339"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T02:18:10.935933Z","signature_b64":"INc6t5WSW5lSnJUJ/5jCNK874c6zdF0u+OPeq2kbyKwYmoo5ULoLpQ1N5muolCAYQ7wQ6galSMbL8fgGuUIYAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3aff505add61648d10fd6617afc8535f0339be68d54e67efd8d180592f202d17","last_reissued_at":"2026-07-07T02:18:10.935348Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T02:18:10.935348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Function-Correcting Codes for Sum-Rank Metric","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"B. Sundar Rajan, Santhi Kumari Kammila","submitted_at":"2026-07-04T12:51:23Z","abstract_excerpt":"Function-Correcting Codes (FCCs) are a class of codes designed to protect the evaluation of a specific function of a message against channel errors at a higher level than the level of protection for the message, while requiring significantly less redundancy than conventional error-correcting codes. In this paper, we study function-correcting codes under the sum-rank metric, which is a natural generalization of both the Hamming metric and the rank-metric and also we derive general upper and lower bounds on the optimal redundancy of FCCs in the sum-rank metric. In particular, we establish a Plot"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.03857","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/2607.03857/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":"2607.03857","created_at":"2026-07-07T02:18:10.935453+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.03857v1","created_at":"2026-07-07T02:18:10.935453+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.03857","created_at":"2026-07-07T02:18:10.935453+00:00"},{"alias_kind":"pith_short_12","alias_value":"HL7VAWW5MFSI","created_at":"2026-07-07T02:18:10.935453+00:00"},{"alias_kind":"pith_short_16","alias_value":"HL7VAWW5MFSI2EH5","created_at":"2026-07-07T02:18:10.935453+00:00"},{"alias_kind":"pith_short_8","alias_value":"HL7VAWW5","created_at":"2026-07-07T02:18:10.935453+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/HL7VAWW5MFSI2EH5MYL27SCTL4","json":"https://pith.science/pith/HL7VAWW5MFSI2EH5MYL27SCTL4.json","graph_json":"https://pith.science/api/pith-number/HL7VAWW5MFSI2EH5MYL27SCTL4/graph.json","events_json":"https://pith.science/api/pith-number/HL7VAWW5MFSI2EH5MYL27SCTL4/events.json","paper":"https://pith.science/paper/HL7VAWW5"},"agent_actions":{"view_html":"https://pith.science/pith/HL7VAWW5MFSI2EH5MYL27SCTL4","download_json":"https://pith.science/pith/HL7VAWW5MFSI2EH5MYL27SCTL4.json","view_paper":"https://pith.science/paper/HL7VAWW5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.03857&json=true","fetch_graph":"https://pith.science/api/pith-number/HL7VAWW5MFSI2EH5MYL27SCTL4/graph.json","fetch_events":"https://pith.science/api/pith-number/HL7VAWW5MFSI2EH5MYL27SCTL4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HL7VAWW5MFSI2EH5MYL27SCTL4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HL7VAWW5MFSI2EH5MYL27SCTL4/action/storage_attestation","attest_author":"https://pith.science/pith/HL7VAWW5MFSI2EH5MYL27SCTL4/action/author_attestation","sign_citation":"https://pith.science/pith/HL7VAWW5MFSI2EH5MYL27SCTL4/action/citation_signature","submit_replication":"https://pith.science/pith/HL7VAWW5MFSI2EH5MYL27SCTL4/action/replication_record"}},"created_at":"2026-07-07T02:18:10.935453+00:00","updated_at":"2026-07-07T02:18:10.935453+00:00"}