{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:NY7D5WPVALKBH3GF3TBEP5JNKZ","short_pith_number":"pith:NY7D5WPV","canonical_record":{"source":{"id":"1110.2435","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2011-10-11T17:05:00Z","cross_cats_sorted":["cs.DC","stat.AP"],"title_canon_sha256":"b3f8e16f95ab5583ef193243967a5a9a5733e5b5cfb1d10e1d5459a82e552d44","abstract_canon_sha256":"5f05cc93e57ffa2f1d6f32063481970a68736354acc31ca7ee16527f2158c027"},"schema_version":"1.0"},"canonical_sha256":"6e3e3ed9f502d413ecc5dcc247f52d566db000fa195284d22afebabd8d073a92","source":{"kind":"arxiv","id":"1110.2435","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.2435","created_at":"2026-05-18T04:11:09Z"},{"alias_kind":"arxiv_version","alias_value":"1110.2435v1","created_at":"2026-05-18T04:11:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.2435","created_at":"2026-05-18T04:11:09Z"},{"alias_kind":"pith_short_12","alias_value":"NY7D5WPVALKB","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NY7D5WPVALKBH3GF","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NY7D5WPV","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:NY7D5WPVALKBH3GF3TBEP5JNKZ","target":"record","payload":{"canonical_record":{"source":{"id":"1110.2435","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2011-10-11T17:05:00Z","cross_cats_sorted":["cs.DC","stat.AP"],"title_canon_sha256":"b3f8e16f95ab5583ef193243967a5a9a5733e5b5cfb1d10e1d5459a82e552d44","abstract_canon_sha256":"5f05cc93e57ffa2f1d6f32063481970a68736354acc31ca7ee16527f2158c027"},"schema_version":"1.0"},"canonical_sha256":"6e3e3ed9f502d413ecc5dcc247f52d566db000fa195284d22afebabd8d073a92","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:09.055866Z","signature_b64":"vtugmTtffqknNiATQZxYmDdy/J+82n04Yz/GOEkdrp4KYOrMKOzvV3EtCKf56A3C/JgZW8gaSZ0PiD71+RKOAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e3e3ed9f502d413ecc5dcc247f52d566db000fa195284d22afebabd8d073a92","last_reissued_at":"2026-05-18T04:11:09.055295Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:09.055295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.2435","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-18T04:11:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YoQu4V33G69PP4oYY+Mkeh1ETeeT904Md1JkPFXVAEGnAWTO9UBhwGbWL7/7z0zHgf55CBEJWsS5v1K/w7XRBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:52:26.682014Z"},"content_sha256":"d7f3ebddf398fec6cd954e9f00a5949dc26e249ed54cd4a812f63b8c62c43005","schema_version":"1.0","event_id":"sha256:d7f3ebddf398fec6cd954e9f00a5949dc26e249ed54cd4a812f63b8c62c43005"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:NY7D5WPVALKBH3GF3TBEP5JNKZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Iterative Methods for Scalable Uncertainty Quantification in Complex Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","stat.AP"],"primary_cat":"stat.CO","authors_text":"Amit Surana, Andrzej Banaszuk, Tuhin Sahai","submitted_at":"2011-10-11T17:05:00Z","abstract_excerpt":"In this paper we address the problem of uncertainty management for robust design, and verification of large dynamic networks whose performance is affected by an equally large number of uncertain parameters. Many such networks (e.g. power, thermal and communication networks) are often composed of weakly interacting subnetworks. We propose intrusive and non-intrusive iterative schemes that exploit such weak interconnections to overcome dimensionality curse associated with traditional uncertainty quantification methods (e.g. generalized Polynomial Chaos, Probabilistic Collocation) and accelerate "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.2435","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-18T04:11:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C35D71e/zBMmlSTY/WXwOJNe8xkBu1w+7RQT62scEbRhM0uurvPrhcKDwopXlXXSlS/8bUo7sVWehQh7s9CDAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:52:26.682369Z"},"content_sha256":"a3219c15e1f1cfa174ed81652b8d3afdd2dde1630369d4409827027e8525254b","schema_version":"1.0","event_id":"sha256:a3219c15e1f1cfa174ed81652b8d3afdd2dde1630369d4409827027e8525254b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NY7D5WPVALKBH3GF3TBEP5JNKZ/bundle.json","state_url":"https://pith.science/pith/NY7D5WPVALKBH3GF3TBEP5JNKZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NY7D5WPVALKBH3GF3TBEP5JNKZ/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-03T22:52:26Z","links":{"resolver":"https://pith.science/pith/NY7D5WPVALKBH3GF3TBEP5JNKZ","bundle":"https://pith.science/pith/NY7D5WPVALKBH3GF3TBEP5JNKZ/bundle.json","state":"https://pith.science/pith/NY7D5WPVALKBH3GF3TBEP5JNKZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NY7D5WPVALKBH3GF3TBEP5JNKZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:NY7D5WPVALKBH3GF3TBEP5JNKZ","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":"5f05cc93e57ffa2f1d6f32063481970a68736354acc31ca7ee16527f2158c027","cross_cats_sorted":["cs.DC","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2011-10-11T17:05:00Z","title_canon_sha256":"b3f8e16f95ab5583ef193243967a5a9a5733e5b5cfb1d10e1d5459a82e552d44"},"schema_version":"1.0","source":{"id":"1110.2435","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.2435","created_at":"2026-05-18T04:11:09Z"},{"alias_kind":"arxiv_version","alias_value":"1110.2435v1","created_at":"2026-05-18T04:11:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.2435","created_at":"2026-05-18T04:11:09Z"},{"alias_kind":"pith_short_12","alias_value":"NY7D5WPVALKB","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NY7D5WPVALKBH3GF","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NY7D5WPV","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:a3219c15e1f1cfa174ed81652b8d3afdd2dde1630369d4409827027e8525254b","target":"graph","created_at":"2026-05-18T04:11:09Z","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 address the problem of uncertainty management for robust design, and verification of large dynamic networks whose performance is affected by an equally large number of uncertain parameters. Many such networks (e.g. power, thermal and communication networks) are often composed of weakly interacting subnetworks. We propose intrusive and non-intrusive iterative schemes that exploit such weak interconnections to overcome dimensionality curse associated with traditional uncertainty quantification methods (e.g. generalized Polynomial Chaos, Probabilistic Collocation) and accelerate ","authors_text":"Amit Surana, Andrzej Banaszuk, Tuhin Sahai","cross_cats":["cs.DC","stat.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2011-10-11T17:05:00Z","title":"Iterative Methods for Scalable Uncertainty Quantification in Complex Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.2435","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:d7f3ebddf398fec6cd954e9f00a5949dc26e249ed54cd4a812f63b8c62c43005","target":"record","created_at":"2026-05-18T04:11:09Z","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":"5f05cc93e57ffa2f1d6f32063481970a68736354acc31ca7ee16527f2158c027","cross_cats_sorted":["cs.DC","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2011-10-11T17:05:00Z","title_canon_sha256":"b3f8e16f95ab5583ef193243967a5a9a5733e5b5cfb1d10e1d5459a82e552d44"},"schema_version":"1.0","source":{"id":"1110.2435","kind":"arxiv","version":1}},"canonical_sha256":"6e3e3ed9f502d413ecc5dcc247f52d566db000fa195284d22afebabd8d073a92","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e3e3ed9f502d413ecc5dcc247f52d566db000fa195284d22afebabd8d073a92","first_computed_at":"2026-05-18T04:11:09.055295Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:11:09.055295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vtugmTtffqknNiATQZxYmDdy/J+82n04Yz/GOEkdrp4KYOrMKOzvV3EtCKf56A3C/JgZW8gaSZ0PiD71+RKOAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:11:09.055866Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.2435","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7f3ebddf398fec6cd954e9f00a5949dc26e249ed54cd4a812f63b8c62c43005","sha256:a3219c15e1f1cfa174ed81652b8d3afdd2dde1630369d4409827027e8525254b"],"state_sha256":"4ddf86d5a042bde4fc624a4a4f13f83bbc4e5a5b99b57990e8106971fbc09a97"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"52e/gfCnye7CdukAH22QPtqpxwzcmMYkucGTcoPUd+CG0nSavi4KknSnI24pgTaB0fq0ZZ//1Mb6PN2B3HiJBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:52:26.684357Z","bundle_sha256":"395603ed20f7ef3088bf611096169c4be31c83f35ab4f82f7c395a945f3e8c52"}}