{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UIDLLCH54KRU6KSYNRJ4Y52DEP","short_pith_number":"pith:UIDLLCH5","schema_version":"1.0","canonical_sha256":"a206b588fde2a34f2a586c53cc774323f380e368ee1ed85ebacb0ee0d2def776","source":{"kind":"arxiv","id":"1709.01307","version":3},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1709.01307","created_at":"2026-05-18T00:05:19.702924+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.01307v3","created_at":"2026-05-18T00:05:19.702924+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01307","created_at":"2026-05-18T00:05:19.702924+00:00"},{"alias_kind":"pith_short_12","alias_value":"UIDLLCH54KRU","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"UIDLLCH54KRU6KSY","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"UIDLLCH5","created_at":"2026-05-18T12:31:46.661854+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UIDLLCH54KRU6KSYNRJ4Y52DEP","json":"https://pith.science/pith/UIDLLCH54KRU6KSYNRJ4Y52DEP.json","graph_json":"https://pith.science/api/pith-number/UIDLLCH54KRU6KSYNRJ4Y52DEP/graph.json","events_json":"https://pith.science/api/pith-number/UIDLLCH54KRU6KSYNRJ4Y52DEP/events.json","paper":"https://pith.science/paper/UIDLLCH5"},"agent_actions":{"view_html":"https://pith.science/pith/UIDLLCH54KRU6KSYNRJ4Y52DEP","download_json":"https://pith.science/pith/UIDLLCH54KRU6KSYNRJ4Y52DEP.json","view_paper":"https://pith.science/paper/UIDLLCH5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.01307&json=true","fetch_graph":"https://pith.science/api/pith-number/UIDLLCH54KRU6KSYNRJ4Y52DEP/graph.json","fetch_events":"https://pith.science/api/pith-number/UIDLLCH54KRU6KSYNRJ4Y52DEP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UIDLLCH54KRU6KSYNRJ4Y52DEP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UIDLLCH54KRU6KSYNRJ4Y52DEP/action/storage_attestation","attest_author":"https://pith.science/pith/UIDLLCH54KRU6KSYNRJ4Y52DEP/action/author_attestation","sign_citation":"https://pith.science/pith/UIDLLCH54KRU6KSYNRJ4Y52DEP/action/citation_signature","submit_replication":"https://pith.science/pith/UIDLLCH54KRU6KSYNRJ4Y52DEP/action/replication_record"}},"created_at":"2026-05-18T00:05:19.702924+00:00","updated_at":"2026-05-18T00:05:19.702924+00:00"}