{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7LSEEJ53BXJISF6EHNHUWYB3CB","short_pith_number":"pith:7LSEEJ53","canonical_record":{"source":{"id":"1507.00043","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2015-06-30T21:34:53Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"d24cdc04adca6d2c183d9d9621ed4753715c387a6f0f759341a828faa6f5dbad","abstract_canon_sha256":"ce6bc46058dbca23004a4372697b8df78ec014aa77f9d8efa44b60bcdbadd56e"},"schema_version":"1.0"},"canonical_sha256":"fae44227bb0dd28917c43b4f4b603b104dd6d79fae68f57994b96321271184c8","source":{"kind":"arxiv","id":"1507.00043","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.00043","created_at":"2026-05-18T01:24:39Z"},{"alias_kind":"arxiv_version","alias_value":"1507.00043v2","created_at":"2026-05-18T01:24:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00043","created_at":"2026-05-18T01:24:39Z"},{"alias_kind":"pith_short_12","alias_value":"7LSEEJ53BXJI","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7LSEEJ53BXJISF6E","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7LSEEJ53","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7LSEEJ53BXJISF6EHNHUWYB3CB","target":"record","payload":{"canonical_record":{"source":{"id":"1507.00043","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2015-06-30T21:34:53Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"d24cdc04adca6d2c183d9d9621ed4753715c387a6f0f759341a828faa6f5dbad","abstract_canon_sha256":"ce6bc46058dbca23004a4372697b8df78ec014aa77f9d8efa44b60bcdbadd56e"},"schema_version":"1.0"},"canonical_sha256":"fae44227bb0dd28917c43b4f4b603b104dd6d79fae68f57994b96321271184c8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:39.369138Z","signature_b64":"3VJI62heKZn5gsLnRhdrPA+XKKHbCegS20btGDutimhYznZ3FFdELLcelP81NStuawSQunXo9GiHg3mUscSCCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fae44227bb0dd28917c43b4f4b603b104dd6d79fae68f57994b96321271184c8","last_reissued_at":"2026-05-18T01:24:39.368784Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:39.368784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.00043","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-18T01:24:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0dQuH2IzZWFZNOCOnznViCQXmS+tQ++K4RDx0o1KZsTq7ljF4Zh+VjQ9PXDfC4JnHdwlqXhSpDmliVC6NBTICQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:04:57.381513Z"},"content_sha256":"dc704c5ab1096a25cc18511203f88c0a0711be580b2fea796d6b9e55b1191471","schema_version":"1.0","event_id":"sha256:dc704c5ab1096a25cc18511203f88c0a0711be580b2fea796d6b9e55b1191471"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7LSEEJ53BXJISF6EHNHUWYB3CB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Top-N recommendations in the presence of sparsity: An NCD-based approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.IR","authors_text":"Athanasios N. Nikolakopoulos, John D. Garofalakis","submitted_at":"2015-06-30T21:34:53Z","abstract_excerpt":"Making recommendations in the presence of sparsity is known to present one of the most challenging problems faced by collaborative filtering methods. In this work we tackle this problem by exploiting the innately hierarchical structure of the item space following an approach inspired by the theory of Decomposability. We view the itemspace as a Nearly Decomposable system and we define blocks of closely related elements and corresponding indirect proximity components. We study the theoretical properties of the decomposition and we derive sufficient conditions that guarantee full item space cover"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00043","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-18T01:24:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HNKypADE416KEYef8oaj9+24iiUf9m/RI17IgfyubZvT1XvyBLSC7r1eI8pBZECCCKhKB4aEYs/PwAoHbhKuDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:04:57.382168Z"},"content_sha256":"58c71ff40ba0896a40f3e18bbd6aa8e3690bc572f4a3b6f73190567c6dcb3376","schema_version":"1.0","event_id":"sha256:58c71ff40ba0896a40f3e18bbd6aa8e3690bc572f4a3b6f73190567c6dcb3376"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7LSEEJ53BXJISF6EHNHUWYB3CB/bundle.json","state_url":"https://pith.science/pith/7LSEEJ53BXJISF6EHNHUWYB3CB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7LSEEJ53BXJISF6EHNHUWYB3CB/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-06-02T05:04:57Z","links":{"resolver":"https://pith.science/pith/7LSEEJ53BXJISF6EHNHUWYB3CB","bundle":"https://pith.science/pith/7LSEEJ53BXJISF6EHNHUWYB3CB/bundle.json","state":"https://pith.science/pith/7LSEEJ53BXJISF6EHNHUWYB3CB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7LSEEJ53BXJISF6EHNHUWYB3CB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7LSEEJ53BXJISF6EHNHUWYB3CB","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":"ce6bc46058dbca23004a4372697b8df78ec014aa77f9d8efa44b60bcdbadd56e","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2015-06-30T21:34:53Z","title_canon_sha256":"d24cdc04adca6d2c183d9d9621ed4753715c387a6f0f759341a828faa6f5dbad"},"schema_version":"1.0","source":{"id":"1507.00043","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.00043","created_at":"2026-05-18T01:24:39Z"},{"alias_kind":"arxiv_version","alias_value":"1507.00043v2","created_at":"2026-05-18T01:24:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00043","created_at":"2026-05-18T01:24:39Z"},{"alias_kind":"pith_short_12","alias_value":"7LSEEJ53BXJI","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7LSEEJ53BXJISF6E","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7LSEEJ53","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:58c71ff40ba0896a40f3e18bbd6aa8e3690bc572f4a3b6f73190567c6dcb3376","target":"graph","created_at":"2026-05-18T01:24:39Z","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":"Making recommendations in the presence of sparsity is known to present one of the most challenging problems faced by collaborative filtering methods. In this work we tackle this problem by exploiting the innately hierarchical structure of the item space following an approach inspired by the theory of Decomposability. We view the itemspace as a Nearly Decomposable system and we define blocks of closely related elements and corresponding indirect proximity components. We study the theoretical properties of the decomposition and we derive sufficient conditions that guarantee full item space cover","authors_text":"Athanasios N. Nikolakopoulos, John D. Garofalakis","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2015-06-30T21:34:53Z","title":"Top-N recommendations in the presence of sparsity: An NCD-based approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00043","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:dc704c5ab1096a25cc18511203f88c0a0711be580b2fea796d6b9e55b1191471","target":"record","created_at":"2026-05-18T01:24:39Z","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":"ce6bc46058dbca23004a4372697b8df78ec014aa77f9d8efa44b60bcdbadd56e","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2015-06-30T21:34:53Z","title_canon_sha256":"d24cdc04adca6d2c183d9d9621ed4753715c387a6f0f759341a828faa6f5dbad"},"schema_version":"1.0","source":{"id":"1507.00043","kind":"arxiv","version":2}},"canonical_sha256":"fae44227bb0dd28917c43b4f4b603b104dd6d79fae68f57994b96321271184c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fae44227bb0dd28917c43b4f4b603b104dd6d79fae68f57994b96321271184c8","first_computed_at":"2026-05-18T01:24:39.368784Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:39.368784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3VJI62heKZn5gsLnRhdrPA+XKKHbCegS20btGDutimhYznZ3FFdELLcelP81NStuawSQunXo9GiHg3mUscSCCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:39.369138Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.00043","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc704c5ab1096a25cc18511203f88c0a0711be580b2fea796d6b9e55b1191471","sha256:58c71ff40ba0896a40f3e18bbd6aa8e3690bc572f4a3b6f73190567c6dcb3376"],"state_sha256":"52e3c7ff799e3f816323f6456459a1ca983ae962ce140aaeeb8024731224ff7b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CFCM62+M/YMXBajiQk8kT9SaS2BJWXigzgcEuS0QRwtQitt/2AayWqo/BmMZYKmkMVaVhgGuKgav6gCFD3GDBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T05:04:57.385345Z","bundle_sha256":"2d93fba714dd26f03641e4ff3d350ac4961db60dd573e60ba114e04f6fb78d5e"}}