{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ASUTXHPWF3L2NOSVZZJE7HN56A","short_pith_number":"pith:ASUTXHPW","canonical_record":{"source":{"id":"1807.00325","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-01T12:39:13Z","cross_cats_sorted":["math.PR","stat.ML"],"title_canon_sha256":"cddd649fd40c6d38a99943264eb9b67ce5e8c1a1ae6ddedefa0e3f43ce9ceccf","abstract_canon_sha256":"c0397b4be38d000052caa3b94e69e6c711317fa80990728c44cde5c4a0367d5f"},"schema_version":"1.0"},"canonical_sha256":"04a93b9df62ed7a6ba55ce524f9dbdf030800863f0085a7b8b3355a4c83eee4b","source":{"kind":"arxiv","id":"1807.00325","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.00325","created_at":"2026-05-18T00:11:55Z"},{"alias_kind":"arxiv_version","alias_value":"1807.00325v1","created_at":"2026-05-18T00:11:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.00325","created_at":"2026-05-18T00:11:55Z"},{"alias_kind":"pith_short_12","alias_value":"ASUTXHPWF3L2","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"ASUTXHPWF3L2NOSV","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"ASUTXHPW","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ASUTXHPWF3L2NOSVZZJE7HN56A","target":"record","payload":{"canonical_record":{"source":{"id":"1807.00325","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-01T12:39:13Z","cross_cats_sorted":["math.PR","stat.ML"],"title_canon_sha256":"cddd649fd40c6d38a99943264eb9b67ce5e8c1a1ae6ddedefa0e3f43ce9ceccf","abstract_canon_sha256":"c0397b4be38d000052caa3b94e69e6c711317fa80990728c44cde5c4a0367d5f"},"schema_version":"1.0"},"canonical_sha256":"04a93b9df62ed7a6ba55ce524f9dbdf030800863f0085a7b8b3355a4c83eee4b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:55.200925Z","signature_b64":"F4eyEOxbLBXvheAhkSITyj9pO330hii7kQsz6GndevD31r+KLZcRmdgRcOF+c9FtdWTHYRKn2bgObTjfJbzrCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04a93b9df62ed7a6ba55ce524f9dbdf030800863f0085a7b8b3355a4c83eee4b","last_reissued_at":"2026-05-18T00:11:55.200176Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:55.200176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.00325","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-18T00:11:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cu+SPJCq/TzRxswoTG/98cF2uU6YbPm8RmXGiPlWwfIcq4G+vmLEP02dOuIewXiVej5Fwe6wvq09rvs2cvVYCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T12:40:35.116622Z"},"content_sha256":"f9aab024193f0ea8cad9d748e10ef4537167cd2acbf0f74505b46df68830978a","schema_version":"1.0","event_id":"sha256:f9aab024193f0ea8cad9d748e10ef4537167cd2acbf0f74505b46df68830978a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ASUTXHPWF3L2NOSVZZJE7HN56A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Data-driven satisficing measure and ranking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","stat.ML"],"primary_cat":"math.OC","authors_text":"Wenjie Huang","submitted_at":"2018-07-01T12:39:13Z","abstract_excerpt":"We propose an computational framework for real-time risk assessment and prioritizing for random outcomes without prior information on probability distributions. The basic model is built based on satisficing measure (SM) which yields a single index for risk comparison. Since SM is a dual representation for a family of risk measures, we consider problems constrained by general convex risk measures and specifically by Conditional value-at-risk. Starting from offline optimization, we apply sample average approximation technique and argue the convergence rate and validation of optimal solutions. In"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.00325","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-18T00:11:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tq8Schaz9puL3mPFe29ETGrJk2pJy7Xyj2RtsIYIUuwoY9YJWV3dqD38zZOJBJI5herSQNf6iSDZsJD1DTirAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T12:40:35.116963Z"},"content_sha256":"3d3ddb1e8fb63bccfbb5d06c38bf8b4175e66b64a76e96494790976a44c69e24","schema_version":"1.0","event_id":"sha256:3d3ddb1e8fb63bccfbb5d06c38bf8b4175e66b64a76e96494790976a44c69e24"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ASUTXHPWF3L2NOSVZZJE7HN56A/bundle.json","state_url":"https://pith.science/pith/ASUTXHPWF3L2NOSVZZJE7HN56A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ASUTXHPWF3L2NOSVZZJE7HN56A/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-07-01T12:40:35Z","links":{"resolver":"https://pith.science/pith/ASUTXHPWF3L2NOSVZZJE7HN56A","bundle":"https://pith.science/pith/ASUTXHPWF3L2NOSVZZJE7HN56A/bundle.json","state":"https://pith.science/pith/ASUTXHPWF3L2NOSVZZJE7HN56A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ASUTXHPWF3L2NOSVZZJE7HN56A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ASUTXHPWF3L2NOSVZZJE7HN56A","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":"c0397b4be38d000052caa3b94e69e6c711317fa80990728c44cde5c4a0367d5f","cross_cats_sorted":["math.PR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-01T12:39:13Z","title_canon_sha256":"cddd649fd40c6d38a99943264eb9b67ce5e8c1a1ae6ddedefa0e3f43ce9ceccf"},"schema_version":"1.0","source":{"id":"1807.00325","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.00325","created_at":"2026-05-18T00:11:55Z"},{"alias_kind":"arxiv_version","alias_value":"1807.00325v1","created_at":"2026-05-18T00:11:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.00325","created_at":"2026-05-18T00:11:55Z"},{"alias_kind":"pith_short_12","alias_value":"ASUTXHPWF3L2","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"ASUTXHPWF3L2NOSV","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"ASUTXHPW","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:3d3ddb1e8fb63bccfbb5d06c38bf8b4175e66b64a76e96494790976a44c69e24","target":"graph","created_at":"2026-05-18T00:11:55Z","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":"We propose an computational framework for real-time risk assessment and prioritizing for random outcomes without prior information on probability distributions. The basic model is built based on satisficing measure (SM) which yields a single index for risk comparison. Since SM is a dual representation for a family of risk measures, we consider problems constrained by general convex risk measures and specifically by Conditional value-at-risk. Starting from offline optimization, we apply sample average approximation technique and argue the convergence rate and validation of optimal solutions. In","authors_text":"Wenjie Huang","cross_cats":["math.PR","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-01T12:39:13Z","title":"Data-driven satisficing measure and ranking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.00325","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:f9aab024193f0ea8cad9d748e10ef4537167cd2acbf0f74505b46df68830978a","target":"record","created_at":"2026-05-18T00:11:55Z","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":"c0397b4be38d000052caa3b94e69e6c711317fa80990728c44cde5c4a0367d5f","cross_cats_sorted":["math.PR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-01T12:39:13Z","title_canon_sha256":"cddd649fd40c6d38a99943264eb9b67ce5e8c1a1ae6ddedefa0e3f43ce9ceccf"},"schema_version":"1.0","source":{"id":"1807.00325","kind":"arxiv","version":1}},"canonical_sha256":"04a93b9df62ed7a6ba55ce524f9dbdf030800863f0085a7b8b3355a4c83eee4b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04a93b9df62ed7a6ba55ce524f9dbdf030800863f0085a7b8b3355a4c83eee4b","first_computed_at":"2026-05-18T00:11:55.200176Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:55.200176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F4eyEOxbLBXvheAhkSITyj9pO330hii7kQsz6GndevD31r+KLZcRmdgRcOF+c9FtdWTHYRKn2bgObTjfJbzrCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:55.200925Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.00325","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f9aab024193f0ea8cad9d748e10ef4537167cd2acbf0f74505b46df68830978a","sha256:3d3ddb1e8fb63bccfbb5d06c38bf8b4175e66b64a76e96494790976a44c69e24"],"state_sha256":"77915224681fb42c2e36625ed313b6b4930aa9e8e8c4b3f2a12cc3ee7447d33c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8LhdB7/FvzQszxeDxayYoKa6tk2D1K03j3u9+P4KR2UBACap0DqVW9qDan4+ZW9m1RYx8JzV/jAf8DT6pcu9BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T12:40:35.118937Z","bundle_sha256":"0f9dbb5f2e43915882814ed07709a324ca84cf09bcd4b6a374d4b7d6a885b75b"}}