{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QMKUTEYIIXN2NZETYQUMG2MDII","short_pith_number":"pith:QMKUTEYI","schema_version":"1.0","canonical_sha256":"831549930845dba6e493c428c36983422b179c0bece99078137bb61e62275f48","source":{"kind":"arxiv","id":"1712.09862","version":1},"attestation_state":"computed","paper":{"title":"A non-biased trust model for wireless mesh networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Heng Chuan Tan, Houda Labiod (INFRES), Jun Zhang (INFRES), Maode Ma, Peter Han Joo Chong (AUT)","submitted_at":"2017-12-28T14:00:33Z","abstract_excerpt":"Trust models that rely on recommendation trusts are vulnerable to badmouthing and ballot-stuffing attacks. To cope with these attacks, existing trust models use different trust aggregation techniques to process the recommendation trusts and combine them with the direct trust values to form a combined trust value. However, these trust models are biased as recommendation trusts that deviate too much from one's own opinion are discarded. In this paper, we propose a non-biased trust model that considers every recommendation trusts available regardless they are good or bad. Our trust model is based"},"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":"1712.09862","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-12-28T14:00:33Z","cross_cats_sorted":[],"title_canon_sha256":"6c8b6e27afa7a91ba781077a54a1798c7a352ebecdb94bab0edd229a57f95346","abstract_canon_sha256":"123f890f13aff28386e52dbbd97fdb3cf631ea0b50f119e556443a2821e3436b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:05.355661Z","signature_b64":"MUGnmcJpoowqLAOO3cskO2cCy5UShu5Fp50yO+GWG8E+lOVuODcHBZ7SgM6U1cYt/WCftPemDWQRjPuzR1thCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"831549930845dba6e493c428c36983422b179c0bece99078137bb61e62275f48","last_reissued_at":"2026-05-18T00:27:05.355190Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:05.355190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A non-biased trust model for wireless mesh networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Heng Chuan Tan, Houda Labiod (INFRES), Jun Zhang (INFRES), Maode Ma, Peter Han Joo Chong (AUT)","submitted_at":"2017-12-28T14:00:33Z","abstract_excerpt":"Trust models that rely on recommendation trusts are vulnerable to badmouthing and ballot-stuffing attacks. To cope with these attacks, existing trust models use different trust aggregation techniques to process the recommendation trusts and combine them with the direct trust values to form a combined trust value. However, these trust models are biased as recommendation trusts that deviate too much from one's own opinion are discarded. In this paper, we propose a non-biased trust model that considers every recommendation trusts available regardless they are good or bad. Our trust model is based"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09862","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":"1712.09862","created_at":"2026-05-18T00:27:05.355259+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.09862v1","created_at":"2026-05-18T00:27:05.355259+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09862","created_at":"2026-05-18T00:27:05.355259+00:00"},{"alias_kind":"pith_short_12","alias_value":"QMKUTEYIIXN2","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"QMKUTEYIIXN2NZET","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"QMKUTEYI","created_at":"2026-05-18T12:31:39.905425+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/QMKUTEYIIXN2NZETYQUMG2MDII","json":"https://pith.science/pith/QMKUTEYIIXN2NZETYQUMG2MDII.json","graph_json":"https://pith.science/api/pith-number/QMKUTEYIIXN2NZETYQUMG2MDII/graph.json","events_json":"https://pith.science/api/pith-number/QMKUTEYIIXN2NZETYQUMG2MDII/events.json","paper":"https://pith.science/paper/QMKUTEYI"},"agent_actions":{"view_html":"https://pith.science/pith/QMKUTEYIIXN2NZETYQUMG2MDII","download_json":"https://pith.science/pith/QMKUTEYIIXN2NZETYQUMG2MDII.json","view_paper":"https://pith.science/paper/QMKUTEYI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.09862&json=true","fetch_graph":"https://pith.science/api/pith-number/QMKUTEYIIXN2NZETYQUMG2MDII/graph.json","fetch_events":"https://pith.science/api/pith-number/QMKUTEYIIXN2NZETYQUMG2MDII/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QMKUTEYIIXN2NZETYQUMG2MDII/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QMKUTEYIIXN2NZETYQUMG2MDII/action/storage_attestation","attest_author":"https://pith.science/pith/QMKUTEYIIXN2NZETYQUMG2MDII/action/author_attestation","sign_citation":"https://pith.science/pith/QMKUTEYIIXN2NZETYQUMG2MDII/action/citation_signature","submit_replication":"https://pith.science/pith/QMKUTEYIIXN2NZETYQUMG2MDII/action/replication_record"}},"created_at":"2026-05-18T00:27:05.355259+00:00","updated_at":"2026-05-18T00:27:05.355259+00:00"}