{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5QLCPEMCYQB4J6LFDE7YOM4QMS","short_pith_number":"pith:5QLCPEMC","canonical_record":{"source":{"id":"1610.00735","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-10-03T20:36:56Z","cross_cats_sorted":[],"title_canon_sha256":"9758287b038d118a28b50ea821676de280ae763f4cf32e7826ccabe0e9d2887d","abstract_canon_sha256":"1ee607f3b0e15c4d6c3be92d2da592ab7323fa7acfd0bea7d25325ffaf18c8ad"},"schema_version":"1.0"},"canonical_sha256":"ec16279182c403c4f965193f873390649f346e49c65a2c6e83d12129248ffde0","source":{"kind":"arxiv","id":"1610.00735","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.00735","created_at":"2026-05-18T01:03:13Z"},{"alias_kind":"arxiv_version","alias_value":"1610.00735v1","created_at":"2026-05-18T01:03:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00735","created_at":"2026-05-18T01:03:13Z"},{"alias_kind":"pith_short_12","alias_value":"5QLCPEMCYQB4","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5QLCPEMCYQB4J6LF","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5QLCPEMC","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5QLCPEMCYQB4J6LFDE7YOM4QMS","target":"record","payload":{"canonical_record":{"source":{"id":"1610.00735","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-10-03T20:36:56Z","cross_cats_sorted":[],"title_canon_sha256":"9758287b038d118a28b50ea821676de280ae763f4cf32e7826ccabe0e9d2887d","abstract_canon_sha256":"1ee607f3b0e15c4d6c3be92d2da592ab7323fa7acfd0bea7d25325ffaf18c8ad"},"schema_version":"1.0"},"canonical_sha256":"ec16279182c403c4f965193f873390649f346e49c65a2c6e83d12129248ffde0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:13.296776Z","signature_b64":"9KWApXkFmJ0ZepFg9x1PIwFCdn/owY5saFIC/o27PH1vvrrx6fYyo3j/1JXhvMIo70itNesPTlGKeS75NwiKAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec16279182c403c4f965193f873390649f346e49c65a2c6e83d12129248ffde0","last_reissued_at":"2026-05-18T01:03:13.296306Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:13.296306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.00735","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:03:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"33CNgMGMZwPFrHk2JWcGCCZDsDAlW/VKlaI4zsw2qjW3tPWeLgE3uY8uGgMFQplgjI+/frRLW/64FnrfBLiNBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:06:56.479690Z"},"content_sha256":"a4662f7ddd4dd983b0f6f1b6d1b65d2f03e06aa0cdc3d0dfb80c59e554cbf60a","schema_version":"1.0","event_id":"sha256:a4662f7ddd4dd983b0f6f1b6d1b65d2f03e06aa0cdc3d0dfb80c59e554cbf60a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5QLCPEMCYQB4J6LFDE7YOM4QMS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"MatLM: a Matrix Formulation for Probabilistic Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Hongfang Liu, Yanshan Wang","submitted_at":"2016-10-03T20:36:56Z","abstract_excerpt":"Probabilistic language models are widely used in Information Retrieval (IR) to rank documents by the probability that they generate the query. However, the implementation of the probabilistic representations with programming languages that favor matrix calculations is challenging. In this paper, we utilize matrix representations to reformulate the probabilistic language models. The matrix representation is a superstructure for the probabilistic language models to organize the calculated probabilities and a potential formalism for standardization of language models and for further mathematical "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00735","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:03:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5vg09bEYio+dm62qCi0rD84uoIFyi/EIiP8fU9JyeqeNByUYXsuLxc686zEDDOjwRNA2gtd46qyvxFriDWmvAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:06:56.480036Z"},"content_sha256":"1a112e3c098d962d5eb3cff7e6222b08d164e80d71e683e77d735a568957119d","schema_version":"1.0","event_id":"sha256:1a112e3c098d962d5eb3cff7e6222b08d164e80d71e683e77d735a568957119d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5QLCPEMCYQB4J6LFDE7YOM4QMS/bundle.json","state_url":"https://pith.science/pith/5QLCPEMCYQB4J6LFDE7YOM4QMS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5QLCPEMCYQB4J6LFDE7YOM4QMS/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-05-28T20:06:56Z","links":{"resolver":"https://pith.science/pith/5QLCPEMCYQB4J6LFDE7YOM4QMS","bundle":"https://pith.science/pith/5QLCPEMCYQB4J6LFDE7YOM4QMS/bundle.json","state":"https://pith.science/pith/5QLCPEMCYQB4J6LFDE7YOM4QMS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5QLCPEMCYQB4J6LFDE7YOM4QMS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5QLCPEMCYQB4J6LFDE7YOM4QMS","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":"1ee607f3b0e15c4d6c3be92d2da592ab7323fa7acfd0bea7d25325ffaf18c8ad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-10-03T20:36:56Z","title_canon_sha256":"9758287b038d118a28b50ea821676de280ae763f4cf32e7826ccabe0e9d2887d"},"schema_version":"1.0","source":{"id":"1610.00735","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.00735","created_at":"2026-05-18T01:03:13Z"},{"alias_kind":"arxiv_version","alias_value":"1610.00735v1","created_at":"2026-05-18T01:03:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00735","created_at":"2026-05-18T01:03:13Z"},{"alias_kind":"pith_short_12","alias_value":"5QLCPEMCYQB4","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5QLCPEMCYQB4J6LF","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5QLCPEMC","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:1a112e3c098d962d5eb3cff7e6222b08d164e80d71e683e77d735a568957119d","target":"graph","created_at":"2026-05-18T01:03:13Z","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":"Probabilistic language models are widely used in Information Retrieval (IR) to rank documents by the probability that they generate the query. However, the implementation of the probabilistic representations with programming languages that favor matrix calculations is challenging. In this paper, we utilize matrix representations to reformulate the probabilistic language models. The matrix representation is a superstructure for the probabilistic language models to organize the calculated probabilities and a potential formalism for standardization of language models and for further mathematical ","authors_text":"Hongfang Liu, Yanshan Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-10-03T20:36:56Z","title":"MatLM: a Matrix Formulation for Probabilistic Language Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00735","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:a4662f7ddd4dd983b0f6f1b6d1b65d2f03e06aa0cdc3d0dfb80c59e554cbf60a","target":"record","created_at":"2026-05-18T01:03:13Z","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":"1ee607f3b0e15c4d6c3be92d2da592ab7323fa7acfd0bea7d25325ffaf18c8ad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-10-03T20:36:56Z","title_canon_sha256":"9758287b038d118a28b50ea821676de280ae763f4cf32e7826ccabe0e9d2887d"},"schema_version":"1.0","source":{"id":"1610.00735","kind":"arxiv","version":1}},"canonical_sha256":"ec16279182c403c4f965193f873390649f346e49c65a2c6e83d12129248ffde0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec16279182c403c4f965193f873390649f346e49c65a2c6e83d12129248ffde0","first_computed_at":"2026-05-18T01:03:13.296306Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:13.296306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9KWApXkFmJ0ZepFg9x1PIwFCdn/owY5saFIC/o27PH1vvrrx6fYyo3j/1JXhvMIo70itNesPTlGKeS75NwiKAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:13.296776Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.00735","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4662f7ddd4dd983b0f6f1b6d1b65d2f03e06aa0cdc3d0dfb80c59e554cbf60a","sha256:1a112e3c098d962d5eb3cff7e6222b08d164e80d71e683e77d735a568957119d"],"state_sha256":"5c2874586d96cec7b46003e2ff97037c6e6640590749c89ca32d9af23cb91819"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"spYvWV3lJMvOOVCKSh0BiDuCrMacQzHjPE0+MmofjDStFl5fm9Epns9Xw2UNR1mPKrILkUb7myo4t1X+Cc9jDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:06:56.481980Z","bundle_sha256":"0994aac0fed76d7ef900f3953b81dd88e0749512fd9e8fb42ef8dc011e94ffb2"}}