{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UKSKMU5Q3BRX6IPJZUJYNU7GYX","short_pith_number":"pith:UKSKMU5Q","schema_version":"1.0","canonical_sha256":"a2a4a653b0d8637f21e9cd1386d3e6c5e862fb364096b84cc0670f4e4681b924","source":{"kind":"arxiv","id":"1508.02489","version":1},"attestation_state":"computed","paper":{"title":"Probabilistic Power Flow Computation via Low-Rank and Sparse Tensor Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"cs.CE","authors_text":"Hung Dinh Nguyen, Konstantin Turitsyn, Luca Daniel, Zheng Zhang","submitted_at":"2015-08-11T05:08:25Z","abstract_excerpt":"This paper presents a tensor-recovery method to solve probabilistic power flow problems. Our approach generates a high-dimensional and sparse generalized polynomial-chaos expansion that provides useful statistical information. The result can also speed up other essential routines in power systems (e.g., stochastic planning, operations and controls).\n  Instead of simulating a power flow equation at all quadrature points, our approach only simulates an extremely small subset of samples. We suggest a model to exploit the underlying low-rank and sparse structure of high-dimensional simulation data"},"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":"1508.02489","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2015-08-11T05:08:25Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"7fcc7838a42e6fb3fe3592092702c1287fadbb913999c940e92ccca08f9798dd","abstract_canon_sha256":"ee0551b8d7b1a11f4a8d48ffec92ec936a966c0de182d3b1f8f57fef09ded0f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:29.058194Z","signature_b64":"9Jn0IICIV1ngqKhSxiYOPPGJOEIC42y5ihWORvYIIP5t32PWm2h3h+zqbI0FiBKLZueg5eT0jGj6YgDdVEk1Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2a4a653b0d8637f21e9cd1386d3e6c5e862fb364096b84cc0670f4e4681b924","last_reissued_at":"2026-05-18T01:35:29.057480Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:29.057480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Probabilistic Power Flow Computation via Low-Rank and Sparse Tensor Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"cs.CE","authors_text":"Hung Dinh Nguyen, Konstantin Turitsyn, Luca Daniel, Zheng Zhang","submitted_at":"2015-08-11T05:08:25Z","abstract_excerpt":"This paper presents a tensor-recovery method to solve probabilistic power flow problems. Our approach generates a high-dimensional and sparse generalized polynomial-chaos expansion that provides useful statistical information. The result can also speed up other essential routines in power systems (e.g., stochastic planning, operations and controls).\n  Instead of simulating a power flow equation at all quadrature points, our approach only simulates an extremely small subset of samples. We suggest a model to exploit the underlying low-rank and sparse structure of high-dimensional simulation data"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02489","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1508.02489","created_at":"2026-05-18T01:35:29.057632+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.02489v1","created_at":"2026-05-18T01:35:29.057632+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02489","created_at":"2026-05-18T01:35:29.057632+00:00"},{"alias_kind":"pith_short_12","alias_value":"UKSKMU5Q3BRX","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UKSKMU5Q3BRX6IPJ","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UKSKMU5Q","created_at":"2026-05-18T12:29:44.643036+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/UKSKMU5Q3BRX6IPJZUJYNU7GYX","json":"https://pith.science/pith/UKSKMU5Q3BRX6IPJZUJYNU7GYX.json","graph_json":"https://pith.science/api/pith-number/UKSKMU5Q3BRX6IPJZUJYNU7GYX/graph.json","events_json":"https://pith.science/api/pith-number/UKSKMU5Q3BRX6IPJZUJYNU7GYX/events.json","paper":"https://pith.science/paper/UKSKMU5Q"},"agent_actions":{"view_html":"https://pith.science/pith/UKSKMU5Q3BRX6IPJZUJYNU7GYX","download_json":"https://pith.science/pith/UKSKMU5Q3BRX6IPJZUJYNU7GYX.json","view_paper":"https://pith.science/paper/UKSKMU5Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.02489&json=true","fetch_graph":"https://pith.science/api/pith-number/UKSKMU5Q3BRX6IPJZUJYNU7GYX/graph.json","fetch_events":"https://pith.science/api/pith-number/UKSKMU5Q3BRX6IPJZUJYNU7GYX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UKSKMU5Q3BRX6IPJZUJYNU7GYX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UKSKMU5Q3BRX6IPJZUJYNU7GYX/action/storage_attestation","attest_author":"https://pith.science/pith/UKSKMU5Q3BRX6IPJZUJYNU7GYX/action/author_attestation","sign_citation":"https://pith.science/pith/UKSKMU5Q3BRX6IPJZUJYNU7GYX/action/citation_signature","submit_replication":"https://pith.science/pith/UKSKMU5Q3BRX6IPJZUJYNU7GYX/action/replication_record"}},"created_at":"2026-05-18T01:35:29.057632+00:00","updated_at":"2026-05-18T01:35:29.057632+00:00"}