{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FCFLEK2BFI2VWOJEPQ3XEJL4XH","short_pith_number":"pith:FCFLEK2B","schema_version":"1.0","canonical_sha256":"288ab22b412a355b39247c3772257cb9ecdbc7e9c90249a93e32e9c92143b317","source":{"kind":"arxiv","id":"2511.18420","version":3},"attestation_state":"computed","paper":{"title":"Function-Correcting Codes With Data Protection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"B. Sundar Rajan, Camilla Hollanti, Charul Rajput, Ragnar Freij-Hollanti","submitted_at":"2025-11-23T12:15:57Z","abstract_excerpt":"Function-correcting codes (FCCs) are designed to provide error protection for the value of a function computed on the data. Existing work typically focuses solely on protecting the function value and not the underlying data. In this work, we propose a general framework that offers protection for both the data and the function values. Since protecting the data inherently contributes to protecting the function value, we focus on scenarios where the function value requires stronger protection than the data itself. We first introduce a more general approach and a framework for function-correcting "},"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":"2511.18420","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-11-23T12:15:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7936549538d650d91baf901205372bc09f9927501142b0b5696afa8794779103","abstract_canon_sha256":"6eb0d13785e07942e96f9422a48d27e7d9ba21321beee1566d23e047cf3e3a1d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:05:02.673904Z","signature_b64":"DNw2UXO+FV5Ipb9oIbtmx5nD3LtOD8UGkfSJ7eFV3OREjX/3Wz7srBmWLlzv6u1dO47ky6avzvMMQ6FDa9c9AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"288ab22b412a355b39247c3772257cb9ecdbc7e9c90249a93e32e9c92143b317","last_reissued_at":"2026-05-20T01:05:02.672862Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:05:02.672862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Function-Correcting Codes With Data Protection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"B. Sundar Rajan, Camilla Hollanti, Charul Rajput, Ragnar Freij-Hollanti","submitted_at":"2025-11-23T12:15:57Z","abstract_excerpt":"Function-correcting codes (FCCs) are designed to provide error protection for the value of a function computed on the data. Existing work typically focuses solely on protecting the function value and not the underlying data. In this work, we propose a general framework that offers protection for both the data and the function values. Since protecting the data inherently contributes to protecting the function value, we focus on scenarios where the function value requires stronger protection than the data itself. We first introduce a more general approach and a framework for function-correcting "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.18420","kind":"arxiv","version":3},"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/2511.18420/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":"2511.18420","created_at":"2026-05-20T01:05:02.673001+00:00"},{"alias_kind":"arxiv_version","alias_value":"2511.18420v3","created_at":"2026-05-20T01:05:02.673001+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.18420","created_at":"2026-05-20T01:05:02.673001+00:00"},{"alias_kind":"pith_short_12","alias_value":"FCFLEK2BFI2V","created_at":"2026-05-20T01:05:02.673001+00:00"},{"alias_kind":"pith_short_16","alias_value":"FCFLEK2BFI2VWOJE","created_at":"2026-05-20T01:05:02.673001+00:00"},{"alias_kind":"pith_short_8","alias_value":"FCFLEK2B","created_at":"2026-05-20T01:05:02.673001+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2605.14023","citing_title":"Function-Correction with Optimal Data Protection for the General Hamming Code Membership","ref_index":9,"is_internal_anchor":true},{"citing_arxiv_id":"2605.03370","citing_title":"Generalized Function-Correcting Partition Codes","ref_index":3,"is_internal_anchor":true},{"citing_arxiv_id":"2604.26397","citing_title":"Existence and Constructions of Strict Function-Correcting Codes with Data Protection","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FCFLEK2BFI2VWOJEPQ3XEJL4XH","json":"https://pith.science/pith/FCFLEK2BFI2VWOJEPQ3XEJL4XH.json","graph_json":"https://pith.science/api/pith-number/FCFLEK2BFI2VWOJEPQ3XEJL4XH/graph.json","events_json":"https://pith.science/api/pith-number/FCFLEK2BFI2VWOJEPQ3XEJL4XH/events.json","paper":"https://pith.science/paper/FCFLEK2B"},"agent_actions":{"view_html":"https://pith.science/pith/FCFLEK2BFI2VWOJEPQ3XEJL4XH","download_json":"https://pith.science/pith/FCFLEK2BFI2VWOJEPQ3XEJL4XH.json","view_paper":"https://pith.science/paper/FCFLEK2B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2511.18420&json=true","fetch_graph":"https://pith.science/api/pith-number/FCFLEK2BFI2VWOJEPQ3XEJL4XH/graph.json","fetch_events":"https://pith.science/api/pith-number/FCFLEK2BFI2VWOJEPQ3XEJL4XH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FCFLEK2BFI2VWOJEPQ3XEJL4XH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FCFLEK2BFI2VWOJEPQ3XEJL4XH/action/storage_attestation","attest_author":"https://pith.science/pith/FCFLEK2BFI2VWOJEPQ3XEJL4XH/action/author_attestation","sign_citation":"https://pith.science/pith/FCFLEK2BFI2VWOJEPQ3XEJL4XH/action/citation_signature","submit_replication":"https://pith.science/pith/FCFLEK2BFI2VWOJEPQ3XEJL4XH/action/replication_record"}},"created_at":"2026-05-20T01:05:02.673001+00:00","updated_at":"2026-05-20T01:05:02.673001+00:00"}