{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:TLM24ZOH5KKVY4UD7PT52ZIKYV","short_pith_number":"pith:TLM24ZOH","schema_version":"1.0","canonical_sha256":"9ad9ae65c7ea955c7283fbe7dd650ac56e51f745ff338fbb8336d88eca68ccc1","source":{"kind":"arxiv","id":"1706.05602","version":1},"attestation_state":"computed","paper":{"title":"Rare-Event Simulation for Distribution Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.OC","authors_text":"Jose Blanchet, Juan Li, Marvin K. Nakayama","submitted_at":"2017-06-18T03:03:58Z","abstract_excerpt":"We model equilibrium allocations in a distribution network as the solution of a linear program (LP) which minimizes the cost of unserved demands across nodes in the network. The constraints in the LP dictate that once a given node's supply is exhausted, its unserved demand is distributed among neighboring nodes. All nodes do the same and the resulting solution is the equilibrium allocation. Assuming that the demands are random (following a jointly Gaussian law), our goal is to study the probability that the optimal cost (i.e. the cost of unserved demands in equilibrium) exceeds a large thresho"},"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":"1706.05602","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-18T03:03:58Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"7682b08928ea44992538d75354639bea72b9ce9c2f76836a7c6242c9fd256b57","abstract_canon_sha256":"622aa71cd2b5031f466bd36641105f65373e21a3ebbfff2cc124c2d41c756c90"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:09.421537Z","signature_b64":"zrMrUBVhcMS6Aacs0EyVLIyku7hmaz884vhgWpIOrzaIKmJ7d1PemdTVCZ86YIAp+4ODHsxvpbQdrDmX2jMNAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ad9ae65c7ea955c7283fbe7dd650ac56e51f745ff338fbb8336d88eca68ccc1","last_reissued_at":"2026-05-18T00:42:09.421041Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:09.421041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rare-Event Simulation for Distribution Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.OC","authors_text":"Jose Blanchet, Juan Li, Marvin K. Nakayama","submitted_at":"2017-06-18T03:03:58Z","abstract_excerpt":"We model equilibrium allocations in a distribution network as the solution of a linear program (LP) which minimizes the cost of unserved demands across nodes in the network. The constraints in the LP dictate that once a given node's supply is exhausted, its unserved demand is distributed among neighboring nodes. All nodes do the same and the resulting solution is the equilibrium allocation. Assuming that the demands are random (following a jointly Gaussian law), our goal is to study the probability that the optimal cost (i.e. the cost of unserved demands in equilibrium) exceeds a large thresho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05602","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":"1706.05602","created_at":"2026-05-18T00:42:09.421115+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.05602v1","created_at":"2026-05-18T00:42:09.421115+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05602","created_at":"2026-05-18T00:42:09.421115+00:00"},{"alias_kind":"pith_short_12","alias_value":"TLM24ZOH5KKV","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"TLM24ZOH5KKVY4UD","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"TLM24ZOH","created_at":"2026-05-18T12:31:46.661854+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/TLM24ZOH5KKVY4UD7PT52ZIKYV","json":"https://pith.science/pith/TLM24ZOH5KKVY4UD7PT52ZIKYV.json","graph_json":"https://pith.science/api/pith-number/TLM24ZOH5KKVY4UD7PT52ZIKYV/graph.json","events_json":"https://pith.science/api/pith-number/TLM24ZOH5KKVY4UD7PT52ZIKYV/events.json","paper":"https://pith.science/paper/TLM24ZOH"},"agent_actions":{"view_html":"https://pith.science/pith/TLM24ZOH5KKVY4UD7PT52ZIKYV","download_json":"https://pith.science/pith/TLM24ZOH5KKVY4UD7PT52ZIKYV.json","view_paper":"https://pith.science/paper/TLM24ZOH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.05602&json=true","fetch_graph":"https://pith.science/api/pith-number/TLM24ZOH5KKVY4UD7PT52ZIKYV/graph.json","fetch_events":"https://pith.science/api/pith-number/TLM24ZOH5KKVY4UD7PT52ZIKYV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TLM24ZOH5KKVY4UD7PT52ZIKYV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TLM24ZOH5KKVY4UD7PT52ZIKYV/action/storage_attestation","attest_author":"https://pith.science/pith/TLM24ZOH5KKVY4UD7PT52ZIKYV/action/author_attestation","sign_citation":"https://pith.science/pith/TLM24ZOH5KKVY4UD7PT52ZIKYV/action/citation_signature","submit_replication":"https://pith.science/pith/TLM24ZOH5KKVY4UD7PT52ZIKYV/action/replication_record"}},"created_at":"2026-05-18T00:42:09.421115+00:00","updated_at":"2026-05-18T00:42:09.421115+00:00"}