{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SVTWI2TA45HUNGZ4QTCAS5Z3KM","short_pith_number":"pith:SVTWI2TA","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"},"canonical_sha256":"9567646a60e74f469b3c84c409773b5311c7c877dc5962c06681be64a02fc2b4","source":{"kind":"arxiv","id":"1902.10963","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.10963","created_at":"2026-05-17T23:52:26Z"},{"alias_kind":"arxiv_version","alias_value":"1902.10963v1","created_at":"2026-05-17T23:52:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10963","created_at":"2026-05-17T23:52:26Z"},{"alias_kind":"pith_short_12","alias_value":"SVTWI2TA45HU","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SVTWI2TA45HUNGZ4","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SVTWI2TA","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SVTWI2TA45HUNGZ4QTCAS5Z3KM","target":"record","payload":{"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"},"canonical_sha256":"9567646a60e74f469b3c84c409773b5311c7c877dc5962c06681be64a02fc2b4","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"},"source_kind":"arxiv","source_id":"1902.10963","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-17T23:52:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ygBkO2h6zbgjBUT+93TvDCc+/DPfhnu7KX7g7AVb5veZqe4uOBLnDQ7++QnLYEFNnC/uSVYS5OLbgpzF2z8sCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T03:57:23.353804Z"},"content_sha256":"05b26ac2ce163e77acea4893715d1aa00bb1ab2edd5171fdc24db3206440c39d","schema_version":"1.0","event_id":"sha256:05b26ac2ce163e77acea4893715d1aa00bb1ab2edd5171fdc24db3206440c39d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SVTWI2TA45HUNGZ4QTCAS5Z3KM","target":"graph","payload":{"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"},"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-17T23:52:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u1+RDnOx+oxGVRB4fdVepT6BptrSvyCyhiDS537L/Cfoq78fXz/P+MIJ1oPT/9Wk3I8TlsCrmDyBXJLdG0B4Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T03:57:23.354150Z"},"content_sha256":"7451fd69e4cbcb0aa96bfaacfa2dcae76a7da3740b84160b896078de65b633c7","schema_version":"1.0","event_id":"sha256:7451fd69e4cbcb0aa96bfaacfa2dcae76a7da3740b84160b896078de65b633c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SVTWI2TA45HUNGZ4QTCAS5Z3KM/bundle.json","state_url":"https://pith.science/pith/SVTWI2TA45HUNGZ4QTCAS5Z3KM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SVTWI2TA45HUNGZ4QTCAS5Z3KM/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-06-25T03:57:23Z","links":{"resolver":"https://pith.science/pith/SVTWI2TA45HUNGZ4QTCAS5Z3KM","bundle":"https://pith.science/pith/SVTWI2TA45HUNGZ4QTCAS5Z3KM/bundle.json","state":"https://pith.science/pith/SVTWI2TA45HUNGZ4QTCAS5Z3KM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SVTWI2TA45HUNGZ4QTCAS5Z3KM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SVTWI2TA45HUNGZ4QTCAS5Z3KM","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":"715fea28418b7e96c9820630aee0d06b1d7fe074faf16e79bf2f2d34a7fd9461","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2019-02-28T09:18:40Z","title_canon_sha256":"9d054b3d0877715053af59bc21508f842342479b9412940845670f460d5f751a"},"schema_version":"1.0","source":{"id":"1902.10963","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.10963","created_at":"2026-05-17T23:52:26Z"},{"alias_kind":"arxiv_version","alias_value":"1902.10963v1","created_at":"2026-05-17T23:52:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10963","created_at":"2026-05-17T23:52:26Z"},{"alias_kind":"pith_short_12","alias_value":"SVTWI2TA45HU","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SVTWI2TA45HUNGZ4","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SVTWI2TA","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:7451fd69e4cbcb0aa96bfaacfa2dcae76a7da3740b84160b896078de65b633c7","target":"graph","created_at":"2026-05-17T23:52:26Z","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":"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","authors_text":"Fumiyasu Komaki, Keisuke Yano, Kento Nakamura","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2019-02-28T09:18:40Z","title":"Learning partially ranked data based on graph regularization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10963","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:05b26ac2ce163e77acea4893715d1aa00bb1ab2edd5171fdc24db3206440c39d","target":"record","created_at":"2026-05-17T23:52:26Z","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":"715fea28418b7e96c9820630aee0d06b1d7fe074faf16e79bf2f2d34a7fd9461","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2019-02-28T09:18:40Z","title_canon_sha256":"9d054b3d0877715053af59bc21508f842342479b9412940845670f460d5f751a"},"schema_version":"1.0","source":{"id":"1902.10963","kind":"arxiv","version":1}},"canonical_sha256":"9567646a60e74f469b3c84c409773b5311c7c877dc5962c06681be64a02fc2b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9567646a60e74f469b3c84c409773b5311c7c877dc5962c06681be64a02fc2b4","first_computed_at":"2026-05-17T23:52:26.252090Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:26.252090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t3pio3To1w7COBcN3SGcZwFb38nC6UsUTWao/XIqpn8h/d4JYa0zu4zUKFZH+TzL3RiVq5Z1SN2ckSWVFCWTCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:26.252718Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.10963","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05b26ac2ce163e77acea4893715d1aa00bb1ab2edd5171fdc24db3206440c39d","sha256:7451fd69e4cbcb0aa96bfaacfa2dcae76a7da3740b84160b896078de65b633c7"],"state_sha256":"4ed0c8cc6cfd6ae3784f73d9b851e68c854afb5df302c69bfb99e8d7e229e5c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IRh5pSev7nWAmD5GGw9k8h9aPBSC/DlTO3l8Ju91dgJJCwJQfHhcYkDBnis+7LH4C9dnvcilTyWjxjeAO59PDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T03:57:23.356110Z","bundle_sha256":"ac31529da89723390013958265431e438ac14d946583c66c12bebcca5508d628"}}