{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:S7XBROGCQNEVYK3UPPLMEHVBD6","short_pith_number":"pith:S7XBROGC","schema_version":"1.0","canonical_sha256":"97ee18b8c283495c2b747bd6c21ea11fb5cd3e3edbd11189cccb848b18fe65f4","source":{"kind":"arxiv","id":"2502.03247","version":1},"attestation_state":"computed","paper":{"title":"Thetacrypt: A Distributed Service for Threshold Cryptography","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Christian Cachin, Mariarosaria Barbaraci, Michael Senn, Noah Schmid, Orestis Alpos","submitted_at":"2025-02-05T15:03:59Z","abstract_excerpt":"Threshold cryptography is a powerful and well-known technique with many applications to systems relying on distributed trust. It has recently emerged also as a solution to challenges in blockchain: frontrunning prevention, managing wallet keys, and generating randomness. This work presents Thetacrypt, a versatile library for integrating many threshold schemes into one codebase. It offers a way to easily build distributed systems using threshold cryptography and is agnostic to their implementation language. The architecture of Thetacrypt supports diverse protocols uniformly. The library current"},"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.03247","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2025-02-05T15:03:59Z","cross_cats_sorted":[],"title_canon_sha256":"b10f21d30fb7fe6fb2e7e16b91f5b63a7e967f6523a4f4ee4657e5663970b371","abstract_canon_sha256":"d1706bb6d0574fd687eeb820121c077e0fa6cd95893cab4cdd9804758bccb825"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:10:02.091246Z","signature_b64":"/m4+5ZnERSYoI1ErVPJeN6kGDCqmaofO1YkoHtnwv1EHL+aQJ2MmfwD8fF6Iargjt1duTGlLjFwvSqnv2EYaDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97ee18b8c283495c2b747bd6c21ea11fb5cd3e3edbd11189cccb848b18fe65f4","last_reissued_at":"2026-07-05T10:10:02.090721Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:10:02.090721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Thetacrypt: A Distributed Service for Threshold Cryptography","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Christian Cachin, Mariarosaria Barbaraci, Michael Senn, Noah Schmid, Orestis Alpos","submitted_at":"2025-02-05T15:03:59Z","abstract_excerpt":"Threshold cryptography is a powerful and well-known technique with many applications to systems relying on distributed trust. It has recently emerged also as a solution to challenges in blockchain: frontrunning prevention, managing wallet keys, and generating randomness. This work presents Thetacrypt, a versatile library for integrating many threshold schemes into one codebase. It offers a way to easily build distributed systems using threshold cryptography and is agnostic to their implementation language. The architecture of Thetacrypt supports diverse protocols uniformly. The library current"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.03247","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.03247/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.03247","created_at":"2026-07-05T10:10:02.090791+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.03247v1","created_at":"2026-07-05T10:10:02.090791+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.03247","created_at":"2026-07-05T10:10:02.090791+00:00"},{"alias_kind":"pith_short_12","alias_value":"S7XBROGCQNEV","created_at":"2026-07-05T10:10:02.090791+00:00"},{"alias_kind":"pith_short_16","alias_value":"S7XBROGCQNEVYK3U","created_at":"2026-07-05T10:10:02.090791+00:00"},{"alias_kind":"pith_short_8","alias_value":"S7XBROGC","created_at":"2026-07-05T10:10:02.090791+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.11051","citing_title":"Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication","ref_index":41,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S7XBROGCQNEVYK3UPPLMEHVBD6","json":"https://pith.science/pith/S7XBROGCQNEVYK3UPPLMEHVBD6.json","graph_json":"https://pith.science/api/pith-number/S7XBROGCQNEVYK3UPPLMEHVBD6/graph.json","events_json":"https://pith.science/api/pith-number/S7XBROGCQNEVYK3UPPLMEHVBD6/events.json","paper":"https://pith.science/paper/S7XBROGC"},"agent_actions":{"view_html":"https://pith.science/pith/S7XBROGCQNEVYK3UPPLMEHVBD6","download_json":"https://pith.science/pith/S7XBROGCQNEVYK3UPPLMEHVBD6.json","view_paper":"https://pith.science/paper/S7XBROGC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.03247&json=true","fetch_graph":"https://pith.science/api/pith-number/S7XBROGCQNEVYK3UPPLMEHVBD6/graph.json","fetch_events":"https://pith.science/api/pith-number/S7XBROGCQNEVYK3UPPLMEHVBD6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S7XBROGCQNEVYK3UPPLMEHVBD6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S7XBROGCQNEVYK3UPPLMEHVBD6/action/storage_attestation","attest_author":"https://pith.science/pith/S7XBROGCQNEVYK3UPPLMEHVBD6/action/author_attestation","sign_citation":"https://pith.science/pith/S7XBROGCQNEVYK3UPPLMEHVBD6/action/citation_signature","submit_replication":"https://pith.science/pith/S7XBROGCQNEVYK3UPPLMEHVBD6/action/replication_record"}},"created_at":"2026-07-05T10:10:02.090791+00:00","updated_at":"2026-07-05T10:10:02.090791+00:00"}