{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:HL7VAWW5MFSI2EH5MYL27SCTL4","short_pith_number":"pith:HL7VAWW5","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"},"canonical_sha256":"3aff505add61648d10fd6617afc8535f0339be68d54e67efd8d180592f202d17","source":{"kind":"arxiv","id":"2607.03857","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.03857","created_at":"2026-07-07T02:18:10Z"},{"alias_kind":"arxiv_version","alias_value":"2607.03857v1","created_at":"2026-07-07T02:18:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.03857","created_at":"2026-07-07T02:18:10Z"},{"alias_kind":"pith_short_12","alias_value":"HL7VAWW5MFSI","created_at":"2026-07-07T02:18:10Z"},{"alias_kind":"pith_short_16","alias_value":"HL7VAWW5MFSI2EH5","created_at":"2026-07-07T02:18:10Z"},{"alias_kind":"pith_short_8","alias_value":"HL7VAWW5","created_at":"2026-07-07T02:18:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:HL7VAWW5MFSI2EH5MYL27SCTL4","target":"record","payload":{"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"},"canonical_sha256":"3aff505add61648d10fd6617afc8535f0339be68d54e67efd8d180592f202d17","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"},"source_kind":"arxiv","source_id":"2607.03857","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-07-07T02:18:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xSA4s/49Iy/3f+zd2PiQmoKHizYspnk50IsbYjtPC4+Mc+i9VF1IeCaowUuc+myjdxoOvYBAqEmkF40eW30uDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T08:39:27.487996Z"},"content_sha256":"dc8c222c041c03b2743d544147cdb3b6f6dc4497da1f3a989a5ea973d47d5c1f","schema_version":"1.0","event_id":"sha256:dc8c222c041c03b2743d544147cdb3b6f6dc4497da1f3a989a5ea973d47d5c1f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:HL7VAWW5MFSI2EH5MYL27SCTL4","target":"graph","payload":{"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"},"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-07-07T02:18:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f+IV7XtUWP6JGlFShShgOnx+jS7RVPWDrjwih+J1UsFJ1alni0rDJrWmuN2HH/rz9X24CPnT13vgvOc/NgIsCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T08:39:27.488497Z"},"content_sha256":"794233cf62d71e66d4afdf6d01c84bd497dca6d3503c1909d6bc520aa60a7c39","schema_version":"1.0","event_id":"sha256:794233cf62d71e66d4afdf6d01c84bd497dca6d3503c1909d6bc520aa60a7c39"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HL7VAWW5MFSI2EH5MYL27SCTL4/bundle.json","state_url":"https://pith.science/pith/HL7VAWW5MFSI2EH5MYL27SCTL4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HL7VAWW5MFSI2EH5MYL27SCTL4/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-08-01T08:39:27Z","links":{"resolver":"https://pith.science/pith/HL7VAWW5MFSI2EH5MYL27SCTL4","bundle":"https://pith.science/pith/HL7VAWW5MFSI2EH5MYL27SCTL4/bundle.json","state":"https://pith.science/pith/HL7VAWW5MFSI2EH5MYL27SCTL4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HL7VAWW5MFSI2EH5MYL27SCTL4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:HL7VAWW5MFSI2EH5MYL27SCTL4","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":"a31ce70132e83a0d203609ad8227ed8a869098532f2f55250d63976a294e6339","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-07-04T12:51:23Z","title_canon_sha256":"986fbed97bed213c1b1d118fab70ee6589fdc2a0b3c55f7ebb3e840843a0e37c"},"schema_version":"1.0","source":{"id":"2607.03857","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.03857","created_at":"2026-07-07T02:18:10Z"},{"alias_kind":"arxiv_version","alias_value":"2607.03857v1","created_at":"2026-07-07T02:18:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.03857","created_at":"2026-07-07T02:18:10Z"},{"alias_kind":"pith_short_12","alias_value":"HL7VAWW5MFSI","created_at":"2026-07-07T02:18:10Z"},{"alias_kind":"pith_short_16","alias_value":"HL7VAWW5MFSI2EH5","created_at":"2026-07-07T02:18:10Z"},{"alias_kind":"pith_short_8","alias_value":"HL7VAWW5","created_at":"2026-07-07T02:18:10Z"}],"graph_snapshots":[{"event_id":"sha256:794233cf62d71e66d4afdf6d01c84bd497dca6d3503c1909d6bc520aa60a7c39","target":"graph","created_at":"2026-07-07T02:18:10Z","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/2607.03857/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"B. Sundar Rajan, Santhi Kumari Kammila","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-07-04T12:51:23Z","title":"Function-Correcting Codes for Sum-Rank Metric"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.03857","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:dc8c222c041c03b2743d544147cdb3b6f6dc4497da1f3a989a5ea973d47d5c1f","target":"record","created_at":"2026-07-07T02:18:10Z","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":"a31ce70132e83a0d203609ad8227ed8a869098532f2f55250d63976a294e6339","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-07-04T12:51:23Z","title_canon_sha256":"986fbed97bed213c1b1d118fab70ee6589fdc2a0b3c55f7ebb3e840843a0e37c"},"schema_version":"1.0","source":{"id":"2607.03857","kind":"arxiv","version":1}},"canonical_sha256":"3aff505add61648d10fd6617afc8535f0339be68d54e67efd8d180592f202d17","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3aff505add61648d10fd6617afc8535f0339be68d54e67efd8d180592f202d17","first_computed_at":"2026-07-07T02:18:10.935348Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-07T02:18:10.935348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"INc6t5WSW5lSnJUJ/5jCNK874c6zdF0u+OPeq2kbyKwYmoo5ULoLpQ1N5muolCAYQ7wQ6galSMbL8fgGuUIYAg==","signature_status":"signed_v1","signed_at":"2026-07-07T02:18:10.935933Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.03857","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc8c222c041c03b2743d544147cdb3b6f6dc4497da1f3a989a5ea973d47d5c1f","sha256:794233cf62d71e66d4afdf6d01c84bd497dca6d3503c1909d6bc520aa60a7c39"],"state_sha256":"39dd16930838b839bfac7e76b47ac8c1c46d5de0e9e7594fd4923f2dd0fd408d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qL5a6jZusanpch3cIs81ecRUDMbblVRi4VLRYvRTMkWLfiiEnoJ5YjbDUwKrczzD0k+B9G5KBk1hk36VLUqCDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T08:39:27.493133Z","bundle_sha256":"24818f80f120d8e495886135a6285e101553f7cf945528b6106842e226bf4ed7"}}