{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:4DFY5CDSMH7G3QDAFB52FV3F35","short_pith_number":"pith:4DFY5CDS","schema_version":"1.0","canonical_sha256":"e0cb8e887261fe6dc060287ba2d765df51db2503a2f5b7bff7561ac258be17f8","source":{"kind":"arxiv","id":"2011.12586","version":1},"attestation_state":"computed","paper":{"title":"RRCN: A Reinforced Random Convolutional Network based Reciprocal Recommendation Approach for Online Dating","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Ju Xin, Kai Chen, Kai Liu, Linhao Luo, Liqi Yang, Xiaofei Yang, Xiaofeng Zhang, Yixiang Fang, Zhiyuan Zhang","submitted_at":"2020-11-25T08:55:17Z","abstract_excerpt":"Recently, the reciprocal recommendation, especially for online dating applications, has attracted more and more research attention. Different from conventional recommendation problems, the reciprocal recommendation aims to simultaneously best match users' mutual preferences. Intuitively, the mutual preferences might be affected by a few key attributes that users like or dislike. Meanwhile, the interactions between users' attributes and their key attributes are also important for key attributes selection. Motivated by these observations, in this paper we propose a novel reinforced random convol"},"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":"2011.12586","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2020-11-25T08:55:17Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"886cc4eb32dbd0059985fb9c4e2c2b065935fbc02073ec4216c485e98569536a","abstract_canon_sha256":"c7490b1db691011b2807cc5ce8d2b716481ff4fcaca6f76bbc8bae33dc73c861"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:54:35.045421Z","signature_b64":"UetBHbY6FxuHv3+OHMjWsVQkcU8ryOnGSdAgN4TMUMw5Rjd0FLJsy+KrOcMAE+cAIeoo8EofGn5dEW1p1w1LBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0cb8e887261fe6dc060287ba2d765df51db2503a2f5b7bff7561ac258be17f8","last_reissued_at":"2026-07-05T01:54:35.045065Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:54:35.045065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RRCN: A Reinforced Random Convolutional Network based Reciprocal Recommendation Approach for Online Dating","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Ju Xin, Kai Chen, Kai Liu, Linhao Luo, Liqi Yang, Xiaofei Yang, Xiaofeng Zhang, Yixiang Fang, Zhiyuan Zhang","submitted_at":"2020-11-25T08:55:17Z","abstract_excerpt":"Recently, the reciprocal recommendation, especially for online dating applications, has attracted more and more research attention. Different from conventional recommendation problems, the reciprocal recommendation aims to simultaneously best match users' mutual preferences. Intuitively, the mutual preferences might be affected by a few key attributes that users like or dislike. Meanwhile, the interactions between users' attributes and their key attributes are also important for key attributes selection. Motivated by these observations, in this paper we propose a novel reinforced random convol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.12586","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/2011.12586/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2011.12586","created_at":"2026-07-05T01:54:35.045120+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.12586v1","created_at":"2026-07-05T01:54:35.045120+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.12586","created_at":"2026-07-05T01:54:35.045120+00:00"},{"alias_kind":"pith_short_12","alias_value":"4DFY5CDSMH7G","created_at":"2026-07-05T01:54:35.045120+00:00"},{"alias_kind":"pith_short_16","alias_value":"4DFY5CDSMH7G3QDA","created_at":"2026-07-05T01:54:35.045120+00:00"},{"alias_kind":"pith_short_8","alias_value":"4DFY5CDS","created_at":"2026-07-05T01:54:35.045120+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.13608","citing_title":"Off-Policy Evaluation and Learning for Matching Markets","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4DFY5CDSMH7G3QDAFB52FV3F35","json":"https://pith.science/pith/4DFY5CDSMH7G3QDAFB52FV3F35.json","graph_json":"https://pith.science/api/pith-number/4DFY5CDSMH7G3QDAFB52FV3F35/graph.json","events_json":"https://pith.science/api/pith-number/4DFY5CDSMH7G3QDAFB52FV3F35/events.json","paper":"https://pith.science/paper/4DFY5CDS"},"agent_actions":{"view_html":"https://pith.science/pith/4DFY5CDSMH7G3QDAFB52FV3F35","download_json":"https://pith.science/pith/4DFY5CDSMH7G3QDAFB52FV3F35.json","view_paper":"https://pith.science/paper/4DFY5CDS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.12586&json=true","fetch_graph":"https://pith.science/api/pith-number/4DFY5CDSMH7G3QDAFB52FV3F35/graph.json","fetch_events":"https://pith.science/api/pith-number/4DFY5CDSMH7G3QDAFB52FV3F35/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4DFY5CDSMH7G3QDAFB52FV3F35/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4DFY5CDSMH7G3QDAFB52FV3F35/action/storage_attestation","attest_author":"https://pith.science/pith/4DFY5CDSMH7G3QDAFB52FV3F35/action/author_attestation","sign_citation":"https://pith.science/pith/4DFY5CDSMH7G3QDAFB52FV3F35/action/citation_signature","submit_replication":"https://pith.science/pith/4DFY5CDSMH7G3QDAFB52FV3F35/action/replication_record"}},"created_at":"2026-07-05T01:54:35.045120+00:00","updated_at":"2026-07-05T01:54:35.045120+00:00"}