{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SVTWI2TA45HUNGZ4QTCAS5Z3KM","short_pith_number":"pith:SVTWI2TA","schema_version":"1.0","canonical_sha256":"9567646a60e74f469b3c84c409773b5311c7c877dc5962c06681be64a02fc2b4","source":{"kind":"arxiv","id":"1902.10963","version":1},"attestation_state":"computed","paper":{"title":"Learning partially ranked data based on graph regularization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.ME","authors_text":"Fumiyasu Komaki, Keisuke Yano, Kento Nakamura","submitted_at":"2019-02-28T09:18:40Z","abstract_excerpt":"Ranked data appear in many different applications, including voting and consumer surveys. There often exhibits a situation in which data are partially ranked. Partially ranked data is thought of as missing data. This paper addresses parameter estimation for partially ranked data under a (possibly) non-ignorable missing mechanism. We propose estimators for both complete rankings and missing mechanisms together with a simple estimation procedure. Our estimation procedure leverages a graph regularization in conjunction with the Expectation-Maximization algorithm. Our estimation procedure is theor"},"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":"1902.10963","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2019-02-28T09:18:40Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"9d054b3d0877715053af59bc21508f842342479b9412940845670f460d5f751a","abstract_canon_sha256":"715fea28418b7e96c9820630aee0d06b1d7fe074faf16e79bf2f2d34a7fd9461"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:26.252718Z","signature_b64":"t3pio3To1w7COBcN3SGcZwFb38nC6UsUTWao/XIqpn8h/d4JYa0zu4zUKFZH+TzL3RiVq5Z1SN2ckSWVFCWTCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9567646a60e74f469b3c84c409773b5311c7c877dc5962c06681be64a02fc2b4","last_reissued_at":"2026-05-17T23:52:26.252090Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:26.252090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning partially ranked data based on graph regularization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.ME","authors_text":"Fumiyasu Komaki, Keisuke Yano, Kento Nakamura","submitted_at":"2019-02-28T09:18:40Z","abstract_excerpt":"Ranked data appear in many different applications, including voting and consumer surveys. There often exhibits a situation in which data are partially ranked. Partially ranked data is thought of as missing data. This paper addresses parameter estimation for partially ranked data under a (possibly) non-ignorable missing mechanism. We propose estimators for both complete rankings and missing mechanisms together with a simple estimation procedure. Our estimation procedure leverages a graph regularization in conjunction with the Expectation-Maximization algorithm. Our estimation procedure is theor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10963","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":"1902.10963","created_at":"2026-05-17T23:52:26.252172+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.10963v1","created_at":"2026-05-17T23:52:26.252172+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10963","created_at":"2026-05-17T23:52:26.252172+00:00"},{"alias_kind":"pith_short_12","alias_value":"SVTWI2TA45HU","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"SVTWI2TA45HUNGZ4","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"SVTWI2TA","created_at":"2026-05-18T12:33:27.125529+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/SVTWI2TA45HUNGZ4QTCAS5Z3KM","json":"https://pith.science/pith/SVTWI2TA45HUNGZ4QTCAS5Z3KM.json","graph_json":"https://pith.science/api/pith-number/SVTWI2TA45HUNGZ4QTCAS5Z3KM/graph.json","events_json":"https://pith.science/api/pith-number/SVTWI2TA45HUNGZ4QTCAS5Z3KM/events.json","paper":"https://pith.science/paper/SVTWI2TA"},"agent_actions":{"view_html":"https://pith.science/pith/SVTWI2TA45HUNGZ4QTCAS5Z3KM","download_json":"https://pith.science/pith/SVTWI2TA45HUNGZ4QTCAS5Z3KM.json","view_paper":"https://pith.science/paper/SVTWI2TA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.10963&json=true","fetch_graph":"https://pith.science/api/pith-number/SVTWI2TA45HUNGZ4QTCAS5Z3KM/graph.json","fetch_events":"https://pith.science/api/pith-number/SVTWI2TA45HUNGZ4QTCAS5Z3KM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SVTWI2TA45HUNGZ4QTCAS5Z3KM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SVTWI2TA45HUNGZ4QTCAS5Z3KM/action/storage_attestation","attest_author":"https://pith.science/pith/SVTWI2TA45HUNGZ4QTCAS5Z3KM/action/author_attestation","sign_citation":"https://pith.science/pith/SVTWI2TA45HUNGZ4QTCAS5Z3KM/action/citation_signature","submit_replication":"https://pith.science/pith/SVTWI2TA45HUNGZ4QTCAS5Z3KM/action/replication_record"}},"created_at":"2026-05-17T23:52:26.252172+00:00","updated_at":"2026-05-17T23:52:26.252172+00:00"}