{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PWCFLKMBYWDOAUGNTY74C6IHJS","short_pith_number":"pith:PWCFLKMB","canonical_record":{"source":{"id":"1511.05743","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-18T11:40:02Z","cross_cats_sorted":[],"title_canon_sha256":"262d4a244c9914995fc588dbe8529cb14b02c0d418805fea5f0b17b6f7803894","abstract_canon_sha256":"302d505dc7e4edeebc946d36540d7783f7940aed1cc0c0d1d4bf728c4850f863"},"schema_version":"1.0"},"canonical_sha256":"7d8455a981c586e050cd9e3fc179074c89b7dc8b092918b42b3d89a727ba740d","source":{"kind":"arxiv","id":"1511.05743","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05743","created_at":"2026-05-18T01:26:32Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05743v1","created_at":"2026-05-18T01:26:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05743","created_at":"2026-05-18T01:26:32Z"},{"alias_kind":"pith_short_12","alias_value":"PWCFLKMBYWDO","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PWCFLKMBYWDOAUGN","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PWCFLKMB","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PWCFLKMBYWDOAUGNTY74C6IHJS","target":"record","payload":{"canonical_record":{"source":{"id":"1511.05743","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-18T11:40:02Z","cross_cats_sorted":[],"title_canon_sha256":"262d4a244c9914995fc588dbe8529cb14b02c0d418805fea5f0b17b6f7803894","abstract_canon_sha256":"302d505dc7e4edeebc946d36540d7783f7940aed1cc0c0d1d4bf728c4850f863"},"schema_version":"1.0"},"canonical_sha256":"7d8455a981c586e050cd9e3fc179074c89b7dc8b092918b42b3d89a727ba740d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:32.869260Z","signature_b64":"HI7Pdc0HQoTiNXuGAidaR4IkK9tHasVk4ikCbAyWPTlp1SS/BDILI0A8QMlNituQABl5Knh8YF96wsTtxwrYCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d8455a981c586e050cd9e3fc179074c89b7dc8b092918b42b3d89a727ba740d","last_reissued_at":"2026-05-18T01:26:32.868694Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:32.868694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.05743","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-18T01:26:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RxvRvYK+aRoYlmP0cgQtE48Ys01dNYY74ei+y3cFyAGKB1t/i7e8TV7CesA/oPkS8NXYY+PRVqn3rv7WukvNBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:53:21.975092Z"},"content_sha256":"4450108b1b2c9a0e7814d5228221d690605c84f7a1642fdac18d31184ea7933d","schema_version":"1.0","event_id":"sha256:4450108b1b2c9a0e7814d5228221d690605c84f7a1642fdac18d31184ea7933d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PWCFLKMBYWDOAUGNTY74C6IHJS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparse learning of maximum likelihood model for optimization of complex loss function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ning Zhang, Prathamesh Chandrasekar","submitted_at":"2015-11-18T11:40:02Z","abstract_excerpt":"Traditional machine learning methods usually minimize a simple loss function to learn a predictive model, and then use a complex performance measure to measure the prediction performance. However, minimizing a simple loss function cannot guarantee that an optimal performance. In this paper, we study the problem of optimizing the complex performance measure directly to obtain a predictive model. We proposed to construct a maximum likelihood model for this problem, and to learn the model parameter, we minimize a com- plex loss function corresponding to the desired complex performance measure. To"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05743","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-18T01:26:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b2+mJGGC4mCkkheTvZ+OFDKhq/8iciSrc7UTw82GAtLAQImPNKURpMzeFbTa9/u2NDn0afhKUSI4DDxZnbuODQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:53:21.975720Z"},"content_sha256":"684382bb34a65e36f81fb11655c38acc4b74d675b476e2b5d36b872aa95eaa04","schema_version":"1.0","event_id":"sha256:684382bb34a65e36f81fb11655c38acc4b74d675b476e2b5d36b872aa95eaa04"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PWCFLKMBYWDOAUGNTY74C6IHJS/bundle.json","state_url":"https://pith.science/pith/PWCFLKMBYWDOAUGNTY74C6IHJS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PWCFLKMBYWDOAUGNTY74C6IHJS/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-05-27T09:53:21Z","links":{"resolver":"https://pith.science/pith/PWCFLKMBYWDOAUGNTY74C6IHJS","bundle":"https://pith.science/pith/PWCFLKMBYWDOAUGNTY74C6IHJS/bundle.json","state":"https://pith.science/pith/PWCFLKMBYWDOAUGNTY74C6IHJS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PWCFLKMBYWDOAUGNTY74C6IHJS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PWCFLKMBYWDOAUGNTY74C6IHJS","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":"302d505dc7e4edeebc946d36540d7783f7940aed1cc0c0d1d4bf728c4850f863","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-18T11:40:02Z","title_canon_sha256":"262d4a244c9914995fc588dbe8529cb14b02c0d418805fea5f0b17b6f7803894"},"schema_version":"1.0","source":{"id":"1511.05743","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05743","created_at":"2026-05-18T01:26:32Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05743v1","created_at":"2026-05-18T01:26:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05743","created_at":"2026-05-18T01:26:32Z"},{"alias_kind":"pith_short_12","alias_value":"PWCFLKMBYWDO","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PWCFLKMBYWDOAUGN","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PWCFLKMB","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:684382bb34a65e36f81fb11655c38acc4b74d675b476e2b5d36b872aa95eaa04","target":"graph","created_at":"2026-05-18T01:26:32Z","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":"Traditional machine learning methods usually minimize a simple loss function to learn a predictive model, and then use a complex performance measure to measure the prediction performance. However, minimizing a simple loss function cannot guarantee that an optimal performance. In this paper, we study the problem of optimizing the complex performance measure directly to obtain a predictive model. We proposed to construct a maximum likelihood model for this problem, and to learn the model parameter, we minimize a com- plex loss function corresponding to the desired complex performance measure. To","authors_text":"Ning Zhang, Prathamesh Chandrasekar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-18T11:40:02Z","title":"Sparse learning of maximum likelihood model for optimization of complex loss function"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05743","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:4450108b1b2c9a0e7814d5228221d690605c84f7a1642fdac18d31184ea7933d","target":"record","created_at":"2026-05-18T01:26:32Z","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":"302d505dc7e4edeebc946d36540d7783f7940aed1cc0c0d1d4bf728c4850f863","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-18T11:40:02Z","title_canon_sha256":"262d4a244c9914995fc588dbe8529cb14b02c0d418805fea5f0b17b6f7803894"},"schema_version":"1.0","source":{"id":"1511.05743","kind":"arxiv","version":1}},"canonical_sha256":"7d8455a981c586e050cd9e3fc179074c89b7dc8b092918b42b3d89a727ba740d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d8455a981c586e050cd9e3fc179074c89b7dc8b092918b42b3d89a727ba740d","first_computed_at":"2026-05-18T01:26:32.868694Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:32.868694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HI7Pdc0HQoTiNXuGAidaR4IkK9tHasVk4ikCbAyWPTlp1SS/BDILI0A8QMlNituQABl5Knh8YF96wsTtxwrYCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:32.869260Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.05743","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4450108b1b2c9a0e7814d5228221d690605c84f7a1642fdac18d31184ea7933d","sha256:684382bb34a65e36f81fb11655c38acc4b74d675b476e2b5d36b872aa95eaa04"],"state_sha256":"beaf157d20893f758e474bf6d41b057c1b88c1ec015c2fdaebb88b942e1a8700"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DXDU+BiMApn8BNh8au6l3pbTwvAYNMRl/k8tRE2TxT8P+SH16Basx2ud52ZR/ARVv2mCptfnCNRdB4awJxPoDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T09:53:21.978891Z","bundle_sha256":"22142f72da4577e98c034a0a1d9003dadf5e364a0788b68c0b409f17a97063b0"}}