{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:BGY3OPAXKPJRHTQD4TPKHPA5R6","short_pith_number":"pith:BGY3OPAX","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"},"canonical_sha256":"09b1b73c1753d313ce03e4dea3bc1d8f8a0f566288815f057329b3967a88a29c","source":{"kind":"arxiv","id":"1207.5661","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.5661","created_at":"2026-05-18T01:56:08Z"},{"alias_kind":"arxiv_version","alias_value":"1207.5661v1","created_at":"2026-05-18T01:56:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5661","created_at":"2026-05-18T01:56:08Z"},{"alias_kind":"pith_short_12","alias_value":"BGY3OPAXKPJR","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"BGY3OPAXKPJRHTQD","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"BGY3OPAX","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:BGY3OPAXKPJRHTQD4TPKHPA5R6","target":"record","payload":{"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"},"canonical_sha256":"09b1b73c1753d313ce03e4dea3bc1d8f8a0f566288815f057329b3967a88a29c","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"},"source_kind":"arxiv","source_id":"1207.5661","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:56:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9LjUtsKzk7E9TlGPxMD/zegbHjx39YYrnmCVOW9+fPdLMrraAE8QiWSpnoT/W38eM/aP5rKKewTed4dHluk4BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:36:14.755625Z"},"content_sha256":"140108255e4bca5138caa82680ae5df5aed29d1b64e9ff444cb47c258bcbe3db","schema_version":"1.0","event_id":"sha256:140108255e4bca5138caa82680ae5df5aed29d1b64e9ff444cb47c258bcbe3db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:BGY3OPAXKPJRHTQD4TPKHPA5R6","target":"graph","payload":{"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"},"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:56:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j11DA64sY6hQ9YrR+Wg3Ok56tBtAZ8gBIiSIsb9vDD6y9SvN2uhNWgVwsNRimCPh+Tyr3rE6WGnaIskZI7ADBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:36:14.755965Z"},"content_sha256":"14545550851d8ab6787ac8b808dc9d5b8a1e629483ec6184d57ed7fa275c67ee","schema_version":"1.0","event_id":"sha256:14545550851d8ab6787ac8b808dc9d5b8a1e629483ec6184d57ed7fa275c67ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BGY3OPAXKPJRHTQD4TPKHPA5R6/bundle.json","state_url":"https://pith.science/pith/BGY3OPAXKPJRHTQD4TPKHPA5R6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BGY3OPAXKPJRHTQD4TPKHPA5R6/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-02T15:36:14Z","links":{"resolver":"https://pith.science/pith/BGY3OPAXKPJRHTQD4TPKHPA5R6","bundle":"https://pith.science/pith/BGY3OPAXKPJRHTQD4TPKHPA5R6/bundle.json","state":"https://pith.science/pith/BGY3OPAXKPJRHTQD4TPKHPA5R6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BGY3OPAXKPJRHTQD4TPKHPA5R6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:BGY3OPAXKPJRHTQD4TPKHPA5R6","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":"c8ae5417ff35f3b9fa4f81eadb9c2f4e57ba2f8ba082d213329a46a92c77d210","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-07-24T11:36:05Z","title_canon_sha256":"9ef538de408ee87075b2eb7485e503da695eef1efcb943f6cdf1e5bfaaa7254c"},"schema_version":"1.0","source":{"id":"1207.5661","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.5661","created_at":"2026-05-18T01:56:08Z"},{"alias_kind":"arxiv_version","alias_value":"1207.5661v1","created_at":"2026-05-18T01:56:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5661","created_at":"2026-05-18T01:56:08Z"},{"alias_kind":"pith_short_12","alias_value":"BGY3OPAXKPJR","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"BGY3OPAXKPJRHTQD","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"BGY3OPAX","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:14545550851d8ab6787ac8b808dc9d5b8a1e629483ec6184d57ed7fa275c67ee","target":"graph","created_at":"2026-05-18T01:56:08Z","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":"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","authors_text":"Hong Cheng, Jeffrey Xu Yu, Rong-Hua Li, Xin Huang","cross_cats":["physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-07-24T11:36:05Z","title":"A Framework of Algorithms: Computing the Bias and Prestige of Nodes in Trust Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5661","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:140108255e4bca5138caa82680ae5df5aed29d1b64e9ff444cb47c258bcbe3db","target":"record","created_at":"2026-05-18T01:56:08Z","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":"c8ae5417ff35f3b9fa4f81eadb9c2f4e57ba2f8ba082d213329a46a92c77d210","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-07-24T11:36:05Z","title_canon_sha256":"9ef538de408ee87075b2eb7485e503da695eef1efcb943f6cdf1e5bfaaa7254c"},"schema_version":"1.0","source":{"id":"1207.5661","kind":"arxiv","version":1}},"canonical_sha256":"09b1b73c1753d313ce03e4dea3bc1d8f8a0f566288815f057329b3967a88a29c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"09b1b73c1753d313ce03e4dea3bc1d8f8a0f566288815f057329b3967a88a29c","first_computed_at":"2026-05-18T01:56:08.523630Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:56:08.523630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JhMAp6Df8AOTZGL9ll3ywjiwogrHAVOviNLkja2uVH7ptNutxAPtR4lJzDCnghgUXnmDHkei4pAf1lwzH5YlBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:56:08.524383Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.5661","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:140108255e4bca5138caa82680ae5df5aed29d1b64e9ff444cb47c258bcbe3db","sha256:14545550851d8ab6787ac8b808dc9d5b8a1e629483ec6184d57ed7fa275c67ee"],"state_sha256":"5537d8d0efc02ab797e9008d815778a1b7bdb07dd6e3bd8e7a70c5fdb917ecdc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zLSAdYLr7OnvCqUv1o0uGRj0gvmxIW4nSDKlKLd090FDiWpEZP2Ev9AzXWm1mqDe1RJ2b2CJ6EjFp+r1HeDUBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T15:36:14.757845Z","bundle_sha256":"95f4897f129cd5a4c8e305c33d4ff4ebef9c4dfd2b743662c09edaf3c894b318"}}