{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:XCC32J2WKF4TVWBPVNM42W4WPS","short_pith_number":"pith:XCC32J2W","canonical_record":{"source":{"id":"1901.05682","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-17T08:47:34Z","cross_cats_sorted":[],"title_canon_sha256":"2c376b1dde0c10394e002fc4b70b00d38b33690808e634b589aa0916fb7d3eac","abstract_canon_sha256":"a846213f72d88cba910128544b3fcf6e31616522b1fe19b41a5b6d26dffce47e"},"schema_version":"1.0"},"canonical_sha256":"b885bd275651793ad82fab59cd5b967ca6d251947385a194af18a8b431b6f367","source":{"kind":"arxiv","id":"1901.05682","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.05682","created_at":"2026-05-17T23:56:06Z"},{"alias_kind":"arxiv_version","alias_value":"1901.05682v1","created_at":"2026-05-17T23:56:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05682","created_at":"2026-05-17T23:56:06Z"},{"alias_kind":"pith_short_12","alias_value":"XCC32J2WKF4T","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XCC32J2WKF4TVWBP","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XCC32J2W","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:XCC32J2WKF4TVWBPVNM42W4WPS","target":"record","payload":{"canonical_record":{"source":{"id":"1901.05682","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-17T08:47:34Z","cross_cats_sorted":[],"title_canon_sha256":"2c376b1dde0c10394e002fc4b70b00d38b33690808e634b589aa0916fb7d3eac","abstract_canon_sha256":"a846213f72d88cba910128544b3fcf6e31616522b1fe19b41a5b6d26dffce47e"},"schema_version":"1.0"},"canonical_sha256":"b885bd275651793ad82fab59cd5b967ca6d251947385a194af18a8b431b6f367","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:06.433481Z","signature_b64":"b9cWtJJPXGwk+9zz0Tq88CzZTg+gWxSpbZ1viXxs7G/T4Qz4mQ6RND+IodfVIoj4lvHltsZuRE+1HZXIjgyLDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b885bd275651793ad82fab59cd5b967ca6d251947385a194af18a8b431b6f367","last_reissued_at":"2026-05-17T23:56:06.432778Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:06.432778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.05682","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-05-17T23:56:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+9RIs04GA0uArxrtu6NN6Kw2U+MzkJer0rEvScOZDkk/pEmWBZSVDtWf9DsWDORKZzd9/VZA9m6nIZw53yJ9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:18:15.024534Z"},"content_sha256":"fb9c88e4256d70af74dfcf7fba6c76bf8f21b25f423ebf60c0570b5efd6e8197","schema_version":"1.0","event_id":"sha256:fb9c88e4256d70af74dfcf7fba6c76bf8f21b25f423ebf60c0570b5efd6e8197"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:XCC32J2WKF4TVWBPVNM42W4WPS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact Spectral-Like Gradient Method for Distributed Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dusan Jakovetic, Natasa Krejic, Natasa Krklec Jerinkic","submitted_at":"2019-01-17T08:47:34Z","abstract_excerpt":"Since the initial proposal in the late 80s, spectral gradient methods continue to receive significant attention, especially due to their excellent numerical performance on various large scale applications. However, to date, they have not been sufficiently explored in the context of distributed optimization. In this paper, we consider unconstrained distributed optimization problems where $n$ nodes constitute an arbitrary connected network and collaboratively minimize the sum of their local convex cost functions. In this setting, building from existing exact distributed gradient methods, we prop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05682","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":""},"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:56:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eSBTm65W8HmFTdhRe65BArXhbZn1+xNQrbGoqnJlE2TG3X4vpqrNKIc5A0CTIy9dz40SIaaVeAVzVxyncHrADw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:18:15.024873Z"},"content_sha256":"50c41823e385d7a647b280df259b4c96e94a7f902e10c301c00f122fc0a4bc40","schema_version":"1.0","event_id":"sha256:50c41823e385d7a647b280df259b4c96e94a7f902e10c301c00f122fc0a4bc40"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XCC32J2WKF4TVWBPVNM42W4WPS/bundle.json","state_url":"https://pith.science/pith/XCC32J2WKF4TVWBPVNM42W4WPS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XCC32J2WKF4TVWBPVNM42W4WPS/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-05-28T19:18:15Z","links":{"resolver":"https://pith.science/pith/XCC32J2WKF4TVWBPVNM42W4WPS","bundle":"https://pith.science/pith/XCC32J2WKF4TVWBPVNM42W4WPS/bundle.json","state":"https://pith.science/pith/XCC32J2WKF4TVWBPVNM42W4WPS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XCC32J2WKF4TVWBPVNM42W4WPS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:XCC32J2WKF4TVWBPVNM42W4WPS","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":"a846213f72d88cba910128544b3fcf6e31616522b1fe19b41a5b6d26dffce47e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-17T08:47:34Z","title_canon_sha256":"2c376b1dde0c10394e002fc4b70b00d38b33690808e634b589aa0916fb7d3eac"},"schema_version":"1.0","source":{"id":"1901.05682","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.05682","created_at":"2026-05-17T23:56:06Z"},{"alias_kind":"arxiv_version","alias_value":"1901.05682v1","created_at":"2026-05-17T23:56:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05682","created_at":"2026-05-17T23:56:06Z"},{"alias_kind":"pith_short_12","alias_value":"XCC32J2WKF4T","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XCC32J2WKF4TVWBP","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XCC32J2W","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:50c41823e385d7a647b280df259b4c96e94a7f902e10c301c00f122fc0a4bc40","target":"graph","created_at":"2026-05-17T23:56: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":"Since the initial proposal in the late 80s, spectral gradient methods continue to receive significant attention, especially due to their excellent numerical performance on various large scale applications. However, to date, they have not been sufficiently explored in the context of distributed optimization. In this paper, we consider unconstrained distributed optimization problems where $n$ nodes constitute an arbitrary connected network and collaboratively minimize the sum of their local convex cost functions. In this setting, building from existing exact distributed gradient methods, we prop","authors_text":"Dusan Jakovetic, Natasa Krejic, Natasa Krklec Jerinkic","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-17T08:47:34Z","title":"Exact Spectral-Like Gradient Method for Distributed Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05682","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:fb9c88e4256d70af74dfcf7fba6c76bf8f21b25f423ebf60c0570b5efd6e8197","target":"record","created_at":"2026-05-17T23:56: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":"a846213f72d88cba910128544b3fcf6e31616522b1fe19b41a5b6d26dffce47e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-17T08:47:34Z","title_canon_sha256":"2c376b1dde0c10394e002fc4b70b00d38b33690808e634b589aa0916fb7d3eac"},"schema_version":"1.0","source":{"id":"1901.05682","kind":"arxiv","version":1}},"canonical_sha256":"b885bd275651793ad82fab59cd5b967ca6d251947385a194af18a8b431b6f367","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b885bd275651793ad82fab59cd5b967ca6d251947385a194af18a8b431b6f367","first_computed_at":"2026-05-17T23:56:06.432778Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:06.432778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b9cWtJJPXGwk+9zz0Tq88CzZTg+gWxSpbZ1viXxs7G/T4Qz4mQ6RND+IodfVIoj4lvHltsZuRE+1HZXIjgyLDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:06.433481Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.05682","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb9c88e4256d70af74dfcf7fba6c76bf8f21b25f423ebf60c0570b5efd6e8197","sha256:50c41823e385d7a647b280df259b4c96e94a7f902e10c301c00f122fc0a4bc40"],"state_sha256":"410a0297f6db50411d07a2bef6e082da35b212b94ce40557772785876339865b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zuHgmVWIoxMPUpmTurfNGye/hin+e/ZaY7nNvHw/qVKOrz6dky3yxWTyUSvwJ8hWqiWbPOV6y2hwWq46Sb9UBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T19:18:15.026878Z","bundle_sha256":"d58a539c07f1ab1e43899fe804bca38f81b4cbfc33ef91ff83b6c588c9e27a2e"}}