{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3JC4FTXSXAUJVMGKYNFRUPCCD7","short_pith_number":"pith:3JC4FTXS","canonical_record":{"source":{"id":"1501.00677","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2015-01-04T13:45:47Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"2e383a0f201ff66b69b482f3cfbad7dfe9264b95323ff5599ca0bda98d22cf5c","abstract_canon_sha256":"704d6472c3240a94ced956f8879beb68c3ae08e3f014b84146de4b2dc4806fd3"},"schema_version":"1.0"},"canonical_sha256":"da45c2cef2b8289ab0cac34b1a3c421feecf99e3b64f41091f424787d63ac7cf","source":{"kind":"arxiv","id":"1501.00677","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00677","created_at":"2026-05-18T02:04:02Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00677v1","created_at":"2026-05-18T02:04:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00677","created_at":"2026-05-18T02:04:02Z"},{"alias_kind":"pith_short_12","alias_value":"3JC4FTXSXAUJ","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3JC4FTXSXAUJVMGK","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3JC4FTXS","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3JC4FTXSXAUJVMGKYNFRUPCCD7","target":"record","payload":{"canonical_record":{"source":{"id":"1501.00677","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2015-01-04T13:45:47Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"2e383a0f201ff66b69b482f3cfbad7dfe9264b95323ff5599ca0bda98d22cf5c","abstract_canon_sha256":"704d6472c3240a94ced956f8879beb68c3ae08e3f014b84146de4b2dc4806fd3"},"schema_version":"1.0"},"canonical_sha256":"da45c2cef2b8289ab0cac34b1a3c421feecf99e3b64f41091f424787d63ac7cf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:04:02.187681Z","signature_b64":"tUv+vl6QCA1AaKQKIGJfOf8FLWVogoqM2rYDnvPQY2QDRe97RPi8aCbxecIuumt0uemHcsOS9B+iLtCdYucqBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da45c2cef2b8289ab0cac34b1a3c421feecf99e3b64f41091f424787d63ac7cf","last_reissued_at":"2026-05-18T02:04:02.186926Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:04:02.186926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.00677","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:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YRR+o9YifDwKGM63hNRrFQwIhhmXR5srBe9ROSkT7ktNCCq8apAjlJfwmc3nTXvIiIXz0wpVgpnN0F+naHu/BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:53:28.340545Z"},"content_sha256":"61457d9d440b46bb26d71d2fe216212410574294f3e6c84784eeee19db51809a","schema_version":"1.0","event_id":"sha256:61457d9d440b46bb26d71d2fe216212410574294f3e6c84784eeee19db51809a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3JC4FTXSXAUJVMGKYNFRUPCCD7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Group-based ranking method for online rating systems with spamming attacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.IR","authors_text":"Jian Gao, Mingsheng Shang, Shi-Min Cai, Tao Zhou, Yu-Wei Dong","submitted_at":"2015-01-04T13:45:47Z","abstract_excerpt":"Ranking problem has attracted much attention in real systems. How to design a robust ranking method is especially significant for online rating systems under the threat of spamming attacks. By building reputation systems for users, many well-performed ranking methods have been applied to address this issue. In this Letter, we propose a group-based ranking method that evaluates users' reputations based on their grouping behaviors. More specifically, users are assigned with high reputation scores if they always fall into large rating groups. Results on three real data sets indicate that the pres"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00677","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:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PlI9mX+TsfTRNugRY4C2Ue1wd+/PTaOWiQSkfuMgUtl6pASs8jR/qY1mzEQSfFyL+5bXedk9I/Wu0nR1p7EmDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:53:28.341254Z"},"content_sha256":"18fea261c6416a3947bd516f276730adca3ba10f72755aa5fb90b1903cab6527","schema_version":"1.0","event_id":"sha256:18fea261c6416a3947bd516f276730adca3ba10f72755aa5fb90b1903cab6527"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3JC4FTXSXAUJVMGKYNFRUPCCD7/bundle.json","state_url":"https://pith.science/pith/3JC4FTXSXAUJVMGKYNFRUPCCD7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3JC4FTXSXAUJVMGKYNFRUPCCD7/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-07T17:53:28Z","links":{"resolver":"https://pith.science/pith/3JC4FTXSXAUJVMGKYNFRUPCCD7","bundle":"https://pith.science/pith/3JC4FTXSXAUJVMGKYNFRUPCCD7/bundle.json","state":"https://pith.science/pith/3JC4FTXSXAUJVMGKYNFRUPCCD7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3JC4FTXSXAUJVMGKYNFRUPCCD7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3JC4FTXSXAUJVMGKYNFRUPCCD7","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":"704d6472c3240a94ced956f8879beb68c3ae08e3f014b84146de4b2dc4806fd3","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2015-01-04T13:45:47Z","title_canon_sha256":"2e383a0f201ff66b69b482f3cfbad7dfe9264b95323ff5599ca0bda98d22cf5c"},"schema_version":"1.0","source":{"id":"1501.00677","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00677","created_at":"2026-05-18T02:04:02Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00677v1","created_at":"2026-05-18T02:04:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00677","created_at":"2026-05-18T02:04:02Z"},{"alias_kind":"pith_short_12","alias_value":"3JC4FTXSXAUJ","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3JC4FTXSXAUJVMGK","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3JC4FTXS","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:18fea261c6416a3947bd516f276730adca3ba10f72755aa5fb90b1903cab6527","target":"graph","created_at":"2026-05-18T02:04:02Z","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 has attracted much attention in real systems. How to design a robust ranking method is especially significant for online rating systems under the threat of spamming attacks. By building reputation systems for users, many well-performed ranking methods have been applied to address this issue. In this Letter, we propose a group-based ranking method that evaluates users' reputations based on their grouping behaviors. More specifically, users are assigned with high reputation scores if they always fall into large rating groups. Results on three real data sets indicate that the pres","authors_text":"Jian Gao, Mingsheng Shang, Shi-Min Cai, Tao Zhou, Yu-Wei Dong","cross_cats":["physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2015-01-04T13:45:47Z","title":"Group-based ranking method for online rating systems with spamming attacks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00677","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:61457d9d440b46bb26d71d2fe216212410574294f3e6c84784eeee19db51809a","target":"record","created_at":"2026-05-18T02:04:02Z","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":"704d6472c3240a94ced956f8879beb68c3ae08e3f014b84146de4b2dc4806fd3","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2015-01-04T13:45:47Z","title_canon_sha256":"2e383a0f201ff66b69b482f3cfbad7dfe9264b95323ff5599ca0bda98d22cf5c"},"schema_version":"1.0","source":{"id":"1501.00677","kind":"arxiv","version":1}},"canonical_sha256":"da45c2cef2b8289ab0cac34b1a3c421feecf99e3b64f41091f424787d63ac7cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da45c2cef2b8289ab0cac34b1a3c421feecf99e3b64f41091f424787d63ac7cf","first_computed_at":"2026-05-18T02:04:02.186926Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:04:02.186926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tUv+vl6QCA1AaKQKIGJfOf8FLWVogoqM2rYDnvPQY2QDRe97RPi8aCbxecIuumt0uemHcsOS9B+iLtCdYucqBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:04:02.187681Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.00677","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61457d9d440b46bb26d71d2fe216212410574294f3e6c84784eeee19db51809a","sha256:18fea261c6416a3947bd516f276730adca3ba10f72755aa5fb90b1903cab6527"],"state_sha256":"5f9df0cf458ff353e11137fd82bc85407aa3c558c4217e26b2129c3e922a101a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EzJ4jHeE7D54GHG8QkPJaVK2INuSy6AQwKO8byo88K8ZnSpTgLW782Q6kOaMNb5ry+ckVlE1jPNgCVXhgTNJDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T17:53:28.345336Z","bundle_sha256":"2013dca9f900e1c57d102e54455c1030397103fe8f6d1f1b5d908dcc38290761"}}