{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:GF4NGZMBCYHEU3XHIP7BPGWZBQ","short_pith_number":"pith:GF4NGZMB","canonical_record":{"source":{"id":"1307.6658","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-07-25T08:19:30Z","cross_cats_sorted":[],"title_canon_sha256":"a298ade4515fd24fd1a014f29c082f6da757d7cab85f56bd46607c4acf907666","abstract_canon_sha256":"5140d62d71d2876d9e2761b92bf671e84c878bc543b73f3b1b7153dc95950352"},"schema_version":"1.0"},"canonical_sha256":"3178d36581160e4a6ee743fe179ad90c2c8aced3e41e6757dded64f9a6584f01","source":{"kind":"arxiv","id":"1307.6658","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.6658","created_at":"2026-05-18T01:36:39Z"},{"alias_kind":"arxiv_version","alias_value":"1307.6658v1","created_at":"2026-05-18T01:36:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6658","created_at":"2026-05-18T01:36:39Z"},{"alias_kind":"pith_short_12","alias_value":"GF4NGZMBCYHE","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GF4NGZMBCYHEU3XH","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GF4NGZMB","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:GF4NGZMBCYHEU3XHIP7BPGWZBQ","target":"record","payload":{"canonical_record":{"source":{"id":"1307.6658","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-07-25T08:19:30Z","cross_cats_sorted":[],"title_canon_sha256":"a298ade4515fd24fd1a014f29c082f6da757d7cab85f56bd46607c4acf907666","abstract_canon_sha256":"5140d62d71d2876d9e2761b92bf671e84c878bc543b73f3b1b7153dc95950352"},"schema_version":"1.0"},"canonical_sha256":"3178d36581160e4a6ee743fe179ad90c2c8aced3e41e6757dded64f9a6584f01","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:39.066960Z","signature_b64":"TDDhOyyls88wWSTV0AcOhh2/8lA0AFyrk/grqENHtJTbumXG79ESlUmcXczHYbpr+8a2oy0GKH1LBb7QuNSBAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3178d36581160e4a6ee743fe179ad90c2c8aced3e41e6757dded64f9a6584f01","last_reissued_at":"2026-05-18T01:36:39.066205Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:39.066205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.6658","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-18T01:36:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4U6w7Cg+44AFdr3mfaGQ7XGgg2wkdQGYTQGUx3j/87hwgfIjgbiVwElrOvPVuenUGe0c7FpAfFBZhj9Y6w4xBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:00:55.710554Z"},"content_sha256":"8d4e1e95def493e8ecefe1348384cc612a3560a0944d27cea15a870ba47b37df","schema_version":"1.0","event_id":"sha256:8d4e1e95def493e8ecefe1348384cc612a3560a0944d27cea15a870ba47b37df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:GF4NGZMBCYHEU3XHIP7BPGWZBQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Reputation Based Framework to Avoid Free-riding in Unstructured Peer-to-Peer network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Ruchir Gupta, Yatindra Nath Singh","submitted_at":"2013-07-25T08:19:30Z","abstract_excerpt":"Free riding is a major problem in peer-to-peer networks. Reputation management systems are generally proposed to overcome this problem. In this paper we have discussed a possible way of resource allocation on the basis of reputation management system i.e. probabilistic allocation based on reputation. This seems to be a better way for allocation of resources because in this case nodes that do not have very good reputation about each other, may also serve each other at least some amount of resource with finite probability. This avoids disconnect between them. Algorithms are presented for optimiz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.6658","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-18T01:36:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TlVhxzMQtvgnzf1sK0Hya8Z76u3xuV8m8XSoTCCG3FcTT4J4+SXbUYHu4E2aCHY/ilHvWbpqDbWuAWjkO77VDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:00:55.710911Z"},"content_sha256":"5b61925904a7c75b507f47d6ff74e47130e099fd56b0991a4b4680d505d232f9","schema_version":"1.0","event_id":"sha256:5b61925904a7c75b507f47d6ff74e47130e099fd56b0991a4b4680d505d232f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GF4NGZMBCYHEU3XHIP7BPGWZBQ/bundle.json","state_url":"https://pith.science/pith/GF4NGZMBCYHEU3XHIP7BPGWZBQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GF4NGZMBCYHEU3XHIP7BPGWZBQ/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-05-28T10:00:55Z","links":{"resolver":"https://pith.science/pith/GF4NGZMBCYHEU3XHIP7BPGWZBQ","bundle":"https://pith.science/pith/GF4NGZMBCYHEU3XHIP7BPGWZBQ/bundle.json","state":"https://pith.science/pith/GF4NGZMBCYHEU3XHIP7BPGWZBQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GF4NGZMBCYHEU3XHIP7BPGWZBQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GF4NGZMBCYHEU3XHIP7BPGWZBQ","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":"5140d62d71d2876d9e2761b92bf671e84c878bc543b73f3b1b7153dc95950352","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-07-25T08:19:30Z","title_canon_sha256":"a298ade4515fd24fd1a014f29c082f6da757d7cab85f56bd46607c4acf907666"},"schema_version":"1.0","source":{"id":"1307.6658","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.6658","created_at":"2026-05-18T01:36:39Z"},{"alias_kind":"arxiv_version","alias_value":"1307.6658v1","created_at":"2026-05-18T01:36:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6658","created_at":"2026-05-18T01:36:39Z"},{"alias_kind":"pith_short_12","alias_value":"GF4NGZMBCYHE","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GF4NGZMBCYHEU3XH","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GF4NGZMB","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:5b61925904a7c75b507f47d6ff74e47130e099fd56b0991a4b4680d505d232f9","target":"graph","created_at":"2026-05-18T01:36:39Z","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":"Free riding is a major problem in peer-to-peer networks. Reputation management systems are generally proposed to overcome this problem. In this paper we have discussed a possible way of resource allocation on the basis of reputation management system i.e. probabilistic allocation based on reputation. This seems to be a better way for allocation of resources because in this case nodes that do not have very good reputation about each other, may also serve each other at least some amount of resource with finite probability. This avoids disconnect between them. Algorithms are presented for optimiz","authors_text":"Ruchir Gupta, Yatindra Nath Singh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-07-25T08:19:30Z","title":"A Reputation Based Framework to Avoid Free-riding in Unstructured Peer-to-Peer network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.6658","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:8d4e1e95def493e8ecefe1348384cc612a3560a0944d27cea15a870ba47b37df","target":"record","created_at":"2026-05-18T01:36:39Z","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":"5140d62d71d2876d9e2761b92bf671e84c878bc543b73f3b1b7153dc95950352","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-07-25T08:19:30Z","title_canon_sha256":"a298ade4515fd24fd1a014f29c082f6da757d7cab85f56bd46607c4acf907666"},"schema_version":"1.0","source":{"id":"1307.6658","kind":"arxiv","version":1}},"canonical_sha256":"3178d36581160e4a6ee743fe179ad90c2c8aced3e41e6757dded64f9a6584f01","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3178d36581160e4a6ee743fe179ad90c2c8aced3e41e6757dded64f9a6584f01","first_computed_at":"2026-05-18T01:36:39.066205Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:39.066205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TDDhOyyls88wWSTV0AcOhh2/8lA0AFyrk/grqENHtJTbumXG79ESlUmcXczHYbpr+8a2oy0GKH1LBb7QuNSBAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:39.066960Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.6658","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d4e1e95def493e8ecefe1348384cc612a3560a0944d27cea15a870ba47b37df","sha256:5b61925904a7c75b507f47d6ff74e47130e099fd56b0991a4b4680d505d232f9"],"state_sha256":"52779c42b357350d30790f775718124f48cd04d1688d7e6b7de67d08bcb321e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C/xETtvrwhwdRgz59/1FgSU8GkTMCc4W9i6c/OZeCAhAYBwvm/I6pZqmKnkMYYEe7I4Rgl+ruqIvE9HqaE9lCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:00:55.712989Z","bundle_sha256":"c2ccd51b46d265ac5d5ea75da0db7e70e36a8a4f8bd3d287666ad6dbf2f0d3c0"}}