{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GKNP6SHYCHJ2DVJRMBFVCR4D2D","short_pith_number":"pith:GKNP6SHY","schema_version":"1.0","canonical_sha256":"329aff48f811d3a1d531604b514783d0d8c84b16fb8d4f765ff6e6d587af40f0","source":{"kind":"arxiv","id":"1803.00851","version":2},"attestation_state":"computed","paper":{"title":"A nonlinear graph-based theory for dynamical network observability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"nlin.CD","authors_text":"Christophe Letellier, Irene Sendi\\~na-Nadal, Luis A. Aguirre","submitted_at":"2018-03-02T14:02:04Z","abstract_excerpt":"A faithful description of the state of a complex dynamical network would require, in principle, the measurement of all its $d$ variables, an infeasible task for systems with practical limited access and composed of many nodes with high dimensional dynamics. However, even if the network dynamics is observable from a reduced set of measured variables, how to reliably identifying such a minimum set of variables providing full observability remains an unsolved problem. From the Jacobian matrix of the governing equations of nonlinear systems, we construct a {\\it pruned fluence graph} in which the n"},"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":"1803.00851","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.CD","submitted_at":"2018-03-02T14:02:04Z","cross_cats_sorted":[],"title_canon_sha256":"3e378674abe416cfb057daabaf951118c3776e72fda628f9709bc502fdbbe7a6","abstract_canon_sha256":"58fa76bdd90833a88b25c211841cf843db393fd9459b4413f86f556557f5cd79"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:07.467069Z","signature_b64":"IuD5krypkJHb21kzf7vYG861fsL1nLPonWp429d1vS9Td8lxtAPM+7XAQndcO97uU6+OjqqB95wKZx6/Tn42Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"329aff48f811d3a1d531604b514783d0d8c84b16fb8d4f765ff6e6d587af40f0","last_reissued_at":"2026-05-17T23:47:07.466428Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:07.466428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A nonlinear graph-based theory for dynamical network observability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"nlin.CD","authors_text":"Christophe Letellier, Irene Sendi\\~na-Nadal, Luis A. Aguirre","submitted_at":"2018-03-02T14:02:04Z","abstract_excerpt":"A faithful description of the state of a complex dynamical network would require, in principle, the measurement of all its $d$ variables, an infeasible task for systems with practical limited access and composed of many nodes with high dimensional dynamics. However, even if the network dynamics is observable from a reduced set of measured variables, how to reliably identifying such a minimum set of variables providing full observability remains an unsolved problem. From the Jacobian matrix of the governing equations of nonlinear systems, we construct a {\\it pruned fluence graph} in which the n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.00851","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1803.00851","created_at":"2026-05-17T23:47:07.466525+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.00851v2","created_at":"2026-05-17T23:47:07.466525+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.00851","created_at":"2026-05-17T23:47:07.466525+00:00"},{"alias_kind":"pith_short_12","alias_value":"GKNP6SHYCHJ2","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GKNP6SHYCHJ2DVJR","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GKNP6SHY","created_at":"2026-05-18T12:32:25.280505+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/GKNP6SHYCHJ2DVJRMBFVCR4D2D","json":"https://pith.science/pith/GKNP6SHYCHJ2DVJRMBFVCR4D2D.json","graph_json":"https://pith.science/api/pith-number/GKNP6SHYCHJ2DVJRMBFVCR4D2D/graph.json","events_json":"https://pith.science/api/pith-number/GKNP6SHYCHJ2DVJRMBFVCR4D2D/events.json","paper":"https://pith.science/paper/GKNP6SHY"},"agent_actions":{"view_html":"https://pith.science/pith/GKNP6SHYCHJ2DVJRMBFVCR4D2D","download_json":"https://pith.science/pith/GKNP6SHYCHJ2DVJRMBFVCR4D2D.json","view_paper":"https://pith.science/paper/GKNP6SHY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.00851&json=true","fetch_graph":"https://pith.science/api/pith-number/GKNP6SHYCHJ2DVJRMBFVCR4D2D/graph.json","fetch_events":"https://pith.science/api/pith-number/GKNP6SHYCHJ2DVJRMBFVCR4D2D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GKNP6SHYCHJ2DVJRMBFVCR4D2D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GKNP6SHYCHJ2DVJRMBFVCR4D2D/action/storage_attestation","attest_author":"https://pith.science/pith/GKNP6SHYCHJ2DVJRMBFVCR4D2D/action/author_attestation","sign_citation":"https://pith.science/pith/GKNP6SHYCHJ2DVJRMBFVCR4D2D/action/citation_signature","submit_replication":"https://pith.science/pith/GKNP6SHYCHJ2DVJRMBFVCR4D2D/action/replication_record"}},"created_at":"2026-05-17T23:47:07.466525+00:00","updated_at":"2026-05-17T23:47:07.466525+00:00"}