{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:RTGIHE3HEAEY7TNYYXAAVUXMKD","short_pith_number":"pith:RTGIHE3H","schema_version":"1.0","canonical_sha256":"8ccc83936720098fcdb8c5c00ad2ec50cea3185f1aa69a8fed135c5812604914","source":{"kind":"arxiv","id":"1303.1493","version":2},"attestation_state":"computed","paper":{"title":"Inference Algorithms for Similarity Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Dan Geiger, David Heckerman","submitted_at":"2013-03-06T14:22:08Z","abstract_excerpt":"We examine two types of similarity networks each based on a distinct notion of relevance. For both types of similarity networks we present an efficient inference algorithm that works under the assumption that every event has a nonzero probability of occurrence. Another inference algorithm is developed for type 1 similarity networks that works under no restriction, albeit less efficiently."},"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":"1303.1493","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-06T14:22:08Z","cross_cats_sorted":[],"title_canon_sha256":"ab1488069d03eae574fbb31bdc68bfb090338bda7f42e91cbba5e425e42f171a","abstract_canon_sha256":"376491fe86853a83c121a3b76c2d9d913e995e8478d82e105280ac392bacc005"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:07:32.306463Z","signature_b64":"LBnjFMrT4CZv4krEJfbE3dpq80peqg0yG1WOhi6tqLao19RnRXw1gclNMGQ+vZYCfHjHKzSdZ1elg7YUqtkFCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ccc83936720098fcdb8c5c00ad2ec50cea3185f1aa69a8fed135c5812604914","last_reissued_at":"2026-05-18T02:07:32.305907Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:07:32.305907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inference Algorithms for Similarity Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Dan Geiger, David Heckerman","submitted_at":"2013-03-06T14:22:08Z","abstract_excerpt":"We examine two types of similarity networks each based on a distinct notion of relevance. For both types of similarity networks we present an efficient inference algorithm that works under the assumption that every event has a nonzero probability of occurrence. Another inference algorithm is developed for type 1 similarity networks that works under no restriction, albeit less efficiently."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1493","kind":"arxiv","version":2},"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":"1303.1493","created_at":"2026-05-18T02:07:32.305989+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.1493v2","created_at":"2026-05-18T02:07:32.305989+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1493","created_at":"2026-05-18T02:07:32.305989+00:00"},{"alias_kind":"pith_short_12","alias_value":"RTGIHE3HEAEY","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"RTGIHE3HEAEY7TNY","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"RTGIHE3H","created_at":"2026-05-18T12:27:59.945178+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/RTGIHE3HEAEY7TNYYXAAVUXMKD","json":"https://pith.science/pith/RTGIHE3HEAEY7TNYYXAAVUXMKD.json","graph_json":"https://pith.science/api/pith-number/RTGIHE3HEAEY7TNYYXAAVUXMKD/graph.json","events_json":"https://pith.science/api/pith-number/RTGIHE3HEAEY7TNYYXAAVUXMKD/events.json","paper":"https://pith.science/paper/RTGIHE3H"},"agent_actions":{"view_html":"https://pith.science/pith/RTGIHE3HEAEY7TNYYXAAVUXMKD","download_json":"https://pith.science/pith/RTGIHE3HEAEY7TNYYXAAVUXMKD.json","view_paper":"https://pith.science/paper/RTGIHE3H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.1493&json=true","fetch_graph":"https://pith.science/api/pith-number/RTGIHE3HEAEY7TNYYXAAVUXMKD/graph.json","fetch_events":"https://pith.science/api/pith-number/RTGIHE3HEAEY7TNYYXAAVUXMKD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RTGIHE3HEAEY7TNYYXAAVUXMKD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RTGIHE3HEAEY7TNYYXAAVUXMKD/action/storage_attestation","attest_author":"https://pith.science/pith/RTGIHE3HEAEY7TNYYXAAVUXMKD/action/author_attestation","sign_citation":"https://pith.science/pith/RTGIHE3HEAEY7TNYYXAAVUXMKD/action/citation_signature","submit_replication":"https://pith.science/pith/RTGIHE3HEAEY7TNYYXAAVUXMKD/action/replication_record"}},"created_at":"2026-05-18T02:07:32.305989+00:00","updated_at":"2026-05-18T02:07:32.305989+00:00"}