{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:CO6KVBLDJS756N3AW4LOC73BS4","short_pith_number":"pith:CO6KVBLD","canonical_record":{"source":{"id":"1902.03348","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-09T01:36:48Z","cross_cats_sorted":[],"title_canon_sha256":"67a4c9fbed8097d1cc846f8a375d033c5b6a8370441c724a2f414ca473ce4942","abstract_canon_sha256":"e3ef157f5196d302bd1ab3fed25d2f242f4ca6923b8fc07fe110bbf2ddf42193"},"schema_version":"1.0"},"canonical_sha256":"13bcaa85634cbfdf3760b716e17f619735d9939ec6c81881de43aa3f1c43eda1","source":{"kind":"arxiv","id":"1902.03348","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.03348","created_at":"2026-05-17T23:45:52Z"},{"alias_kind":"arxiv_version","alias_value":"1902.03348v2","created_at":"2026-05-17T23:45:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03348","created_at":"2026-05-17T23:45:52Z"},{"alias_kind":"pith_short_12","alias_value":"CO6KVBLDJS75","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CO6KVBLDJS756N3A","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CO6KVBLD","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:CO6KVBLDJS756N3AW4LOC73BS4","target":"record","payload":{"canonical_record":{"source":{"id":"1902.03348","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-09T01:36:48Z","cross_cats_sorted":[],"title_canon_sha256":"67a4c9fbed8097d1cc846f8a375d033c5b6a8370441c724a2f414ca473ce4942","abstract_canon_sha256":"e3ef157f5196d302bd1ab3fed25d2f242f4ca6923b8fc07fe110bbf2ddf42193"},"schema_version":"1.0"},"canonical_sha256":"13bcaa85634cbfdf3760b716e17f619735d9939ec6c81881de43aa3f1c43eda1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:52.088666Z","signature_b64":"gELoRjH3Po6WGtYwVtuP2IKegGHzP74Ztyl68bptH9lZLVmyEIdzjkINK2LQ4XgkcDUah9yWfhMOjd38o9/oAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13bcaa85634cbfdf3760b716e17f619735d9939ec6c81881de43aa3f1c43eda1","last_reissued_at":"2026-05-17T23:45:52.088087Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:52.088087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.03348","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-17T23:45:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KPMquKni0ija8xpyXTSDwtmkg9Ac49r8C+NCE4/CyZE6RiBp1ADQmlqcy/H57DZZLZqeCQ0vkS9nZkA+CU8GBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T20:36:30.893463Z"},"content_sha256":"951c1b4f680ddcf7805881f4e2b923022a7fe2939d4b29fa18a8ebb6fe0276c3","schema_version":"1.0","event_id":"sha256:951c1b4f680ddcf7805881f4e2b923022a7fe2939d4b29fa18a8ebb6fe0276c3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:CO6KVBLDJS756N3AW4LOC73BS4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"H2 model reduction of linear network systems by moment matching and optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"I. Necoara, T.C. Ionescu","submitted_at":"2019-02-09T01:36:48Z","abstract_excerpt":"In this paper we study the problem of model reduction of linear network systems. We aim at computing a reduced order stable approximation of the network with the same topology and optimal w.r.t. H2 norm error approximation. Our approach is based on time-domain moment matching framework, where we optimize over families of parameterized reduced order models matching a set of moments at arbitrary interpolation points. The parameterization of the low order models is in terms of the free parameters and of the interpolation points. For this family of parameterized models we formulate an optimization"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03348","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-17T23:45:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mQDG9Ehu3qANv6JmxGx26Ald6luJqxvj10L/02uy3aYU4r398FpOa90XXi0oi6L51UMAnd8JGBBxnUJ/7giJCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T20:36:30.893812Z"},"content_sha256":"8e0e35f4e91086ece10f43710b7fb466df249e1b79c3f2de9144348a40e35d97","schema_version":"1.0","event_id":"sha256:8e0e35f4e91086ece10f43710b7fb466df249e1b79c3f2de9144348a40e35d97"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CO6KVBLDJS756N3AW4LOC73BS4/bundle.json","state_url":"https://pith.science/pith/CO6KVBLDJS756N3AW4LOC73BS4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CO6KVBLDJS756N3AW4LOC73BS4/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-22T20:36:30Z","links":{"resolver":"https://pith.science/pith/CO6KVBLDJS756N3AW4LOC73BS4","bundle":"https://pith.science/pith/CO6KVBLDJS756N3AW4LOC73BS4/bundle.json","state":"https://pith.science/pith/CO6KVBLDJS756N3AW4LOC73BS4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CO6KVBLDJS756N3AW4LOC73BS4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CO6KVBLDJS756N3AW4LOC73BS4","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":"e3ef157f5196d302bd1ab3fed25d2f242f4ca6923b8fc07fe110bbf2ddf42193","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-09T01:36:48Z","title_canon_sha256":"67a4c9fbed8097d1cc846f8a375d033c5b6a8370441c724a2f414ca473ce4942"},"schema_version":"1.0","source":{"id":"1902.03348","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.03348","created_at":"2026-05-17T23:45:52Z"},{"alias_kind":"arxiv_version","alias_value":"1902.03348v2","created_at":"2026-05-17T23:45:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03348","created_at":"2026-05-17T23:45:52Z"},{"alias_kind":"pith_short_12","alias_value":"CO6KVBLDJS75","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CO6KVBLDJS756N3A","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CO6KVBLD","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:8e0e35f4e91086ece10f43710b7fb466df249e1b79c3f2de9144348a40e35d97","target":"graph","created_at":"2026-05-17T23:45:52Z","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 study the problem of model reduction of linear network systems. We aim at computing a reduced order stable approximation of the network with the same topology and optimal w.r.t. H2 norm error approximation. Our approach is based on time-domain moment matching framework, where we optimize over families of parameterized reduced order models matching a set of moments at arbitrary interpolation points. The parameterization of the low order models is in terms of the free parameters and of the interpolation points. For this family of parameterized models we formulate an optimization","authors_text":"I. Necoara, T.C. Ionescu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-09T01:36:48Z","title":"H2 model reduction of linear network systems by moment matching and optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03348","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:951c1b4f680ddcf7805881f4e2b923022a7fe2939d4b29fa18a8ebb6fe0276c3","target":"record","created_at":"2026-05-17T23:45:52Z","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":"e3ef157f5196d302bd1ab3fed25d2f242f4ca6923b8fc07fe110bbf2ddf42193","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-09T01:36:48Z","title_canon_sha256":"67a4c9fbed8097d1cc846f8a375d033c5b6a8370441c724a2f414ca473ce4942"},"schema_version":"1.0","source":{"id":"1902.03348","kind":"arxiv","version":2}},"canonical_sha256":"13bcaa85634cbfdf3760b716e17f619735d9939ec6c81881de43aa3f1c43eda1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"13bcaa85634cbfdf3760b716e17f619735d9939ec6c81881de43aa3f1c43eda1","first_computed_at":"2026-05-17T23:45:52.088087Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:52.088087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gELoRjH3Po6WGtYwVtuP2IKegGHzP74Ztyl68bptH9lZLVmyEIdzjkINK2LQ4XgkcDUah9yWfhMOjd38o9/oAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:52.088666Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.03348","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:951c1b4f680ddcf7805881f4e2b923022a7fe2939d4b29fa18a8ebb6fe0276c3","sha256:8e0e35f4e91086ece10f43710b7fb466df249e1b79c3f2de9144348a40e35d97"],"state_sha256":"3862e7a372043d0eeaa48a803be5504883310ee70276f96f35137c65553b74f9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wnZS1zlo+iT6aXl03KzVo61JTzJD20zqo0Ww0jH95wZaOc+/6tocfQfQUPIOs6Ef3fkYHyDGThgxSpLYSgaVBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T20:36:30.895760Z","bundle_sha256":"2335e760dd12e78f4773e9a8b2e3d2bca746236c26de33aa4c3bef4e86b02842"}}