{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:AGTBJ5KWWPUK3TU6QQLAHOWLUX","short_pith_number":"pith:AGTBJ5KW","schema_version":"1.0","canonical_sha256":"01a614f556b3e8adce9e841603bacba5cd61e982b15d41a72695943b8cc097ca","source":{"kind":"arxiv","id":"1207.6430","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1207.6430","created_at":"2026-05-18T02:50:32.611660+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.6430v2","created_at":"2026-05-18T02:50:32.611660+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6430","created_at":"2026-05-18T02:50:32.611660+00:00"},{"alias_kind":"pith_short_12","alias_value":"AGTBJ5KWWPUK","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"AGTBJ5KWWPUK3TU6","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"AGTBJ5KW","created_at":"2026-05-18T12:26:58.693483+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/AGTBJ5KWWPUK3TU6QQLAHOWLUX","json":"https://pith.science/pith/AGTBJ5KWWPUK3TU6QQLAHOWLUX.json","graph_json":"https://pith.science/api/pith-number/AGTBJ5KWWPUK3TU6QQLAHOWLUX/graph.json","events_json":"https://pith.science/api/pith-number/AGTBJ5KWWPUK3TU6QQLAHOWLUX/events.json","paper":"https://pith.science/paper/AGTBJ5KW"},"agent_actions":{"view_html":"https://pith.science/pith/AGTBJ5KWWPUK3TU6QQLAHOWLUX","download_json":"https://pith.science/pith/AGTBJ5KWWPUK3TU6QQLAHOWLUX.json","view_paper":"https://pith.science/paper/AGTBJ5KW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.6430&json=true","fetch_graph":"https://pith.science/api/pith-number/AGTBJ5KWWPUK3TU6QQLAHOWLUX/graph.json","fetch_events":"https://pith.science/api/pith-number/AGTBJ5KWWPUK3TU6QQLAHOWLUX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AGTBJ5KWWPUK3TU6QQLAHOWLUX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AGTBJ5KWWPUK3TU6QQLAHOWLUX/action/storage_attestation","attest_author":"https://pith.science/pith/AGTBJ5KWWPUK3TU6QQLAHOWLUX/action/author_attestation","sign_citation":"https://pith.science/pith/AGTBJ5KWWPUK3TU6QQLAHOWLUX/action/citation_signature","submit_replication":"https://pith.science/pith/AGTBJ5KWWPUK3TU6QQLAHOWLUX/action/replication_record"}},"created_at":"2026-05-18T02:50:32.611660+00:00","updated_at":"2026-05-18T02:50:32.611660+00:00"}