{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:2J2JRJAW6O5N47WJFV4F5PUK6L","short_pith_number":"pith:2J2JRJAW","schema_version":"1.0","canonical_sha256":"d27498a416f3bade7ec92d785ebe8af2fba1f7422513ec059e3372bb20394f67","source":{"kind":"arxiv","id":"2502.09817","version":1},"attestation_state":"computed","paper":{"title":"Vector Linear Secure Aggregation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hua Sun, Xihang Yuan","submitted_at":"2025-02-13T23:28:55Z","abstract_excerpt":"The secure summation problem, where $K$ users wish to compute the sum of their inputs at a server while revealing nothing about all $K$ inputs beyond the desired sum, is generalized in two aspects - first, the desired function is an arbitrary linear function (multiple linear combinations) of the $K$ inputs instead of just the sum; second, rather than protecting all $K$ inputs, we wish to guarantee that no information is leaked about an arbitrary linear function of the $K$ inputs. For this vector linear generalization of the secure summation problem, we characterize the optimal randomness cost,"},"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":"2502.09817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-02-13T23:28:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2638106b0d97f59972ae3350297398d9270d38687b1ec66a71ff52c0c1b69139","abstract_canon_sha256":"ead2ebde3fa1257f0fa1d1d83afb72d7a49a8a5c231dcd306b55701555b4f269"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:14:12.689225Z","signature_b64":"RZBjRdbZccFjfeK+lTGTPNHFdxBhrizd4mzgXr5w6U9dS8icQnQsYKjsSSQ5GIq6cfw8LlXBNkAn5yvrB0BoDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d27498a416f3bade7ec92d785ebe8af2fba1f7422513ec059e3372bb20394f67","last_reissued_at":"2026-07-05T10:14:12.688709Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:14:12.688709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Vector Linear Secure Aggregation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hua Sun, Xihang Yuan","submitted_at":"2025-02-13T23:28:55Z","abstract_excerpt":"The secure summation problem, where $K$ users wish to compute the sum of their inputs at a server while revealing nothing about all $K$ inputs beyond the desired sum, is generalized in two aspects - first, the desired function is an arbitrary linear function (multiple linear combinations) of the $K$ inputs instead of just the sum; second, rather than protecting all $K$ inputs, we wish to guarantee that no information is leaked about an arbitrary linear function of the $K$ inputs. For this vector linear generalization of the secure summation problem, we characterize the optimal randomness cost,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.09817","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/2502.09817/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":"2502.09817","created_at":"2026-07-05T10:14:12.688771+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.09817v1","created_at":"2026-07-05T10:14:12.688771+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.09817","created_at":"2026-07-05T10:14:12.688771+00:00"},{"alias_kind":"pith_short_12","alias_value":"2J2JRJAW6O5N","created_at":"2026-07-05T10:14:12.688771+00:00"},{"alias_kind":"pith_short_16","alias_value":"2J2JRJAW6O5N47WJ","created_at":"2026-07-05T10:14:12.688771+00:00"},{"alias_kind":"pith_short_8","alias_value":"2J2JRJAW","created_at":"2026-07-05T10:14:12.688771+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.26391","citing_title":"Multi-Server Secure Aggregation with Arbitrary Collusion and Heterogeneous Security Constraints","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01849","citing_title":"Optimal Communication Rate of Secure Aggregation over Ring Networks with Pairwise Keys","ref_index":24,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2J2JRJAW6O5N47WJFV4F5PUK6L","json":"https://pith.science/pith/2J2JRJAW6O5N47WJFV4F5PUK6L.json","graph_json":"https://pith.science/api/pith-number/2J2JRJAW6O5N47WJFV4F5PUK6L/graph.json","events_json":"https://pith.science/api/pith-number/2J2JRJAW6O5N47WJFV4F5PUK6L/events.json","paper":"https://pith.science/paper/2J2JRJAW"},"agent_actions":{"view_html":"https://pith.science/pith/2J2JRJAW6O5N47WJFV4F5PUK6L","download_json":"https://pith.science/pith/2J2JRJAW6O5N47WJFV4F5PUK6L.json","view_paper":"https://pith.science/paper/2J2JRJAW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.09817&json=true","fetch_graph":"https://pith.science/api/pith-number/2J2JRJAW6O5N47WJFV4F5PUK6L/graph.json","fetch_events":"https://pith.science/api/pith-number/2J2JRJAW6O5N47WJFV4F5PUK6L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2J2JRJAW6O5N47WJFV4F5PUK6L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2J2JRJAW6O5N47WJFV4F5PUK6L/action/storage_attestation","attest_author":"https://pith.science/pith/2J2JRJAW6O5N47WJFV4F5PUK6L/action/author_attestation","sign_citation":"https://pith.science/pith/2J2JRJAW6O5N47WJFV4F5PUK6L/action/citation_signature","submit_replication":"https://pith.science/pith/2J2JRJAW6O5N47WJFV4F5PUK6L/action/replication_record"}},"created_at":"2026-07-05T10:14:12.688771+00:00","updated_at":"2026-07-05T10:14:12.688771+00:00"}