{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:3EIOWWDCNJT3HAIYLI6ZTJR3MS","short_pith_number":"pith:3EIOWWDC","schema_version":"1.0","canonical_sha256":"d910eb58626a67b381185a3d99a63b64990e6fdd72d7c6c2bbe1cc0ac2db80a6","source":{"kind":"arxiv","id":"1901.11405","version":3},"attestation_state":"computed","paper":{"title":"Optimal Sampling for Dynamic Complex Networks with Graph-Bandlimited Initialization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Bin Li, Weisi Guo, Zhuangkun Wei","submitted_at":"2019-01-30T08:12:55Z","abstract_excerpt":"Many engineering, social, and biological complex systems consist of dynamical elements connected via a large-scale network. Monitoring the network's dynamics is essential for a variety of maintenance and scientific purposes. Whilst we understand how to optimally sample a single dynamic element or a non-dynamic graph, we do not possess a theory on how to optimally sample networked dynamical elements. Here, we study nonlinear dynamic graph signals on a fixed complex network. We define the necessary conditions for optimal sampling in the combining time- and graph-domain to fully recover the netwo"},"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":"1901.11405","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-01-30T08:12:55Z","cross_cats_sorted":[],"title_canon_sha256":"1cbce5a1127aea65f44c144d9cb98c91e39c8c304e2a353879d71dad4d55a0cf","abstract_canon_sha256":"6760993dea3819f5f5d6b8fb28185bbe0ea4b607aec7705223c2b1612364092f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:39.435051Z","signature_b64":"vuq2WF4DRvh9TG+fOgH/a0jl/UmMylbibEbRDSVbvn+9wYhBD6PVP0QIGi+LSWO3qxkoAlfm25HZ8yGPj6Z/Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d910eb58626a67b381185a3d99a63b64990e6fdd72d7c6c2bbe1cc0ac2db80a6","last_reissued_at":"2026-05-17T23:47:39.434466Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:39.434466Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Sampling for Dynamic Complex Networks with Graph-Bandlimited Initialization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Bin Li, Weisi Guo, Zhuangkun Wei","submitted_at":"2019-01-30T08:12:55Z","abstract_excerpt":"Many engineering, social, and biological complex systems consist of dynamical elements connected via a large-scale network. Monitoring the network's dynamics is essential for a variety of maintenance and scientific purposes. Whilst we understand how to optimally sample a single dynamic element or a non-dynamic graph, we do not possess a theory on how to optimally sample networked dynamical elements. Here, we study nonlinear dynamic graph signals on a fixed complex network. We define the necessary conditions for optimal sampling in the combining time- and graph-domain to fully recover the netwo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.11405","kind":"arxiv","version":3},"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":"1901.11405","created_at":"2026-05-17T23:47:39.434566+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.11405v3","created_at":"2026-05-17T23:47:39.434566+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.11405","created_at":"2026-05-17T23:47:39.434566+00:00"},{"alias_kind":"pith_short_12","alias_value":"3EIOWWDCNJT3","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"3EIOWWDCNJT3HAIY","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"3EIOWWDC","created_at":"2026-05-18T12:33:07.085635+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/3EIOWWDCNJT3HAIYLI6ZTJR3MS","json":"https://pith.science/pith/3EIOWWDCNJT3HAIYLI6ZTJR3MS.json","graph_json":"https://pith.science/api/pith-number/3EIOWWDCNJT3HAIYLI6ZTJR3MS/graph.json","events_json":"https://pith.science/api/pith-number/3EIOWWDCNJT3HAIYLI6ZTJR3MS/events.json","paper":"https://pith.science/paper/3EIOWWDC"},"agent_actions":{"view_html":"https://pith.science/pith/3EIOWWDCNJT3HAIYLI6ZTJR3MS","download_json":"https://pith.science/pith/3EIOWWDCNJT3HAIYLI6ZTJR3MS.json","view_paper":"https://pith.science/paper/3EIOWWDC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.11405&json=true","fetch_graph":"https://pith.science/api/pith-number/3EIOWWDCNJT3HAIYLI6ZTJR3MS/graph.json","fetch_events":"https://pith.science/api/pith-number/3EIOWWDCNJT3HAIYLI6ZTJR3MS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3EIOWWDCNJT3HAIYLI6ZTJR3MS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3EIOWWDCNJT3HAIYLI6ZTJR3MS/action/storage_attestation","attest_author":"https://pith.science/pith/3EIOWWDCNJT3HAIYLI6ZTJR3MS/action/author_attestation","sign_citation":"https://pith.science/pith/3EIOWWDCNJT3HAIYLI6ZTJR3MS/action/citation_signature","submit_replication":"https://pith.science/pith/3EIOWWDCNJT3HAIYLI6ZTJR3MS/action/replication_record"}},"created_at":"2026-05-17T23:47:39.434566+00:00","updated_at":"2026-05-17T23:47:39.434566+00:00"}