{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:WY3U6VYJM7DHAA6N4HCSJSPL7I","short_pith_number":"pith:WY3U6VYJ","schema_version":"1.0","canonical_sha256":"b6374f570967c67003cde1c524c9ebfa3563c7686428073ff3bdaa20596760ee","source":{"kind":"arxiv","id":"2102.12057","version":2},"attestation_state":"computed","paper":{"title":"Revisit Recommender System in the Permutation Prospective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Fei Sun, Junfeng Ge, Wenwu Ou, Yufei Feng, Yu Gong","submitted_at":"2021-02-24T04:15:40Z","abstract_excerpt":"Recommender systems (RS) work effective at alleviating information overload and matching user interests in various web-scale applications. Most RS retrieve the user's favorite candidates and then rank them by the rating scores in the greedy manner. In the permutation prospective, however, current RS come to reveal the following two limitations: 1) They neglect addressing the permutation-variant influence within the recommended results; 2) Permutation consideration extends the latent solution space exponentially, and current RS lack the ability to evaluate the permutations. Both drive RS away f"},"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":"2102.12057","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2021-02-24T04:15:40Z","cross_cats_sorted":[],"title_canon_sha256":"1298cce7fb5d2778899808237eef57a64bb951b0e4c7beef50bf4d3e426e91c5","abstract_canon_sha256":"b003c48d3878f4ef076d7d1bb9beffa2e61ca3bba4c78cc60a5f581f8e14c0c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:28:34.252488Z","signature_b64":"cnswLo4ShHQIDUW71NSfxwQXrYgJ1oEcoMMflE8LL9suwXSYwvJTMI8oW2pxuZOy6+irV9cAXEvPAuXXwfqxCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6374f570967c67003cde1c524c9ebfa3563c7686428073ff3bdaa20596760ee","last_reissued_at":"2026-07-05T02:28:34.252048Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:28:34.252048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Revisit Recommender System in the Permutation Prospective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Fei Sun, Junfeng Ge, Wenwu Ou, Yufei Feng, Yu Gong","submitted_at":"2021-02-24T04:15:40Z","abstract_excerpt":"Recommender systems (RS) work effective at alleviating information overload and matching user interests in various web-scale applications. Most RS retrieve the user's favorite candidates and then rank them by the rating scores in the greedy manner. In the permutation prospective, however, current RS come to reveal the following two limitations: 1) They neglect addressing the permutation-variant influence within the recommended results; 2) Permutation consideration extends the latent solution space exponentially, and current RS lack the ability to evaluate the permutations. Both drive RS away f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.12057","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/2102.12057/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":"2102.12057","created_at":"2026-07-05T02:28:34.252104+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.12057v2","created_at":"2026-07-05T02:28:34.252104+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.12057","created_at":"2026-07-05T02:28:34.252104+00:00"},{"alias_kind":"pith_short_12","alias_value":"WY3U6VYJM7DH","created_at":"2026-07-05T02:28:34.252104+00:00"},{"alias_kind":"pith_short_16","alias_value":"WY3U6VYJM7DHAA6N","created_at":"2026-07-05T02:28:34.252104+00:00"},{"alias_kind":"pith_short_8","alias_value":"WY3U6VYJ","created_at":"2026-07-05T02:28:34.252104+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.25749","citing_title":"DeGRe: Dense-supervised Generative Reranking for Recommendation","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2604.25290","citing_title":"Limitations of LTI Koopman Modeling for Nonlinear Control Systems","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2602.05408","citing_title":"Rich-Media Re-Ranker: A User Satisfaction-Driven LLM Re-ranking Framework for Rich-Media Search","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2604.25291","citing_title":"From Local Indices to Global Identifiers: Generative Reranking for Recommender Systems via Global Action Space","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2604.07420","citing_title":"Dual-Rerank: Fusing Causality and Utility for Industrial Generative Reranking","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05314","citing_title":"Next-Scale Generative Reranking: A Tree-based Generative Rerank Method at Meituan","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WY3U6VYJM7DHAA6N4HCSJSPL7I","json":"https://pith.science/pith/WY3U6VYJM7DHAA6N4HCSJSPL7I.json","graph_json":"https://pith.science/api/pith-number/WY3U6VYJM7DHAA6N4HCSJSPL7I/graph.json","events_json":"https://pith.science/api/pith-number/WY3U6VYJM7DHAA6N4HCSJSPL7I/events.json","paper":"https://pith.science/paper/WY3U6VYJ"},"agent_actions":{"view_html":"https://pith.science/pith/WY3U6VYJM7DHAA6N4HCSJSPL7I","download_json":"https://pith.science/pith/WY3U6VYJM7DHAA6N4HCSJSPL7I.json","view_paper":"https://pith.science/paper/WY3U6VYJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.12057&json=true","fetch_graph":"https://pith.science/api/pith-number/WY3U6VYJM7DHAA6N4HCSJSPL7I/graph.json","fetch_events":"https://pith.science/api/pith-number/WY3U6VYJM7DHAA6N4HCSJSPL7I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WY3U6VYJM7DHAA6N4HCSJSPL7I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WY3U6VYJM7DHAA6N4HCSJSPL7I/action/storage_attestation","attest_author":"https://pith.science/pith/WY3U6VYJM7DHAA6N4HCSJSPL7I/action/author_attestation","sign_citation":"https://pith.science/pith/WY3U6VYJM7DHAA6N4HCSJSPL7I/action/citation_signature","submit_replication":"https://pith.science/pith/WY3U6VYJM7DHAA6N4HCSJSPL7I/action/replication_record"}},"created_at":"2026-07-05T02:28:34.252104+00:00","updated_at":"2026-07-05T02:28:34.252104+00:00"}