{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:UIDLLCH54KRU6KSYNRJ4Y52DEP","short_pith_number":"pith:UIDLLCH5","canonical_record":{"source":{"id":"1709.01307","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-05T09:45:19Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"ac3db42a67fd2be94a805b82ff114806a42bc78ba611e518a2552b7973eb7001","abstract_canon_sha256":"8a1204eee7326c3dd1666c39deb55ffc6d15ab4d05edefc4806c53847d0a5c11"},"schema_version":"1.0"},"canonical_sha256":"a206b588fde2a34f2a586c53cc774323f380e368ee1ed85ebacb0ee0d2def776","source":{"kind":"arxiv","id":"1709.01307","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01307","created_at":"2026-05-18T00:05:19Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01307v3","created_at":"2026-05-18T00:05:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01307","created_at":"2026-05-18T00:05:19Z"},{"alias_kind":"pith_short_12","alias_value":"UIDLLCH54KRU","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UIDLLCH54KRU6KSY","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UIDLLCH5","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:UIDLLCH54KRU6KSYNRJ4Y52DEP","target":"record","payload":{"canonical_record":{"source":{"id":"1709.01307","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-05T09:45:19Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"ac3db42a67fd2be94a805b82ff114806a42bc78ba611e518a2552b7973eb7001","abstract_canon_sha256":"8a1204eee7326c3dd1666c39deb55ffc6d15ab4d05edefc4806c53847d0a5c11"},"schema_version":"1.0"},"canonical_sha256":"a206b588fde2a34f2a586c53cc774323f380e368ee1ed85ebacb0ee0d2def776","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:19.703636Z","signature_b64":"LlGaLGXsPJSqpeftVP3i6QhT/+quCERAlQJ2HyQV8BogRYr9Kbcy+c147OnWddSlgWVCweJiRLQqKmTtfljbBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a206b588fde2a34f2a586c53cc774323f380e368ee1ed85ebacb0ee0d2def776","last_reissued_at":"2026-05-18T00:05:19.702822Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:19.702822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.01307","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-18T00:05:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WpPTDFAFKMSS/rwb85O1m9CZIYgN4g1eRkGB59foO/KOWkg5fTUw0GuvLixRcOaXolgcDVMaITxqnKitH38XAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T09:24:49.809529Z"},"content_sha256":"bd63d55d93473799bd95a3c9355aa154f641fe230f9a370cf27a24e269382529","schema_version":"1.0","event_id":"sha256:bd63d55d93473799bd95a3c9355aa154f641fe230f9a370cf27a24e269382529"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:UIDLLCH54KRU6KSYNRJ4Y52DEP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed second order methods with increasing number of working nodes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Dragana Bajovic, Dusan Jakovetic, Natasa Krejic, Natasa Krklec Jerinkic","submitted_at":"2017-09-05T09:45:19Z","abstract_excerpt":"Recently, an idling mechanism has been introduced in the context of distributed \\emph{first order} methods for minimization of a sum of nodes' local convex costs over a generic, connected network. With the idling mechanism, each node $i$, at each iteration $k$, is active -- updates its solution estimate and exchanges messages with its network neighborhood -- with probability $p_k$, and it stays idle with probability $1-p_k$, while the activations are independent both across nodes and across iterations. In this paper, we demonstrate that the idling mechanism can be successfully incorporated in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01307","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-18T00:05:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VRX1qMr9ic93rlLWa7EUFVkPl1C/1ukVmqDJLC4jTvqLEfNIPSdh7jnZkZpjHeypWwRvDbEtQNZdpjBDGv86BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T09:24:49.809889Z"},"content_sha256":"5c48b897a3aba6b2649f812f0cd3f9be8f90c93a05294b522cdb449da3cfcd15","schema_version":"1.0","event_id":"sha256:5c48b897a3aba6b2649f812f0cd3f9be8f90c93a05294b522cdb449da3cfcd15"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UIDLLCH54KRU6KSYNRJ4Y52DEP/bundle.json","state_url":"https://pith.science/pith/UIDLLCH54KRU6KSYNRJ4Y52DEP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UIDLLCH54KRU6KSYNRJ4Y52DEP/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-20T09:24:49Z","links":{"resolver":"https://pith.science/pith/UIDLLCH54KRU6KSYNRJ4Y52DEP","bundle":"https://pith.science/pith/UIDLLCH54KRU6KSYNRJ4Y52DEP/bundle.json","state":"https://pith.science/pith/UIDLLCH54KRU6KSYNRJ4Y52DEP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UIDLLCH54KRU6KSYNRJ4Y52DEP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UIDLLCH54KRU6KSYNRJ4Y52DEP","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":"8a1204eee7326c3dd1666c39deb55ffc6d15ab4d05edefc4806c53847d0a5c11","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-05T09:45:19Z","title_canon_sha256":"ac3db42a67fd2be94a805b82ff114806a42bc78ba611e518a2552b7973eb7001"},"schema_version":"1.0","source":{"id":"1709.01307","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01307","created_at":"2026-05-18T00:05:19Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01307v3","created_at":"2026-05-18T00:05:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01307","created_at":"2026-05-18T00:05:19Z"},{"alias_kind":"pith_short_12","alias_value":"UIDLLCH54KRU","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UIDLLCH54KRU6KSY","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UIDLLCH5","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:5c48b897a3aba6b2649f812f0cd3f9be8f90c93a05294b522cdb449da3cfcd15","target":"graph","created_at":"2026-05-18T00:05:19Z","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":"Recently, an idling mechanism has been introduced in the context of distributed \\emph{first order} methods for minimization of a sum of nodes' local convex costs over a generic, connected network. With the idling mechanism, each node $i$, at each iteration $k$, is active -- updates its solution estimate and exchanges messages with its network neighborhood -- with probability $p_k$, and it stays idle with probability $1-p_k$, while the activations are independent both across nodes and across iterations. In this paper, we demonstrate that the idling mechanism can be successfully incorporated in ","authors_text":"Dragana Bajovic, Dusan Jakovetic, Natasa Krejic, Natasa Krklec Jerinkic","cross_cats":["math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-05T09:45:19Z","title":"Distributed second order methods with increasing number of working nodes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01307","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:bd63d55d93473799bd95a3c9355aa154f641fe230f9a370cf27a24e269382529","target":"record","created_at":"2026-05-18T00:05:19Z","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":"8a1204eee7326c3dd1666c39deb55ffc6d15ab4d05edefc4806c53847d0a5c11","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-05T09:45:19Z","title_canon_sha256":"ac3db42a67fd2be94a805b82ff114806a42bc78ba611e518a2552b7973eb7001"},"schema_version":"1.0","source":{"id":"1709.01307","kind":"arxiv","version":3}},"canonical_sha256":"a206b588fde2a34f2a586c53cc774323f380e368ee1ed85ebacb0ee0d2def776","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a206b588fde2a34f2a586c53cc774323f380e368ee1ed85ebacb0ee0d2def776","first_computed_at":"2026-05-18T00:05:19.702822Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:19.702822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LlGaLGXsPJSqpeftVP3i6QhT/+quCERAlQJ2HyQV8BogRYr9Kbcy+c147OnWddSlgWVCweJiRLQqKmTtfljbBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:19.703636Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.01307","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd63d55d93473799bd95a3c9355aa154f641fe230f9a370cf27a24e269382529","sha256:5c48b897a3aba6b2649f812f0cd3f9be8f90c93a05294b522cdb449da3cfcd15"],"state_sha256":"2fa2190fa0d32de1e1ef75bf8e61094a995f192b2cea44aaaf9991615b59ba60"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ylLI6aGbTvYm64+Hn9wLmhXMjgI86wmaXe0tXgOnQww6idiVqJPlqmnLEKORQdZz/Ot9q9CH/tt4c6Zt+KRIBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T09:24:49.812266Z","bundle_sha256":"13bdbaa58f57e6b2ca7efc94cdfbae0b77d89b7b8faf7bf3fdf7a31ef4cd4bb2"}}