{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:K5X5O3VWBFXBBWIVNAV3BVSBQJ","short_pith_number":"pith:K5X5O3VW","canonical_record":{"source":{"id":"1412.0684","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-11-27T01:03:50Z","cross_cats_sorted":["math.DS"],"title_canon_sha256":"636ed4d7fe024ddfc3c51cc2b466f3ba6f4f997eb5b30b86fbe488fb5ff62e37","abstract_canon_sha256":"a3839f3e47eb5ce0c6cf8997a7ce6d3d8a0b6a41b14200f6f3258256ded7abfe"},"schema_version":"1.0"},"canonical_sha256":"576fd76eb6096e10d915682bb0d641826348059396c6b00982ce4400f8ce56ea","source":{"kind":"arxiv","id":"1412.0684","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.0684","created_at":"2026-05-18T02:32:21Z"},{"alias_kind":"arxiv_version","alias_value":"1412.0684v1","created_at":"2026-05-18T02:32:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0684","created_at":"2026-05-18T02:32:21Z"},{"alias_kind":"pith_short_12","alias_value":"K5X5O3VWBFXB","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"K5X5O3VWBFXBBWIV","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"K5X5O3VW","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:K5X5O3VWBFXBBWIVNAV3BVSBQJ","target":"record","payload":{"canonical_record":{"source":{"id":"1412.0684","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-11-27T01:03:50Z","cross_cats_sorted":["math.DS"],"title_canon_sha256":"636ed4d7fe024ddfc3c51cc2b466f3ba6f4f997eb5b30b86fbe488fb5ff62e37","abstract_canon_sha256":"a3839f3e47eb5ce0c6cf8997a7ce6d3d8a0b6a41b14200f6f3258256ded7abfe"},"schema_version":"1.0"},"canonical_sha256":"576fd76eb6096e10d915682bb0d641826348059396c6b00982ce4400f8ce56ea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:21.406719Z","signature_b64":"WeosvZDb5dY0kClmZltSHX1KXr8JaHbENNIBiqcT4IaTC9w4lWsAgd1sTxCWrbGD/R6uL3GbOQhhviKqUbEQDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"576fd76eb6096e10d915682bb0d641826348059396c6b00982ce4400f8ce56ea","last_reissued_at":"2026-05-18T02:32:21.406338Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:21.406338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.0684","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-05-18T02:32:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"80vwrgt4a5ZMoAIabrF5B6+3bZo4flN44lU7C8gSCADDqfPYdccuPgmjzN0ImdKVQ3gDtq8KMGA6RNLah6awAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T10:20:14.032076Z"},"content_sha256":"9ba5c71f3c4a6b97649516659aca3e9253557405c40ef501c0ffba09fabd86f7","schema_version":"1.0","event_id":"sha256:9ba5c71f3c4a6b97649516659aca3e9253557405c40ef501c0ffba09fabd86f7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:K5X5O3VWBFXBBWIVNAV3BVSBQJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Global Identifiability Condition for Consensus Networks with Tree Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"cs.SY","authors_text":"Aranya Chakrabortty, Pramod P. Khargonekar, Seyedbehzad Nabavi","submitted_at":"2014-11-27T01:03:50Z","abstract_excerpt":"In this paper we present a sufficient condition that guarantees identifiability of linear network dynamic systems exhibiting continuous-time weighted consensus protocols with acyclic structure. Each edge of the underlying network graph $\\mathcal G$ of the system is defined by a constant parameter, referred to as the weight of the edge, while each node is defined by a scalar state whose dynamics evolve as the weighted linear combination of its difference with the states of its neighboring nodes. Following the classical definitions of identifiability and indistinguishability, we first derive a c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0684","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"},"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-18T02:32:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rv3HdH3OYfZCJNhs0VnLYgbdE1q4vIa4g37ALnzzaGLTZdVNJQtXwEt31gAUiXEg7xbORYOTGrIjV5NdksCaDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T10:20:14.032414Z"},"content_sha256":"5a0715ce0be1b687ed8781283cc182559edb22db892c0b185a2186e2787883c0","schema_version":"1.0","event_id":"sha256:5a0715ce0be1b687ed8781283cc182559edb22db892c0b185a2186e2787883c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K5X5O3VWBFXBBWIVNAV3BVSBQJ/bundle.json","state_url":"https://pith.science/pith/K5X5O3VWBFXBBWIVNAV3BVSBQJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K5X5O3VWBFXBBWIVNAV3BVSBQJ/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-09T10:20:14Z","links":{"resolver":"https://pith.science/pith/K5X5O3VWBFXBBWIVNAV3BVSBQJ","bundle":"https://pith.science/pith/K5X5O3VWBFXBBWIVNAV3BVSBQJ/bundle.json","state":"https://pith.science/pith/K5X5O3VWBFXBBWIVNAV3BVSBQJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K5X5O3VWBFXBBWIVNAV3BVSBQJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:K5X5O3VWBFXBBWIVNAV3BVSBQJ","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":"a3839f3e47eb5ce0c6cf8997a7ce6d3d8a0b6a41b14200f6f3258256ded7abfe","cross_cats_sorted":["math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-11-27T01:03:50Z","title_canon_sha256":"636ed4d7fe024ddfc3c51cc2b466f3ba6f4f997eb5b30b86fbe488fb5ff62e37"},"schema_version":"1.0","source":{"id":"1412.0684","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.0684","created_at":"2026-05-18T02:32:21Z"},{"alias_kind":"arxiv_version","alias_value":"1412.0684v1","created_at":"2026-05-18T02:32:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0684","created_at":"2026-05-18T02:32:21Z"},{"alias_kind":"pith_short_12","alias_value":"K5X5O3VWBFXB","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"K5X5O3VWBFXBBWIV","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"K5X5O3VW","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:5a0715ce0be1b687ed8781283cc182559edb22db892c0b185a2186e2787883c0","target":"graph","created_at":"2026-05-18T02:32:21Z","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 we present a sufficient condition that guarantees identifiability of linear network dynamic systems exhibiting continuous-time weighted consensus protocols with acyclic structure. Each edge of the underlying network graph $\\mathcal G$ of the system is defined by a constant parameter, referred to as the weight of the edge, while each node is defined by a scalar state whose dynamics evolve as the weighted linear combination of its difference with the states of its neighboring nodes. Following the classical definitions of identifiability and indistinguishability, we first derive a c","authors_text":"Aranya Chakrabortty, Pramod P. Khargonekar, Seyedbehzad Nabavi","cross_cats":["math.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-11-27T01:03:50Z","title":"A Global Identifiability Condition for Consensus Networks with Tree Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0684","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:9ba5c71f3c4a6b97649516659aca3e9253557405c40ef501c0ffba09fabd86f7","target":"record","created_at":"2026-05-18T02:32:21Z","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":"a3839f3e47eb5ce0c6cf8997a7ce6d3d8a0b6a41b14200f6f3258256ded7abfe","cross_cats_sorted":["math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-11-27T01:03:50Z","title_canon_sha256":"636ed4d7fe024ddfc3c51cc2b466f3ba6f4f997eb5b30b86fbe488fb5ff62e37"},"schema_version":"1.0","source":{"id":"1412.0684","kind":"arxiv","version":1}},"canonical_sha256":"576fd76eb6096e10d915682bb0d641826348059396c6b00982ce4400f8ce56ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"576fd76eb6096e10d915682bb0d641826348059396c6b00982ce4400f8ce56ea","first_computed_at":"2026-05-18T02:32:21.406338Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:21.406338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WeosvZDb5dY0kClmZltSHX1KXr8JaHbENNIBiqcT4IaTC9w4lWsAgd1sTxCWrbGD/R6uL3GbOQhhviKqUbEQDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:21.406719Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.0684","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ba5c71f3c4a6b97649516659aca3e9253557405c40ef501c0ffba09fabd86f7","sha256:5a0715ce0be1b687ed8781283cc182559edb22db892c0b185a2186e2787883c0"],"state_sha256":"7a92ab9055d83535a95f49aadf059c700cac927b3addf8fce73b6b46313647a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jJE+bPhJMmIrOATf38dp1KARX8xnhZgAZy/G2h3ZC+ghimNTPyexVOBElo1CH7PuZRwacGDgXWwJqMx7mRGmDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T10:20:14.034192Z","bundle_sha256":"749d8b354b79d35f953908f8626fca6d522aa4df1c637e4de89c68b494bb909f"}}