{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:KAJ4YEQMZG4RPZ4K2RXZVV6ZLC","short_pith_number":"pith:KAJ4YEQM","canonical_record":{"source":{"id":"2405.18858","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-05-29T08:13:48Z","cross_cats_sorted":[],"title_canon_sha256":"23788f7d47340b9026ff1277d0402c3d0e6e5146a7d86a80d10c74c31bd5d8fd","abstract_canon_sha256":"6c45627d101210a3fa0a6b20d61236022072b5cbde5e269ea5dab8e183dd9da2"},"schema_version":"1.0"},"canonical_sha256":"5013cc120cc9b917e78ad46f9ad7d958911f8bfdfd182259af16fb17a03fc7fd","source":{"kind":"arxiv","id":"2405.18858","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.18858","created_at":"2026-07-05T08:24:44Z"},{"alias_kind":"arxiv_version","alias_value":"2405.18858v1","created_at":"2026-07-05T08:24:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.18858","created_at":"2026-07-05T08:24:44Z"},{"alias_kind":"pith_short_12","alias_value":"KAJ4YEQMZG4R","created_at":"2026-07-05T08:24:44Z"},{"alias_kind":"pith_short_16","alias_value":"KAJ4YEQMZG4RPZ4K","created_at":"2026-07-05T08:24:44Z"},{"alias_kind":"pith_short_8","alias_value":"KAJ4YEQM","created_at":"2026-07-05T08:24:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:KAJ4YEQMZG4RPZ4K2RXZVV6ZLC","target":"record","payload":{"canonical_record":{"source":{"id":"2405.18858","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-05-29T08:13:48Z","cross_cats_sorted":[],"title_canon_sha256":"23788f7d47340b9026ff1277d0402c3d0e6e5146a7d86a80d10c74c31bd5d8fd","abstract_canon_sha256":"6c45627d101210a3fa0a6b20d61236022072b5cbde5e269ea5dab8e183dd9da2"},"schema_version":"1.0"},"canonical_sha256":"5013cc120cc9b917e78ad46f9ad7d958911f8bfdfd182259af16fb17a03fc7fd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:24:44.465588Z","signature_b64":"DgAoUkpW87FVRg0Z59OcCiVtOok2MGBmFsv1VND9M/jKvVpf8yv8oUVe56XfBVYv26hRFPGscUj2Gq50UCbJBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5013cc120cc9b917e78ad46f9ad7d958911f8bfdfd182259af16fb17a03fc7fd","last_reissued_at":"2026-07-05T08:24:44.465098Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:24:44.465098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2405.18858","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-05T08:24:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j9eZl0rGpTeiA9VjJEKGaFRYSLNy3zubd6AznZ2HVaMLM9k/j5NdyHgSZlQEqaT85iu93bFfIul591V75Zu7Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T13:38:17.067944Z"},"content_sha256":"46f7a3092cbe6f3dc43efd869842affc6b84498b8e1e1540649f0c507d48dac9","schema_version":"1.0","event_id":"sha256:46f7a3092cbe6f3dc43efd869842affc6b84498b8e1e1540649f0c507d48dac9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:KAJ4YEQMZG4RPZ4K2RXZVV6ZLC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Bilevel Optimization with Communication Compression","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bin Wang, Jie Hu, Kun Yuan, Songtao Lu, Xinmeng Huang, Yutong He","submitted_at":"2024-05-29T08:13:48Z","abstract_excerpt":"Stochastic bilevel optimization tackles challenges involving nested optimization structures. Its fast-growing scale nowadays necessitates efficient distributed algorithms. In conventional distributed bilevel methods, each worker must transmit full-dimensional stochastic gradients to the server every iteration, leading to significant communication overhead and thus hindering efficiency and scalability. To resolve this issue, we introduce the first family of distributed bilevel algorithms with communication compression. The primary challenge in algorithmic development is mitigating bias in hyper"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.18858","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/2405.18858/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-05T08:24:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xRQ77bPSFPNMum+AFCED7x7iFFOiDUB/jLBY9zOsQw/MwZ4uw45m9ULFR8ueKRiiU/nQd/TXdoMv6uL5DkPUDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T13:38:17.068439Z"},"content_sha256":"03d253d50bd30faefde4a97877f9fa73877e2b4ce3dd167c129fc074b25311d4","schema_version":"1.0","event_id":"sha256:03d253d50bd30faefde4a97877f9fa73877e2b4ce3dd167c129fc074b25311d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KAJ4YEQMZG4RPZ4K2RXZVV6ZLC/bundle.json","state_url":"https://pith.science/pith/KAJ4YEQMZG4RPZ4K2RXZVV6ZLC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KAJ4YEQMZG4RPZ4K2RXZVV6ZLC/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-10T13:38:17Z","links":{"resolver":"https://pith.science/pith/KAJ4YEQMZG4RPZ4K2RXZVV6ZLC","bundle":"https://pith.science/pith/KAJ4YEQMZG4RPZ4K2RXZVV6ZLC/bundle.json","state":"https://pith.science/pith/KAJ4YEQMZG4RPZ4K2RXZVV6ZLC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KAJ4YEQMZG4RPZ4K2RXZVV6ZLC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:KAJ4YEQMZG4RPZ4K2RXZVV6ZLC","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":"6c45627d101210a3fa0a6b20d61236022072b5cbde5e269ea5dab8e183dd9da2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-05-29T08:13:48Z","title_canon_sha256":"23788f7d47340b9026ff1277d0402c3d0e6e5146a7d86a80d10c74c31bd5d8fd"},"schema_version":"1.0","source":{"id":"2405.18858","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.18858","created_at":"2026-07-05T08:24:44Z"},{"alias_kind":"arxiv_version","alias_value":"2405.18858v1","created_at":"2026-07-05T08:24:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.18858","created_at":"2026-07-05T08:24:44Z"},{"alias_kind":"pith_short_12","alias_value":"KAJ4YEQMZG4R","created_at":"2026-07-05T08:24:44Z"},{"alias_kind":"pith_short_16","alias_value":"KAJ4YEQMZG4RPZ4K","created_at":"2026-07-05T08:24:44Z"},{"alias_kind":"pith_short_8","alias_value":"KAJ4YEQM","created_at":"2026-07-05T08:24:44Z"}],"graph_snapshots":[{"event_id":"sha256:03d253d50bd30faefde4a97877f9fa73877e2b4ce3dd167c129fc074b25311d4","target":"graph","created_at":"2026-07-05T08:24:44Z","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/2405.18858/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Stochastic bilevel optimization tackles challenges involving nested optimization structures. Its fast-growing scale nowadays necessitates efficient distributed algorithms. In conventional distributed bilevel methods, each worker must transmit full-dimensional stochastic gradients to the server every iteration, leading to significant communication overhead and thus hindering efficiency and scalability. To resolve this issue, we introduce the first family of distributed bilevel algorithms with communication compression. The primary challenge in algorithmic development is mitigating bias in hyper","authors_text":"Bin Wang, Jie Hu, Kun Yuan, Songtao Lu, Xinmeng Huang, Yutong He","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-05-29T08:13:48Z","title":"Distributed Bilevel Optimization with Communication Compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.18858","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:46f7a3092cbe6f3dc43efd869842affc6b84498b8e1e1540649f0c507d48dac9","target":"record","created_at":"2026-07-05T08:24:44Z","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":"6c45627d101210a3fa0a6b20d61236022072b5cbde5e269ea5dab8e183dd9da2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-05-29T08:13:48Z","title_canon_sha256":"23788f7d47340b9026ff1277d0402c3d0e6e5146a7d86a80d10c74c31bd5d8fd"},"schema_version":"1.0","source":{"id":"2405.18858","kind":"arxiv","version":1}},"canonical_sha256":"5013cc120cc9b917e78ad46f9ad7d958911f8bfdfd182259af16fb17a03fc7fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5013cc120cc9b917e78ad46f9ad7d958911f8bfdfd182259af16fb17a03fc7fd","first_computed_at":"2026-07-05T08:24:44.465098Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:24:44.465098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DgAoUkpW87FVRg0Z59OcCiVtOok2MGBmFsv1VND9M/jKvVpf8yv8oUVe56XfBVYv26hRFPGscUj2Gq50UCbJBw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:24:44.465588Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.18858","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:46f7a3092cbe6f3dc43efd869842affc6b84498b8e1e1540649f0c507d48dac9","sha256:03d253d50bd30faefde4a97877f9fa73877e2b4ce3dd167c129fc074b25311d4"],"state_sha256":"130309d6a095dd2c9e8672bdac6d1f89783f9673f8d3ac5a414dca547a2b1989"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EJ+pypatSdIdAAOC5DQJ9Ltg/WYumRR+gWkcMfu/HhEZN+DO1oI4N6ljklIcBjYbZ5rYA+i8P+UiCXpJexqOAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T13:38:17.072878Z","bundle_sha256":"922934eb25d1366821bcaf5e5b178f7fba52c6193827ef29296d07ec6fca22eb"}}