{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:VHOM7OXCYQLSX24DYGNGSF7DZL","short_pith_number":"pith:VHOM7OXC","canonical_record":{"source":{"id":"1609.03161","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-09-11T13:57:51Z","cross_cats_sorted":[],"title_canon_sha256":"f2c5292125fcdd3368abb9a0696ed3ae007a0e70e4f01d0418ebcc46cc8c8bce","abstract_canon_sha256":"64d7cdc7700acd15e7eac1a48e5032f3d94e7f353d9914b15a1f5a37ea41bb3e"},"schema_version":"1.0"},"canonical_sha256":"a9dccfbae2c4172beb83c19a6917e3caf983ec588cb9c630eaa5c4cad3e4a625","source":{"kind":"arxiv","id":"1609.03161","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03161","created_at":"2026-05-18T00:42:35Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03161v2","created_at":"2026-05-18T00:42:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03161","created_at":"2026-05-18T00:42:35Z"},{"alias_kind":"pith_short_12","alias_value":"VHOM7OXCYQLS","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VHOM7OXCYQLSX24D","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VHOM7OXC","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:VHOM7OXCYQLSX24DYGNGSF7DZL","target":"record","payload":{"canonical_record":{"source":{"id":"1609.03161","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-09-11T13:57:51Z","cross_cats_sorted":[],"title_canon_sha256":"f2c5292125fcdd3368abb9a0696ed3ae007a0e70e4f01d0418ebcc46cc8c8bce","abstract_canon_sha256":"64d7cdc7700acd15e7eac1a48e5032f3d94e7f353d9914b15a1f5a37ea41bb3e"},"schema_version":"1.0"},"canonical_sha256":"a9dccfbae2c4172beb83c19a6917e3caf983ec588cb9c630eaa5c4cad3e4a625","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:35.096268Z","signature_b64":"jK/eIFaSbcZWwfF2KlH040EAptlZ7RLstzLF+nUMDqhPFhplT7RviHv8aXarL884Xy7h5qZgotildyeGHLWjAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9dccfbae2c4172beb83c19a6917e3caf983ec588cb9c630eaa5c4cad3e4a625","last_reissued_at":"2026-05-18T00:42:35.095819Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:35.095819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.03161","source_version":2,"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:42:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+jo6VYAj/5SSaas/EOfTr30GZ4L6I6KFrAcgWtSNLK7QqNkMoezLiU/nUDbJOZeg8LyHP299tHwFRCXuwUXmCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T12:51:39.802575Z"},"content_sha256":"50240ca29c3eae050bf08c310e9f42fdc363d5e78798f904ba4158b867223b14","schema_version":"1.0","event_id":"sha256:50240ca29c3eae050bf08c310e9f42fdc363d5e78798f904ba4158b867223b14"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:VHOM7OXCYQLSX24DYGNGSF7DZL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed algorithms for solving convex inequalities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Gangshan Jing, Kaihong Lu, Long Wang","submitted_at":"2016-09-11T13:57:51Z","abstract_excerpt":"In this paper, a distributed subgradient-based algorithm is proposed for continuous-time multi-agent systems to search a feasible solution to convex inequalities. The algorithm involves each agent achieving a state constrained by its own inequalities while exchanging local information with other agents under a time-varying directed communication graph. With the validity of a mild connectivity condition associated with the communication graph, it is shown that all agents will reach agreement asymptotically and the consensus state is in the solution set of the inequalities. Furthermore, the meth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03161","kind":"arxiv","version":2},"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:42:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/xfBtzxM8RUhH1y9ml7N7rXYHJD3/QwIP3L4q5CaRZtV79AZqPCiz3vbo42faJ4DcjlN7MXOOZDbOAyEFSblAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T12:51:39.802915Z"},"content_sha256":"2a6c6e1f8c84bc9b56859a696e76a1b7c536aa08f1e1cb30f48d763bffa3af0b","schema_version":"1.0","event_id":"sha256:2a6c6e1f8c84bc9b56859a696e76a1b7c536aa08f1e1cb30f48d763bffa3af0b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VHOM7OXCYQLSX24DYGNGSF7DZL/bundle.json","state_url":"https://pith.science/pith/VHOM7OXCYQLSX24DYGNGSF7DZL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VHOM7OXCYQLSX24DYGNGSF7DZL/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-26T12:51:39Z","links":{"resolver":"https://pith.science/pith/VHOM7OXCYQLSX24DYGNGSF7DZL","bundle":"https://pith.science/pith/VHOM7OXCYQLSX24DYGNGSF7DZL/bundle.json","state":"https://pith.science/pith/VHOM7OXCYQLSX24DYGNGSF7DZL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VHOM7OXCYQLSX24DYGNGSF7DZL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VHOM7OXCYQLSX24DYGNGSF7DZL","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":"64d7cdc7700acd15e7eac1a48e5032f3d94e7f353d9914b15a1f5a37ea41bb3e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-09-11T13:57:51Z","title_canon_sha256":"f2c5292125fcdd3368abb9a0696ed3ae007a0e70e4f01d0418ebcc46cc8c8bce"},"schema_version":"1.0","source":{"id":"1609.03161","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03161","created_at":"2026-05-18T00:42:35Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03161v2","created_at":"2026-05-18T00:42:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03161","created_at":"2026-05-18T00:42:35Z"},{"alias_kind":"pith_short_12","alias_value":"VHOM7OXCYQLS","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VHOM7OXCYQLSX24D","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VHOM7OXC","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:2a6c6e1f8c84bc9b56859a696e76a1b7c536aa08f1e1cb30f48d763bffa3af0b","target":"graph","created_at":"2026-05-18T00:42: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 this paper, a distributed subgradient-based algorithm is proposed for continuous-time multi-agent systems to search a feasible solution to convex inequalities. The algorithm involves each agent achieving a state constrained by its own inequalities while exchanging local information with other agents under a time-varying directed communication graph. With the validity of a mild connectivity condition associated with the communication graph, it is shown that all agents will reach agreement asymptotically and the consensus state is in the solution set of the inequalities. Furthermore, the meth","authors_text":"Gangshan Jing, Kaihong Lu, Long Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-09-11T13:57:51Z","title":"Distributed algorithms for solving convex inequalities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03161","kind":"arxiv","version":2},"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:50240ca29c3eae050bf08c310e9f42fdc363d5e78798f904ba4158b867223b14","target":"record","created_at":"2026-05-18T00:42: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":"64d7cdc7700acd15e7eac1a48e5032f3d94e7f353d9914b15a1f5a37ea41bb3e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-09-11T13:57:51Z","title_canon_sha256":"f2c5292125fcdd3368abb9a0696ed3ae007a0e70e4f01d0418ebcc46cc8c8bce"},"schema_version":"1.0","source":{"id":"1609.03161","kind":"arxiv","version":2}},"canonical_sha256":"a9dccfbae2c4172beb83c19a6917e3caf983ec588cb9c630eaa5c4cad3e4a625","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9dccfbae2c4172beb83c19a6917e3caf983ec588cb9c630eaa5c4cad3e4a625","first_computed_at":"2026-05-18T00:42:35.095819Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:35.095819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jK/eIFaSbcZWwfF2KlH040EAptlZ7RLstzLF+nUMDqhPFhplT7RviHv8aXarL884Xy7h5qZgotildyeGHLWjAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:35.096268Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.03161","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50240ca29c3eae050bf08c310e9f42fdc363d5e78798f904ba4158b867223b14","sha256:2a6c6e1f8c84bc9b56859a696e76a1b7c536aa08f1e1cb30f48d763bffa3af0b"],"state_sha256":"f3379d6d8fe323659fe04bd83d61f4ebca40e0aeb94959b1832d86b13edf236c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S3V8q1VxIzcUMTsWbtZgbfiPCsa6+gg3zzokChpf2CB1YxtT6ktXdOQJgH6F8c5VMitsxzcKF6PtNu5tplSCBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T12:51:39.804751Z","bundle_sha256":"8cf74e44418b006eedd7a61b32379d572894f6411efb946991bb52dafd21c114"}}