{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:LRDUJOXCW4IBQYDT53DPA5LFUV","short_pith_number":"pith:LRDUJOXC","canonical_record":{"source":{"id":"1011.1761","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2010-11-08T10:40:19Z","cross_cats_sorted":["stat.CO","stat.ML"],"title_canon_sha256":"d3f77be8c827032038b6f6dcde7c92c4e37b2f98ed04fc967473d416184b2706","abstract_canon_sha256":"9fd4269e8a6bef24322719c804d04697f3e29e280c7c415e0f4453951c4aa748"},"schema_version":"1.0"},"canonical_sha256":"5c4744bae2b710186073eec6f07565a54fc693d9bb6f32481962c420f7164043","source":{"kind":"arxiv","id":"1011.1761","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.1761","created_at":"2026-05-18T02:23:37Z"},{"alias_kind":"arxiv_version","alias_value":"1011.1761v1","created_at":"2026-05-18T02:23:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.1761","created_at":"2026-05-18T02:23:37Z"},{"alias_kind":"pith_short_12","alias_value":"LRDUJOXCW4IB","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"LRDUJOXCW4IBQYDT","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"LRDUJOXC","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:LRDUJOXCW4IBQYDT53DPA5LFUV","target":"record","payload":{"canonical_record":{"source":{"id":"1011.1761","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2010-11-08T10:40:19Z","cross_cats_sorted":["stat.CO","stat.ML"],"title_canon_sha256":"d3f77be8c827032038b6f6dcde7c92c4e37b2f98ed04fc967473d416184b2706","abstract_canon_sha256":"9fd4269e8a6bef24322719c804d04697f3e29e280c7c415e0f4453951c4aa748"},"schema_version":"1.0"},"canonical_sha256":"5c4744bae2b710186073eec6f07565a54fc693d9bb6f32481962c420f7164043","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:37.381446Z","signature_b64":"wIJTnjlKz4ZYem4+48G6u/kpM+/yUx7UtITBEkf06mvzSQ+KiRgGbz3WT0Uh5FInJ6Y4RS+y+t+Fqn9xg7pxBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c4744bae2b710186073eec6f07565a54fc693d9bb6f32481962c420f7164043","last_reissued_at":"2026-05-18T02:23:37.380882Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:37.380882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.1761","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-18T02:23:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LvvtDmq3edjceuPBznj1GRyBL3BqXjlPdwcKY4DKBEecGIrnXrvtha3C8vTUJ7YEtlQCRemwZoylFu2g+fPiDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:58:32.898309Z"},"content_sha256":"fb9fd569fbf868e25bc40be67bb71705391df92d0a52be4fc6a3f7dd5488fd4a","schema_version":"1.0","event_id":"sha256:fb9fd569fbf868e25bc40be67bb71705391df92d0a52be4fc6a3f7dd5488fd4a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:LRDUJOXCW4IBQYDT53DPA5LFUV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Bayesian Inference for Generalized Bradley-Terry Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO","stat.ML"],"primary_cat":"stat.ME","authors_text":"Arnaud Doucet, Francois Caron (INRIA Bordeaux - Sud-Ouest, IMB)","submitted_at":"2010-11-08T10:40:19Z","abstract_excerpt":"The Bradley-Terry model is a popular approach to describe probabilities of the possible outcomes when elements of a set are repeatedly compared with one another in pairs. It has found many applications including animal behaviour, chess ranking and multiclass classification. Numerous extensions of the basic model have also been proposed in the literature including models with ties, multiple comparisons, group comparisons and random graphs. From a computational point of view, Hunter (2004) has proposed efficient iterative MM (minorization-maximization) algorithms to perform maximum likelihood es"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.1761","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-18T02:23:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z+L+gFnd8APZe8J3cXEnScFYP5OoRq+wPn3JCl48Bl2qw4rPwIWYxJh4YjNmQHGQKTx4mGRtax3Vdlw9xqjkAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:58:32.898857Z"},"content_sha256":"b7e1dd780c497fc8f35483fa90d2958c96b9d333b3ba38662471704b66f1e09b","schema_version":"1.0","event_id":"sha256:b7e1dd780c497fc8f35483fa90d2958c96b9d333b3ba38662471704b66f1e09b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LRDUJOXCW4IBQYDT53DPA5LFUV/bundle.json","state_url":"https://pith.science/pith/LRDUJOXCW4IBQYDT53DPA5LFUV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LRDUJOXCW4IBQYDT53DPA5LFUV/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-31T12:58:32Z","links":{"resolver":"https://pith.science/pith/LRDUJOXCW4IBQYDT53DPA5LFUV","bundle":"https://pith.science/pith/LRDUJOXCW4IBQYDT53DPA5LFUV/bundle.json","state":"https://pith.science/pith/LRDUJOXCW4IBQYDT53DPA5LFUV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LRDUJOXCW4IBQYDT53DPA5LFUV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:LRDUJOXCW4IBQYDT53DPA5LFUV","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":"9fd4269e8a6bef24322719c804d04697f3e29e280c7c415e0f4453951c4aa748","cross_cats_sorted":["stat.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2010-11-08T10:40:19Z","title_canon_sha256":"d3f77be8c827032038b6f6dcde7c92c4e37b2f98ed04fc967473d416184b2706"},"schema_version":"1.0","source":{"id":"1011.1761","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.1761","created_at":"2026-05-18T02:23:37Z"},{"alias_kind":"arxiv_version","alias_value":"1011.1761v1","created_at":"2026-05-18T02:23:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.1761","created_at":"2026-05-18T02:23:37Z"},{"alias_kind":"pith_short_12","alias_value":"LRDUJOXCW4IB","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"LRDUJOXCW4IBQYDT","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"LRDUJOXC","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:b7e1dd780c497fc8f35483fa90d2958c96b9d333b3ba38662471704b66f1e09b","target":"graph","created_at":"2026-05-18T02:23: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":"The Bradley-Terry model is a popular approach to describe probabilities of the possible outcomes when elements of a set are repeatedly compared with one another in pairs. It has found many applications including animal behaviour, chess ranking and multiclass classification. Numerous extensions of the basic model have also been proposed in the literature including models with ties, multiple comparisons, group comparisons and random graphs. From a computational point of view, Hunter (2004) has proposed efficient iterative MM (minorization-maximization) algorithms to perform maximum likelihood es","authors_text":"Arnaud Doucet, Francois Caron (INRIA Bordeaux - Sud-Ouest, IMB)","cross_cats":["stat.CO","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2010-11-08T10:40:19Z","title":"Efficient Bayesian Inference for Generalized Bradley-Terry Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.1761","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:fb9fd569fbf868e25bc40be67bb71705391df92d0a52be4fc6a3f7dd5488fd4a","target":"record","created_at":"2026-05-18T02:23: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":"9fd4269e8a6bef24322719c804d04697f3e29e280c7c415e0f4453951c4aa748","cross_cats_sorted":["stat.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2010-11-08T10:40:19Z","title_canon_sha256":"d3f77be8c827032038b6f6dcde7c92c4e37b2f98ed04fc967473d416184b2706"},"schema_version":"1.0","source":{"id":"1011.1761","kind":"arxiv","version":1}},"canonical_sha256":"5c4744bae2b710186073eec6f07565a54fc693d9bb6f32481962c420f7164043","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c4744bae2b710186073eec6f07565a54fc693d9bb6f32481962c420f7164043","first_computed_at":"2026-05-18T02:23:37.380882Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:37.380882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wIJTnjlKz4ZYem4+48G6u/kpM+/yUx7UtITBEkf06mvzSQ+KiRgGbz3WT0Uh5FInJ6Y4RS+y+t+Fqn9xg7pxBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:37.381446Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.1761","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb9fd569fbf868e25bc40be67bb71705391df92d0a52be4fc6a3f7dd5488fd4a","sha256:b7e1dd780c497fc8f35483fa90d2958c96b9d333b3ba38662471704b66f1e09b"],"state_sha256":"797135b755f1c1e523b64c6ff5a8f083310fe8855120d073a0ed918ca8658ab4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cvunamHrYkBwlrGJcxniA0HsWM4Xezdodmv9qNEYsca9LpUyQyY5hbYzAlAlowxTxH45U4sRCply58kKGkTuBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:58:32.903645Z","bundle_sha256":"020c6dfd452983c2a1ed5fe19e6c6f5cdd556cc5c3ffb2d6e1c92640ba6116bb"}}