{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NXR4QHXR3WF4BJF4YPXQJQVWQF","short_pith_number":"pith:NXR4QHXR","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"},"canonical_sha256":"6de3c81ef1dd8bc0a4bcc3ef04c2b681509c7bcdaf7c176590de5c7e157887cf","source":{"kind":"arxiv","id":"1811.02161","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02161","created_at":"2026-05-17T23:54:15Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02161v2","created_at":"2026-05-17T23:54:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02161","created_at":"2026-05-17T23:54:15Z"},{"alias_kind":"pith_short_12","alias_value":"NXR4QHXR3WF4","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NXR4QHXR3WF4BJF4","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NXR4QHXR","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NXR4QHXR3WF4BJF4YPXQJQVWQF","target":"record","payload":{"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"},"canonical_sha256":"6de3c81ef1dd8bc0a4bcc3ef04c2b681509c7bcdaf7c176590de5c7e157887cf","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"},"source_kind":"arxiv","source_id":"1811.02161","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-17T23:54:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zugglT71UuSoyEYUZjzezaFff9st7UUqK/dPM+N0qUnI2g9P11BZBxMdTXXofNxIXzjwmo57ekCQChjoGe2wAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:17:15.916011Z"},"content_sha256":"6fb8da41909b6b1d57b9aab5b570e90ea7d7f58f1d5c04bd26b6f85136c7a771","schema_version":"1.0","event_id":"sha256:6fb8da41909b6b1d57b9aab5b570e90ea7d7f58f1d5c04bd26b6f85136c7a771"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NXR4QHXR3WF4BJF4YPXQJQVWQF","target":"graph","payload":{"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"},"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-17T23:54:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HkHpqGejAQtMFSfN9pC/XMblzYRqwUBR0QbRaYbabboXzJKflHDmZSkahIxwaC3cBlyFlItdSRCikBXEf3o3AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:17:15.916377Z"},"content_sha256":"f3ef86aaaa6c4324d0ec1113a439f783fdf0af54de6f47daf22507849b50c156","schema_version":"1.0","event_id":"sha256:f3ef86aaaa6c4324d0ec1113a439f783fdf0af54de6f47daf22507849b50c156"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NXR4QHXR3WF4BJF4YPXQJQVWQF/bundle.json","state_url":"https://pith.science/pith/NXR4QHXR3WF4BJF4YPXQJQVWQF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NXR4QHXR3WF4BJF4YPXQJQVWQF/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-01T09:17:15Z","links":{"resolver":"https://pith.science/pith/NXR4QHXR3WF4BJF4YPXQJQVWQF","bundle":"https://pith.science/pith/NXR4QHXR3WF4BJF4YPXQJQVWQF/bundle.json","state":"https://pith.science/pith/NXR4QHXR3WF4BJF4YPXQJQVWQF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NXR4QHXR3WF4BJF4YPXQJQVWQF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NXR4QHXR3WF4BJF4YPXQJQVWQF","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":"d352ee4753349bc1c49a5010a1284810392d42ca9abdbd1e0c7a8cf29196e223","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-06T04:54:18Z","title_canon_sha256":"bfe4bffd2e2968a1c0b9b54ee1b87949b932ef3cd51d183c77d86609452dd02e"},"schema_version":"1.0","source":{"id":"1811.02161","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02161","created_at":"2026-05-17T23:54:15Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02161v2","created_at":"2026-05-17T23:54:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02161","created_at":"2026-05-17T23:54:15Z"},{"alias_kind":"pith_short_12","alias_value":"NXR4QHXR3WF4","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NXR4QHXR3WF4BJF4","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NXR4QHXR","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:f3ef86aaaa6c4324d0ec1113a439f783fdf0af54de6f47daf22507849b50c156","target":"graph","created_at":"2026-05-17T23:54:15Z","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":"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","authors_text":"Aadirupa Saha, Chiranjib Bhattacharyya, Rakesh Shivanna","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-06T04:54:18Z","title":"How Many Pairwise Preferences Do We Need to Rank A Graph Consistently?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02161","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:6fb8da41909b6b1d57b9aab5b570e90ea7d7f58f1d5c04bd26b6f85136c7a771","target":"record","created_at":"2026-05-17T23:54:15Z","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":"d352ee4753349bc1c49a5010a1284810392d42ca9abdbd1e0c7a8cf29196e223","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-06T04:54:18Z","title_canon_sha256":"bfe4bffd2e2968a1c0b9b54ee1b87949b932ef3cd51d183c77d86609452dd02e"},"schema_version":"1.0","source":{"id":"1811.02161","kind":"arxiv","version":2}},"canonical_sha256":"6de3c81ef1dd8bc0a4bcc3ef04c2b681509c7bcdaf7c176590de5c7e157887cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6de3c81ef1dd8bc0a4bcc3ef04c2b681509c7bcdaf7c176590de5c7e157887cf","first_computed_at":"2026-05-17T23:54:15.782014Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:15.782014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S9lOGfk1+cp3xS8uwBwUqzfWKujsdu/6rzdS26Y+BzhjhUj9WruYwBMt8Iegdppx+gvZhaHDP3i7909WjqBvDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:15.782425Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.02161","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6fb8da41909b6b1d57b9aab5b570e90ea7d7f58f1d5c04bd26b6f85136c7a771","sha256:f3ef86aaaa6c4324d0ec1113a439f783fdf0af54de6f47daf22507849b50c156"],"state_sha256":"1898ff62aa46f497ac47fe354189df53ba10abe4a6c50e2a589f1e278b8b904c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iXgN3LHg/PaTVYej3Ir2JZE1BryrUbD1Cf2/7yja3JaR7LNXRRfLyuJs/CoQbzCYS8Q5WHULHqv73gWfmjYsDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T09:17:15.918356Z","bundle_sha256":"4819bcee888fa2e213dff16ef83165af27e045765074bc55c7d43875c0e32a0c"}}