{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:SAI6FKJUPH3VYG3WHHXZMFCL7U","short_pith_number":"pith:SAI6FKJU","canonical_record":{"source":{"id":"1203.2808","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-03-13T13:47:37Z","cross_cats_sorted":[],"title_canon_sha256":"dc88f8a2002f6d991f7b6cf5d5022f2f39aeb19e1e588a74397c8d01ae37f1b5","abstract_canon_sha256":"fc5bd33cc6eb39674376d0153bae591d4853282ff9d4125470f652ef77f246b4"},"schema_version":"1.0"},"canonical_sha256":"9011e2a93479f75c1b7639ef96144bfd2c2e0128ab9e91ba0109354ce5e56931","source":{"kind":"arxiv","id":"1203.2808","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.2808","created_at":"2026-05-18T04:00:14Z"},{"alias_kind":"arxiv_version","alias_value":"1203.2808v1","created_at":"2026-05-18T04:00:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2808","created_at":"2026-05-18T04:00:14Z"},{"alias_kind":"pith_short_12","alias_value":"SAI6FKJUPH3V","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SAI6FKJUPH3VYG3W","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SAI6FKJU","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:SAI6FKJUPH3VYG3WHHXZMFCL7U","target":"record","payload":{"canonical_record":{"source":{"id":"1203.2808","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-03-13T13:47:37Z","cross_cats_sorted":[],"title_canon_sha256":"dc88f8a2002f6d991f7b6cf5d5022f2f39aeb19e1e588a74397c8d01ae37f1b5","abstract_canon_sha256":"fc5bd33cc6eb39674376d0153bae591d4853282ff9d4125470f652ef77f246b4"},"schema_version":"1.0"},"canonical_sha256":"9011e2a93479f75c1b7639ef96144bfd2c2e0128ab9e91ba0109354ce5e56931","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:14.545560Z","signature_b64":"WjPsVxf4nh3MaSHF6JS5ukZG1iJ3l3rie55MigrJbzZYYfUCvPs5ZPZg2yEOGRuQe97Ou4NjkKZYU8g9nd2ABw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9011e2a93479f75c1b7639ef96144bfd2c2e0128ab9e91ba0109354ce5e56931","last_reissued_at":"2026-05-18T04:00:14.544743Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:14.544743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.2808","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-18T04:00:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a+KZL8JdLbCvW9oXKc4qIPhrBHj2yAAJGRwVIHCQqHKTVx+SpzxDtXwuAkb/+o2QxFjiLSPfFxnAoDacNJLXCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:02:13.803666Z"},"content_sha256":"64d58561cc6ab20d597f608886f39bb5f524d0981d88936253cd16f1ac499d47","schema_version":"1.0","event_id":"sha256:64d58561cc6ab20d597f608886f39bb5f524d0981d88936253cd16f1ac499d47"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:SAI6FKJUPH3VYG3WHHXZMFCL7U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Distributed Line Search for Network Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alejandro Ribeiro, Ali Jadbabaie, Michael Zargham","submitted_at":"2012-03-13T13:47:37Z","abstract_excerpt":"Dual descent methods are used to solve network optimization problems because descent directions can be computed in a distributed manner using information available either locally or at neighboring nodes. However, choosing a stepsize in the descent direction remains a challenge because its computation requires global information. This work presents an algorithm based on a local version of the Armijo rule that allows for the computation of a stepsize using only local and neighborhood information. We show that when our distributed line search algorithm is applied with a descent direction computed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2808","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-18T04:00:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kO711aOxj+mOrHU+HPLkUAc5oCDAP6qs3SWa+bry1ArfCbN/RhOGjpVtE3F4YZqUmR2BdAcDYPG/SS+IT833Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:02:13.804364Z"},"content_sha256":"2adb8b5f0e95d3470a61bb3c50056d9e26ef3992afb7c47308866bd249888b0f","schema_version":"1.0","event_id":"sha256:2adb8b5f0e95d3470a61bb3c50056d9e26ef3992afb7c47308866bd249888b0f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SAI6FKJUPH3VYG3WHHXZMFCL7U/bundle.json","state_url":"https://pith.science/pith/SAI6FKJUPH3VYG3WHHXZMFCL7U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SAI6FKJUPH3VYG3WHHXZMFCL7U/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-26T12:02:13Z","links":{"resolver":"https://pith.science/pith/SAI6FKJUPH3VYG3WHHXZMFCL7U","bundle":"https://pith.science/pith/SAI6FKJUPH3VYG3WHHXZMFCL7U/bundle.json","state":"https://pith.science/pith/SAI6FKJUPH3VYG3WHHXZMFCL7U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SAI6FKJUPH3VYG3WHHXZMFCL7U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:SAI6FKJUPH3VYG3WHHXZMFCL7U","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":"fc5bd33cc6eb39674376d0153bae591d4853282ff9d4125470f652ef77f246b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-03-13T13:47:37Z","title_canon_sha256":"dc88f8a2002f6d991f7b6cf5d5022f2f39aeb19e1e588a74397c8d01ae37f1b5"},"schema_version":"1.0","source":{"id":"1203.2808","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.2808","created_at":"2026-05-18T04:00:14Z"},{"alias_kind":"arxiv_version","alias_value":"1203.2808v1","created_at":"2026-05-18T04:00:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2808","created_at":"2026-05-18T04:00:14Z"},{"alias_kind":"pith_short_12","alias_value":"SAI6FKJUPH3V","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SAI6FKJUPH3VYG3W","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SAI6FKJU","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:2adb8b5f0e95d3470a61bb3c50056d9e26ef3992afb7c47308866bd249888b0f","target":"graph","created_at":"2026-05-18T04:00:14Z","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":"Dual descent methods are used to solve network optimization problems because descent directions can be computed in a distributed manner using information available either locally or at neighboring nodes. However, choosing a stepsize in the descent direction remains a challenge because its computation requires global information. This work presents an algorithm based on a local version of the Armijo rule that allows for the computation of a stepsize using only local and neighborhood information. We show that when our distributed line search algorithm is applied with a descent direction computed","authors_text":"Alejandro Ribeiro, Ali Jadbabaie, Michael Zargham","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-03-13T13:47:37Z","title":"A Distributed Line Search for Network Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2808","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:64d58561cc6ab20d597f608886f39bb5f524d0981d88936253cd16f1ac499d47","target":"record","created_at":"2026-05-18T04:00:14Z","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":"fc5bd33cc6eb39674376d0153bae591d4853282ff9d4125470f652ef77f246b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-03-13T13:47:37Z","title_canon_sha256":"dc88f8a2002f6d991f7b6cf5d5022f2f39aeb19e1e588a74397c8d01ae37f1b5"},"schema_version":"1.0","source":{"id":"1203.2808","kind":"arxiv","version":1}},"canonical_sha256":"9011e2a93479f75c1b7639ef96144bfd2c2e0128ab9e91ba0109354ce5e56931","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9011e2a93479f75c1b7639ef96144bfd2c2e0128ab9e91ba0109354ce5e56931","first_computed_at":"2026-05-18T04:00:14.544743Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:00:14.544743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WjPsVxf4nh3MaSHF6JS5ukZG1iJ3l3rie55MigrJbzZYYfUCvPs5ZPZg2yEOGRuQe97Ou4NjkKZYU8g9nd2ABw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:00:14.545560Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.2808","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64d58561cc6ab20d597f608886f39bb5f524d0981d88936253cd16f1ac499d47","sha256:2adb8b5f0e95d3470a61bb3c50056d9e26ef3992afb7c47308866bd249888b0f"],"state_sha256":"2209138177a053436fed8f42b5f89cf607a800b9f00ece258feec5a298013e50"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aD+JuauelWsrf4BGcRT82qm2qMBJCvMLa+Uos9doQ8SEs8DbJ68BWF8fFA10bHdrDNI4jPM+8uA5PdAiQtzgBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T12:02:13.807699Z","bundle_sha256":"13fb34183c51d74e0f9b8e50c2a971af911b2d68e72e5db41df1eb52939d496a"}}