{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RCKENW2VVMXORRVE2Y2TU7I6VV","short_pith_number":"pith:RCKENW2V","canonical_record":{"source":{"id":"1809.03758","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-09-11T09:08:33Z","cross_cats_sorted":[],"title_canon_sha256":"157c9bc130e6d128f69790f2c5c9c207869ad535a3d85766164656ae9d0be81e","abstract_canon_sha256":"956940e5998ef34e648a32c1a2e3d81e3bcfcd21a9e33e6791d4eb8b26e54f5d"},"schema_version":"1.0"},"canonical_sha256":"889446db55ab2ee8c6a4d6353a7d1ead784f253754ef99927b7a22a5dd901388","source":{"kind":"arxiv","id":"1809.03758","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.03758","created_at":"2026-05-18T00:05:59Z"},{"alias_kind":"arxiv_version","alias_value":"1809.03758v1","created_at":"2026-05-18T00:05:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.03758","created_at":"2026-05-18T00:05:59Z"},{"alias_kind":"pith_short_12","alias_value":"RCKENW2VVMXO","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RCKENW2VVMXORRVE","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RCKENW2V","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RCKENW2VVMXORRVE2Y2TU7I6VV","target":"record","payload":{"canonical_record":{"source":{"id":"1809.03758","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-09-11T09:08:33Z","cross_cats_sorted":[],"title_canon_sha256":"157c9bc130e6d128f69790f2c5c9c207869ad535a3d85766164656ae9d0be81e","abstract_canon_sha256":"956940e5998ef34e648a32c1a2e3d81e3bcfcd21a9e33e6791d4eb8b26e54f5d"},"schema_version":"1.0"},"canonical_sha256":"889446db55ab2ee8c6a4d6353a7d1ead784f253754ef99927b7a22a5dd901388","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:59.910688Z","signature_b64":"I1X9aAhSetSdbmaJplzjyEwSjIWgpVQSYSGYBFJwahJhC9an1cpjRbpthfxbGX3AGH9SV2rKfu7bwSvg+xmhBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"889446db55ab2ee8c6a4d6353a7d1ead784f253754ef99927b7a22a5dd901388","last_reissued_at":"2026-05-18T00:05:59.910152Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:59.910152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.03758","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:05:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hBzzF/5FUMRjLihg/nw2qqCXQwGKLh0zYswkjGAw/SjjnVfUeZx8o6gsvBImA6VToOdJ1gysTWyIRshDX0ZcCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:57:44.774003Z"},"content_sha256":"4f1edbe00f005e1de2ae74997cc08aab8141c4d66bc399e1ac2f73f7142a7cb9","schema_version":"1.0","event_id":"sha256:4f1edbe00f005e1de2ae74997cc08aab8141c4d66bc399e1ac2f73f7142a7cb9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RCKENW2VVMXORRVE2Y2TU7I6VV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Threshold-Based Heuristics for Trust Inference in a Social Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Bithika Pal, Mamata Jenamani, Suman Banerjee","submitted_at":"2018-09-11T09:08:33Z","abstract_excerpt":"Trust among the users of a social network plays a pivotal role in item recommendation, particularly for the cold start users. Due to the sparse nature of these networks, trust information between any two users may not be always available. To infer the missing trust values, one well-known approach is path based trust estimation, which suggests a user to believe all of its neighbors in the network. In this context, we propose two threshold-based heuristics to overcome the limitation of computation for the path based trust inference. It uses the propagation phenomena of trust and decides a thresh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.03758","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:05:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d+Bhx1ZBiah8zBNKwFgkIYNM/DB7SE9dYwaHbeZMY87H4ko/L4MMdqB37rv4ChDyg/B0xyJiz/8zxiqwf8QhBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:57:44.774727Z"},"content_sha256":"a12e22efbfd16e5919fd5fe9dcc201ee49e901fa8f35c795272c1e4266b04cfc","schema_version":"1.0","event_id":"sha256:a12e22efbfd16e5919fd5fe9dcc201ee49e901fa8f35c795272c1e4266b04cfc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RCKENW2VVMXORRVE2Y2TU7I6VV/bundle.json","state_url":"https://pith.science/pith/RCKENW2VVMXORRVE2Y2TU7I6VV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RCKENW2VVMXORRVE2Y2TU7I6VV/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-10T22:57:44Z","links":{"resolver":"https://pith.science/pith/RCKENW2VVMXORRVE2Y2TU7I6VV","bundle":"https://pith.science/pith/RCKENW2VVMXORRVE2Y2TU7I6VV/bundle.json","state":"https://pith.science/pith/RCKENW2VVMXORRVE2Y2TU7I6VV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RCKENW2VVMXORRVE2Y2TU7I6VV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RCKENW2VVMXORRVE2Y2TU7I6VV","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":"956940e5998ef34e648a32c1a2e3d81e3bcfcd21a9e33e6791d4eb8b26e54f5d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-09-11T09:08:33Z","title_canon_sha256":"157c9bc130e6d128f69790f2c5c9c207869ad535a3d85766164656ae9d0be81e"},"schema_version":"1.0","source":{"id":"1809.03758","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.03758","created_at":"2026-05-18T00:05:59Z"},{"alias_kind":"arxiv_version","alias_value":"1809.03758v1","created_at":"2026-05-18T00:05:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.03758","created_at":"2026-05-18T00:05:59Z"},{"alias_kind":"pith_short_12","alias_value":"RCKENW2VVMXO","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RCKENW2VVMXORRVE","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RCKENW2V","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:a12e22efbfd16e5919fd5fe9dcc201ee49e901fa8f35c795272c1e4266b04cfc","target":"graph","created_at":"2026-05-18T00:05:59Z","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":"Trust among the users of a social network plays a pivotal role in item recommendation, particularly for the cold start users. Due to the sparse nature of these networks, trust information between any two users may not be always available. To infer the missing trust values, one well-known approach is path based trust estimation, which suggests a user to believe all of its neighbors in the network. In this context, we propose two threshold-based heuristics to overcome the limitation of computation for the path based trust inference. It uses the propagation phenomena of trust and decides a thresh","authors_text":"Bithika Pal, Mamata Jenamani, Suman Banerjee","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-09-11T09:08:33Z","title":"Threshold-Based Heuristics for Trust Inference in a Social Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.03758","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:4f1edbe00f005e1de2ae74997cc08aab8141c4d66bc399e1ac2f73f7142a7cb9","target":"record","created_at":"2026-05-18T00:05:59Z","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":"956940e5998ef34e648a32c1a2e3d81e3bcfcd21a9e33e6791d4eb8b26e54f5d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-09-11T09:08:33Z","title_canon_sha256":"157c9bc130e6d128f69790f2c5c9c207869ad535a3d85766164656ae9d0be81e"},"schema_version":"1.0","source":{"id":"1809.03758","kind":"arxiv","version":1}},"canonical_sha256":"889446db55ab2ee8c6a4d6353a7d1ead784f253754ef99927b7a22a5dd901388","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"889446db55ab2ee8c6a4d6353a7d1ead784f253754ef99927b7a22a5dd901388","first_computed_at":"2026-05-18T00:05:59.910152Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:59.910152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I1X9aAhSetSdbmaJplzjyEwSjIWgpVQSYSGYBFJwahJhC9an1cpjRbpthfxbGX3AGH9SV2rKfu7bwSvg+xmhBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:59.910688Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.03758","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f1edbe00f005e1de2ae74997cc08aab8141c4d66bc399e1ac2f73f7142a7cb9","sha256:a12e22efbfd16e5919fd5fe9dcc201ee49e901fa8f35c795272c1e4266b04cfc"],"state_sha256":"1186ffeeb4c7a6cfe2d4ecb3d7c013191c2d6d8b7fc286761c7fc99784051508"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uR8Qib63lIN5eqwzSO3ocR7oor1i18oWGMDm1vAG2hurlDT91zJvsKPtyNkzTQIfextEFbfiQl4ex5Vrw0+sAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T22:57:44.778820Z","bundle_sha256":"1fba086641e5b2d078e15535d0354a904d86ae33a126d8e4dbeb88777de6e81e"}}