{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:AGTBJ5KWWPUK3TU6QQLAHOWLUX","short_pith_number":"pith:AGTBJ5KW","canonical_record":{"source":{"id":"1207.6430","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-07-26T23:14:34Z","cross_cats_sorted":["cs.LG","stat.AP"],"title_canon_sha256":"53b26873265abe0e4f311505020613d2698ddba048d5c506d722586dc895fc4c","abstract_canon_sha256":"299288b570b0c08faec0b56e7fa1d9592afcb0b711fe48af51e9a951f65650c7"},"schema_version":"1.0"},"canonical_sha256":"01a614f556b3e8adce9e841603bacba5cd61e982b15d41a72695943b8cc097ca","source":{"kind":"arxiv","id":"1207.6430","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.6430","created_at":"2026-05-18T02:50:32Z"},{"alias_kind":"arxiv_version","alias_value":"1207.6430v2","created_at":"2026-05-18T02:50:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6430","created_at":"2026-05-18T02:50:32Z"},{"alias_kind":"pith_short_12","alias_value":"AGTBJ5KWWPUK","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AGTBJ5KWWPUK3TU6","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AGTBJ5KW","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:AGTBJ5KWWPUK3TU6QQLAHOWLUX","target":"record","payload":{"canonical_record":{"source":{"id":"1207.6430","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-07-26T23:14:34Z","cross_cats_sorted":["cs.LG","stat.AP"],"title_canon_sha256":"53b26873265abe0e4f311505020613d2698ddba048d5c506d722586dc895fc4c","abstract_canon_sha256":"299288b570b0c08faec0b56e7fa1d9592afcb0b711fe48af51e9a951f65650c7"},"schema_version":"1.0"},"canonical_sha256":"01a614f556b3e8adce9e841603bacba5cd61e982b15d41a72695943b8cc097ca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:32.612058Z","signature_b64":"ow4iiV/OJcSyG5+uFJx7tDnwcbhO9Bf2FnFw+P8lX0+zIh3Plp7lxSjSq6tFNg4D+nxaGnKVhU11OqKXUODKAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01a614f556b3e8adce9e841603bacba5cd61e982b15d41a72695943b8cc097ca","last_reissued_at":"2026-05-18T02:50:32.611598Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:32.611598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.6430","source_version":2,"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:50:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k7MoaHaNv5qebaPBSSsuACOpFmvnFJzTE8B8L0FZkTU27U070RQtcjthQuXaB8euxJRCqRqLTtZx33WByudlCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:39:53.500671Z"},"content_sha256":"e9728c74f9033e73f58450f90baeaf32b37d51575fb09badbbd232fdb20ebe20","schema_version":"1.0","event_id":"sha256:e9728c74f9033e73f58450f90baeaf32b37d51575fb09badbbd232fdb20ebe20"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:AGTBJ5KWWPUK3TU6QQLAHOWLUX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Data Collection For Informative Rankings Expose Well-Connected Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.AP"],"primary_cat":"stat.ML","authors_text":"Braxton Osting, Christoph Brune, Stanley J. Osher","submitted_at":"2012-07-26T23:14:34Z","abstract_excerpt":"Given a graph where vertices represent alternatives and arcs represent pairwise comparison data, the statistical ranking problem is to find a potential function, defined on the vertices, such that the gradient of the potential function agrees with the pairwise comparisons. Our goal in this paper is to develop a method for collecting data for which the least squares estimator for the ranking problem has maximal Fisher information. Our approach, based on experimental design, is to view data collection as a bi-level optimization problem where the inner problem is the ranking problem and the outer"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6430","kind":"arxiv","version":2},"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:50:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WxZY+Q57DD3yYpmEMcIknuBGtZ7yH6hpAc52NzxvBMUme1/njvqv23HpwELMHbp4nuYQdcV8glHxXj7JtG0HCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:39:53.501342Z"},"content_sha256":"49dc20d535732222ef49d114e09ac2bea71cab0d4ebf86c163628b26c42bca75","schema_version":"1.0","event_id":"sha256:49dc20d535732222ef49d114e09ac2bea71cab0d4ebf86c163628b26c42bca75"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AGTBJ5KWWPUK3TU6QQLAHOWLUX/bundle.json","state_url":"https://pith.science/pith/AGTBJ5KWWPUK3TU6QQLAHOWLUX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AGTBJ5KWWPUK3TU6QQLAHOWLUX/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-25T19:39:53Z","links":{"resolver":"https://pith.science/pith/AGTBJ5KWWPUK3TU6QQLAHOWLUX","bundle":"https://pith.science/pith/AGTBJ5KWWPUK3TU6QQLAHOWLUX/bundle.json","state":"https://pith.science/pith/AGTBJ5KWWPUK3TU6QQLAHOWLUX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AGTBJ5KWWPUK3TU6QQLAHOWLUX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:AGTBJ5KWWPUK3TU6QQLAHOWLUX","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":"299288b570b0c08faec0b56e7fa1d9592afcb0b711fe48af51e9a951f65650c7","cross_cats_sorted":["cs.LG","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-07-26T23:14:34Z","title_canon_sha256":"53b26873265abe0e4f311505020613d2698ddba048d5c506d722586dc895fc4c"},"schema_version":"1.0","source":{"id":"1207.6430","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.6430","created_at":"2026-05-18T02:50:32Z"},{"alias_kind":"arxiv_version","alias_value":"1207.6430v2","created_at":"2026-05-18T02:50:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6430","created_at":"2026-05-18T02:50:32Z"},{"alias_kind":"pith_short_12","alias_value":"AGTBJ5KWWPUK","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AGTBJ5KWWPUK3TU6","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AGTBJ5KW","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:49dc20d535732222ef49d114e09ac2bea71cab0d4ebf86c163628b26c42bca75","target":"graph","created_at":"2026-05-18T02:50:32Z","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":"Given a graph where vertices represent alternatives and arcs represent pairwise comparison data, the statistical ranking problem is to find a potential function, defined on the vertices, such that the gradient of the potential function agrees with the pairwise comparisons. Our goal in this paper is to develop a method for collecting data for which the least squares estimator for the ranking problem has maximal Fisher information. Our approach, based on experimental design, is to view data collection as a bi-level optimization problem where the inner problem is the ranking problem and the outer","authors_text":"Braxton Osting, Christoph Brune, Stanley J. Osher","cross_cats":["cs.LG","stat.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-07-26T23:14:34Z","title":"Optimal Data Collection For Informative Rankings Expose Well-Connected Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6430","kind":"arxiv","version":2},"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:e9728c74f9033e73f58450f90baeaf32b37d51575fb09badbbd232fdb20ebe20","target":"record","created_at":"2026-05-18T02:50:32Z","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":"299288b570b0c08faec0b56e7fa1d9592afcb0b711fe48af51e9a951f65650c7","cross_cats_sorted":["cs.LG","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-07-26T23:14:34Z","title_canon_sha256":"53b26873265abe0e4f311505020613d2698ddba048d5c506d722586dc895fc4c"},"schema_version":"1.0","source":{"id":"1207.6430","kind":"arxiv","version":2}},"canonical_sha256":"01a614f556b3e8adce9e841603bacba5cd61e982b15d41a72695943b8cc097ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01a614f556b3e8adce9e841603bacba5cd61e982b15d41a72695943b8cc097ca","first_computed_at":"2026-05-18T02:50:32.611598Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:32.611598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ow4iiV/OJcSyG5+uFJx7tDnwcbhO9Bf2FnFw+P8lX0+zIh3Plp7lxSjSq6tFNg4D+nxaGnKVhU11OqKXUODKAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:32.612058Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.6430","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e9728c74f9033e73f58450f90baeaf32b37d51575fb09badbbd232fdb20ebe20","sha256:49dc20d535732222ef49d114e09ac2bea71cab0d4ebf86c163628b26c42bca75"],"state_sha256":"159c51935fee6a03e8805d36d810eec2240a1a55f152bc583e4a14e66561036a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"71xwYvMEyjK+HmvRSN66iGE/vmPny31oA1bNpCtKlT6L+beX9TqsOWXEisIjenMPfOTerA9UsUvk7r3XwNPcDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:39:53.504761Z","bundle_sha256":"ef6b720e750b94bd58899db2a7a4c7de5e48e5241f17cac1f56eb05a0f695ec1"}}