{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:FBVJ7SBUJZ2HPWXAJXHEINQVOH","short_pith_number":"pith:FBVJ7SBU","canonical_record":{"source":{"id":"1403.7175","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-27T19:13:34Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"1ddec29485ad63db78226be62e81124fe0c25195e7d1b1f81bed692b804a6d1e","abstract_canon_sha256":"b3307a8802512cbbb9035bc8092ce7e0fb97b0bd5560871e90a667f865eba6cc"},"schema_version":"1.0"},"canonical_sha256":"286a9fc8344e7477dae04dce44361571f2bd881ddd2cb00fceaf4a800dc9a873","source":{"kind":"arxiv","id":"1403.7175","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.7175","created_at":"2026-05-18T02:47:07Z"},{"alias_kind":"arxiv_version","alias_value":"1403.7175v2","created_at":"2026-05-18T02:47:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.7175","created_at":"2026-05-18T02:47:07Z"},{"alias_kind":"pith_short_12","alias_value":"FBVJ7SBUJZ2H","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FBVJ7SBUJZ2HPWXA","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FBVJ7SBU","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:FBVJ7SBUJZ2HPWXAJXHEINQVOH","target":"record","payload":{"canonical_record":{"source":{"id":"1403.7175","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-27T19:13:34Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"1ddec29485ad63db78226be62e81124fe0c25195e7d1b1f81bed692b804a6d1e","abstract_canon_sha256":"b3307a8802512cbbb9035bc8092ce7e0fb97b0bd5560871e90a667f865eba6cc"},"schema_version":"1.0"},"canonical_sha256":"286a9fc8344e7477dae04dce44361571f2bd881ddd2cb00fceaf4a800dc9a873","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:07.355991Z","signature_b64":"mFtfZ55Qk+Ns/g86FWIxYy1f+95DpYvjrNJPTxMpDbsJPwHnogO3acR8WIEV17jClQz1ZRWNrg4Cyu5Sml0SCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"286a9fc8344e7477dae04dce44361571f2bd881ddd2cb00fceaf4a800dc9a873","last_reissued_at":"2026-05-18T02:47:07.355447Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:07.355447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.7175","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-18T02:47:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"msD43RiBFIqjFqh45MqGQVSW0xwOUP1vGCWTvTIZaQhO0a9XPFE4FFcx+f0GTT6QJ7ugEcWaDxmQYKfwoTl4CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:58:49.385093Z"},"content_sha256":"016e203f48fc3a768f3d3af2a19e0ffb024a15c3b7bf022ee8d25dc9ea568251","schema_version":"1.0","event_id":"sha256:016e203f48fc3a768f3d3af2a19e0ffb024a15c3b7bf022ee8d25dc9ea568251"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:FBVJ7SBUJZ2HPWXAJXHEINQVOH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-Rank and Low-Order Decompositions for Local System Identification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Anders Rantzer, Nikolai Matni","submitted_at":"2014-03-27T19:13:34Z","abstract_excerpt":"As distributed systems increase in size, the need for scalable algorithms becomes more and more important. We argue that in the context of system identification, an essential building block of any scalable algorithm is the ability to estimate local dynamics within a large interconnected system. We show that in what we term the \"full interconnection measurement\" setting, this task is easily solved using existing system identification methods. We also propose a promising heuristic for the \"hidden interconnection measurement\" case, in which contributions to local measurements from both local and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.7175","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-18T02:47:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oVPQXAP+0LRUG4CGcNr942ZXyaYT8EhxEVWyGgKw1434m85xc8zIgxG7t2t+Q4XioovMBBiaA55+tAbDso2IBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:58:49.385761Z"},"content_sha256":"e83a3e97022d36368c5665b408577f271e336abe3df947105a761aa2b59d9450","schema_version":"1.0","event_id":"sha256:e83a3e97022d36368c5665b408577f271e336abe3df947105a761aa2b59d9450"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FBVJ7SBUJZ2HPWXAJXHEINQVOH/bundle.json","state_url":"https://pith.science/pith/FBVJ7SBUJZ2HPWXAJXHEINQVOH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FBVJ7SBUJZ2HPWXAJXHEINQVOH/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-08T22:58:49Z","links":{"resolver":"https://pith.science/pith/FBVJ7SBUJZ2HPWXAJXHEINQVOH","bundle":"https://pith.science/pith/FBVJ7SBUJZ2HPWXAJXHEINQVOH/bundle.json","state":"https://pith.science/pith/FBVJ7SBUJZ2HPWXAJXHEINQVOH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FBVJ7SBUJZ2HPWXAJXHEINQVOH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FBVJ7SBUJZ2HPWXAJXHEINQVOH","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":"b3307a8802512cbbb9035bc8092ce7e0fb97b0bd5560871e90a667f865eba6cc","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-27T19:13:34Z","title_canon_sha256":"1ddec29485ad63db78226be62e81124fe0c25195e7d1b1f81bed692b804a6d1e"},"schema_version":"1.0","source":{"id":"1403.7175","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.7175","created_at":"2026-05-18T02:47:07Z"},{"alias_kind":"arxiv_version","alias_value":"1403.7175v2","created_at":"2026-05-18T02:47:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.7175","created_at":"2026-05-18T02:47:07Z"},{"alias_kind":"pith_short_12","alias_value":"FBVJ7SBUJZ2H","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FBVJ7SBUJZ2HPWXA","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FBVJ7SBU","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:e83a3e97022d36368c5665b408577f271e336abe3df947105a761aa2b59d9450","target":"graph","created_at":"2026-05-18T02:47:07Z","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":"As distributed systems increase in size, the need for scalable algorithms becomes more and more important. We argue that in the context of system identification, an essential building block of any scalable algorithm is the ability to estimate local dynamics within a large interconnected system. We show that in what we term the \"full interconnection measurement\" setting, this task is easily solved using existing system identification methods. We also propose a promising heuristic for the \"hidden interconnection measurement\" case, in which contributions to local measurements from both local and ","authors_text":"Anders Rantzer, Nikolai Matni","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-27T19:13:34Z","title":"Low-Rank and Low-Order Decompositions for Local System Identification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.7175","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:016e203f48fc3a768f3d3af2a19e0ffb024a15c3b7bf022ee8d25dc9ea568251","target":"record","created_at":"2026-05-18T02:47:07Z","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":"b3307a8802512cbbb9035bc8092ce7e0fb97b0bd5560871e90a667f865eba6cc","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-27T19:13:34Z","title_canon_sha256":"1ddec29485ad63db78226be62e81124fe0c25195e7d1b1f81bed692b804a6d1e"},"schema_version":"1.0","source":{"id":"1403.7175","kind":"arxiv","version":2}},"canonical_sha256":"286a9fc8344e7477dae04dce44361571f2bd881ddd2cb00fceaf4a800dc9a873","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"286a9fc8344e7477dae04dce44361571f2bd881ddd2cb00fceaf4a800dc9a873","first_computed_at":"2026-05-18T02:47:07.355447Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:07.355447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mFtfZ55Qk+Ns/g86FWIxYy1f+95DpYvjrNJPTxMpDbsJPwHnogO3acR8WIEV17jClQz1ZRWNrg4Cyu5Sml0SCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:07.355991Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.7175","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:016e203f48fc3a768f3d3af2a19e0ffb024a15c3b7bf022ee8d25dc9ea568251","sha256:e83a3e97022d36368c5665b408577f271e336abe3df947105a761aa2b59d9450"],"state_sha256":"ddddbe46757323dcf662d042cc1418084e97b66b9fd5a0258db9cab6bbbb1d48"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wCdhe1tXciw7LLZAjNPH8SVosLc3UcfJlETL04M7vegDwl4nP8e8R+nz2qzJNj8sY3PwscRK7Fpm7wEa4+TYCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T22:58:49.388912Z","bundle_sha256":"2a946b1bf99a03cb6b9feab7b79ee27f415e74c5737d76ab60ae081c8aeddda0"}}