{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZATYWFI6IJR4F2GZGI4NXUZO54","short_pith_number":"pith:ZATYWFI6","canonical_record":{"source":{"id":"1509.00594","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2015-09-02T07:58:13Z","cross_cats_sorted":["cs.SI","physics.data-an"],"title_canon_sha256":"5167158ea56e7dbe213c21daef4b5ad97566446832e4ef27465b6454c45ec836","abstract_canon_sha256":"b5451262fb5b2b9869dde4c825c9f4d9c4cd09889d96b43222367d0f1cb72405"},"schema_version":"1.0"},"canonical_sha256":"c8278b151e4263c2e8d93238dbd32eef24f125328c7c5e2dd2c4b8a4401c866e","source":{"kind":"arxiv","id":"1509.00594","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00594","created_at":"2026-05-18T00:52:23Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00594v1","created_at":"2026-05-18T00:52:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00594","created_at":"2026-05-18T00:52:23Z"},{"alias_kind":"pith_short_12","alias_value":"ZATYWFI6IJR4","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZATYWFI6IJR4F2GZ","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZATYWFI6","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZATYWFI6IJR4F2GZGI4NXUZO54","target":"record","payload":{"canonical_record":{"source":{"id":"1509.00594","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2015-09-02T07:58:13Z","cross_cats_sorted":["cs.SI","physics.data-an"],"title_canon_sha256":"5167158ea56e7dbe213c21daef4b5ad97566446832e4ef27465b6454c45ec836","abstract_canon_sha256":"b5451262fb5b2b9869dde4c825c9f4d9c4cd09889d96b43222367d0f1cb72405"},"schema_version":"1.0"},"canonical_sha256":"c8278b151e4263c2e8d93238dbd32eef24f125328c7c5e2dd2c4b8a4401c866e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:23.854894Z","signature_b64":"b8SbyGFsV2cYWoyB++RTe6WDGZV6RzisBMWQVGIdCU98CdNG1wkroB8MydHY8Zcn4613CQXtnnk4zUWwdU66DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8278b151e4263c2e8d93238dbd32eef24f125328c7c5e2dd2c4b8a4401c866e","last_reissued_at":"2026-05-18T00:52:23.854134Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:23.854134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.00594","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-18T00:52:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y+svqspDMn7gj70syrkijJB18Pwk6uM4yW83tgQz06tg6cBdsivqd2+sRhxXaLXdZLjeSjPljLwZ9+fwXhauBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:08:41.253486Z"},"content_sha256":"1667f6264a8605a35e04772d1a5419373ec39b4cadadd12cb5326c6532d5679f","schema_version":"1.0","event_id":"sha256:1667f6264a8605a35e04772d1a5419373ec39b4cadadd12cb5326c6532d5679f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZATYWFI6IJR4F2GZGI4NXUZO54","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Evaluating user reputation in online rating systems via an iterative group-based ranking method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.data-an"],"primary_cat":"cs.IR","authors_text":"Jian Gao, Tao Zhou","submitted_at":"2015-09-02T07:58:13Z","abstract_excerpt":"Reputation is a valuable asset in online social lives and it has drawn increased attention. How to evaluate user reputation in online rating systems is especially significant due to the existence of spamming attacks. To address this issue, so far, a variety of methods have been proposed, including network-based methods, quality-based methods and group-based ranking method. In this paper, we propose an iterative group-based ranking (IGR) method by introducing an iterative reputation-allocation process into the original group-based ranking (GR) method. More specifically, users with higher reputa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00594","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-18T00:52:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d9nsdM9bd/jb5yCKhnHa+DBGY78c1oViBcSfDF9UnxjVao5XQiwYXuCq6xkgJSS3furpUF6drCAQBmQvncPWAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:08:41.253873Z"},"content_sha256":"68bd80319973287e54bd060bfa624c43f22b40ba66f38238ea7445207654ca89","schema_version":"1.0","event_id":"sha256:68bd80319973287e54bd060bfa624c43f22b40ba66f38238ea7445207654ca89"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZATYWFI6IJR4F2GZGI4NXUZO54/bundle.json","state_url":"https://pith.science/pith/ZATYWFI6IJR4F2GZGI4NXUZO54/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZATYWFI6IJR4F2GZGI4NXUZO54/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-07T20:08:41Z","links":{"resolver":"https://pith.science/pith/ZATYWFI6IJR4F2GZGI4NXUZO54","bundle":"https://pith.science/pith/ZATYWFI6IJR4F2GZGI4NXUZO54/bundle.json","state":"https://pith.science/pith/ZATYWFI6IJR4F2GZGI4NXUZO54/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZATYWFI6IJR4F2GZGI4NXUZO54/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZATYWFI6IJR4F2GZGI4NXUZO54","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":"b5451262fb5b2b9869dde4c825c9f4d9c4cd09889d96b43222367d0f1cb72405","cross_cats_sorted":["cs.SI","physics.data-an"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2015-09-02T07:58:13Z","title_canon_sha256":"5167158ea56e7dbe213c21daef4b5ad97566446832e4ef27465b6454c45ec836"},"schema_version":"1.0","source":{"id":"1509.00594","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00594","created_at":"2026-05-18T00:52:23Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00594v1","created_at":"2026-05-18T00:52:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00594","created_at":"2026-05-18T00:52:23Z"},{"alias_kind":"pith_short_12","alias_value":"ZATYWFI6IJR4","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZATYWFI6IJR4F2GZ","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZATYWFI6","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:68bd80319973287e54bd060bfa624c43f22b40ba66f38238ea7445207654ca89","target":"graph","created_at":"2026-05-18T00:52: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":"Reputation is a valuable asset in online social lives and it has drawn increased attention. How to evaluate user reputation in online rating systems is especially significant due to the existence of spamming attacks. To address this issue, so far, a variety of methods have been proposed, including network-based methods, quality-based methods and group-based ranking method. In this paper, we propose an iterative group-based ranking (IGR) method by introducing an iterative reputation-allocation process into the original group-based ranking (GR) method. More specifically, users with higher reputa","authors_text":"Jian Gao, Tao Zhou","cross_cats":["cs.SI","physics.data-an"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2015-09-02T07:58:13Z","title":"Evaluating user reputation in online rating systems via an iterative group-based ranking method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00594","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:1667f6264a8605a35e04772d1a5419373ec39b4cadadd12cb5326c6532d5679f","target":"record","created_at":"2026-05-18T00:52: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":"b5451262fb5b2b9869dde4c825c9f4d9c4cd09889d96b43222367d0f1cb72405","cross_cats_sorted":["cs.SI","physics.data-an"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2015-09-02T07:58:13Z","title_canon_sha256":"5167158ea56e7dbe213c21daef4b5ad97566446832e4ef27465b6454c45ec836"},"schema_version":"1.0","source":{"id":"1509.00594","kind":"arxiv","version":1}},"canonical_sha256":"c8278b151e4263c2e8d93238dbd32eef24f125328c7c5e2dd2c4b8a4401c866e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c8278b151e4263c2e8d93238dbd32eef24f125328c7c5e2dd2c4b8a4401c866e","first_computed_at":"2026-05-18T00:52:23.854134Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:23.854134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b8SbyGFsV2cYWoyB++RTe6WDGZV6RzisBMWQVGIdCU98CdNG1wkroB8MydHY8Zcn4613CQXtnnk4zUWwdU66DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:23.854894Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.00594","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1667f6264a8605a35e04772d1a5419373ec39b4cadadd12cb5326c6532d5679f","sha256:68bd80319973287e54bd060bfa624c43f22b40ba66f38238ea7445207654ca89"],"state_sha256":"bcc76d011748ffba21f5deb0061b555931a76ae8424dd221896e371c88d0281d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z8fuPn1IkqKfKz/t0LOFYbwMajgs2zaenMgmH365L/pOByDQJaXSA515QOwe0uJGN5ApssO4q2hJ4FpxA8TrAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T20:08:41.257062Z","bundle_sha256":"4c47eb1cd5b8d8ad001adca97512bbb19632cadffde0206527b4ce465857d869"}}