{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:SITH6ZLEEXCQDHIBPCENRFA5CM","short_pith_number":"pith:SITH6ZLE","schema_version":"1.0","canonical_sha256":"92267f656425c5019d017888d8941d1314cfcef2abb53a0cac3c59f54f4ee9fe","source":{"kind":"arxiv","id":"1107.1880","version":3},"attestation_state":"computed","paper":{"title":"Matrix powers algorithms for trust evaluation in PKI architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Hicham Hossayni (DCIS), Jean-Guillaume Dumas (LJK)","submitted_at":"2011-07-10T19:15:32Z","abstract_excerpt":"This paper deals with the evaluation of trust in public-key infrastructures. Different trust models have been proposed to interconnect the various PKI components in order to propagate the trust between them. In this paper we provide a new polynomial algorithm using linear algebra to assess trust relationships in a network using different trust evaluation schemes. The advantages are twofold: first the use of matrix computations instead of graph algorithms provides an optimized computational solution; second, our algorithm can be used for generic graphs, even in the presence of cycles. Our algor"},"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":"1107.1880","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2011-07-10T19:15:32Z","cross_cats_sorted":[],"title_canon_sha256":"dcad53fff68ab3414a5d653b22fcd439b4aec3b82c3a681e3ce4e7c113e3c024","abstract_canon_sha256":"7689627ec26fb581bac32f8c3af4156c5c2afd77f5043aecf7148eb39919d118"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:48.570283Z","signature_b64":"Ob53MpcRkv7DphZkmzBlwbdLnNMojZKjPwCILLY+AH6TSwalnD+SjAB/5Rb+0nDiS4rEOWKBYAAuRA2a8SxkDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92267f656425c5019d017888d8941d1314cfcef2abb53a0cac3c59f54f4ee9fe","last_reissued_at":"2026-05-18T03:34:48.569795Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:48.569795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matrix powers algorithms for trust evaluation in PKI architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Hicham Hossayni (DCIS), Jean-Guillaume Dumas (LJK)","submitted_at":"2011-07-10T19:15:32Z","abstract_excerpt":"This paper deals with the evaluation of trust in public-key infrastructures. Different trust models have been proposed to interconnect the various PKI components in order to propagate the trust between them. In this paper we provide a new polynomial algorithm using linear algebra to assess trust relationships in a network using different trust evaluation schemes. The advantages are twofold: first the use of matrix computations instead of graph algorithms provides an optimized computational solution; second, our algorithm can be used for generic graphs, even in the presence of cycles. Our algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1880","kind":"arxiv","version":3},"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":"1107.1880","created_at":"2026-05-18T03:34:48.569871+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.1880v3","created_at":"2026-05-18T03:34:48.569871+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1880","created_at":"2026-05-18T03:34:48.569871+00:00"},{"alias_kind":"pith_short_12","alias_value":"SITH6ZLEEXCQ","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"SITH6ZLEEXCQDHIB","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"SITH6ZLE","created_at":"2026-05-18T12:26:41.206345+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/SITH6ZLEEXCQDHIBPCENRFA5CM","json":"https://pith.science/pith/SITH6ZLEEXCQDHIBPCENRFA5CM.json","graph_json":"https://pith.science/api/pith-number/SITH6ZLEEXCQDHIBPCENRFA5CM/graph.json","events_json":"https://pith.science/api/pith-number/SITH6ZLEEXCQDHIBPCENRFA5CM/events.json","paper":"https://pith.science/paper/SITH6ZLE"},"agent_actions":{"view_html":"https://pith.science/pith/SITH6ZLEEXCQDHIBPCENRFA5CM","download_json":"https://pith.science/pith/SITH6ZLEEXCQDHIBPCENRFA5CM.json","view_paper":"https://pith.science/paper/SITH6ZLE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.1880&json=true","fetch_graph":"https://pith.science/api/pith-number/SITH6ZLEEXCQDHIBPCENRFA5CM/graph.json","fetch_events":"https://pith.science/api/pith-number/SITH6ZLEEXCQDHIBPCENRFA5CM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SITH6ZLEEXCQDHIBPCENRFA5CM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SITH6ZLEEXCQDHIBPCENRFA5CM/action/storage_attestation","attest_author":"https://pith.science/pith/SITH6ZLEEXCQDHIBPCENRFA5CM/action/author_attestation","sign_citation":"https://pith.science/pith/SITH6ZLEEXCQDHIBPCENRFA5CM/action/citation_signature","submit_replication":"https://pith.science/pith/SITH6ZLEEXCQDHIBPCENRFA5CM/action/replication_record"}},"created_at":"2026-05-18T03:34:48.569871+00:00","updated_at":"2026-05-18T03:34:48.569871+00:00"}