{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FBG3TKZC2BTMW3534URD6SOIGD","short_pith_number":"pith:FBG3TKZC","canonical_record":{"source":{"id":"1710.06056","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-10-17T02:15:55Z","cross_cats_sorted":[],"title_canon_sha256":"037e94a3520e1ae75b80394fa36f8fdfb7ad5cab12a0277983995bf0b32948fe","abstract_canon_sha256":"35ba64457942f926496e213afd6d017c5749002483d84a042a3a201525bcc3c7"},"schema_version":"1.0"},"canonical_sha256":"284db9ab22d066cb6fbbe5223f49c830ea0b761529e64d60bbe7cba1ed632f09","source":{"kind":"arxiv","id":"1710.06056","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.06056","created_at":"2026-05-18T00:32:37Z"},{"alias_kind":"arxiv_version","alias_value":"1710.06056v1","created_at":"2026-05-18T00:32:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.06056","created_at":"2026-05-18T00:32:37Z"},{"alias_kind":"pith_short_12","alias_value":"FBG3TKZC2BTM","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FBG3TKZC2BTMW353","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FBG3TKZC","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FBG3TKZC2BTMW3534URD6SOIGD","target":"record","payload":{"canonical_record":{"source":{"id":"1710.06056","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-10-17T02:15:55Z","cross_cats_sorted":[],"title_canon_sha256":"037e94a3520e1ae75b80394fa36f8fdfb7ad5cab12a0277983995bf0b32948fe","abstract_canon_sha256":"35ba64457942f926496e213afd6d017c5749002483d84a042a3a201525bcc3c7"},"schema_version":"1.0"},"canonical_sha256":"284db9ab22d066cb6fbbe5223f49c830ea0b761529e64d60bbe7cba1ed632f09","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:37.919553Z","signature_b64":"4KaKyb+5QJUeCXb78LjNETQynaByDxa1sFFiNvXpzfIBBpxJqNa29PUWppi3i7EQIM9OUA8xfdz0IddEM+1rCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"284db9ab22d066cb6fbbe5223f49c830ea0b761529e64d60bbe7cba1ed632f09","last_reissued_at":"2026-05-18T00:32:37.918840Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:37.918840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.06056","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:32:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g8fdoZmj9a7kTcEEK2YyFoKNROmEUWoxCYC6EYmiTlPZO6eN+dgcw7fIsdhVCz6Wooka7PCqtiik3vMFKxqMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:15:00.054385Z"},"content_sha256":"ff1a56d10928a2cf8d0ead00252eb88f469334b8012cb439d7541aae68ff7e4a","schema_version":"1.0","event_id":"sha256:ff1a56d10928a2cf8d0ead00252eb88f469334b8012cb439d7541aae68ff7e4a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FBG3TKZC2BTMW3534URD6SOIGD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotically Optimal Sequential Design for Rank Aggregation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Xiaoou Li, Xi Chen, Yunxiao Chen","submitted_at":"2017-10-17T02:15:55Z","abstract_excerpt":"A sequential design problem for rank aggregation is commonly encountered in psychology, politics, marketing, sports, etc. In this problem, a decision maker is responsible for ranking $K$ items by sequentially collecting pairwise noisy comparison from judges. The decision maker needs to choose a pair of items for comparison in each step, decide when to stop data collection, and make a final decision after stopping, based on a sequential flow of information. Due to the complex ranking structure, existing sequential analysis methods are not suitable.\n  In this paper, we formulate the problem unde"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.06056","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:32:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qcfYHBivuO9tvYIt3jCLHaFSFKuHBcknSuvLX3Lky6oHKUzjhW0RQfMZE8xW+Jz4zZWiI62u3CT5okpYdbV7BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:15:00.054736Z"},"content_sha256":"0b73b3a7d9df0698f85e10ab5f8f90926b9a60d5aaa95054b17f17caeb1a0683","schema_version":"1.0","event_id":"sha256:0b73b3a7d9df0698f85e10ab5f8f90926b9a60d5aaa95054b17f17caeb1a0683"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FBG3TKZC2BTMW3534URD6SOIGD/bundle.json","state_url":"https://pith.science/pith/FBG3TKZC2BTMW3534URD6SOIGD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FBG3TKZC2BTMW3534URD6SOIGD/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-04T01:15:00Z","links":{"resolver":"https://pith.science/pith/FBG3TKZC2BTMW3534URD6SOIGD","bundle":"https://pith.science/pith/FBG3TKZC2BTMW3534URD6SOIGD/bundle.json","state":"https://pith.science/pith/FBG3TKZC2BTMW3534URD6SOIGD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FBG3TKZC2BTMW3534URD6SOIGD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FBG3TKZC2BTMW3534URD6SOIGD","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":"35ba64457942f926496e213afd6d017c5749002483d84a042a3a201525bcc3c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-10-17T02:15:55Z","title_canon_sha256":"037e94a3520e1ae75b80394fa36f8fdfb7ad5cab12a0277983995bf0b32948fe"},"schema_version":"1.0","source":{"id":"1710.06056","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.06056","created_at":"2026-05-18T00:32:37Z"},{"alias_kind":"arxiv_version","alias_value":"1710.06056v1","created_at":"2026-05-18T00:32:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.06056","created_at":"2026-05-18T00:32:37Z"},{"alias_kind":"pith_short_12","alias_value":"FBG3TKZC2BTM","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FBG3TKZC2BTMW353","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FBG3TKZC","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:0b73b3a7d9df0698f85e10ab5f8f90926b9a60d5aaa95054b17f17caeb1a0683","target":"graph","created_at":"2026-05-18T00:32:37Z","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":"A sequential design problem for rank aggregation is commonly encountered in psychology, politics, marketing, sports, etc. In this problem, a decision maker is responsible for ranking $K$ items by sequentially collecting pairwise noisy comparison from judges. The decision maker needs to choose a pair of items for comparison in each step, decide when to stop data collection, and make a final decision after stopping, based on a sequential flow of information. Due to the complex ranking structure, existing sequential analysis methods are not suitable.\n  In this paper, we formulate the problem unde","authors_text":"Xiaoou Li, Xi Chen, Yunxiao Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-10-17T02:15:55Z","title":"Asymptotically Optimal Sequential Design for Rank Aggregation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.06056","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:ff1a56d10928a2cf8d0ead00252eb88f469334b8012cb439d7541aae68ff7e4a","target":"record","created_at":"2026-05-18T00:32:37Z","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":"35ba64457942f926496e213afd6d017c5749002483d84a042a3a201525bcc3c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-10-17T02:15:55Z","title_canon_sha256":"037e94a3520e1ae75b80394fa36f8fdfb7ad5cab12a0277983995bf0b32948fe"},"schema_version":"1.0","source":{"id":"1710.06056","kind":"arxiv","version":1}},"canonical_sha256":"284db9ab22d066cb6fbbe5223f49c830ea0b761529e64d60bbe7cba1ed632f09","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"284db9ab22d066cb6fbbe5223f49c830ea0b761529e64d60bbe7cba1ed632f09","first_computed_at":"2026-05-18T00:32:37.918840Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:37.918840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4KaKyb+5QJUeCXb78LjNETQynaByDxa1sFFiNvXpzfIBBpxJqNa29PUWppi3i7EQIM9OUA8xfdz0IddEM+1rCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:37.919553Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.06056","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff1a56d10928a2cf8d0ead00252eb88f469334b8012cb439d7541aae68ff7e4a","sha256:0b73b3a7d9df0698f85e10ab5f8f90926b9a60d5aaa95054b17f17caeb1a0683"],"state_sha256":"12be04561bc279d82d508227cb742a20b78e9254c72f442db449273d1f370475"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2RcGsdC9bDqmkkgrIc77TYP4oCShUjhCw4xZDAQW1wPCxYNb2u9hrut9UeI6pG+yVMIS2H13otEehkmVCO+sBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T01:15:00.056862Z","bundle_sha256":"0c687099150802188be55ce8773d21159ce8ed15d4a0519beb0adccac9aeb0f6"}}