{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:KSNPSL5IR3GZIABIUWONMZUWUL","short_pith_number":"pith:KSNPSL5I","schema_version":"1.0","canonical_sha256":"549af92fa88ecd940028a59cd66696a2c49d98b3b494ecda5e1ce5c966b9f5b0","source":{"kind":"arxiv","id":"0911.0232","version":6},"attestation_state":"computed","paper":{"title":"Distributed strategies for generating weight-balanced and doubly stochastic digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Bahman Gharesifard, Jorge Cortes","submitted_at":"2009-11-02T04:24:59Z","abstract_excerpt":"Weight-balanced and doubly stochastic digraphs are two classes of digraphs that play an essential role in a variety of cooperative control problems, including formation control, distributed averaging, and optimization. We refer to a digraph as doubly stochasticable (weight-balanceable) if it admits a doubly stochastic (weight-balanced) adjacency matrix. This paper studies the characterization of both classes of digraphs, and introduces distributed algorithms to compute the appropriate set of weights in each case."},"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":"0911.0232","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-11-02T04:24:59Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"9e760aa6bb5d777c735a367b269336c4f0481af8e80020a1be6a9482286a8f9a","abstract_canon_sha256":"f058d77f710759324bf9b21bf978520fafe45bee0723fe48429b9652f886ef98"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:48.428212Z","signature_b64":"srKG+100JdUw7TQadaq07DuG2blrQcYKZ/3dVhbyzRFGJ1C6jbinKO41Q4J1YIpFHamZ/wnjRdZ222x2HWtUDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"549af92fa88ecd940028a59cd66696a2c49d98b3b494ecda5e1ce5c966b9f5b0","last_reissued_at":"2026-05-18T04:10:48.427780Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:48.427780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed strategies for generating weight-balanced and doubly stochastic digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Bahman Gharesifard, Jorge Cortes","submitted_at":"2009-11-02T04:24:59Z","abstract_excerpt":"Weight-balanced and doubly stochastic digraphs are two classes of digraphs that play an essential role in a variety of cooperative control problems, including formation control, distributed averaging, and optimization. We refer to a digraph as doubly stochasticable (weight-balanceable) if it admits a doubly stochastic (weight-balanced) adjacency matrix. This paper studies the characterization of both classes of digraphs, and introduces distributed algorithms to compute the appropriate set of weights in each case."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.0232","kind":"arxiv","version":6},"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":"0911.0232","created_at":"2026-05-18T04:10:48.427840+00:00"},{"alias_kind":"arxiv_version","alias_value":"0911.0232v6","created_at":"2026-05-18T04:10:48.427840+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.0232","created_at":"2026-05-18T04:10:48.427840+00:00"},{"alias_kind":"pith_short_12","alias_value":"KSNPSL5IR3GZ","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"KSNPSL5IR3GZIABI","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"KSNPSL5I","created_at":"2026-05-18T12:26:00.592388+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/KSNPSL5IR3GZIABIUWONMZUWUL","json":"https://pith.science/pith/KSNPSL5IR3GZIABIUWONMZUWUL.json","graph_json":"https://pith.science/api/pith-number/KSNPSL5IR3GZIABIUWONMZUWUL/graph.json","events_json":"https://pith.science/api/pith-number/KSNPSL5IR3GZIABIUWONMZUWUL/events.json","paper":"https://pith.science/paper/KSNPSL5I"},"agent_actions":{"view_html":"https://pith.science/pith/KSNPSL5IR3GZIABIUWONMZUWUL","download_json":"https://pith.science/pith/KSNPSL5IR3GZIABIUWONMZUWUL.json","view_paper":"https://pith.science/paper/KSNPSL5I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0911.0232&json=true","fetch_graph":"https://pith.science/api/pith-number/KSNPSL5IR3GZIABIUWONMZUWUL/graph.json","fetch_events":"https://pith.science/api/pith-number/KSNPSL5IR3GZIABIUWONMZUWUL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KSNPSL5IR3GZIABIUWONMZUWUL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KSNPSL5IR3GZIABIUWONMZUWUL/action/storage_attestation","attest_author":"https://pith.science/pith/KSNPSL5IR3GZIABIUWONMZUWUL/action/author_attestation","sign_citation":"https://pith.science/pith/KSNPSL5IR3GZIABIUWONMZUWUL/action/citation_signature","submit_replication":"https://pith.science/pith/KSNPSL5IR3GZIABIUWONMZUWUL/action/replication_record"}},"created_at":"2026-05-18T04:10:48.427840+00:00","updated_at":"2026-05-18T04:10:48.427840+00:00"}