{"as_of":"2026-08-07T20:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6554370d667d5482fbc024838233dfcd4597306667b96cc38fba7a9e561de5a8","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T23:04:14.187274Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-06T23:04:15.180092Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1805.02232","last_updated":"2018-09-19T08:56:16Z","snapshot_observed_at":"2026-07-06T06:37:37.681903Z","submitted_at":"2018-05-06T15:24:54Z","title":"Discrete Factorization Machines for Fast Feature-based Recommendation","version":3},"cited_work":{"arxiv_id":"1805.02232","doi":null,"metadata_source":"pith","pith_arxiv_id":"1805.02232","snapshot_observed_at":"2026-08-06T23:04:15.180092Z","title":"Discrete Factorization Machines for Fast Feature-based Recommendation","venue":"cs.IR","work_id":"e8e62b72-bbd1-4470-a6c6-e2bbbb10effe","year":2018},"citing_paper":{"arxiv_id":"2506.19993","last_updated":"2025-06-24T20:27:51Z","snapshot_observed_at":"2026-08-06T22:56:54.915714Z","submitted_at":"2025-06-24T20:27:51Z","title":"CoVE: Compressed Vocabulary Expansion Makes Better LLM-based Recommender Systems","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-06T23:04:14.187274Z"},"links":{"cited_paper":"/paper/1805.02232","citing_paper":"/paper/2506.19993"},"observation_digest":"sha256:c412e595dcf3fc14a73654377a354dbc44ac432b5094bf2b26cbdf3988c4f111","observation_id":"cce2919f-f8c2-494f-b5c1-3d5cd827fb0e","resolution":{"observed_at":"2026-08-06T23:04:15.209685Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1805.02232/citation-record","integrity":"/paper/1805.02232/integrity","json":"/paper/1805.02232/citation-record.json","paper":"/paper/1805.02232"},"outbound":[],"paper":{"arxiv_id":"1805.02232","last_updated":"2018-09-19T08:56:16Z","latest_version":3,"primary_category":"cs.IR","snapshot_observed_at":"2026-07-06T06:37:37.681903Z","submitted_at":"2018-05-06T15:24:54Z","title":"Discrete Factorization Machines for Fast Feature-based Recommendation"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1805.02232."}