{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:YZESYG3OAKSSW5DMHWZ7JKN7Q3","short_pith_number":"pith:YZESYG3O","canonical_record":{"source":{"id":"2306.01401","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2023-06-02T09:47:38Z","cross_cats_sorted":[],"title_canon_sha256":"972c7590fdc0c713269f854453627ddf7d52076fc70ebdb36e4fa2d8fe1b8f60","abstract_canon_sha256":"ae79f34107c99dcc7fb2f687e88af9d3851acface3c5cad8df3d1d2a20be1840"},"schema_version":"1.0"},"canonical_sha256":"c6492c1b6e02a52b746c3db3f4a9bf86ca1d49f84282f20b7b9f51a7af2cd520","source":{"kind":"arxiv","id":"2306.01401","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.01401","created_at":"2026-07-05T06:16:53Z"},{"alias_kind":"arxiv_version","alias_value":"2306.01401v1","created_at":"2026-07-05T06:16:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.01401","created_at":"2026-07-05T06:16:53Z"},{"alias_kind":"pith_short_12","alias_value":"YZESYG3OAKSS","created_at":"2026-07-05T06:16:53Z"},{"alias_kind":"pith_short_16","alias_value":"YZESYG3OAKSSW5DM","created_at":"2026-07-05T06:16:53Z"},{"alias_kind":"pith_short_8","alias_value":"YZESYG3O","created_at":"2026-07-05T06:16:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:YZESYG3OAKSSW5DMHWZ7JKN7Q3","target":"record","payload":{"canonical_record":{"source":{"id":"2306.01401","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2023-06-02T09:47:38Z","cross_cats_sorted":[],"title_canon_sha256":"972c7590fdc0c713269f854453627ddf7d52076fc70ebdb36e4fa2d8fe1b8f60","abstract_canon_sha256":"ae79f34107c99dcc7fb2f687e88af9d3851acface3c5cad8df3d1d2a20be1840"},"schema_version":"1.0"},"canonical_sha256":"c6492c1b6e02a52b746c3db3f4a9bf86ca1d49f84282f20b7b9f51a7af2cd520","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:16:53.853074Z","signature_b64":"zWpnJH2rJqgX1mF3A6DFWkjOD0fnDNqjz6hLcOn0C/sDXPomu+CyGulh8+l861vta7h1ypNfgZpPjxIIfutKAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6492c1b6e02a52b746c3db3f4a9bf86ca1d49f84282f20b7b9f51a7af2cd520","last_reissued_at":"2026-07-05T06:16:53.852659Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:16:53.852659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2306.01401","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-05T06:16:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XA9/WI/W/CGW2jmY27tI1YfT/hcgCo4AAnkc5aTjG45xNMbkp92DyTaxJ3C05okOvt6dwjA5EG5SHUIVRqRBCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T15:37:57.340795Z"},"content_sha256":"1b26ce4886c99f9e447f56013ab1cb3e7ae84f9fa66bb181e0b9c6577c32a576","schema_version":"1.0","event_id":"sha256:1b26ce4886c99f9e447f56013ab1cb3e7ae84f9fa66bb181e0b9c6577c32a576"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:YZESYG3OAKSSW5DMHWZ7JKN7Q3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Network Agnostic MPC with Statistical Security","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Ananya Appan, Ashish Choudhury","submitted_at":"2023-06-02T09:47:38Z","abstract_excerpt":"We initiate the study of the network agnostic MPC protocols with statistical security. Network agnostic protocols give the best possible security guarantees irrespective of the underlying network type. We consider the general-adversary model, where the adversary is characterized by an adversary structure which enumerates all possible candidate subsets of corrupt parties. The $\\mathcal{Q}^{(k)}$ condition enforces that the union of no $k$ subsets from the adversary structure covers the party set. Given an unconditionally-secure PKI setup, known statistically-secure synchronous MPC protocols are"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.01401","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/2306.01401/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-05T06:16:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F0+dE96WDbfTSwkjIerVey07BZ0KYj2AIdAroCZ2s4jpjtKiPeQyh7ZY6HCgEd294oe1xAybSdzrcsFojr7wAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T15:37:57.341304Z"},"content_sha256":"fe3e7cd92f652193586554943e608fbf2d2e9fe9741e19d286e9f89c6e33d524","schema_version":"1.0","event_id":"sha256:fe3e7cd92f652193586554943e608fbf2d2e9fe9741e19d286e9f89c6e33d524"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YZESYG3OAKSSW5DMHWZ7JKN7Q3/bundle.json","state_url":"https://pith.science/pith/YZESYG3OAKSSW5DMHWZ7JKN7Q3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YZESYG3OAKSSW5DMHWZ7JKN7Q3/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-14T15:37:57Z","links":{"resolver":"https://pith.science/pith/YZESYG3OAKSSW5DMHWZ7JKN7Q3","bundle":"https://pith.science/pith/YZESYG3OAKSSW5DMHWZ7JKN7Q3/bundle.json","state":"https://pith.science/pith/YZESYG3OAKSSW5DMHWZ7JKN7Q3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YZESYG3OAKSSW5DMHWZ7JKN7Q3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:YZESYG3OAKSSW5DMHWZ7JKN7Q3","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":"ae79f34107c99dcc7fb2f687e88af9d3851acface3c5cad8df3d1d2a20be1840","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2023-06-02T09:47:38Z","title_canon_sha256":"972c7590fdc0c713269f854453627ddf7d52076fc70ebdb36e4fa2d8fe1b8f60"},"schema_version":"1.0","source":{"id":"2306.01401","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.01401","created_at":"2026-07-05T06:16:53Z"},{"alias_kind":"arxiv_version","alias_value":"2306.01401v1","created_at":"2026-07-05T06:16:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.01401","created_at":"2026-07-05T06:16:53Z"},{"alias_kind":"pith_short_12","alias_value":"YZESYG3OAKSS","created_at":"2026-07-05T06:16:53Z"},{"alias_kind":"pith_short_16","alias_value":"YZESYG3OAKSSW5DM","created_at":"2026-07-05T06:16:53Z"},{"alias_kind":"pith_short_8","alias_value":"YZESYG3O","created_at":"2026-07-05T06:16:53Z"}],"graph_snapshots":[{"event_id":"sha256:fe3e7cd92f652193586554943e608fbf2d2e9fe9741e19d286e9f89c6e33d524","target":"graph","created_at":"2026-07-05T06:16:53Z","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/2306.01401/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We initiate the study of the network agnostic MPC protocols with statistical security. Network agnostic protocols give the best possible security guarantees irrespective of the underlying network type. We consider the general-adversary model, where the adversary is characterized by an adversary structure which enumerates all possible candidate subsets of corrupt parties. The $\\mathcal{Q}^{(k)}$ condition enforces that the union of no $k$ subsets from the adversary structure covers the party set. Given an unconditionally-secure PKI setup, known statistically-secure synchronous MPC protocols are","authors_text":"Ananya Appan, Ashish Choudhury","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2023-06-02T09:47:38Z","title":"Network Agnostic MPC with Statistical Security"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.01401","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:1b26ce4886c99f9e447f56013ab1cb3e7ae84f9fa66bb181e0b9c6577c32a576","target":"record","created_at":"2026-07-05T06:16:53Z","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":"ae79f34107c99dcc7fb2f687e88af9d3851acface3c5cad8df3d1d2a20be1840","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2023-06-02T09:47:38Z","title_canon_sha256":"972c7590fdc0c713269f854453627ddf7d52076fc70ebdb36e4fa2d8fe1b8f60"},"schema_version":"1.0","source":{"id":"2306.01401","kind":"arxiv","version":1}},"canonical_sha256":"c6492c1b6e02a52b746c3db3f4a9bf86ca1d49f84282f20b7b9f51a7af2cd520","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c6492c1b6e02a52b746c3db3f4a9bf86ca1d49f84282f20b7b9f51a7af2cd520","first_computed_at":"2026-07-05T06:16:53.852659Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:16:53.852659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zWpnJH2rJqgX1mF3A6DFWkjOD0fnDNqjz6hLcOn0C/sDXPomu+CyGulh8+l861vta7h1ypNfgZpPjxIIfutKAA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:16:53.853074Z","signed_message":"canonical_sha256_bytes"},"source_id":"2306.01401","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b26ce4886c99f9e447f56013ab1cb3e7ae84f9fa66bb181e0b9c6577c32a576","sha256:fe3e7cd92f652193586554943e608fbf2d2e9fe9741e19d286e9f89c6e33d524"],"state_sha256":"0bac61e383e5ec8f1b96c7fc6141e38a6504ee7295b2df6f9b32bf6b437f5440"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DzEgn52dAxI0mz7Xfv4Mc9G/Owj+D7rsPFGeA58xnZI1eKvgkmW8pglLg+nYcPbMORFNvWSYM4Nxtirj5dSuAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T15:37:57.346742Z","bundle_sha256":"5a500170881953d325612deaf2ff844036e594c7afc4052b3722fe90199335f2"}}