{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:CB4TMWBORF74WXBAIFIZGE5XWJ","short_pith_number":"pith:CB4TMWBO","canonical_record":{"source":{"id":"1012.3793","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2010-12-17T00:58:02Z","cross_cats_sorted":["physics.data-an"],"title_canon_sha256":"7a8451a436f57af3bfb858d30cbfa5879351a6890bad10d0727f8e805db31125","abstract_canon_sha256":"7884f23c9390566eb9d068d069e25bb4f8cee82edd6e4d5da269dc6427cd0447"},"schema_version":"1.0"},"canonical_sha256":"107936582e897fcb5c2041519313b7b2700788a66c2fd173785708ab68290140","source":{"kind":"arxiv","id":"1012.3793","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.3793","created_at":"2026-05-18T02:04:23Z"},{"alias_kind":"arxiv_version","alias_value":"1012.3793v1","created_at":"2026-05-18T02:04:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.3793","created_at":"2026-05-18T02:04:23Z"},{"alias_kind":"pith_short_12","alias_value":"CB4TMWBORF74","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"CB4TMWBORF74WXBA","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"CB4TMWBO","created_at":"2026-05-18T12:26:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:CB4TMWBORF74WXBAIFIZGE5XWJ","target":"record","payload":{"canonical_record":{"source":{"id":"1012.3793","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2010-12-17T00:58:02Z","cross_cats_sorted":["physics.data-an"],"title_canon_sha256":"7a8451a436f57af3bfb858d30cbfa5879351a6890bad10d0727f8e805db31125","abstract_canon_sha256":"7884f23c9390566eb9d068d069e25bb4f8cee82edd6e4d5da269dc6427cd0447"},"schema_version":"1.0"},"canonical_sha256":"107936582e897fcb5c2041519313b7b2700788a66c2fd173785708ab68290140","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:04:23.329763Z","signature_b64":"v7+bEIJhmnFhUG5oTGUoL0l7W0xbcgCYCEOH8K2ze7iVxMTbMQqt4vy02UQDCVZ7otj+S78JdS2vSu5kQIfhCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"107936582e897fcb5c2041519313b7b2700788a66c2fd173785708ab68290140","last_reissued_at":"2026-05-18T02:04:23.329038Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:04:23.329038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1012.3793","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:04:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k90WLAMdr9NR1BhLgIsn7kI83JZjjfyJPzPEmUbFUh2QsksN2nsCBMDKFO8GZgfoDKft1f3NEjkim7KyxlLcBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:00:23.144552Z"},"content_sha256":"a114da1b3d048c96d0add3d482924bc30e8ac2672379d5e85ada40a50b0ccd0c","schema_version":"1.0","event_id":"sha256:a114da1b3d048c96d0add3d482924bc30e8ac2672379d5e85ada40a50b0ccd0c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:CB4TMWBORF74WXBAIFIZGE5XWJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A robust ranking algorithm to spamming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.data-an"],"primary_cat":"cs.IR","authors_text":"Tao Zhou, Ting Lei, Yanbo Zhou","submitted_at":"2010-12-17T00:58:02Z","abstract_excerpt":"Ranking problem of web-based rating system has attracted many attentions. A good ranking algorithm should be robust against spammer attack. Here we proposed a correlation based reputation algorithm to solve the ranking problem of such rating systems where user votes some objects with ratings. In this algorithm, reputation of user is iteratively determined by the correlation coefficient between his/her rating vector and the corresponding objects' weighted average rating vector. Comparing with iterative refinement (IR) and mean score algorithm, results for both artificial and real data indicate "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.3793","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:04:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u9worXoCCeal5+bEzuVFdfkqjaQQ39ufHnRdncOSO83/oqWd8lGmMefD88ogZ9MLOql171Y/CQ57M9KchYq8DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:00:23.144910Z"},"content_sha256":"228e3ef4fffa0928559061728e0c60fcb8a477ed8e75709d638c5ba0d04792c8","schema_version":"1.0","event_id":"sha256:228e3ef4fffa0928559061728e0c60fcb8a477ed8e75709d638c5ba0d04792c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CB4TMWBORF74WXBAIFIZGE5XWJ/bundle.json","state_url":"https://pith.science/pith/CB4TMWBORF74WXBAIFIZGE5XWJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CB4TMWBORF74WXBAIFIZGE5XWJ/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-01T10:00:23Z","links":{"resolver":"https://pith.science/pith/CB4TMWBORF74WXBAIFIZGE5XWJ","bundle":"https://pith.science/pith/CB4TMWBORF74WXBAIFIZGE5XWJ/bundle.json","state":"https://pith.science/pith/CB4TMWBORF74WXBAIFIZGE5XWJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CB4TMWBORF74WXBAIFIZGE5XWJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:CB4TMWBORF74WXBAIFIZGE5XWJ","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":"7884f23c9390566eb9d068d069e25bb4f8cee82edd6e4d5da269dc6427cd0447","cross_cats_sorted":["physics.data-an"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2010-12-17T00:58:02Z","title_canon_sha256":"7a8451a436f57af3bfb858d30cbfa5879351a6890bad10d0727f8e805db31125"},"schema_version":"1.0","source":{"id":"1012.3793","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.3793","created_at":"2026-05-18T02:04:23Z"},{"alias_kind":"arxiv_version","alias_value":"1012.3793v1","created_at":"2026-05-18T02:04:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.3793","created_at":"2026-05-18T02:04:23Z"},{"alias_kind":"pith_short_12","alias_value":"CB4TMWBORF74","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"CB4TMWBORF74WXBA","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"CB4TMWBO","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:228e3ef4fffa0928559061728e0c60fcb8a477ed8e75709d638c5ba0d04792c8","target":"graph","created_at":"2026-05-18T02:04:23Z","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":"Ranking problem of web-based rating system has attracted many attentions. A good ranking algorithm should be robust against spammer attack. Here we proposed a correlation based reputation algorithm to solve the ranking problem of such rating systems where user votes some objects with ratings. In this algorithm, reputation of user is iteratively determined by the correlation coefficient between his/her rating vector and the corresponding objects' weighted average rating vector. Comparing with iterative refinement (IR) and mean score algorithm, results for both artificial and real data indicate ","authors_text":"Tao Zhou, Ting Lei, Yanbo Zhou","cross_cats":["physics.data-an"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2010-12-17T00:58:02Z","title":"A robust ranking algorithm to spamming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.3793","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:a114da1b3d048c96d0add3d482924bc30e8ac2672379d5e85ada40a50b0ccd0c","target":"record","created_at":"2026-05-18T02:04:23Z","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":"7884f23c9390566eb9d068d069e25bb4f8cee82edd6e4d5da269dc6427cd0447","cross_cats_sorted":["physics.data-an"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2010-12-17T00:58:02Z","title_canon_sha256":"7a8451a436f57af3bfb858d30cbfa5879351a6890bad10d0727f8e805db31125"},"schema_version":"1.0","source":{"id":"1012.3793","kind":"arxiv","version":1}},"canonical_sha256":"107936582e897fcb5c2041519313b7b2700788a66c2fd173785708ab68290140","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"107936582e897fcb5c2041519313b7b2700788a66c2fd173785708ab68290140","first_computed_at":"2026-05-18T02:04:23.329038Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:04:23.329038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v7+bEIJhmnFhUG5oTGUoL0l7W0xbcgCYCEOH8K2ze7iVxMTbMQqt4vy02UQDCVZ7otj+S78JdS2vSu5kQIfhCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:04:23.329763Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.3793","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a114da1b3d048c96d0add3d482924bc30e8ac2672379d5e85ada40a50b0ccd0c","sha256:228e3ef4fffa0928559061728e0c60fcb8a477ed8e75709d638c5ba0d04792c8"],"state_sha256":"a52ab6930f8385c8f467a59697fc4ec05b7b7b7f58b06781bcace3643d5dd9d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vt10QZqexkqEMFNf1/RUnr+2zhZu1cyIAwQoQhOz5GFOJDDN+przAF+VNsH5+oBszYASHRG3MVzWZ2sUDC6EDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T10:00:23.146892Z","bundle_sha256":"31bc9626d865677de146b27b8808f0824d38df89c95cc551eb137a1acedcab91"}}