{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:CLOECAVUTXJKRZNVER7PW25WUY","short_pith_number":"pith:CLOECAVU","canonical_record":{"source":{"id":"2403.06502","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2024-03-11T08:23:37Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"e453213fa6bc2a1a6cc9cf37a5720715ac476743df37ad9efa2dd3f9637b6dec","abstract_canon_sha256":"d5977ce209867c35e570efd8e51d037e2d19063cbdefa96dd6946329c11151f4"},"schema_version":"1.0"},"canonical_sha256":"12dc4102b49dd2a8e5b5247efb6bb6a600aac136c0a9de616d72b70fa03f9a74","source":{"kind":"arxiv","id":"2403.06502","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.06502","created_at":"2026-07-05T09:09:56Z"},{"alias_kind":"arxiv_version","alias_value":"2403.06502v2","created_at":"2026-07-05T09:09:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.06502","created_at":"2026-07-05T09:09:56Z"},{"alias_kind":"pith_short_12","alias_value":"CLOECAVUTXJK","created_at":"2026-07-05T09:09:56Z"},{"alias_kind":"pith_short_16","alias_value":"CLOECAVUTXJKRZNV","created_at":"2026-07-05T09:09:56Z"},{"alias_kind":"pith_short_8","alias_value":"CLOECAVU","created_at":"2026-07-05T09:09:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:CLOECAVUTXJKRZNVER7PW25WUY","target":"record","payload":{"canonical_record":{"source":{"id":"2403.06502","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2024-03-11T08:23:37Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"e453213fa6bc2a1a6cc9cf37a5720715ac476743df37ad9efa2dd3f9637b6dec","abstract_canon_sha256":"d5977ce209867c35e570efd8e51d037e2d19063cbdefa96dd6946329c11151f4"},"schema_version":"1.0"},"canonical_sha256":"12dc4102b49dd2a8e5b5247efb6bb6a600aac136c0a9de616d72b70fa03f9a74","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:09:56.987616Z","signature_b64":"lrKs2bSmTGaAfTlUXUKXwDK1hDu0bhDVi/ICB60CsAxpRlM3oDLtpLGbVQaMuZWISwPLwg0PrkyiAKM2/1D7Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12dc4102b49dd2a8e5b5247efb6bb6a600aac136c0a9de616d72b70fa03f9a74","last_reissued_at":"2026-07-05T09:09:56.986977Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:09:56.986977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2403.06502","source_version":2,"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-05T09:09:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oFLlib510RTT0g4KnWPC9++eraaOksceLEp2chfyE981nlETjCUF5+jXYnWS9sKXshC0ImxH5k28jAzedAk9Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T18:20:45.438603Z"},"content_sha256":"2ae75da7b9037499132dedfce94b21ed35caa5ddecbcabca13fe25ac2b0ae6ac","schema_version":"1.0","event_id":"sha256:2ae75da7b9037499132dedfce94b21ed35caa5ddecbcabca13fe25ac2b0ae6ac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:CLOECAVUTXJKRZNVER7PW25WUY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Distributed Optimization of Multi-Dimensional Functions Despite Byzantine Adversaries","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.MA","authors_text":"Kananart Kuwaranancharoen, Lei Xin, Shreyas Sundaram","submitted_at":"2024-03-11T08:23:37Z","abstract_excerpt":"The problem of distributed optimization requires a group of networked agents to compute a parameter that minimizes the average of their local cost functions. While there are a variety of distributed optimization algorithms that can solve this problem, they are typically vulnerable to \"Byzantine\" agents that do not follow the algorithm. Recent attempts to address this issue focus on single dimensional functions, or assume certain statistical properties of the functions at the agents. In this paper, we provide two resilient, scalable, distributed optimization algorithms for multi-dimensional fun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.06502","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/2403.06502/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-05T09:09:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VZMTctdQlcIEqZBw2qBxiKJRf3rLCG+Hmx0l5nMno9JRODc6szGOOyeuxUxKCShEusLjnlWd5osjcFiBIrBXCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T18:20:45.439062Z"},"content_sha256":"d121fe7161d6a770a1447498245f8da88e44dd47669e19477e1f9db54ef74aa9","schema_version":"1.0","event_id":"sha256:d121fe7161d6a770a1447498245f8da88e44dd47669e19477e1f9db54ef74aa9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CLOECAVUTXJKRZNVER7PW25WUY/bundle.json","state_url":"https://pith.science/pith/CLOECAVUTXJKRZNVER7PW25WUY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CLOECAVUTXJKRZNVER7PW25WUY/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-07-31T18:20:45Z","links":{"resolver":"https://pith.science/pith/CLOECAVUTXJKRZNVER7PW25WUY","bundle":"https://pith.science/pith/CLOECAVUTXJKRZNVER7PW25WUY/bundle.json","state":"https://pith.science/pith/CLOECAVUTXJKRZNVER7PW25WUY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CLOECAVUTXJKRZNVER7PW25WUY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:CLOECAVUTXJKRZNVER7PW25WUY","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":"d5977ce209867c35e570efd8e51d037e2d19063cbdefa96dd6946329c11151f4","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2024-03-11T08:23:37Z","title_canon_sha256":"e453213fa6bc2a1a6cc9cf37a5720715ac476743df37ad9efa2dd3f9637b6dec"},"schema_version":"1.0","source":{"id":"2403.06502","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.06502","created_at":"2026-07-05T09:09:56Z"},{"alias_kind":"arxiv_version","alias_value":"2403.06502v2","created_at":"2026-07-05T09:09:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.06502","created_at":"2026-07-05T09:09:56Z"},{"alias_kind":"pith_short_12","alias_value":"CLOECAVUTXJK","created_at":"2026-07-05T09:09:56Z"},{"alias_kind":"pith_short_16","alias_value":"CLOECAVUTXJKRZNV","created_at":"2026-07-05T09:09:56Z"},{"alias_kind":"pith_short_8","alias_value":"CLOECAVU","created_at":"2026-07-05T09:09:56Z"}],"graph_snapshots":[{"event_id":"sha256:d121fe7161d6a770a1447498245f8da88e44dd47669e19477e1f9db54ef74aa9","target":"graph","created_at":"2026-07-05T09:09:56Z","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/2403.06502/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The problem of distributed optimization requires a group of networked agents to compute a parameter that minimizes the average of their local cost functions. While there are a variety of distributed optimization algorithms that can solve this problem, they are typically vulnerable to \"Byzantine\" agents that do not follow the algorithm. Recent attempts to address this issue focus on single dimensional functions, or assume certain statistical properties of the functions at the agents. In this paper, we provide two resilient, scalable, distributed optimization algorithms for multi-dimensional fun","authors_text":"Kananart Kuwaranancharoen, Lei Xin, Shreyas Sundaram","cross_cats":["math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2024-03-11T08:23:37Z","title":"Scalable Distributed Optimization of Multi-Dimensional Functions Despite Byzantine Adversaries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.06502","kind":"arxiv","version":2},"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:2ae75da7b9037499132dedfce94b21ed35caa5ddecbcabca13fe25ac2b0ae6ac","target":"record","created_at":"2026-07-05T09:09:56Z","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":"d5977ce209867c35e570efd8e51d037e2d19063cbdefa96dd6946329c11151f4","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2024-03-11T08:23:37Z","title_canon_sha256":"e453213fa6bc2a1a6cc9cf37a5720715ac476743df37ad9efa2dd3f9637b6dec"},"schema_version":"1.0","source":{"id":"2403.06502","kind":"arxiv","version":2}},"canonical_sha256":"12dc4102b49dd2a8e5b5247efb6bb6a600aac136c0a9de616d72b70fa03f9a74","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"12dc4102b49dd2a8e5b5247efb6bb6a600aac136c0a9de616d72b70fa03f9a74","first_computed_at":"2026-07-05T09:09:56.986977Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:09:56.986977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lrKs2bSmTGaAfTlUXUKXwDK1hDu0bhDVi/ICB60CsAxpRlM3oDLtpLGbVQaMuZWISwPLwg0PrkyiAKM2/1D7Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T09:09:56.987616Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.06502","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ae75da7b9037499132dedfce94b21ed35caa5ddecbcabca13fe25ac2b0ae6ac","sha256:d121fe7161d6a770a1447498245f8da88e44dd47669e19477e1f9db54ef74aa9"],"state_sha256":"2fd6f25788dc2e323b5e9282d0bca438f302187da643ee9ebb6b420a95c57028"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GOu7ukBNWAWYNBCY6PwbogPO8OY9GPwb7U5q3j6SG8Q5xr92OMi5s09yvUTlYQYN581pOdGraZNzuDbIrZhfDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-31T18:20:45.443344Z","bundle_sha256":"ec647c33420660b5e2cf7a95583d0d1f70b2dcace5ec685bee888924ccc1cd5b"}}