{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:VD6545LJSPBC6NIXTSWVGAAZUO","short_pith_number":"pith:VD6545LJ","schema_version":"1.0","canonical_sha256":"a8fdde756993c22f35179cad530019a3a022bcd16090dff47e495f788d229afd","source":{"kind":"arxiv","id":"1908.01204","version":2},"attestation_state":"computed","paper":{"title":"Private Sequential Function Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Behrooz Tahmasebi, Mohammad Ali Maddah-Ali","submitted_at":"2019-08-03T17:32:41Z","abstract_excerpt":"Consider a system, including a user, $N$ servers, and $K$ basic functions which are known at all of the servers. Using the combination of those basic functions, it is possible to construct a wide class of functions. The user wishes to compute a particular combination of the basic functions, by offloading the computation to $N$ servers, while the servers should not obtain any information about which combination of the basic functions is to be computed. The objective is to minimize the total number of queries asked by the user from the servers to achieve the desired result.\n  As a first step tow"},"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":"1908.01204","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-03T17:32:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"08727927dc65fe12251543291613c61bb0acb482c2baebfd3d82d80d5144d150","abstract_canon_sha256":"4b56dfc7e8be7c6dd13a0e9f523a30ef89242288c622af9a2f8828248cbedf6b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:46:31.965121Z","signature_b64":"HwyH9Gc/T/edAVJmPG7ma4XGn0gfuc7p3YU3yxSMtouNrHfX0yPXXrHO7U0MfAjlmUJ/etaicqSRzkw1WdrcDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8fdde756993c22f35179cad530019a3a022bcd16090dff47e495f788d229afd","last_reissued_at":"2026-07-05T00:46:31.964757Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:46:31.964757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Private Sequential Function Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Behrooz Tahmasebi, Mohammad Ali Maddah-Ali","submitted_at":"2019-08-03T17:32:41Z","abstract_excerpt":"Consider a system, including a user, $N$ servers, and $K$ basic functions which are known at all of the servers. Using the combination of those basic functions, it is possible to construct a wide class of functions. The user wishes to compute a particular combination of the basic functions, by offloading the computation to $N$ servers, while the servers should not obtain any information about which combination of the basic functions is to be computed. The objective is to minimize the total number of queries asked by the user from the servers to achieve the desired result.\n  As a first step tow"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01204","kind":"arxiv","version":2},"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/1908.01204/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":"1908.01204","created_at":"2026-07-05T00:46:31.964812+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.01204v2","created_at":"2026-07-05T00:46:31.964812+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01204","created_at":"2026-07-05T00:46:31.964812+00:00"},{"alias_kind":"pith_short_12","alias_value":"VD6545LJSPBC","created_at":"2026-07-05T00:46:31.964812+00:00"},{"alias_kind":"pith_short_16","alias_value":"VD6545LJSPBC6NIX","created_at":"2026-07-05T00:46:31.964812+00:00"},{"alias_kind":"pith_short_8","alias_value":"VD6545LJ","created_at":"2026-07-05T00:46:31.964812+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1909.00407","citing_title":"Private and Secure Distributed Matrix Multiplication with Flexible Communication Load","ref_index":40,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VD6545LJSPBC6NIXTSWVGAAZUO","json":"https://pith.science/pith/VD6545LJSPBC6NIXTSWVGAAZUO.json","graph_json":"https://pith.science/api/pith-number/VD6545LJSPBC6NIXTSWVGAAZUO/graph.json","events_json":"https://pith.science/api/pith-number/VD6545LJSPBC6NIXTSWVGAAZUO/events.json","paper":"https://pith.science/paper/VD6545LJ"},"agent_actions":{"view_html":"https://pith.science/pith/VD6545LJSPBC6NIXTSWVGAAZUO","download_json":"https://pith.science/pith/VD6545LJSPBC6NIXTSWVGAAZUO.json","view_paper":"https://pith.science/paper/VD6545LJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.01204&json=true","fetch_graph":"https://pith.science/api/pith-number/VD6545LJSPBC6NIXTSWVGAAZUO/graph.json","fetch_events":"https://pith.science/api/pith-number/VD6545LJSPBC6NIXTSWVGAAZUO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VD6545LJSPBC6NIXTSWVGAAZUO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VD6545LJSPBC6NIXTSWVGAAZUO/action/storage_attestation","attest_author":"https://pith.science/pith/VD6545LJSPBC6NIXTSWVGAAZUO/action/author_attestation","sign_citation":"https://pith.science/pith/VD6545LJSPBC6NIXTSWVGAAZUO/action/citation_signature","submit_replication":"https://pith.science/pith/VD6545LJSPBC6NIXTSWVGAAZUO/action/replication_record"}},"created_at":"2026-07-05T00:46:31.964812+00:00","updated_at":"2026-07-05T00:46:31.964812+00:00"}