{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:3SA5U2OSIY32FG4ZLGT55I64OU","short_pith_number":"pith:3SA5U2OS","canonical_record":{"source":{"id":"2005.01079","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2020-05-03T13:04:40Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"3265a5386e6a202a7bf3648af603d51184156f133f1fa2d0f9d522c75f3d316e","abstract_canon_sha256":"b6baf9089a2621398077b1410de9e7eb49422f5524aff4b87a92631b92446257"},"schema_version":"1.0"},"canonical_sha256":"dc81da69d24637a29b9959a7dea3dc75110f266a01e61e56d0c7d0a086a2aeb0","source":{"kind":"arxiv","id":"2005.01079","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.01079","created_at":"2026-07-05T01:00:04Z"},{"alias_kind":"arxiv_version","alias_value":"2005.01079v1","created_at":"2026-07-05T01:00:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.01079","created_at":"2026-07-05T01:00:04Z"},{"alias_kind":"pith_short_12","alias_value":"3SA5U2OSIY32","created_at":"2026-07-05T01:00:04Z"},{"alias_kind":"pith_short_16","alias_value":"3SA5U2OSIY32FG4Z","created_at":"2026-07-05T01:00:04Z"},{"alias_kind":"pith_short_8","alias_value":"3SA5U2OS","created_at":"2026-07-05T01:00:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:3SA5U2OSIY32FG4ZLGT55I64OU","target":"record","payload":{"canonical_record":{"source":{"id":"2005.01079","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2020-05-03T13:04:40Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"3265a5386e6a202a7bf3648af603d51184156f133f1fa2d0f9d522c75f3d316e","abstract_canon_sha256":"b6baf9089a2621398077b1410de9e7eb49422f5524aff4b87a92631b92446257"},"schema_version":"1.0"},"canonical_sha256":"dc81da69d24637a29b9959a7dea3dc75110f266a01e61e56d0c7d0a086a2aeb0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:00:04.100272Z","signature_b64":"Frbq4G+L98rsel8ls3SlJbBNSxYYDggutFks6tpj92Z9mIZaFIDPnWab1Hl4V+Jv6PeoyYpm6n52rkmldq69Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc81da69d24637a29b9959a7dea3dc75110f266a01e61e56d0c7d0a086a2aeb0","last_reissued_at":"2026-07-05T01:00:04.099903Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:00:04.099903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2005.01079","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-07-05T01:00:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3qRaAVbPQ0lDseTop2GenrFq3RUfadufYMY6cCn1eavWV9YCwWZiYYld3OrORYYi7fGPBA5DFLJ3Web3PdsMCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T23:43:35.549827Z"},"content_sha256":"27a19f483b00ce8ace12d5383b8d79b9ee602644550f098c7d4a75871f155ea1","schema_version":"1.0","event_id":"sha256:27a19f483b00ce8ace12d5383b8d79b9ee602644550f098c7d4a75871f155ea1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:3SA5U2OSIY32FG4ZLGT55I64OU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Second-order Multi-Agent Optimization over unbalanced network without boundedness of gradients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Guojian Ren, Haokun Hu, Lipo Mo, Yongguang Yu","submitted_at":"2020-05-03T13:04:40Z","abstract_excerpt":"This paper is mainly devoted to the distributed second-order multi-agent optimization problem with unbalanced and directed networks. To deal with this problem, a new distributed algorithm is proposed based on the local neighbor information and the private objective functions. By a coordination transformation, the closed-loop system is divided into two first-order subsystems, which is easier to be dealt with. Under the assumption of the strong connectivity of networks, it is proved that all agent can collaboratively converge to some optimal solution of the team objective function, where the gra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.01079","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2005.01079/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:00:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n+8Ev2zrmWG19HUqKz5tCpAQuVX3AvAJjmdb+78T0qfN0SR0/lC5oMdBvXXTiRPuYG+E9EMR4Ignln5vxiNjAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T23:43:35.550204Z"},"content_sha256":"b6767810b9ec9d2a6c96dfcc5fbec71533d34be23f2c4b12320a543ccc10caf2","schema_version":"1.0","event_id":"sha256:b6767810b9ec9d2a6c96dfcc5fbec71533d34be23f2c4b12320a543ccc10caf2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3SA5U2OSIY32FG4ZLGT55I64OU/bundle.json","state_url":"https://pith.science/pith/3SA5U2OSIY32FG4ZLGT55I64OU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3SA5U2OSIY32FG4ZLGT55I64OU/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-07-12T23:43:35Z","links":{"resolver":"https://pith.science/pith/3SA5U2OSIY32FG4ZLGT55I64OU","bundle":"https://pith.science/pith/3SA5U2OSIY32FG4ZLGT55I64OU/bundle.json","state":"https://pith.science/pith/3SA5U2OSIY32FG4ZLGT55I64OU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3SA5U2OSIY32FG4ZLGT55I64OU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:3SA5U2OSIY32FG4ZLGT55I64OU","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":"b6baf9089a2621398077b1410de9e7eb49422f5524aff4b87a92631b92446257","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2020-05-03T13:04:40Z","title_canon_sha256":"3265a5386e6a202a7bf3648af603d51184156f133f1fa2d0f9d522c75f3d316e"},"schema_version":"1.0","source":{"id":"2005.01079","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.01079","created_at":"2026-07-05T01:00:04Z"},{"alias_kind":"arxiv_version","alias_value":"2005.01079v1","created_at":"2026-07-05T01:00:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.01079","created_at":"2026-07-05T01:00:04Z"},{"alias_kind":"pith_short_12","alias_value":"3SA5U2OSIY32","created_at":"2026-07-05T01:00:04Z"},{"alias_kind":"pith_short_16","alias_value":"3SA5U2OSIY32FG4Z","created_at":"2026-07-05T01:00:04Z"},{"alias_kind":"pith_short_8","alias_value":"3SA5U2OS","created_at":"2026-07-05T01:00:04Z"}],"graph_snapshots":[{"event_id":"sha256:b6767810b9ec9d2a6c96dfcc5fbec71533d34be23f2c4b12320a543ccc10caf2","target":"graph","created_at":"2026-07-05T01:00:04Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2005.01079/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper is mainly devoted to the distributed second-order multi-agent optimization problem with unbalanced and directed networks. To deal with this problem, a new distributed algorithm is proposed based on the local neighbor information and the private objective functions. By a coordination transformation, the closed-loop system is divided into two first-order subsystems, which is easier to be dealt with. Under the assumption of the strong connectivity of networks, it is proved that all agent can collaboratively converge to some optimal solution of the team objective function, where the gra","authors_text":"Guojian Ren, Haokun Hu, Lipo Mo, Yongguang Yu","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2020-05-03T13:04:40Z","title":"Distributed Second-order Multi-Agent Optimization over unbalanced network without boundedness of gradients"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.01079","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:27a19f483b00ce8ace12d5383b8d79b9ee602644550f098c7d4a75871f155ea1","target":"record","created_at":"2026-07-05T01:00:04Z","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":"b6baf9089a2621398077b1410de9e7eb49422f5524aff4b87a92631b92446257","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2020-05-03T13:04:40Z","title_canon_sha256":"3265a5386e6a202a7bf3648af603d51184156f133f1fa2d0f9d522c75f3d316e"},"schema_version":"1.0","source":{"id":"2005.01079","kind":"arxiv","version":1}},"canonical_sha256":"dc81da69d24637a29b9959a7dea3dc75110f266a01e61e56d0c7d0a086a2aeb0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc81da69d24637a29b9959a7dea3dc75110f266a01e61e56d0c7d0a086a2aeb0","first_computed_at":"2026-07-05T01:00:04.099903Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:00:04.099903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Frbq4G+L98rsel8ls3SlJbBNSxYYDggutFks6tpj92Z9mIZaFIDPnWab1Hl4V+Jv6PeoyYpm6n52rkmldq69Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:00:04.100272Z","signed_message":"canonical_sha256_bytes"},"source_id":"2005.01079","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27a19f483b00ce8ace12d5383b8d79b9ee602644550f098c7d4a75871f155ea1","sha256:b6767810b9ec9d2a6c96dfcc5fbec71533d34be23f2c4b12320a543ccc10caf2"],"state_sha256":"c0b3bde060ed2973bfee58ade09f75414c2a30d2b68c77500c34e748e93dd302"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DMeeyBuA9guG8zOAXIWqY2qrKb5WVqxj864O0VaEtrNORk7jz18AZ198ViTwvrBSfkYTGjtDuPPxBEHawYkIDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-12T23:43:35.552450Z","bundle_sha256":"5b67ea3077b97e06faa3bd699f03251132c16e2845e37f2df38bc50412139256"}}