{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DJ4RD4WLUFFP7NU4ND3KYFN6HD","short_pith_number":"pith:DJ4RD4WL","canonical_record":{"source":{"id":"1710.09997","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-27T06:15:40Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d6d477a0f9b804d0c3bfc1ec0b99b336344293878c82063c36c9b9eec9729d76","abstract_canon_sha256":"2cb106c055c555d9f96e344b2dbb0f7dd1559c37ee3633ed8b4caf128758ace4"},"schema_version":"1.0"},"canonical_sha256":"1a7911f2cba14affb69c68f6ac15be38ec1fc6f84b04f3012abca4409da53023","source":{"kind":"arxiv","id":"1710.09997","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.09997","created_at":"2026-05-17T23:53:06Z"},{"alias_kind":"arxiv_version","alias_value":"1710.09997v3","created_at":"2026-05-17T23:53:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.09997","created_at":"2026-05-17T23:53:06Z"},{"alias_kind":"pith_short_12","alias_value":"DJ4RD4WLUFFP","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DJ4RD4WLUFFP7NU4","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DJ4RD4WL","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DJ4RD4WLUFFP7NU4ND3KYFN6HD","target":"record","payload":{"canonical_record":{"source":{"id":"1710.09997","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-27T06:15:40Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d6d477a0f9b804d0c3bfc1ec0b99b336344293878c82063c36c9b9eec9729d76","abstract_canon_sha256":"2cb106c055c555d9f96e344b2dbb0f7dd1559c37ee3633ed8b4caf128758ace4"},"schema_version":"1.0"},"canonical_sha256":"1a7911f2cba14affb69c68f6ac15be38ec1fc6f84b04f3012abca4409da53023","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:06.761166Z","signature_b64":"4vNt/p2DUOVeWdqZrsoUZq1zHkxGF4i0/5gQAnPuKJBQ34Kq4E7qew5DKXx8mHASQa2aMlAbbnuPbToX30STCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a7911f2cba14affb69c68f6ac15be38ec1fc6f84b04f3012abca4409da53023","last_reissued_at":"2026-05-17T23:53:06.760650Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:06.760650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.09997","source_version":3,"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-05-17T23:53:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZxO0070sNjQkEOlW45tib7odFJSSxyGyEgTZGOnc3UKE3UmWr7mZMgPMCY3lAICc4/gYNsgk1mQb5gtnCiI1CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T21:53:53.270668Z"},"content_sha256":"2ca215868bc3282eccba052f985736a2e592a25c166a4c0e3973ffa35143b9c1","schema_version":"1.0","event_id":"sha256:2ca215868bc3282eccba052f985736a2e592a25c166a4c0e3973ffa35143b9c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DJ4RD4WLUFFP7NU4ND3KYFN6HD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Zeroth Order Nonconvex Multi-Agent Optimization over Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Alfredo Garcia, Davood Hajinezhad, Mingyi Hong","submitted_at":"2017-10-27T06:15:40Z","abstract_excerpt":"In this paper, we consider distributed optimization problems over a multi-agent network, where each agent can only partially evaluate the objective function, and it is allowed to exchange messages with its immediate neighbors. Differently from all existing works on distributed optimization, our focus is given to optimizing a class of non-convex problems, and under the challenging setting where each agent can only access the zeroth-order information (i.e., the functional values) of its local functions. For different types of network topologies such as undirected connected networks or star netwo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.09997","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-17T23:53:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2g6q1FePiGOIBlAOeq+lOZEbA23MqTAovXLK44KRO1tosC26qsFD9QMi5Xkt//kdoXA2h8KVZagbWCkVdfuvDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T21:53:53.271013Z"},"content_sha256":"57d8602dc349266bbe5a4cfb9d5cafe010ad827a87a6b25214322c2184fe7dd8","schema_version":"1.0","event_id":"sha256:57d8602dc349266bbe5a4cfb9d5cafe010ad827a87a6b25214322c2184fe7dd8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DJ4RD4WLUFFP7NU4ND3KYFN6HD/bundle.json","state_url":"https://pith.science/pith/DJ4RD4WLUFFP7NU4ND3KYFN6HD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DJ4RD4WLUFFP7NU4ND3KYFN6HD/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-03T21:53:53Z","links":{"resolver":"https://pith.science/pith/DJ4RD4WLUFFP7NU4ND3KYFN6HD","bundle":"https://pith.science/pith/DJ4RD4WLUFFP7NU4ND3KYFN6HD/bundle.json","state":"https://pith.science/pith/DJ4RD4WLUFFP7NU4ND3KYFN6HD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DJ4RD4WLUFFP7NU4ND3KYFN6HD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DJ4RD4WLUFFP7NU4ND3KYFN6HD","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":"2cb106c055c555d9f96e344b2dbb0f7dd1559c37ee3633ed8b4caf128758ace4","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-27T06:15:40Z","title_canon_sha256":"d6d477a0f9b804d0c3bfc1ec0b99b336344293878c82063c36c9b9eec9729d76"},"schema_version":"1.0","source":{"id":"1710.09997","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.09997","created_at":"2026-05-17T23:53:06Z"},{"alias_kind":"arxiv_version","alias_value":"1710.09997v3","created_at":"2026-05-17T23:53:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.09997","created_at":"2026-05-17T23:53:06Z"},{"alias_kind":"pith_short_12","alias_value":"DJ4RD4WLUFFP","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DJ4RD4WLUFFP7NU4","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DJ4RD4WL","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:57d8602dc349266bbe5a4cfb9d5cafe010ad827a87a6b25214322c2184fe7dd8","target":"graph","created_at":"2026-05-17T23:53:06Z","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"},"paper":{"abstract_excerpt":"In this paper, we consider distributed optimization problems over a multi-agent network, where each agent can only partially evaluate the objective function, and it is allowed to exchange messages with its immediate neighbors. Differently from all existing works on distributed optimization, our focus is given to optimizing a class of non-convex problems, and under the challenging setting where each agent can only access the zeroth-order information (i.e., the functional values) of its local functions. For different types of network topologies such as undirected connected networks or star netwo","authors_text":"Alfredo Garcia, Davood Hajinezhad, Mingyi Hong","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-27T06:15:40Z","title":"Zeroth Order Nonconvex Multi-Agent Optimization over Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.09997","kind":"arxiv","version":3},"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:2ca215868bc3282eccba052f985736a2e592a25c166a4c0e3973ffa35143b9c1","target":"record","created_at":"2026-05-17T23:53:06Z","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":"2cb106c055c555d9f96e344b2dbb0f7dd1559c37ee3633ed8b4caf128758ace4","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-27T06:15:40Z","title_canon_sha256":"d6d477a0f9b804d0c3bfc1ec0b99b336344293878c82063c36c9b9eec9729d76"},"schema_version":"1.0","source":{"id":"1710.09997","kind":"arxiv","version":3}},"canonical_sha256":"1a7911f2cba14affb69c68f6ac15be38ec1fc6f84b04f3012abca4409da53023","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1a7911f2cba14affb69c68f6ac15be38ec1fc6f84b04f3012abca4409da53023","first_computed_at":"2026-05-17T23:53:06.760650Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:06.760650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4vNt/p2DUOVeWdqZrsoUZq1zHkxGF4i0/5gQAnPuKJBQ34Kq4E7qew5DKXx8mHASQa2aMlAbbnuPbToX30STCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:06.761166Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.09997","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ca215868bc3282eccba052f985736a2e592a25c166a4c0e3973ffa35143b9c1","sha256:57d8602dc349266bbe5a4cfb9d5cafe010ad827a87a6b25214322c2184fe7dd8"],"state_sha256":"8ca9f54a8cae9a87dc271a2d9b14803a54d11155cdf1112e12dd6716b38e9bb0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IdCcc4fd/CRY9XGDL9Hh90BWwPsQ4rghkJLKvkxI2K1L9QBCM8oqB+B0qea/ISkKUmB+3p4w2EjfVsn54nFvAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T21:53:53.272968Z","bundle_sha256":"59050d84b1cd34c2a634d35d69d5b35c8c30cb291f135b0470b9b14a09351d20"}}