{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TVDLM4FOYVHWWH5667D4KPWB6X","short_pith_number":"pith:TVDLM4FO","schema_version":"1.0","canonical_sha256":"9d46b670aec54f6b1fbef7c7c53ec1f5f54d622492ab29b999b2dbc3cd089d94","source":{"kind":"arxiv","id":"1507.04177","version":1},"attestation_state":"computed","paper":{"title":"The projection method for continuous-time consensus seeking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","math.OC"],"primary_cat":"cs.SY","authors_text":"Pavel Chebotarev, Rafig Agaev","submitted_at":"2015-07-15T11:53:31Z","abstract_excerpt":"For the case where the dependency digraph has no spanning in-tree, we characterize the region of convergence of the basic continuous-time distributed consensus algorithm and show that consensus can be achieved by employing the method of orthogonal projection, which has been proposed for the discrete-time coordination problem."},"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":"1507.04177","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-07-15T11:53:31Z","cross_cats_sorted":["cs.MA","math.OC"],"title_canon_sha256":"b720190e9d5d649b481b072489b4c30866d640715504e4fdff5097129dddd486","abstract_canon_sha256":"8e3b5b891111675ea47f4543fee9f90867f6fb89825d6b8c0f08f0a76af9ebfd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:58.252944Z","signature_b64":"dBVk6gtPm2p5uycxa4xZ2+d/CtqrkRIpmqzLkvh0G6TiqdTvNlpyNeZZlldqTGrLpBhWj5XEB1WIPCHt78LHBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d46b670aec54f6b1fbef7c7c53ec1f5f54d622492ab29b999b2dbc3cd089d94","last_reissued_at":"2026-05-18T00:54:58.252569Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:58.252569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The projection method for continuous-time consensus seeking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","math.OC"],"primary_cat":"cs.SY","authors_text":"Pavel Chebotarev, Rafig Agaev","submitted_at":"2015-07-15T11:53:31Z","abstract_excerpt":"For the case where the dependency digraph has no spanning in-tree, we characterize the region of convergence of the basic continuous-time distributed consensus algorithm and show that consensus can be achieved by employing the method of orthogonal projection, which has been proposed for the discrete-time coordination problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04177","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1507.04177","created_at":"2026-05-18T00:54:58.252627+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.04177v1","created_at":"2026-05-18T00:54:58.252627+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04177","created_at":"2026-05-18T00:54:58.252627+00:00"},{"alias_kind":"pith_short_12","alias_value":"TVDLM4FOYVHW","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TVDLM4FOYVHWWH56","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TVDLM4FO","created_at":"2026-05-18T12:29:42.218222+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/TVDLM4FOYVHWWH5667D4KPWB6X","json":"https://pith.science/pith/TVDLM4FOYVHWWH5667D4KPWB6X.json","graph_json":"https://pith.science/api/pith-number/TVDLM4FOYVHWWH5667D4KPWB6X/graph.json","events_json":"https://pith.science/api/pith-number/TVDLM4FOYVHWWH5667D4KPWB6X/events.json","paper":"https://pith.science/paper/TVDLM4FO"},"agent_actions":{"view_html":"https://pith.science/pith/TVDLM4FOYVHWWH5667D4KPWB6X","download_json":"https://pith.science/pith/TVDLM4FOYVHWWH5667D4KPWB6X.json","view_paper":"https://pith.science/paper/TVDLM4FO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.04177&json=true","fetch_graph":"https://pith.science/api/pith-number/TVDLM4FOYVHWWH5667D4KPWB6X/graph.json","fetch_events":"https://pith.science/api/pith-number/TVDLM4FOYVHWWH5667D4KPWB6X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TVDLM4FOYVHWWH5667D4KPWB6X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TVDLM4FOYVHWWH5667D4KPWB6X/action/storage_attestation","attest_author":"https://pith.science/pith/TVDLM4FOYVHWWH5667D4KPWB6X/action/author_attestation","sign_citation":"https://pith.science/pith/TVDLM4FOYVHWWH5667D4KPWB6X/action/citation_signature","submit_replication":"https://pith.science/pith/TVDLM4FOYVHWWH5667D4KPWB6X/action/replication_record"}},"created_at":"2026-05-18T00:54:58.252627+00:00","updated_at":"2026-05-18T00:54:58.252627+00:00"}