{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:PXNFXIMPGDFZFRJJPVMI366GHO","short_pith_number":"pith:PXNFXIMP","canonical_record":{"source":{"id":"1204.5314","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-04-24T09:06:36Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"7b0000be6649950963f2382d85a63f67ddba0c9f202f5fff760e8560434ebc80","abstract_canon_sha256":"9dde0c4864a8b125eb76721ef1c9e1c030b11e4521ccc4bb9f446a50fdb090c2"},"schema_version":"1.0"},"canonical_sha256":"7dda5ba18f30cb92c5297d588dfbc63bbadfa77628b0d254fe8de17d2582d897","source":{"kind":"arxiv","id":"1204.5314","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.5314","created_at":"2026-05-18T03:18:31Z"},{"alias_kind":"arxiv_version","alias_value":"1204.5314v1","created_at":"2026-05-18T03:18:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5314","created_at":"2026-05-18T03:18:31Z"},{"alias_kind":"pith_short_12","alias_value":"PXNFXIMPGDFZ","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PXNFXIMPGDFZFRJJ","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PXNFXIMP","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:PXNFXIMPGDFZFRJJPVMI366GHO","target":"record","payload":{"canonical_record":{"source":{"id":"1204.5314","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-04-24T09:06:36Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"7b0000be6649950963f2382d85a63f67ddba0c9f202f5fff760e8560434ebc80","abstract_canon_sha256":"9dde0c4864a8b125eb76721ef1c9e1c030b11e4521ccc4bb9f446a50fdb090c2"},"schema_version":"1.0"},"canonical_sha256":"7dda5ba18f30cb92c5297d588dfbc63bbadfa77628b0d254fe8de17d2582d897","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:31.917968Z","signature_b64":"6mQNnk2/I33Tg41p381eudDxTCLwYH62GQgLcI8nsjPS8UsYUhfWROe8n8E1GYpJtPpT6qWGTmOfXBtE4aM0BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7dda5ba18f30cb92c5297d588dfbc63bbadfa77628b0d254fe8de17d2582d897","last_reissued_at":"2026-05-18T03:18:31.917136Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:31.917136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.5314","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-18T03:18:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hAsRLFKBduyMRd4YTpimpwbMc294qLfpv2gs8a9/k4aYBFtrh7AjFfoOpVrrclv/xC4FhuiZmhwRec1GdmmXBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:44:43.309350Z"},"content_sha256":"cd77cacb47cfc602acba6404ffaafdfd98b9c904637231b1a40bde4370f018b8","schema_version":"1.0","event_id":"sha256:cd77cacb47cfc602acba6404ffaafdfd98b9c904637231b1a40bde4370f018b8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:PXNFXIMPGDFZFRJJPVMI366GHO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Tunable Mechanism for Identifying Trusted Nodes in Large Scale Distributed Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Frank Schweitzer, Ingo Scholtes, Joydeep Chandra, Niloy Ganguly","submitted_at":"2012-04-24T09:06:36Z","abstract_excerpt":"In this paper, we propose a simple randomized protocol for identifying trusted nodes based on personalized trust in large scale distributed networks. The problem of identifying trusted nodes, based on personalized trust, in a large network setting stems from the huge computation and message overhead involved in exhaustively calculating and propagating the trust estimates by the remote nodes. However, in any practical scenario, nodes generally communicate with a small subset of nodes and thus exhaustively estimating the trust of all the nodes can lead to huge resource consumption. In contrast, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5314","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-18T03:18:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rfgpSgqti3KsfwmOffhDcjofsudn6TIU0FxKFS89hRBErqxOAO9AJokiRYm29xAUs7nyh85DAq4UQSuX5aM0DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:44:43.310093Z"},"content_sha256":"068c86f961c94c1e7d261888e80d576de887a617b1ff95b36bcf34e1cadfbada","schema_version":"1.0","event_id":"sha256:068c86f961c94c1e7d261888e80d576de887a617b1ff95b36bcf34e1cadfbada"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PXNFXIMPGDFZFRJJPVMI366GHO/bundle.json","state_url":"https://pith.science/pith/PXNFXIMPGDFZFRJJPVMI366GHO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PXNFXIMPGDFZFRJJPVMI366GHO/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-30T21:44:43Z","links":{"resolver":"https://pith.science/pith/PXNFXIMPGDFZFRJJPVMI366GHO","bundle":"https://pith.science/pith/PXNFXIMPGDFZFRJJPVMI366GHO/bundle.json","state":"https://pith.science/pith/PXNFXIMPGDFZFRJJPVMI366GHO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PXNFXIMPGDFZFRJJPVMI366GHO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:PXNFXIMPGDFZFRJJPVMI366GHO","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":"9dde0c4864a8b125eb76721ef1c9e1c030b11e4521ccc4bb9f446a50fdb090c2","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-04-24T09:06:36Z","title_canon_sha256":"7b0000be6649950963f2382d85a63f67ddba0c9f202f5fff760e8560434ebc80"},"schema_version":"1.0","source":{"id":"1204.5314","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.5314","created_at":"2026-05-18T03:18:31Z"},{"alias_kind":"arxiv_version","alias_value":"1204.5314v1","created_at":"2026-05-18T03:18:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5314","created_at":"2026-05-18T03:18:31Z"},{"alias_kind":"pith_short_12","alias_value":"PXNFXIMPGDFZ","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PXNFXIMPGDFZFRJJ","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PXNFXIMP","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:068c86f961c94c1e7d261888e80d576de887a617b1ff95b36bcf34e1cadfbada","target":"graph","created_at":"2026-05-18T03:18:31Z","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":"In this paper, we propose a simple randomized protocol for identifying trusted nodes based on personalized trust in large scale distributed networks. The problem of identifying trusted nodes, based on personalized trust, in a large network setting stems from the huge computation and message overhead involved in exhaustively calculating and propagating the trust estimates by the remote nodes. However, in any practical scenario, nodes generally communicate with a small subset of nodes and thus exhaustively estimating the trust of all the nodes can lead to huge resource consumption. In contrast, ","authors_text":"Frank Schweitzer, Ingo Scholtes, Joydeep Chandra, Niloy Ganguly","cross_cats":["physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-04-24T09:06:36Z","title":"A Tunable Mechanism for Identifying Trusted Nodes in Large Scale Distributed Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5314","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:cd77cacb47cfc602acba6404ffaafdfd98b9c904637231b1a40bde4370f018b8","target":"record","created_at":"2026-05-18T03:18:31Z","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":"9dde0c4864a8b125eb76721ef1c9e1c030b11e4521ccc4bb9f446a50fdb090c2","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-04-24T09:06:36Z","title_canon_sha256":"7b0000be6649950963f2382d85a63f67ddba0c9f202f5fff760e8560434ebc80"},"schema_version":"1.0","source":{"id":"1204.5314","kind":"arxiv","version":1}},"canonical_sha256":"7dda5ba18f30cb92c5297d588dfbc63bbadfa77628b0d254fe8de17d2582d897","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7dda5ba18f30cb92c5297d588dfbc63bbadfa77628b0d254fe8de17d2582d897","first_computed_at":"2026-05-18T03:18:31.917136Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:18:31.917136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6mQNnk2/I33Tg41p381eudDxTCLwYH62GQgLcI8nsjPS8UsYUhfWROe8n8E1GYpJtPpT6qWGTmOfXBtE4aM0BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:18:31.917968Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.5314","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd77cacb47cfc602acba6404ffaafdfd98b9c904637231b1a40bde4370f018b8","sha256:068c86f961c94c1e7d261888e80d576de887a617b1ff95b36bcf34e1cadfbada"],"state_sha256":"b5c9870325a6eaa31aaa692a3176419db54b43eaf6bc4590c2ff7488c5d123d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MmX/A8xQGnJRJOa7v4diktTbF2+yZWSRinakmwNBplqbu8yxyrRLAvjcA4y7N/ZoRU0BovRTOjPYcw4LXfh4DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T21:44:43.313387Z","bundle_sha256":"e3ec69a32e49d0a5c05e867dca97ddc9bcc4a1381bcdc2e65417678eb61fd66e"}}