{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:W54QDPDPNQ56BDZL3TZZQ4A7GH","short_pith_number":"pith:W54QDPDP","canonical_record":{"source":{"id":"1811.08677","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-11-21T10:52:57Z","cross_cats_sorted":[],"title_canon_sha256":"de1c5fd3925902f8c7f358086b72f14dde2ba840885feb44376af8626fce85b6","abstract_canon_sha256":"694cef3e016a393ad66568c3887d18185c2c99dc030ce48d156d6f355046f69e"},"schema_version":"1.0"},"canonical_sha256":"b77901bc6f6c3be08f2bdcf398701f31c8d106bea33bf8fd466dced645238b9f","source":{"kind":"arxiv","id":"1811.08677","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.08677","created_at":"2026-05-18T00:00:11Z"},{"alias_kind":"arxiv_version","alias_value":"1811.08677v1","created_at":"2026-05-18T00:00:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08677","created_at":"2026-05-18T00:00:11Z"},{"alias_kind":"pith_short_12","alias_value":"W54QDPDPNQ56","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"W54QDPDPNQ56BDZL","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"W54QDPDP","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:W54QDPDPNQ56BDZL3TZZQ4A7GH","target":"record","payload":{"canonical_record":{"source":{"id":"1811.08677","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-11-21T10:52:57Z","cross_cats_sorted":[],"title_canon_sha256":"de1c5fd3925902f8c7f358086b72f14dde2ba840885feb44376af8626fce85b6","abstract_canon_sha256":"694cef3e016a393ad66568c3887d18185c2c99dc030ce48d156d6f355046f69e"},"schema_version":"1.0"},"canonical_sha256":"b77901bc6f6c3be08f2bdcf398701f31c8d106bea33bf8fd466dced645238b9f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:11.913580Z","signature_b64":"hd2bJdGKCFms0oQNndgZIkImoX0sOwCYuregYSPO/FCNWXIfLtdW14uk3mCBz6rx3+df7kyf+t4ZiLeXZml9DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b77901bc6f6c3be08f2bdcf398701f31c8d106bea33bf8fd466dced645238b9f","last_reissued_at":"2026-05-18T00:00:11.913037Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:11.913037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.08677","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-18T00:00:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cd1fzRYV6dGeYDS9HQr95e8KKhdyGq9N5/u4qdhhKqRtRDDpP5t70/O0QZcPwSrhPAN6hSWG52m/Ad4YOQaaCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:03:48.087605Z"},"content_sha256":"b0e66dcbc6b80376732e7367a68f5ba11f129aa85bc7d7af382fd6ef3e9d3788","schema_version":"1.0","event_id":"sha256:b0e66dcbc6b80376732e7367a68f5ba11f129aa85bc7d7af382fd6ef3e9d3788"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:W54QDPDPNQ56BDZL3TZZQ4A7GH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A state-space approach to sparse dynamic network reconstruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Johan Thunberg, Jorge Goncalves, Lennart Ljung, Zuogong Yue","submitted_at":"2018-11-21T10:52:57Z","abstract_excerpt":"Dynamic network reconstruction has been shown to be challenging due to the requirements on sparse network structures and network identifiability. The direct parametric method (e.g., using ARX models) requires a large amount of parameters in model selection. Amongst the parametric models, only a restricted class can easily be used to address network sparsity without rendering the optimization problem intractable. To overcome these problems, this paper presents a state-space-based method, which significantly reduces the number of unknown parameters in model selection. Furthermore, we avoid vario"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08677","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-18T00:00:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qLJuIWFjqpa6w7NbuPXBE79Zz8c514h6oUBMtX/q+A98yDMyc+BRS9l+c1iOdH9c24Qeli/+D1Ix72a5cIntAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:03:48.087948Z"},"content_sha256":"a2f6b590298c4acc165a736e44754c42b087e1a17d356cb1e658d161267e3be8","schema_version":"1.0","event_id":"sha256:a2f6b590298c4acc165a736e44754c42b087e1a17d356cb1e658d161267e3be8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W54QDPDPNQ56BDZL3TZZQ4A7GH/bundle.json","state_url":"https://pith.science/pith/W54QDPDPNQ56BDZL3TZZQ4A7GH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W54QDPDPNQ56BDZL3TZZQ4A7GH/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-02T18:03:48Z","links":{"resolver":"https://pith.science/pith/W54QDPDPNQ56BDZL3TZZQ4A7GH","bundle":"https://pith.science/pith/W54QDPDPNQ56BDZL3TZZQ4A7GH/bundle.json","state":"https://pith.science/pith/W54QDPDPNQ56BDZL3TZZQ4A7GH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W54QDPDPNQ56BDZL3TZZQ4A7GH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:W54QDPDPNQ56BDZL3TZZQ4A7GH","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":"694cef3e016a393ad66568c3887d18185c2c99dc030ce48d156d6f355046f69e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-11-21T10:52:57Z","title_canon_sha256":"de1c5fd3925902f8c7f358086b72f14dde2ba840885feb44376af8626fce85b6"},"schema_version":"1.0","source":{"id":"1811.08677","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.08677","created_at":"2026-05-18T00:00:11Z"},{"alias_kind":"arxiv_version","alias_value":"1811.08677v1","created_at":"2026-05-18T00:00:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08677","created_at":"2026-05-18T00:00:11Z"},{"alias_kind":"pith_short_12","alias_value":"W54QDPDPNQ56","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"W54QDPDPNQ56BDZL","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"W54QDPDP","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:a2f6b590298c4acc165a736e44754c42b087e1a17d356cb1e658d161267e3be8","target":"graph","created_at":"2026-05-18T00:00:11Z","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":"Dynamic network reconstruction has been shown to be challenging due to the requirements on sparse network structures and network identifiability. The direct parametric method (e.g., using ARX models) requires a large amount of parameters in model selection. Amongst the parametric models, only a restricted class can easily be used to address network sparsity without rendering the optimization problem intractable. To overcome these problems, this paper presents a state-space-based method, which significantly reduces the number of unknown parameters in model selection. Furthermore, we avoid vario","authors_text":"Johan Thunberg, Jorge Goncalves, Lennart Ljung, Zuogong Yue","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-11-21T10:52:57Z","title":"A state-space approach to sparse dynamic network reconstruction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08677","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:b0e66dcbc6b80376732e7367a68f5ba11f129aa85bc7d7af382fd6ef3e9d3788","target":"record","created_at":"2026-05-18T00:00:11Z","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":"694cef3e016a393ad66568c3887d18185c2c99dc030ce48d156d6f355046f69e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-11-21T10:52:57Z","title_canon_sha256":"de1c5fd3925902f8c7f358086b72f14dde2ba840885feb44376af8626fce85b6"},"schema_version":"1.0","source":{"id":"1811.08677","kind":"arxiv","version":1}},"canonical_sha256":"b77901bc6f6c3be08f2bdcf398701f31c8d106bea33bf8fd466dced645238b9f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b77901bc6f6c3be08f2bdcf398701f31c8d106bea33bf8fd466dced645238b9f","first_computed_at":"2026-05-18T00:00:11.913037Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:11.913037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hd2bJdGKCFms0oQNndgZIkImoX0sOwCYuregYSPO/FCNWXIfLtdW14uk3mCBz6rx3+df7kyf+t4ZiLeXZml9DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:11.913580Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.08677","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0e66dcbc6b80376732e7367a68f5ba11f129aa85bc7d7af382fd6ef3e9d3788","sha256:a2f6b590298c4acc165a736e44754c42b087e1a17d356cb1e658d161267e3be8"],"state_sha256":"5b0bff532fac59b96b3567def1151571e23ec298173477a4b838d2274de67de6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E4UWXP404gASU7o1ooq2VDdqHBTaC44XPS/h8YocT1jg6xejerfvx+r1Lk8SS4rD9UycVzKQYL3yFMaT+3nPAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T18:03:48.089871Z","bundle_sha256":"4f2f02312f742a87495018a3afd330e2ac61f9f3ea2f1f9a6c0176123f80c942"}}