{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:U4YRPSXOBBPXRO6AYHZIDUIUW2","short_pith_number":"pith:U4YRPSXO","schema_version":"1.0","canonical_sha256":"a73117caee085f78bbc0c1f281d114b6b21951ef9e872b81bc4b1343ce018fa6","source":{"kind":"arxiv","id":"1409.2824","version":2},"attestation_state":"computed","paper":{"title":"Scalable Bayesian Modelling of Paired Symbols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Noam Koenigstein, Ole Winther, Ulrich Paquet","submitted_at":"2014-09-09T17:42:55Z","abstract_excerpt":"We present a novel, scalable and Bayesian approach to modelling the occurrence of pairs of symbols (i,j) drawn from a large vocabulary. Observed pairs are assumed to be generated by a simple popularity based selection process followed by censoring using a preference function. By basing inference on the well-founded principle of variational bounding, and using new site-independent bounds, we show how a scalable inference procedure can be obtained for large data sets. State of the art results are presented on real-world movie viewing data."},"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":"1409.2824","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-09-09T17:42:55Z","cross_cats_sorted":[],"title_canon_sha256":"de8b9110febd60458597ef96d333dcba0e64fe7bc5356a4ad476946ee30278b6","abstract_canon_sha256":"b9913da95dcccfc33335cf79c60d756b3b406238c6ec25dfb3a4cfce78f8c848"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:08.827420Z","signature_b64":"wf/Qqc6cFMKCHNuGwuJ9AijEhwH+rg8eZco4O2uMqF+X2oxzUQNEBw0kVo2JVWjcpMmDvDT9hO5akcZz/GMbCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a73117caee085f78bbc0c1f281d114b6b21951ef9e872b81bc4b1343ce018fa6","last_reissued_at":"2026-05-18T02:43:08.826860Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:08.826860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Bayesian Modelling of Paired Symbols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Noam Koenigstein, Ole Winther, Ulrich Paquet","submitted_at":"2014-09-09T17:42:55Z","abstract_excerpt":"We present a novel, scalable and Bayesian approach to modelling the occurrence of pairs of symbols (i,j) drawn from a large vocabulary. Observed pairs are assumed to be generated by a simple popularity based selection process followed by censoring using a preference function. By basing inference on the well-founded principle of variational bounding, and using new site-independent bounds, we show how a scalable inference procedure can be obtained for large data sets. State of the art results are presented on real-world movie viewing data."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.2824","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":"1409.2824","created_at":"2026-05-18T02:43:08.826944+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.2824v2","created_at":"2026-05-18T02:43:08.826944+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.2824","created_at":"2026-05-18T02:43:08.826944+00:00"},{"alias_kind":"pith_short_12","alias_value":"U4YRPSXOBBPX","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"U4YRPSXOBBPXRO6A","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"U4YRPSXO","created_at":"2026-05-18T12:28:52.271510+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/U4YRPSXOBBPXRO6AYHZIDUIUW2","json":"https://pith.science/pith/U4YRPSXOBBPXRO6AYHZIDUIUW2.json","graph_json":"https://pith.science/api/pith-number/U4YRPSXOBBPXRO6AYHZIDUIUW2/graph.json","events_json":"https://pith.science/api/pith-number/U4YRPSXOBBPXRO6AYHZIDUIUW2/events.json","paper":"https://pith.science/paper/U4YRPSXO"},"agent_actions":{"view_html":"https://pith.science/pith/U4YRPSXOBBPXRO6AYHZIDUIUW2","download_json":"https://pith.science/pith/U4YRPSXOBBPXRO6AYHZIDUIUW2.json","view_paper":"https://pith.science/paper/U4YRPSXO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.2824&json=true","fetch_graph":"https://pith.science/api/pith-number/U4YRPSXOBBPXRO6AYHZIDUIUW2/graph.json","fetch_events":"https://pith.science/api/pith-number/U4YRPSXOBBPXRO6AYHZIDUIUW2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U4YRPSXOBBPXRO6AYHZIDUIUW2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U4YRPSXOBBPXRO6AYHZIDUIUW2/action/storage_attestation","attest_author":"https://pith.science/pith/U4YRPSXOBBPXRO6AYHZIDUIUW2/action/author_attestation","sign_citation":"https://pith.science/pith/U4YRPSXOBBPXRO6AYHZIDUIUW2/action/citation_signature","submit_replication":"https://pith.science/pith/U4YRPSXOBBPXRO6AYHZIDUIUW2/action/replication_record"}},"created_at":"2026-05-18T02:43:08.826944+00:00","updated_at":"2026-05-18T02:43:08.826944+00:00"}