{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NXR4QHXR3WF4BJF4YPXQJQVWQF","short_pith_number":"pith:NXR4QHXR","schema_version":"1.0","canonical_sha256":"6de3c81ef1dd8bc0a4bcc3ef04c2b681509c7bcdaf7c176590de5c7e157887cf","source":{"kind":"arxiv","id":"1811.02161","version":2},"attestation_state":"computed","paper":{"title":"How Many Pairwise Preferences Do We Need to Rank A Graph Consistently?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Aadirupa Saha, Chiranjib Bhattacharyya, Rakesh Shivanna","submitted_at":"2018-11-06T04:54:18Z","abstract_excerpt":"We consider the problem of optimal recovery of true ranking of $n$ items from a randomly chosen subset of their pairwise preferences. It is well known that without any further assumption, one requires a sample size of $\\Omega(n^2)$ for the purpose. We analyze the problem with an additional structure of relational graph $G([n],E)$ over the $n$ items added with an assumption of \\emph{locality}: Neighboring items are similar in their rankings. Noting the preferential nature of the data, we choose to embed not the graph, but, its \\emph{strong product} to capture the pairwise node relationships. Fu"},"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":"1811.02161","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-06T04:54:18Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"bfe4bffd2e2968a1c0b9b54ee1b87949b932ef3cd51d183c77d86609452dd02e","abstract_canon_sha256":"d352ee4753349bc1c49a5010a1284810392d42ca9abdbd1e0c7a8cf29196e223"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:15.782425Z","signature_b64":"S9lOGfk1+cp3xS8uwBwUqzfWKujsdu/6rzdS26Y+BzhjhUj9WruYwBMt8Iegdppx+gvZhaHDP3i7909WjqBvDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6de3c81ef1dd8bc0a4bcc3ef04c2b681509c7bcdaf7c176590de5c7e157887cf","last_reissued_at":"2026-05-17T23:54:15.782014Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:15.782014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How Many Pairwise Preferences Do We Need to Rank A Graph Consistently?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Aadirupa Saha, Chiranjib Bhattacharyya, Rakesh Shivanna","submitted_at":"2018-11-06T04:54:18Z","abstract_excerpt":"We consider the problem of optimal recovery of true ranking of $n$ items from a randomly chosen subset of their pairwise preferences. It is well known that without any further assumption, one requires a sample size of $\\Omega(n^2)$ for the purpose. We analyze the problem with an additional structure of relational graph $G([n],E)$ over the $n$ items added with an assumption of \\emph{locality}: Neighboring items are similar in their rankings. Noting the preferential nature of the data, we choose to embed not the graph, but, its \\emph{strong product} to capture the pairwise node relationships. Fu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02161","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":"1811.02161","created_at":"2026-05-17T23:54:15.782074+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.02161v2","created_at":"2026-05-17T23:54:15.782074+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02161","created_at":"2026-05-17T23:54:15.782074+00:00"},{"alias_kind":"pith_short_12","alias_value":"NXR4QHXR3WF4","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NXR4QHXR3WF4BJF4","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NXR4QHXR","created_at":"2026-05-18T12:32:40.477152+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/NXR4QHXR3WF4BJF4YPXQJQVWQF","json":"https://pith.science/pith/NXR4QHXR3WF4BJF4YPXQJQVWQF.json","graph_json":"https://pith.science/api/pith-number/NXR4QHXR3WF4BJF4YPXQJQVWQF/graph.json","events_json":"https://pith.science/api/pith-number/NXR4QHXR3WF4BJF4YPXQJQVWQF/events.json","paper":"https://pith.science/paper/NXR4QHXR"},"agent_actions":{"view_html":"https://pith.science/pith/NXR4QHXR3WF4BJF4YPXQJQVWQF","download_json":"https://pith.science/pith/NXR4QHXR3WF4BJF4YPXQJQVWQF.json","view_paper":"https://pith.science/paper/NXR4QHXR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.02161&json=true","fetch_graph":"https://pith.science/api/pith-number/NXR4QHXR3WF4BJF4YPXQJQVWQF/graph.json","fetch_events":"https://pith.science/api/pith-number/NXR4QHXR3WF4BJF4YPXQJQVWQF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NXR4QHXR3WF4BJF4YPXQJQVWQF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NXR4QHXR3WF4BJF4YPXQJQVWQF/action/storage_attestation","attest_author":"https://pith.science/pith/NXR4QHXR3WF4BJF4YPXQJQVWQF/action/author_attestation","sign_citation":"https://pith.science/pith/NXR4QHXR3WF4BJF4YPXQJQVWQF/action/citation_signature","submit_replication":"https://pith.science/pith/NXR4QHXR3WF4BJF4YPXQJQVWQF/action/replication_record"}},"created_at":"2026-05-17T23:54:15.782074+00:00","updated_at":"2026-05-17T23:54:15.782074+00:00"}