{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:AAO2G6CMXLERU7TMSJHHSRB2PI","short_pith_number":"pith:AAO2G6CM","canonical_record":{"source":{"id":"1706.09709","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-29T12:20:18Z","cross_cats_sorted":["math.DS"],"title_canon_sha256":"03dff12022d9d13c51840be1858b1bf05eaedd15abc06c8dc87758ec27d4b6b1","abstract_canon_sha256":"5c0d026b07a75c6612431f1220c2de32f54006d14d6893a7f9c5945646c9193c"},"schema_version":"1.0"},"canonical_sha256":"001da3784cbac91a7e6c924e79443a7a22802e5e689be2d93ecbb64f1606d569","source":{"kind":"arxiv","id":"1706.09709","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.09709","created_at":"2026-05-18T00:05:00Z"},{"alias_kind":"arxiv_version","alias_value":"1706.09709v2","created_at":"2026-05-18T00:05:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09709","created_at":"2026-05-18T00:05:00Z"},{"alias_kind":"pith_short_12","alias_value":"AAO2G6CMXLER","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AAO2G6CMXLERU7TM","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AAO2G6CM","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:AAO2G6CMXLERU7TMSJHHSRB2PI","target":"record","payload":{"canonical_record":{"source":{"id":"1706.09709","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-29T12:20:18Z","cross_cats_sorted":["math.DS"],"title_canon_sha256":"03dff12022d9d13c51840be1858b1bf05eaedd15abc06c8dc87758ec27d4b6b1","abstract_canon_sha256":"5c0d026b07a75c6612431f1220c2de32f54006d14d6893a7f9c5945646c9193c"},"schema_version":"1.0"},"canonical_sha256":"001da3784cbac91a7e6c924e79443a7a22802e5e689be2d93ecbb64f1606d569","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:00.540282Z","signature_b64":"0XlCJSpHzUM4ck+BzyFs5qKvOcaPJ4SOPneC46c4o3FMzgXP/6NWeATeM25gdkd86kIAC5aTGQUw0nXmnQl2Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"001da3784cbac91a7e6c924e79443a7a22802e5e689be2d93ecbb64f1606d569","last_reissued_at":"2026-05-18T00:05:00.539837Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:00.539837Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.09709","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:05:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y1t/f/+0vhMagtKDSLmyQHZ9GCznGGT7QIAhmSZJv/aRoV972BfAPvcQZOvxbX2AXL70MfOXTFNyLFERWreMAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:49:02.147216Z"},"content_sha256":"d6df9455fb22cebc7e32811161484f5a3ce751fe68899bf800e9cfcea59697b2","schema_version":"1.0","event_id":"sha256:d6df9455fb22cebc7e32811161484f5a3ce751fe68899bf800e9cfcea59697b2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:AAO2G6CMXLERU7TMSJHHSRB2PI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Topology Reconstruction of Dynamical Networks via Constrained Lyapunov Equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"math.OC","authors_text":"Henk J. van Waarde, M. Kanat Camlibel, Pietro Tesi","submitted_at":"2017-06-29T12:20:18Z","abstract_excerpt":"The network structure (or topology) of a dynamical network is often unavailable or uncertain. Hence, we consider the problem of network reconstruction. Network reconstruction aims at inferring the topology of a dynamical network using measurements obtained from the network. In this technical note we define the notion of solvability of the network reconstruction problem. Subsequently, we provide necessary and sufficient conditions under which the network reconstruction problem is solvable. Finally, using constrained Lyapunov equations, we establish novel network reconstruction algorithms, appli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09709","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:05:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KDVSky1N6IeR3iX0HLt4YL+0mClOcFL6KiEgUxBk2VkaogBzHq6hOcr0B5uQvrPANQzs4/li7toJFgzuvKHVCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:49:02.147726Z"},"content_sha256":"6d6de0c383ae684743f0c4769c13710a55fe06e8f351b5d292f47b50458aa5a3","schema_version":"1.0","event_id":"sha256:6d6de0c383ae684743f0c4769c13710a55fe06e8f351b5d292f47b50458aa5a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AAO2G6CMXLERU7TMSJHHSRB2PI/bundle.json","state_url":"https://pith.science/pith/AAO2G6CMXLERU7TMSJHHSRB2PI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AAO2G6CMXLERU7TMSJHHSRB2PI/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-05-28T01:49:02Z","links":{"resolver":"https://pith.science/pith/AAO2G6CMXLERU7TMSJHHSRB2PI","bundle":"https://pith.science/pith/AAO2G6CMXLERU7TMSJHHSRB2PI/bundle.json","state":"https://pith.science/pith/AAO2G6CMXLERU7TMSJHHSRB2PI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AAO2G6CMXLERU7TMSJHHSRB2PI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:AAO2G6CMXLERU7TMSJHHSRB2PI","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":"5c0d026b07a75c6612431f1220c2de32f54006d14d6893a7f9c5945646c9193c","cross_cats_sorted":["math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-29T12:20:18Z","title_canon_sha256":"03dff12022d9d13c51840be1858b1bf05eaedd15abc06c8dc87758ec27d4b6b1"},"schema_version":"1.0","source":{"id":"1706.09709","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.09709","created_at":"2026-05-18T00:05:00Z"},{"alias_kind":"arxiv_version","alias_value":"1706.09709v2","created_at":"2026-05-18T00:05:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09709","created_at":"2026-05-18T00:05:00Z"},{"alias_kind":"pith_short_12","alias_value":"AAO2G6CMXLER","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AAO2G6CMXLERU7TM","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AAO2G6CM","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:6d6de0c383ae684743f0c4769c13710a55fe06e8f351b5d292f47b50458aa5a3","target":"graph","created_at":"2026-05-18T00:05:00Z","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":"The network structure (or topology) of a dynamical network is often unavailable or uncertain. Hence, we consider the problem of network reconstruction. Network reconstruction aims at inferring the topology of a dynamical network using measurements obtained from the network. In this technical note we define the notion of solvability of the network reconstruction problem. Subsequently, we provide necessary and sufficient conditions under which the network reconstruction problem is solvable. Finally, using constrained Lyapunov equations, we establish novel network reconstruction algorithms, appli","authors_text":"Henk J. van Waarde, M. Kanat Camlibel, Pietro Tesi","cross_cats":["math.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-29T12:20:18Z","title":"Topology Reconstruction of Dynamical Networks via Constrained Lyapunov Equations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09709","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:d6df9455fb22cebc7e32811161484f5a3ce751fe68899bf800e9cfcea59697b2","target":"record","created_at":"2026-05-18T00:05:00Z","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":"5c0d026b07a75c6612431f1220c2de32f54006d14d6893a7f9c5945646c9193c","cross_cats_sorted":["math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-29T12:20:18Z","title_canon_sha256":"03dff12022d9d13c51840be1858b1bf05eaedd15abc06c8dc87758ec27d4b6b1"},"schema_version":"1.0","source":{"id":"1706.09709","kind":"arxiv","version":2}},"canonical_sha256":"001da3784cbac91a7e6c924e79443a7a22802e5e689be2d93ecbb64f1606d569","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"001da3784cbac91a7e6c924e79443a7a22802e5e689be2d93ecbb64f1606d569","first_computed_at":"2026-05-18T00:05:00.539837Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:00.539837Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0XlCJSpHzUM4ck+BzyFs5qKvOcaPJ4SOPneC46c4o3FMzgXP/6NWeATeM25gdkd86kIAC5aTGQUw0nXmnQl2Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:00.540282Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.09709","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6df9455fb22cebc7e32811161484f5a3ce751fe68899bf800e9cfcea59697b2","sha256:6d6de0c383ae684743f0c4769c13710a55fe06e8f351b5d292f47b50458aa5a3"],"state_sha256":"ed5aac61b1927112f41a74d8bb5cee252c5570735a352e124b09b44e7241f931"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aQ75NypIEbs/3YFXZft9gEdes2OvjmjcGuvBmGoCkj5pWR27mziYHIJBBOfDi0MbTemH6ejVH+/a+NH7KFFgBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T01:49:02.150093Z","bundle_sha256":"cab02dfb181615f04f82562f3a0cc48d02764351a006d2bfe73e23293c53f760"}}