{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TTHK7ZQKILGUIIXMDAUTMUUC7I","short_pith_number":"pith:TTHK7ZQK","canonical_record":{"source":{"id":"1604.02071","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-04-07T16:40:53Z","cross_cats_sorted":[],"title_canon_sha256":"a49e4c27e2c4eb7b29a4fa655ca82f141fa89598010fb1fa9b468f144d3fa917","abstract_canon_sha256":"7ad0fef8f75ed03e9c462de8577aa59c181c04d4a8e1c417ab8f9e74bc94c972"},"schema_version":"1.0"},"canonical_sha256":"9cceafe60a42cd4422ec1829365282fa33dc5c7bfc652d4e2a30c95b078c69c8","source":{"kind":"arxiv","id":"1604.02071","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.02071","created_at":"2026-05-18T00:44:18Z"},{"alias_kind":"arxiv_version","alias_value":"1604.02071v2","created_at":"2026-05-18T00:44:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02071","created_at":"2026-05-18T00:44:18Z"},{"alias_kind":"pith_short_12","alias_value":"TTHK7ZQKILGU","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TTHK7ZQKILGUIIXM","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TTHK7ZQK","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TTHK7ZQKILGUIIXMDAUTMUUC7I","target":"record","payload":{"canonical_record":{"source":{"id":"1604.02071","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-04-07T16:40:53Z","cross_cats_sorted":[],"title_canon_sha256":"a49e4c27e2c4eb7b29a4fa655ca82f141fa89598010fb1fa9b468f144d3fa917","abstract_canon_sha256":"7ad0fef8f75ed03e9c462de8577aa59c181c04d4a8e1c417ab8f9e74bc94c972"},"schema_version":"1.0"},"canonical_sha256":"9cceafe60a42cd4422ec1829365282fa33dc5c7bfc652d4e2a30c95b078c69c8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:18.838193Z","signature_b64":"O7mPWrnYI7xwM2sox4dUP9D+Tmey0BnhoyQjQIuNHeFlN5CAHsehJhyHWdr8M/Cb/p82ylvI3SDvbDRdnfoFBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9cceafe60a42cd4422ec1829365282fa33dc5c7bfc652d4e2a30c95b078c69c8","last_reissued_at":"2026-05-18T00:44:18.837642Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:18.837642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.02071","source_version":2,"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-18T00:44:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6siJU6/twAihMdmC2GO85udpkgr6NoS8DwVrFpSPYa0TNUxeisIyeuBlBp6kI1e8xk1z2lQhoVRVpzVM4qDGCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:57:09.322188Z"},"content_sha256":"b24c46add13bd233f62cef568178099ddd6de59014bbb8effa6c93294eebb00e","schema_version":"1.0","event_id":"sha256:b24c46add13bd233f62cef568178099ddd6de59014bbb8effa6c93294eebb00e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TTHK7ZQKILGUIIXMDAUTMUUC7I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable and interpretable product recommendations via overlapping co-clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Celestine D\\\"unner, Michail Vlachos, Reinhard Heckel, Thomas Parnell","submitted_at":"2016-04-07T16:40:53Z","abstract_excerpt":"We consider the problem of generating interpretable recommendations by identifying overlapping co-clusters of clients and products, based only on positive or implicit feedback. Our approach is applicable on very large datasets because it exhibits almost linear complexity in the input examples and the number of co-clusters. We show, both on real industrial data and on publicly available datasets, that the recommendation accuracy of our algorithm is competitive to that of state-of-art matrix factorization techniques. In addition, our technique has the advantage of offering recommendations that a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02071","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"},"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-18T00:44:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NX48CRutfixhWM68Q/l7e8+yw2m9j1EMRl0iwxpB78Bnv1FIfiLic2qYyxHFqhXnGwWbzHLbT8X5+LBd6ZNJAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:57:09.322891Z"},"content_sha256":"89fad30beb459e88a71633a093c7088d1d461959a4175b710b088b2525d340c9","schema_version":"1.0","event_id":"sha256:89fad30beb459e88a71633a093c7088d1d461959a4175b710b088b2525d340c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TTHK7ZQKILGUIIXMDAUTMUUC7I/bundle.json","state_url":"https://pith.science/pith/TTHK7ZQKILGUIIXMDAUTMUUC7I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TTHK7ZQKILGUIIXMDAUTMUUC7I/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-25T20:57:09Z","links":{"resolver":"https://pith.science/pith/TTHK7ZQKILGUIIXMDAUTMUUC7I","bundle":"https://pith.science/pith/TTHK7ZQKILGUIIXMDAUTMUUC7I/bundle.json","state":"https://pith.science/pith/TTHK7ZQKILGUIIXMDAUTMUUC7I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TTHK7ZQKILGUIIXMDAUTMUUC7I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TTHK7ZQKILGUIIXMDAUTMUUC7I","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":"7ad0fef8f75ed03e9c462de8577aa59c181c04d4a8e1c417ab8f9e74bc94c972","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-04-07T16:40:53Z","title_canon_sha256":"a49e4c27e2c4eb7b29a4fa655ca82f141fa89598010fb1fa9b468f144d3fa917"},"schema_version":"1.0","source":{"id":"1604.02071","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.02071","created_at":"2026-05-18T00:44:18Z"},{"alias_kind":"arxiv_version","alias_value":"1604.02071v2","created_at":"2026-05-18T00:44:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02071","created_at":"2026-05-18T00:44:18Z"},{"alias_kind":"pith_short_12","alias_value":"TTHK7ZQKILGU","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TTHK7ZQKILGUIIXM","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TTHK7ZQK","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:89fad30beb459e88a71633a093c7088d1d461959a4175b710b088b2525d340c9","target":"graph","created_at":"2026-05-18T00:44:18Z","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":"We consider the problem of generating interpretable recommendations by identifying overlapping co-clusters of clients and products, based only on positive or implicit feedback. Our approach is applicable on very large datasets because it exhibits almost linear complexity in the input examples and the number of co-clusters. We show, both on real industrial data and on publicly available datasets, that the recommendation accuracy of our algorithm is competitive to that of state-of-art matrix factorization techniques. In addition, our technique has the advantage of offering recommendations that a","authors_text":"Celestine D\\\"unner, Michail Vlachos, Reinhard Heckel, Thomas Parnell","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-04-07T16:40:53Z","title":"Scalable and interpretable product recommendations via overlapping co-clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02071","kind":"arxiv","version":2},"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:b24c46add13bd233f62cef568178099ddd6de59014bbb8effa6c93294eebb00e","target":"record","created_at":"2026-05-18T00:44:18Z","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":"7ad0fef8f75ed03e9c462de8577aa59c181c04d4a8e1c417ab8f9e74bc94c972","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-04-07T16:40:53Z","title_canon_sha256":"a49e4c27e2c4eb7b29a4fa655ca82f141fa89598010fb1fa9b468f144d3fa917"},"schema_version":"1.0","source":{"id":"1604.02071","kind":"arxiv","version":2}},"canonical_sha256":"9cceafe60a42cd4422ec1829365282fa33dc5c7bfc652d4e2a30c95b078c69c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9cceafe60a42cd4422ec1829365282fa33dc5c7bfc652d4e2a30c95b078c69c8","first_computed_at":"2026-05-18T00:44:18.837642Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:18.837642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O7mPWrnYI7xwM2sox4dUP9D+Tmey0BnhoyQjQIuNHeFlN5CAHsehJhyHWdr8M/Cb/p82ylvI3SDvbDRdnfoFBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:18.838193Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.02071","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b24c46add13bd233f62cef568178099ddd6de59014bbb8effa6c93294eebb00e","sha256:89fad30beb459e88a71633a093c7088d1d461959a4175b710b088b2525d340c9"],"state_sha256":"7a402af9ea875d7b702a0b6c32e0b1702f9aad9181e0231596e8c81cc1b9ba10"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"onGfX+ZZX2rabKpUPefjwrulSLoh+860K2RwwbMuoawKk0SOxEQeXmbvlYUkjVE/304Q0uwTKLJOlspl+LhKAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:57:09.326679Z","bundle_sha256":"95ddb307dd2821fd8c0bcb5fc17e9d17297a34b9175b0364a758898ce0edbd98"}}