{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:BGY3OPAXKPJRHTQD4TPKHPA5R6","short_pith_number":"pith:BGY3OPAX","schema_version":"1.0","canonical_sha256":"09b1b73c1753d313ce03e4dea3bc1d8f8a0f566288815f057329b3967a88a29c","source":{"kind":"arxiv","id":"1207.5661","version":1},"attestation_state":"computed","paper":{"title":"A Framework of Algorithms: Computing the Bias and Prestige of Nodes in Trust Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Hong Cheng, Jeffrey Xu Yu, Rong-Hua Li, Xin Huang","submitted_at":"2012-07-24T11:36:05Z","abstract_excerpt":"A trust network is a social network in which edges represent the trust relationship between two nodes in the network. In a trust network, a fundamental question is how to assess and compute the bias and prestige of the nodes, where the bias of a node measures the trustworthiness of a node and the prestige of a node measures the importance of the node. The larger bias of a node implies the lower trustworthiness of the node, and the larger prestige of a node implies the higher importance of the node. In this paper, we define a vector-valued contractive function to characterize the bias vector wh"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1207.5661","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-07-24T11:36:05Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"9ef538de408ee87075b2eb7485e503da695eef1efcb943f6cdf1e5bfaaa7254c","abstract_canon_sha256":"c8ae5417ff35f3b9fa4f81eadb9c2f4e57ba2f8ba082d213329a46a92c77d210"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:56:08.524383Z","signature_b64":"JhMAp6Df8AOTZGL9ll3ywjiwogrHAVOviNLkja2uVH7ptNutxAPtR4lJzDCnghgUXnmDHkei4pAf1lwzH5YlBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09b1b73c1753d313ce03e4dea3bc1d8f8a0f566288815f057329b3967a88a29c","last_reissued_at":"2026-05-18T01:56:08.523630Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:56:08.523630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Framework of Algorithms: Computing the Bias and Prestige of Nodes in Trust Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Hong Cheng, Jeffrey Xu Yu, Rong-Hua Li, Xin Huang","submitted_at":"2012-07-24T11:36:05Z","abstract_excerpt":"A trust network is a social network in which edges represent the trust relationship between two nodes in the network. In a trust network, a fundamental question is how to assess and compute the bias and prestige of the nodes, where the bias of a node measures the trustworthiness of a node and the prestige of a node measures the importance of the node. The larger bias of a node implies the lower trustworthiness of the node, and the larger prestige of a node implies the higher importance of the node. In this paper, we define a vector-valued contractive function to characterize the bias vector wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5661","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1207.5661","created_at":"2026-05-18T01:56:08.523754+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.5661v1","created_at":"2026-05-18T01:56:08.523754+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5661","created_at":"2026-05-18T01:56:08.523754+00:00"},{"alias_kind":"pith_short_12","alias_value":"BGY3OPAXKPJR","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"BGY3OPAXKPJRHTQD","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"BGY3OPAX","created_at":"2026-05-18T12:26:58.693483+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BGY3OPAXKPJRHTQD4TPKHPA5R6","json":"https://pith.science/pith/BGY3OPAXKPJRHTQD4TPKHPA5R6.json","graph_json":"https://pith.science/api/pith-number/BGY3OPAXKPJRHTQD4TPKHPA5R6/graph.json","events_json":"https://pith.science/api/pith-number/BGY3OPAXKPJRHTQD4TPKHPA5R6/events.json","paper":"https://pith.science/paper/BGY3OPAX"},"agent_actions":{"view_html":"https://pith.science/pith/BGY3OPAXKPJRHTQD4TPKHPA5R6","download_json":"https://pith.science/pith/BGY3OPAXKPJRHTQD4TPKHPA5R6.json","view_paper":"https://pith.science/paper/BGY3OPAX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.5661&json=true","fetch_graph":"https://pith.science/api/pith-number/BGY3OPAXKPJRHTQD4TPKHPA5R6/graph.json","fetch_events":"https://pith.science/api/pith-number/BGY3OPAXKPJRHTQD4TPKHPA5R6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BGY3OPAXKPJRHTQD4TPKHPA5R6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BGY3OPAXKPJRHTQD4TPKHPA5R6/action/storage_attestation","attest_author":"https://pith.science/pith/BGY3OPAXKPJRHTQD4TPKHPA5R6/action/author_attestation","sign_citation":"https://pith.science/pith/BGY3OPAXKPJRHTQD4TPKHPA5R6/action/citation_signature","submit_replication":"https://pith.science/pith/BGY3OPAXKPJRHTQD4TPKHPA5R6/action/replication_record"}},"created_at":"2026-05-18T01:56:08.523754+00:00","updated_at":"2026-05-18T01:56:08.523754+00:00"}