{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OW5V6NJQXNBGJRZCKJXMQQ6TBP","short_pith_number":"pith:OW5V6NJQ","canonical_record":{"source":{"id":"1702.05137","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-02-16T19:59:40Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"6d93a03444bb8d4af6080719ff389e0b3704b421d1a19bb3010eaee212ee9aed","abstract_canon_sha256":"5d1ac1570e0b82cc6c189bec86fed1e8a93514463100fd62ad4d68278df4f5d0"},"schema_version":"1.0"},"canonical_sha256":"75bb5f3530bb4264c722526ec843d30bdde1ca1630be6a61b40b1ff749c2da74","source":{"kind":"arxiv","id":"1702.05137","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05137","created_at":"2026-05-18T00:50:34Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05137v1","created_at":"2026-05-18T00:50:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05137","created_at":"2026-05-18T00:50:34Z"},{"alias_kind":"pith_short_12","alias_value":"OW5V6NJQXNBG","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OW5V6NJQXNBGJRZC","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OW5V6NJQ","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OW5V6NJQXNBGJRZCKJXMQQ6TBP","target":"record","payload":{"canonical_record":{"source":{"id":"1702.05137","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-02-16T19:59:40Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"6d93a03444bb8d4af6080719ff389e0b3704b421d1a19bb3010eaee212ee9aed","abstract_canon_sha256":"5d1ac1570e0b82cc6c189bec86fed1e8a93514463100fd62ad4d68278df4f5d0"},"schema_version":"1.0"},"canonical_sha256":"75bb5f3530bb4264c722526ec843d30bdde1ca1630be6a61b40b1ff749c2da74","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:34.757068Z","signature_b64":"m9Bzt5L1Uu7ewQgQBgfQuHQioQpFG1acurKH5f5a2nvsqxwxfZ4ZzLg3yZGx6iJOliMH9fmR3fWod9dP4U1BCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75bb5f3530bb4264c722526ec843d30bdde1ca1630be6a61b40b1ff749c2da74","last_reissued_at":"2026-05-18T00:50:34.756468Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:34.756468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.05137","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:50:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CMo7asLTDoBa+OOnqxezrOqgMuWxdg5qHVz5+IesHCyOKSOlbHyegR0fYYehNopcgr8UbIk1DNgpBhVBAZMGAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:59:02.235735Z"},"content_sha256":"c5a26816974d5c2ba70e3a5a55c8984c6d399109d3609d2aabe4f867433bef34","schema_version":"1.0","event_id":"sha256:c5a26816974d5c2ba70e3a5a55c8984c6d399109d3609d2aabe4f867433bef34"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OW5V6NJQXNBGJRZCKJXMQQ6TBP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Semi-supervised Learning for Discrete Choice Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Diego Klabjan, Jie Yang, Sergey Shebalov","submitted_at":"2017-02-16T19:59:40Z","abstract_excerpt":"We introduce a semi-supervised discrete choice model to calibrate discrete choice models when relatively few requests have both choice sets and stated preferences but the majority only have the choice sets. Two classic semi-supervised learning algorithms, the expectation maximization algorithm and the cluster-and-label algorithm, have been adapted to our choice modeling problem setting. We also develop two new algorithms based on the cluster-and-label algorithm. The new algorithms use the Bayesian Information Criterion to evaluate a clustering setting to automatically adjust the number of clus"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05137","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:50:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b5agUO5EWrnfatjxX0WO2St21/EIPw7EkspmcDprWV+XKYJPDdgLLeX7sY1kL5sfrKJULRX524JJJlfw4Gc5CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:59:02.236090Z"},"content_sha256":"73ab54f6d4b0ee58e27adee84cec631029b53a70c6b8936e122628a88c4cd208","schema_version":"1.0","event_id":"sha256:73ab54f6d4b0ee58e27adee84cec631029b53a70c6b8936e122628a88c4cd208"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OW5V6NJQXNBGJRZCKJXMQQ6TBP/bundle.json","state_url":"https://pith.science/pith/OW5V6NJQXNBGJRZCKJXMQQ6TBP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OW5V6NJQXNBGJRZCKJXMQQ6TBP/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-28T07:59:02Z","links":{"resolver":"https://pith.science/pith/OW5V6NJQXNBGJRZCKJXMQQ6TBP","bundle":"https://pith.science/pith/OW5V6NJQXNBGJRZCKJXMQQ6TBP/bundle.json","state":"https://pith.science/pith/OW5V6NJQXNBGJRZCKJXMQQ6TBP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OW5V6NJQXNBGJRZCKJXMQQ6TBP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OW5V6NJQXNBGJRZCKJXMQQ6TBP","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":"5d1ac1570e0b82cc6c189bec86fed1e8a93514463100fd62ad4d68278df4f5d0","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-02-16T19:59:40Z","title_canon_sha256":"6d93a03444bb8d4af6080719ff389e0b3704b421d1a19bb3010eaee212ee9aed"},"schema_version":"1.0","source":{"id":"1702.05137","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05137","created_at":"2026-05-18T00:50:34Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05137v1","created_at":"2026-05-18T00:50:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05137","created_at":"2026-05-18T00:50:34Z"},{"alias_kind":"pith_short_12","alias_value":"OW5V6NJQXNBG","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OW5V6NJQXNBGJRZC","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OW5V6NJQ","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:73ab54f6d4b0ee58e27adee84cec631029b53a70c6b8936e122628a88c4cd208","target":"graph","created_at":"2026-05-18T00:50:34Z","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 introduce a semi-supervised discrete choice model to calibrate discrete choice models when relatively few requests have both choice sets and stated preferences but the majority only have the choice sets. Two classic semi-supervised learning algorithms, the expectation maximization algorithm and the cluster-and-label algorithm, have been adapted to our choice modeling problem setting. We also develop two new algorithms based on the cluster-and-label algorithm. The new algorithms use the Bayesian Information Criterion to evaluate a clustering setting to automatically adjust the number of clus","authors_text":"Diego Klabjan, Jie Yang, Sergey Shebalov","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-02-16T19:59:40Z","title":"Semi-supervised Learning for Discrete Choice Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05137","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:c5a26816974d5c2ba70e3a5a55c8984c6d399109d3609d2aabe4f867433bef34","target":"record","created_at":"2026-05-18T00:50:34Z","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":"5d1ac1570e0b82cc6c189bec86fed1e8a93514463100fd62ad4d68278df4f5d0","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-02-16T19:59:40Z","title_canon_sha256":"6d93a03444bb8d4af6080719ff389e0b3704b421d1a19bb3010eaee212ee9aed"},"schema_version":"1.0","source":{"id":"1702.05137","kind":"arxiv","version":1}},"canonical_sha256":"75bb5f3530bb4264c722526ec843d30bdde1ca1630be6a61b40b1ff749c2da74","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75bb5f3530bb4264c722526ec843d30bdde1ca1630be6a61b40b1ff749c2da74","first_computed_at":"2026-05-18T00:50:34.756468Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:34.756468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m9Bzt5L1Uu7ewQgQBgfQuHQioQpFG1acurKH5f5a2nvsqxwxfZ4ZzLg3yZGx6iJOliMH9fmR3fWod9dP4U1BCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:34.757068Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.05137","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c5a26816974d5c2ba70e3a5a55c8984c6d399109d3609d2aabe4f867433bef34","sha256:73ab54f6d4b0ee58e27adee84cec631029b53a70c6b8936e122628a88c4cd208"],"state_sha256":"fe3399cf3d9e9b143b98934ce57288b4a5c98c56e05dbe21600473ccdd6e03d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GwU6eU7W/UgsOBM3RQeYB2xtZAM16zHO4CP45wZPxBBpBRH0DEVfyNNMpcn8JVC8AFEDDZwzM8X18fvd5MB8Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:59:02.238035Z","bundle_sha256":"a7901642961afac4652651495b76bc1a6040c887f0e94b181dac6fa88ddd0d3c"}}