{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:A2FLVE32QRZ6PE64D7TJK4EHZF","short_pith_number":"pith:A2FLVE32","canonical_record":{"source":{"id":"2203.10107","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-03-18T18:02:44Z","cross_cats_sorted":[],"title_canon_sha256":"f8208cd997c05c21044eb721f971a78301ad29927a3c85e8cb50cf70037a5846","abstract_canon_sha256":"a7c8dfea5ed4eb4e83917f8d22bb2946890da2e468133ff28e5e9ca15014a848"},"schema_version":"1.0"},"canonical_sha256":"068aba937a8473e793dc1fe6957087c9797dde7f1e41bbd0ad48651ea7ceac59","source":{"kind":"arxiv","id":"2203.10107","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.10107","created_at":"2026-07-05T04:06:31Z"},{"alias_kind":"arxiv_version","alias_value":"2203.10107v1","created_at":"2026-07-05T04:06:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.10107","created_at":"2026-07-05T04:06:31Z"},{"alias_kind":"pith_short_12","alias_value":"A2FLVE32QRZ6","created_at":"2026-07-05T04:06:31Z"},{"alias_kind":"pith_short_16","alias_value":"A2FLVE32QRZ6PE64","created_at":"2026-07-05T04:06:31Z"},{"alias_kind":"pith_short_8","alias_value":"A2FLVE32","created_at":"2026-07-05T04:06:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:A2FLVE32QRZ6PE64D7TJK4EHZF","target":"record","payload":{"canonical_record":{"source":{"id":"2203.10107","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-03-18T18:02:44Z","cross_cats_sorted":[],"title_canon_sha256":"f8208cd997c05c21044eb721f971a78301ad29927a3c85e8cb50cf70037a5846","abstract_canon_sha256":"a7c8dfea5ed4eb4e83917f8d22bb2946890da2e468133ff28e5e9ca15014a848"},"schema_version":"1.0"},"canonical_sha256":"068aba937a8473e793dc1fe6957087c9797dde7f1e41bbd0ad48651ea7ceac59","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:06:31.508114Z","signature_b64":"7sWz3oc7C8FK/Py/x2ubvTpEzYvdb++wUmTzw/noP98cUtuaJACQUWdAkj+VjfK1Pppqe12Dr1oLNgN9cgZDDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"068aba937a8473e793dc1fe6957087c9797dde7f1e41bbd0ad48651ea7ceac59","last_reissued_at":"2026-07-05T04:06:31.507706Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:06:31.507706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2203.10107","source_version":1,"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-05T04:06:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3MIUvgCa1vOhSXOVw04UCJJpAK6huDB/QFRapzm89mdEncUqVHkbJD/B1pOjsrku+/Vhe7kNQOe5D3VpIxrqCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T04:12:35.768541Z"},"content_sha256":"b2264dff922ac3f43d8b27994add257a28db0b28c6e44216a04cce6127c17664","schema_version":"1.0","event_id":"sha256:b2264dff922ac3f43d8b27994add257a28db0b28c6e44216a04cce6127c17664"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:A2FLVE32QRZ6PE64D7TJK4EHZF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SiMCa: Sinkhorn Matrix Factorization with Capacity Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Antoine Baker, Eric Daoud, Luca Ganassali, Marc Lelarge","submitted_at":"2022-03-18T18:02:44Z","abstract_excerpt":"For a very broad range of problems, recommendation algorithms have been increasingly used over the past decade. In most of these algorithms, the predictions are built upon user-item affinity scores which are obtained from high-dimensional embeddings of items and users. In more complex scenarios, with geometrical or capacity constraints, prediction based on embeddings may not be sufficient and some additional features should be considered in the design of the algorithm. In this work, we study the recommendation problem in the setting where affinities between users and items are based both on th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.10107","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2203.10107/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-05T04:06:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R4GIvnpv3+RhTP29JzZENyB7YS8HMX2Hbz260OmQCFp+1c0mJes00bb67iZpIh0RHhbpC9hdxXeUhtWddFJoBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T04:12:35.768906Z"},"content_sha256":"87f9366d82d0aef231c3b5f368f2b77798d2db13092e4b75679bb8ee0223a263","schema_version":"1.0","event_id":"sha256:87f9366d82d0aef231c3b5f368f2b77798d2db13092e4b75679bb8ee0223a263"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A2FLVE32QRZ6PE64D7TJK4EHZF/bundle.json","state_url":"https://pith.science/pith/A2FLVE32QRZ6PE64D7TJK4EHZF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A2FLVE32QRZ6PE64D7TJK4EHZF/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-19T04:12:35Z","links":{"resolver":"https://pith.science/pith/A2FLVE32QRZ6PE64D7TJK4EHZF","bundle":"https://pith.science/pith/A2FLVE32QRZ6PE64D7TJK4EHZF/bundle.json","state":"https://pith.science/pith/A2FLVE32QRZ6PE64D7TJK4EHZF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A2FLVE32QRZ6PE64D7TJK4EHZF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:A2FLVE32QRZ6PE64D7TJK4EHZF","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":"a7c8dfea5ed4eb4e83917f8d22bb2946890da2e468133ff28e5e9ca15014a848","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-03-18T18:02:44Z","title_canon_sha256":"f8208cd997c05c21044eb721f971a78301ad29927a3c85e8cb50cf70037a5846"},"schema_version":"1.0","source":{"id":"2203.10107","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.10107","created_at":"2026-07-05T04:06:31Z"},{"alias_kind":"arxiv_version","alias_value":"2203.10107v1","created_at":"2026-07-05T04:06:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.10107","created_at":"2026-07-05T04:06:31Z"},{"alias_kind":"pith_short_12","alias_value":"A2FLVE32QRZ6","created_at":"2026-07-05T04:06:31Z"},{"alias_kind":"pith_short_16","alias_value":"A2FLVE32QRZ6PE64","created_at":"2026-07-05T04:06:31Z"},{"alias_kind":"pith_short_8","alias_value":"A2FLVE32","created_at":"2026-07-05T04:06:31Z"}],"graph_snapshots":[{"event_id":"sha256:87f9366d82d0aef231c3b5f368f2b77798d2db13092e4b75679bb8ee0223a263","target":"graph","created_at":"2026-07-05T04:06:31Z","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/2203.10107/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For a very broad range of problems, recommendation algorithms have been increasingly used over the past decade. In most of these algorithms, the predictions are built upon user-item affinity scores which are obtained from high-dimensional embeddings of items and users. In more complex scenarios, with geometrical or capacity constraints, prediction based on embeddings may not be sufficient and some additional features should be considered in the design of the algorithm. In this work, we study the recommendation problem in the setting where affinities between users and items are based both on th","authors_text":"Antoine Baker, Eric Daoud, Luca Ganassali, Marc Lelarge","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-03-18T18:02:44Z","title":"SiMCa: Sinkhorn Matrix Factorization with Capacity Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.10107","kind":"arxiv","version":1},"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:b2264dff922ac3f43d8b27994add257a28db0b28c6e44216a04cce6127c17664","target":"record","created_at":"2026-07-05T04:06:31Z","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":"a7c8dfea5ed4eb4e83917f8d22bb2946890da2e468133ff28e5e9ca15014a848","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-03-18T18:02:44Z","title_canon_sha256":"f8208cd997c05c21044eb721f971a78301ad29927a3c85e8cb50cf70037a5846"},"schema_version":"1.0","source":{"id":"2203.10107","kind":"arxiv","version":1}},"canonical_sha256":"068aba937a8473e793dc1fe6957087c9797dde7f1e41bbd0ad48651ea7ceac59","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"068aba937a8473e793dc1fe6957087c9797dde7f1e41bbd0ad48651ea7ceac59","first_computed_at":"2026-07-05T04:06:31.507706Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:06:31.507706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7sWz3oc7C8FK/Py/x2ubvTpEzYvdb++wUmTzw/noP98cUtuaJACQUWdAkj+VjfK1Pppqe12Dr1oLNgN9cgZDDA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:06:31.508114Z","signed_message":"canonical_sha256_bytes"},"source_id":"2203.10107","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2264dff922ac3f43d8b27994add257a28db0b28c6e44216a04cce6127c17664","sha256:87f9366d82d0aef231c3b5f368f2b77798d2db13092e4b75679bb8ee0223a263"],"state_sha256":"5642b154dd7b0b9ec7ad2f1d7d77e0198da5dc78f13813ec4f7b2e83a5a228d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SI03v6A2vPOJUNB5gnhCOsK3xlmBs6DhTx9NZXKZHd6X74MZ4pry7i5UB5goO7t8EFaQ1xtDjElh88a47jxODA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T04:12:35.772281Z","bundle_sha256":"3a947d625f20102fffeebb5e5655f44f88ae80e456c04c7cf33cf05891a77800"}}