{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:GEVKVPCLCQTY2I6BZWAK7OBKPX","short_pith_number":"pith:GEVKVPCL","schema_version":"1.0","canonical_sha256":"312aaabc4b14278d23c1cd80afb82a7ddaddf7dd3a9ec0628dd5a4e8e04f954e","source":{"kind":"arxiv","id":"2607.10541","version":1},"attestation_state":"computed","paper":{"title":"RecRec: Recursive Refinement for Sequential Recommendation","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Abhinav Thorat, Niranjan Pedanekar, Pervez Shaik, Prosenjit Biswas, Ravi Kolla","submitted_at":"2026-07-12T02:53:17Z","abstract_excerpt":"Sequential recommender systems typically infer user preferences through single-pass encoding of interaction histories without iterative refinement, relying on increasingly deep architectures to capture complex patterns. In this work, we revisit sequential recommendation from a recursive inference perspective: can user preferences be modeled as a persistent latent state that is recursively refined? We propose RecRec (Recursive Recommendation), a lightweight model that maintains a compact latent state and updates it through a shared recursive module conditioned on interaction evidence. Unlike pr"},"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":"2607.10541","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.IR","submitted_at":"2026-07-12T02:53:17Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"797358a4f2e2e51f6fab5522d5078f5ab7c4b25f50134894b145138eebf25d96","abstract_canon_sha256":"900e3cc65dbff60453deee1210f5731038b27dbc85526d1232cd8f6a7d845ded"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-14T01:21:20.363301Z","signature_b64":"ksdbWbBH/NjPPJj5nFxXDss9PSyzEZMT7lRVrmf/5wPrA/v5FXINz4pYJYeG9b7VnOjEYhqe2dJdO6tHqLbTDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"312aaabc4b14278d23c1cd80afb82a7ddaddf7dd3a9ec0628dd5a4e8e04f954e","last_reissued_at":"2026-07-14T01:21:20.362429Z","signature_status":"signed_v1","first_computed_at":"2026-07-14T01:21:20.362429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RecRec: Recursive Refinement for Sequential Recommendation","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Abhinav Thorat, Niranjan Pedanekar, Pervez Shaik, Prosenjit Biswas, Ravi Kolla","submitted_at":"2026-07-12T02:53:17Z","abstract_excerpt":"Sequential recommender systems typically infer user preferences through single-pass encoding of interaction histories without iterative refinement, relying on increasingly deep architectures to capture complex patterns. In this work, we revisit sequential recommendation from a recursive inference perspective: can user preferences be modeled as a persistent latent state that is recursively refined? We propose RecRec (Recursive Recommendation), a lightweight model that maintains a compact latent state and updates it through a shared recursive module conditioned on interaction evidence. Unlike pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.10541","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/2607.10541/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":"2607.10541","created_at":"2026-07-14T01:21:20.362885+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.10541v1","created_at":"2026-07-14T01:21:20.362885+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.10541","created_at":"2026-07-14T01:21:20.362885+00:00"},{"alias_kind":"pith_short_12","alias_value":"GEVKVPCLCQTY","created_at":"2026-07-14T01:21:20.362885+00:00"},{"alias_kind":"pith_short_16","alias_value":"GEVKVPCLCQTY2I6B","created_at":"2026-07-14T01:21:20.362885+00:00"},{"alias_kind":"pith_short_8","alias_value":"GEVKVPCL","created_at":"2026-07-14T01:21:20.362885+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GEVKVPCLCQTY2I6BZWAK7OBKPX","json":"https://pith.science/pith/GEVKVPCLCQTY2I6BZWAK7OBKPX.json","graph_json":"https://pith.science/api/pith-number/GEVKVPCLCQTY2I6BZWAK7OBKPX/graph.json","events_json":"https://pith.science/api/pith-number/GEVKVPCLCQTY2I6BZWAK7OBKPX/events.json","paper":"https://pith.science/paper/GEVKVPCL"},"agent_actions":{"view_html":"https://pith.science/pith/GEVKVPCLCQTY2I6BZWAK7OBKPX","download_json":"https://pith.science/pith/GEVKVPCLCQTY2I6BZWAK7OBKPX.json","view_paper":"https://pith.science/paper/GEVKVPCL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.10541&json=true","fetch_graph":"https://pith.science/api/pith-number/GEVKVPCLCQTY2I6BZWAK7OBKPX/graph.json","fetch_events":"https://pith.science/api/pith-number/GEVKVPCLCQTY2I6BZWAK7OBKPX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GEVKVPCLCQTY2I6BZWAK7OBKPX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GEVKVPCLCQTY2I6BZWAK7OBKPX/action/storage_attestation","attest_author":"https://pith.science/pith/GEVKVPCLCQTY2I6BZWAK7OBKPX/action/author_attestation","sign_citation":"https://pith.science/pith/GEVKVPCLCQTY2I6BZWAK7OBKPX/action/citation_signature","submit_replication":"https://pith.science/pith/GEVKVPCLCQTY2I6BZWAK7OBKPX/action/replication_record"}},"created_at":"2026-07-14T01:21:20.362885+00:00","updated_at":"2026-07-14T01:21:20.362885+00:00"}