{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:7WDXPP5XXFZQCBZJQ7DLMAAWJ5","short_pith_number":"pith:7WDXPP5X","canonical_record":{"source":{"id":"1002.2283","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-02-11T05:51:47Z","cross_cats_sorted":["cs.DC","cs.SY"],"title_canon_sha256":"7e04a5284025a59da05332e8d63fbcc2eb441dad255ca6c06118a7d6f5ad0680","abstract_canon_sha256":"6b99ad98fe5673c8fcadfce71e3db5061771e0239044ed47c7bfb4b3b6d8301f"},"schema_version":"1.0"},"canonical_sha256":"fd8777bfb7b97301072987c6b600164f65aacda70091c2f5db6a487bf6d7c812","source":{"kind":"arxiv","id":"1002.2283","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1002.2283","created_at":"2026-05-18T04:29:35Z"},{"alias_kind":"arxiv_version","alias_value":"1002.2283v3","created_at":"2026-05-18T04:29:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.2283","created_at":"2026-05-18T04:29:35Z"},{"alias_kind":"pith_short_12","alias_value":"7WDXPP5XXFZQ","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"7WDXPP5XXFZQCBZJ","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"7WDXPP5X","created_at":"2026-05-18T12:26:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:7WDXPP5XXFZQCBZJQ7DLMAAWJ5","target":"record","payload":{"canonical_record":{"source":{"id":"1002.2283","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-02-11T05:51:47Z","cross_cats_sorted":["cs.DC","cs.SY"],"title_canon_sha256":"7e04a5284025a59da05332e8d63fbcc2eb441dad255ca6c06118a7d6f5ad0680","abstract_canon_sha256":"6b99ad98fe5673c8fcadfce71e3db5061771e0239044ed47c7bfb4b3b6d8301f"},"schema_version":"1.0"},"canonical_sha256":"fd8777bfb7b97301072987c6b600164f65aacda70091c2f5db6a487bf6d7c812","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:29:35.026428Z","signature_b64":"7jzheE+XhsFbj3/O8Qa/j5fcDybqgqjLPRiKn4ft1vmMzSkoKy2jDN2qy8pgna1r0DKiTLkUM1Bl1i5E/2uwDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd8777bfb7b97301072987c6b600164f65aacda70091c2f5db6a487bf6d7c812","last_reissued_at":"2026-05-18T04:29:35.025789Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:29:35.025789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1002.2283","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-18T04:29:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UZiXFOJu7x+ebxW7siP4VtuR92q+cC1oPOjEjcAYRq0n+TdVMPsDfQhOrTw0gbiL50PtCmb8jWGg30sSqm2ZDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T18:25:55.333992Z"},"content_sha256":"3d56c14c5fefdc2898c690f6251dfaa1cdf70bb13c8795d52abfe08b2e3f2562","schema_version":"1.0","event_id":"sha256:3d56c14c5fefdc2898c690f6251dfaa1cdf70bb13c8795d52abfe08b2e3f2562"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:7WDXPP5XXFZQCBZJQ7DLMAAWJ5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Gossip Algorithms for Convex Consensus Optimization over Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.SY"],"primary_cat":"math.OC","authors_text":"Choon Yik Tang, Jie Lu, Paul R. Regier, Travis D. Bow","submitted_at":"2010-02-11T05:51:47Z","abstract_excerpt":"In many applications, nodes in a network desire not only a consensus, but an optimal one. To date, a family of subgradient algorithms have been proposed to solve this problem under general convexity assumptions. This paper shows that, for the scalar case and by assuming a bit more, novel non-gradient-based algorithms with appealing features can be constructed. Specifically, we develop Pairwise Equalizing (PE) and Pairwise Bisectioning (PB), two gossip algorithms that solve unconstrained, separable, convex consensus optimization problems over undirected networks with time-varying topologies, wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.2283","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-18T04:29:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aCF6gHX5I5mKt1nHc1cVVu6RYrmUrrLWXRVdmfwgy3eNL1WCdQFJ1hjkccF+HEy825qBUq+cCm4vzdg48vv2Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T18:25:55.334347Z"},"content_sha256":"bbf79aa0e27561605e1ab1299e5d1ee9d6912d1b2d67cc1efc15ddb9c2f94a87","schema_version":"1.0","event_id":"sha256:bbf79aa0e27561605e1ab1299e5d1ee9d6912d1b2d67cc1efc15ddb9c2f94a87"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7WDXPP5XXFZQCBZJQ7DLMAAWJ5/bundle.json","state_url":"https://pith.science/pith/7WDXPP5XXFZQCBZJQ7DLMAAWJ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7WDXPP5XXFZQCBZJQ7DLMAAWJ5/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-06-30T18:25:55Z","links":{"resolver":"https://pith.science/pith/7WDXPP5XXFZQCBZJQ7DLMAAWJ5","bundle":"https://pith.science/pith/7WDXPP5XXFZQCBZJQ7DLMAAWJ5/bundle.json","state":"https://pith.science/pith/7WDXPP5XXFZQCBZJQ7DLMAAWJ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7WDXPP5XXFZQCBZJQ7DLMAAWJ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:7WDXPP5XXFZQCBZJQ7DLMAAWJ5","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":"6b99ad98fe5673c8fcadfce71e3db5061771e0239044ed47c7bfb4b3b6d8301f","cross_cats_sorted":["cs.DC","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-02-11T05:51:47Z","title_canon_sha256":"7e04a5284025a59da05332e8d63fbcc2eb441dad255ca6c06118a7d6f5ad0680"},"schema_version":"1.0","source":{"id":"1002.2283","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1002.2283","created_at":"2026-05-18T04:29:35Z"},{"alias_kind":"arxiv_version","alias_value":"1002.2283v3","created_at":"2026-05-18T04:29:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.2283","created_at":"2026-05-18T04:29:35Z"},{"alias_kind":"pith_short_12","alias_value":"7WDXPP5XXFZQ","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"7WDXPP5XXFZQCBZJ","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"7WDXPP5X","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:bbf79aa0e27561605e1ab1299e5d1ee9d6912d1b2d67cc1efc15ddb9c2f94a87","target":"graph","created_at":"2026-05-18T04:29:35Z","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 many applications, nodes in a network desire not only a consensus, but an optimal one. To date, a family of subgradient algorithms have been proposed to solve this problem under general convexity assumptions. This paper shows that, for the scalar case and by assuming a bit more, novel non-gradient-based algorithms with appealing features can be constructed. Specifically, we develop Pairwise Equalizing (PE) and Pairwise Bisectioning (PB), two gossip algorithms that solve unconstrained, separable, convex consensus optimization problems over undirected networks with time-varying topologies, wh","authors_text":"Choon Yik Tang, Jie Lu, Paul R. Regier, Travis D. Bow","cross_cats":["cs.DC","cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-02-11T05:51:47Z","title":"Gossip Algorithms for Convex Consensus Optimization over Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.2283","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:3d56c14c5fefdc2898c690f6251dfaa1cdf70bb13c8795d52abfe08b2e3f2562","target":"record","created_at":"2026-05-18T04:29:35Z","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":"6b99ad98fe5673c8fcadfce71e3db5061771e0239044ed47c7bfb4b3b6d8301f","cross_cats_sorted":["cs.DC","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-02-11T05:51:47Z","title_canon_sha256":"7e04a5284025a59da05332e8d63fbcc2eb441dad255ca6c06118a7d6f5ad0680"},"schema_version":"1.0","source":{"id":"1002.2283","kind":"arxiv","version":3}},"canonical_sha256":"fd8777bfb7b97301072987c6b600164f65aacda70091c2f5db6a487bf6d7c812","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd8777bfb7b97301072987c6b600164f65aacda70091c2f5db6a487bf6d7c812","first_computed_at":"2026-05-18T04:29:35.025789Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:29:35.025789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7jzheE+XhsFbj3/O8Qa/j5fcDybqgqjLPRiKn4ft1vmMzSkoKy2jDN2qy8pgna1r0DKiTLkUM1Bl1i5E/2uwDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:29:35.026428Z","signed_message":"canonical_sha256_bytes"},"source_id":"1002.2283","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d56c14c5fefdc2898c690f6251dfaa1cdf70bb13c8795d52abfe08b2e3f2562","sha256:bbf79aa0e27561605e1ab1299e5d1ee9d6912d1b2d67cc1efc15ddb9c2f94a87"],"state_sha256":"0620e00b434450289c284e9f1b739cd3cfe500c90a963c0e614b2e763ae90041"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iStvAGwD7KJpvZ9iwVj+sUJZAGvRuDkEWC2w4sOWjQKMHU/sPKyqvuXHFcqWLcj0rbgJ6WFUTQIKBpj1kREiCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T18:25:55.336363Z","bundle_sha256":"16c4f349afc1d872973cbbee24c3f7f0682b6afd5310acb66843af171ed450c6"}}