{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:LKQ3JMDWUPRVURBD3MZ2V6HO5N","short_pith_number":"pith:LKQ3JMDW","schema_version":"1.0","canonical_sha256":"5aa1b4b076a3e35a4423db33aaf8eeeb75185c2fa1ed3329a90ced2212a0d91e","source":{"kind":"arxiv","id":"1305.5330","version":1},"attestation_state":"computed","paper":{"title":"A toy model of information retrieval system based on quantum probability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Roman Zapatrin","submitted_at":"2013-05-23T06:49:20Z","abstract_excerpt":"Recent numerical results show that non-Bayesian knowledge revision may be helpful in search engine training and optimization. In order to demonstrate how basic assumption about about the physical nature (and hence the observed statistics) of retrieved documents can affect the performance of search engines we suggest an idealized toy model with minimal number of parameters."},"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":"1305.5330","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2013-05-23T06:49:20Z","cross_cats_sorted":[],"title_canon_sha256":"41a2201df072497837290d1dbf155237cd535fa2604a7c7e87314b8e2d181073","abstract_canon_sha256":"a613390810e7023ae65e9e8214bbb63b5e7b4a2c3898b9c8a77f4ecd39d25782"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:05.090160Z","signature_b64":"T7UH9LTQAb5FTw1hyQy7lJxng34yU8lnoHpkOvtGoV6E2F6DyWPc44mnLDRhkrkByVR5qoHBd252E9Vnn7zUAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5aa1b4b076a3e35a4423db33aaf8eeeb75185c2fa1ed3329a90ced2212a0d91e","last_reissued_at":"2026-05-18T03:25:05.089605Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:05.089605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A toy model of information retrieval system based on quantum probability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Roman Zapatrin","submitted_at":"2013-05-23T06:49:20Z","abstract_excerpt":"Recent numerical results show that non-Bayesian knowledge revision may be helpful in search engine training and optimization. In order to demonstrate how basic assumption about about the physical nature (and hence the observed statistics) of retrieved documents can affect the performance of search engines we suggest an idealized toy model with minimal number of parameters."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.5330","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":"1305.5330","created_at":"2026-05-18T03:25:05.089700+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.5330v1","created_at":"2026-05-18T03:25:05.089700+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.5330","created_at":"2026-05-18T03:25:05.089700+00:00"},{"alias_kind":"pith_short_12","alias_value":"LKQ3JMDWUPRV","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"LKQ3JMDWUPRVURBD","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"LKQ3JMDW","created_at":"2026-05-18T12:27:51.066281+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/LKQ3JMDWUPRVURBD3MZ2V6HO5N","json":"https://pith.science/pith/LKQ3JMDWUPRVURBD3MZ2V6HO5N.json","graph_json":"https://pith.science/api/pith-number/LKQ3JMDWUPRVURBD3MZ2V6HO5N/graph.json","events_json":"https://pith.science/api/pith-number/LKQ3JMDWUPRVURBD3MZ2V6HO5N/events.json","paper":"https://pith.science/paper/LKQ3JMDW"},"agent_actions":{"view_html":"https://pith.science/pith/LKQ3JMDWUPRVURBD3MZ2V6HO5N","download_json":"https://pith.science/pith/LKQ3JMDWUPRVURBD3MZ2V6HO5N.json","view_paper":"https://pith.science/paper/LKQ3JMDW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.5330&json=true","fetch_graph":"https://pith.science/api/pith-number/LKQ3JMDWUPRVURBD3MZ2V6HO5N/graph.json","fetch_events":"https://pith.science/api/pith-number/LKQ3JMDWUPRVURBD3MZ2V6HO5N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LKQ3JMDWUPRVURBD3MZ2V6HO5N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LKQ3JMDWUPRVURBD3MZ2V6HO5N/action/storage_attestation","attest_author":"https://pith.science/pith/LKQ3JMDWUPRVURBD3MZ2V6HO5N/action/author_attestation","sign_citation":"https://pith.science/pith/LKQ3JMDWUPRVURBD3MZ2V6HO5N/action/citation_signature","submit_replication":"https://pith.science/pith/LKQ3JMDWUPRVURBD3MZ2V6HO5N/action/replication_record"}},"created_at":"2026-05-18T03:25:05.089700+00:00","updated_at":"2026-05-18T03:25:05.089700+00:00"}