{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:5Z3MQV4MWYRYA2KP6QRYP4COSF","short_pith_number":"pith:5Z3MQV4M","schema_version":"1.0","canonical_sha256":"ee76c8578cb62380694ff42387f04e9153059d10fe9a98b1896eb263807fa756","source":{"kind":"arxiv","id":"1206.4622","version":1},"attestation_state":"computed","paper":{"title":"A Graphical Model Formulation of Collaborative Filtering Neighbourhood Methods with Fast Maximum Entropy Training","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aaron Defazio (ANU), Australian National University), Tiberio Caetano (NICTA","submitted_at":"2012-06-18T15:05:52Z","abstract_excerpt":"Item neighbourhood methods for collaborative filtering learn a weighted graph over the set of items, where each item is connected to those it is most similar to. The prediction of a user's rating on an item is then given by that rating of neighbouring items, weighted by their similarity. This paper presents a new neighbourhood approach which we call item fields, whereby an undirected graphical model is formed over the item graph. The resulting prediction rule is a simple generalization of the classical approaches, which takes into account non-local information in the graph, allowing its best r"},"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":"1206.4622","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-18T15:05:52Z","cross_cats_sorted":["cs.IR","stat.ML"],"title_canon_sha256":"e4b5f6f2893c0da00e2efe2d62d35319ea2a7f2f25c9c9683a9169444c40bd45","abstract_canon_sha256":"3cc941484539ed0826cac5001cee112a4a7b0f4b472ddc80905db61e1023338d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:04.559599Z","signature_b64":"5Z9Wr62VyQYXKklw3CxhZJUHMBuh6Xm3gMOL5XH8cElX2b3tdbsdbIglPriQx4YYIwbl8liyYjIXSFQ4gfBKAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee76c8578cb62380694ff42387f04e9153059d10fe9a98b1896eb263807fa756","last_reissued_at":"2026-05-18T03:53:04.558832Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:04.558832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Graphical Model Formulation of Collaborative Filtering Neighbourhood Methods with Fast Maximum Entropy Training","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aaron Defazio (ANU), Australian National University), Tiberio Caetano (NICTA","submitted_at":"2012-06-18T15:05:52Z","abstract_excerpt":"Item neighbourhood methods for collaborative filtering learn a weighted graph over the set of items, where each item is connected to those it is most similar to. The prediction of a user's rating on an item is then given by that rating of neighbouring items, weighted by their similarity. This paper presents a new neighbourhood approach which we call item fields, whereby an undirected graphical model is formed over the item graph. The resulting prediction rule is a simple generalization of the classical approaches, which takes into account non-local information in the graph, allowing its best r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.4622","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":"1206.4622","created_at":"2026-05-18T03:53:04.558957+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.4622v1","created_at":"2026-05-18T03:53:04.558957+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.4622","created_at":"2026-05-18T03:53:04.558957+00:00"},{"alias_kind":"pith_short_12","alias_value":"5Z3MQV4MWYRY","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"5Z3MQV4MWYRYA2KP","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"5Z3MQV4M","created_at":"2026-05-18T12:26:56.085431+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/5Z3MQV4MWYRYA2KP6QRYP4COSF","json":"https://pith.science/pith/5Z3MQV4MWYRYA2KP6QRYP4COSF.json","graph_json":"https://pith.science/api/pith-number/5Z3MQV4MWYRYA2KP6QRYP4COSF/graph.json","events_json":"https://pith.science/api/pith-number/5Z3MQV4MWYRYA2KP6QRYP4COSF/events.json","paper":"https://pith.science/paper/5Z3MQV4M"},"agent_actions":{"view_html":"https://pith.science/pith/5Z3MQV4MWYRYA2KP6QRYP4COSF","download_json":"https://pith.science/pith/5Z3MQV4MWYRYA2KP6QRYP4COSF.json","view_paper":"https://pith.science/paper/5Z3MQV4M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.4622&json=true","fetch_graph":"https://pith.science/api/pith-number/5Z3MQV4MWYRYA2KP6QRYP4COSF/graph.json","fetch_events":"https://pith.science/api/pith-number/5Z3MQV4MWYRYA2KP6QRYP4COSF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5Z3MQV4MWYRYA2KP6QRYP4COSF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5Z3MQV4MWYRYA2KP6QRYP4COSF/action/storage_attestation","attest_author":"https://pith.science/pith/5Z3MQV4MWYRYA2KP6QRYP4COSF/action/author_attestation","sign_citation":"https://pith.science/pith/5Z3MQV4MWYRYA2KP6QRYP4COSF/action/citation_signature","submit_replication":"https://pith.science/pith/5Z3MQV4MWYRYA2KP6QRYP4COSF/action/replication_record"}},"created_at":"2026-05-18T03:53:04.558957+00:00","updated_at":"2026-05-18T03:53:04.558957+00:00"}