{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:5GIIKZNAA5MOE5YMT6YV4DXVAX","short_pith_number":"pith:5GIIKZNA","canonical_record":{"source":{"id":"2209.04394","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2022-09-09T16:59:15Z","cross_cats_sorted":[],"title_canon_sha256":"efc43b859792dd0de31de413ef975fb6892447f2a37cfaa5fef49cae3026e854","abstract_canon_sha256":"6194194d4d169eec3c57580fe5ef37ae45f6a359cd66710416579d696e27c309"},"schema_version":"1.0"},"canonical_sha256":"e9908565a00758e2770c9fb15e0ef505c06d4da8214d0b6b95efbf86a8452526","source":{"kind":"arxiv","id":"2209.04394","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.04394","created_at":"2026-07-05T05:17:28Z"},{"alias_kind":"arxiv_version","alias_value":"2209.04394v2","created_at":"2026-07-05T05:17:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.04394","created_at":"2026-07-05T05:17:28Z"},{"alias_kind":"pith_short_12","alias_value":"5GIIKZNAA5MO","created_at":"2026-07-05T05:17:28Z"},{"alias_kind":"pith_short_16","alias_value":"5GIIKZNAA5MOE5YM","created_at":"2026-07-05T05:17:28Z"},{"alias_kind":"pith_short_8","alias_value":"5GIIKZNA","created_at":"2026-07-05T05:17:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:5GIIKZNAA5MOE5YMT6YV4DXVAX","target":"record","payload":{"canonical_record":{"source":{"id":"2209.04394","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2022-09-09T16:59:15Z","cross_cats_sorted":[],"title_canon_sha256":"efc43b859792dd0de31de413ef975fb6892447f2a37cfaa5fef49cae3026e854","abstract_canon_sha256":"6194194d4d169eec3c57580fe5ef37ae45f6a359cd66710416579d696e27c309"},"schema_version":"1.0"},"canonical_sha256":"e9908565a00758e2770c9fb15e0ef505c06d4da8214d0b6b95efbf86a8452526","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:17:28.335953Z","signature_b64":"1TOXwb22quZYuyUN15Sgi6fLU/EVI4b1r34d/NXJEPXKQVAov041ze3uzTaLK3xHeDX7YFTJPDjrVdBJs8b4AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9908565a00758e2770c9fb15e0ef505c06d4da8214d0b6b95efbf86a8452526","last_reissued_at":"2026-07-05T05:17:28.335429Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:17:28.335429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2209.04394","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-07-05T05:17:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y9o5k/kkSDj+7uRhkQmeYyScQPha9wHhFMDh6HlNRl7qb8aMzybqkaUJFjN6p9b6x8RqTvhLXEA/GUUDvNk7Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T14:55:56.382484Z"},"content_sha256":"7eeb164b6899eab4340313cb57c01c4997dd111696fe32caa39bdc428cb55871","schema_version":"1.0","event_id":"sha256:7eeb164b6899eab4340313cb57c01c4997dd111696fe32caa39bdc428cb55871"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:5GIIKZNAA5MOE5YMT6YV4DXVAX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fair Matrix Factorisation for Large-Scale Recommender Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Kenshi Abe, Riku Togashi","submitted_at":"2022-09-09T16:59:15Z","abstract_excerpt":"Recommender systems are hedged with various requirements, such as ranking quality, optimisation efficiency, and item fairness. Item fairness is an emerging yet impending issue in practical systems. The notion of item fairness requires controlling the opportunity of items (e.g. the exposure) by considering the entire set of rankings recommended for users. However, the intrinsic nature of fairness destroys the separability of optimisation subproblems for users and items, which is an essential property of conventional scalable algorithms, such as implicit alternating least squares (iALS). Few fai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.04394","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2209.04394/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:17:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KWHHJMY7wJVdfgiNWa7LJ+DixFL1s9SgdBqIYGlJ3s4v4vdigl/IXg+k1yEGdsC/4ySlQ2GC439H6Q90HU+ICQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T14:55:56.383514Z"},"content_sha256":"aa63b96113f872055be801c242629b79f299185ef7c214085f271536fcee9c29","schema_version":"1.0","event_id":"sha256:aa63b96113f872055be801c242629b79f299185ef7c214085f271536fcee9c29"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5GIIKZNAA5MOE5YMT6YV4DXVAX/bundle.json","state_url":"https://pith.science/pith/5GIIKZNAA5MOE5YMT6YV4DXVAX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5GIIKZNAA5MOE5YMT6YV4DXVAX/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-08-13T14:55:56Z","links":{"resolver":"https://pith.science/pith/5GIIKZNAA5MOE5YMT6YV4DXVAX","bundle":"https://pith.science/pith/5GIIKZNAA5MOE5YMT6YV4DXVAX/bundle.json","state":"https://pith.science/pith/5GIIKZNAA5MOE5YMT6YV4DXVAX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5GIIKZNAA5MOE5YMT6YV4DXVAX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:5GIIKZNAA5MOE5YMT6YV4DXVAX","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":"6194194d4d169eec3c57580fe5ef37ae45f6a359cd66710416579d696e27c309","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2022-09-09T16:59:15Z","title_canon_sha256":"efc43b859792dd0de31de413ef975fb6892447f2a37cfaa5fef49cae3026e854"},"schema_version":"1.0","source":{"id":"2209.04394","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.04394","created_at":"2026-07-05T05:17:28Z"},{"alias_kind":"arxiv_version","alias_value":"2209.04394v2","created_at":"2026-07-05T05:17:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.04394","created_at":"2026-07-05T05:17:28Z"},{"alias_kind":"pith_short_12","alias_value":"5GIIKZNAA5MO","created_at":"2026-07-05T05:17:28Z"},{"alias_kind":"pith_short_16","alias_value":"5GIIKZNAA5MOE5YM","created_at":"2026-07-05T05:17:28Z"},{"alias_kind":"pith_short_8","alias_value":"5GIIKZNA","created_at":"2026-07-05T05:17:28Z"}],"graph_snapshots":[{"event_id":"sha256:aa63b96113f872055be801c242629b79f299185ef7c214085f271536fcee9c29","target":"graph","created_at":"2026-07-05T05:17:28Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2209.04394/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recommender systems are hedged with various requirements, such as ranking quality, optimisation efficiency, and item fairness. Item fairness is an emerging yet impending issue in practical systems. The notion of item fairness requires controlling the opportunity of items (e.g. the exposure) by considering the entire set of rankings recommended for users. However, the intrinsic nature of fairness destroys the separability of optimisation subproblems for users and items, which is an essential property of conventional scalable algorithms, such as implicit alternating least squares (iALS). Few fai","authors_text":"Kenshi Abe, Riku Togashi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2022-09-09T16:59:15Z","title":"Fair Matrix Factorisation for Large-Scale Recommender Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.04394","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:7eeb164b6899eab4340313cb57c01c4997dd111696fe32caa39bdc428cb55871","target":"record","created_at":"2026-07-05T05:17:28Z","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":"6194194d4d169eec3c57580fe5ef37ae45f6a359cd66710416579d696e27c309","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2022-09-09T16:59:15Z","title_canon_sha256":"efc43b859792dd0de31de413ef975fb6892447f2a37cfaa5fef49cae3026e854"},"schema_version":"1.0","source":{"id":"2209.04394","kind":"arxiv","version":2}},"canonical_sha256":"e9908565a00758e2770c9fb15e0ef505c06d4da8214d0b6b95efbf86a8452526","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9908565a00758e2770c9fb15e0ef505c06d4da8214d0b6b95efbf86a8452526","first_computed_at":"2026-07-05T05:17:28.335429Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:17:28.335429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1TOXwb22quZYuyUN15Sgi6fLU/EVI4b1r34d/NXJEPXKQVAov041ze3uzTaLK3xHeDX7YFTJPDjrVdBJs8b4AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:17:28.335953Z","signed_message":"canonical_sha256_bytes"},"source_id":"2209.04394","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7eeb164b6899eab4340313cb57c01c4997dd111696fe32caa39bdc428cb55871","sha256:aa63b96113f872055be801c242629b79f299185ef7c214085f271536fcee9c29"],"state_sha256":"b40cb8a7559814b45ab0e7d450ae3586f5cebb22d1d87b3ab7179a1e2c333b5d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/5VrXAzx32BozOrI8cSdo/RVRy6YmJoS6749veUtGxD4WIEEAfg2jhw9F4LKuLXlk6z9rikrCl1rjYWBWK4CBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T14:55:56.390330Z","bundle_sha256":"5ac8d36d2ed4d143a2024cc964231c3af1a9c846446352d1c4651dd40f9e0a2f"}}