{"as_of":"2026-08-18T15:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c7f3cf7fb2027da97e84deaca9e05c9a2eb21664ecc02fc3aa892ef1365372ea","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T22:35:06.071283Z","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-14T05:59:39.718872Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1611.03382","last_updated":"2016-11-10T16:23:04Z","snapshot_observed_at":"2026-08-18T01:18:19.161878Z","submitted_at":"2016-11-10T16:23:04Z","title":"Efficient Summarization with Read-Again and Copy Mechanism","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.03382","snapshot_observed_at":"2026-08-14T12:33:50.189726Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.07026","last_updated":"2019-08-19T19:02:14Z","snapshot_observed_at":"2026-08-16T12:52:34.093325Z","submitted_at":"2019-08-19T19:02:14Z","title":"Topic Augmented Generator for Abstractive Summarization","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-14T12:33:50.189726Z"},"links":{"cited_paper":"/paper/1611.03382","citing_paper":"/paper/1908.07026"},"observation_digest":"sha256:9514ffeb1066a9ac44593edd9dd5af1ce1c3fb13e5ad192f901d5dd72831c37e","observation_id":"21d8d9b6-c4bc-4d12-b9b5-067cad0be2e0","resolution":{"observed_at":"2026-08-14T12:33:50.189726Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1611.03382","last_updated":"2016-11-10T16:23:04Z","snapshot_observed_at":"2026-08-18T01:18:19.161878Z","submitted_at":"2016-11-10T16:23:04Z","title":"Efficient Summarization with Read-Again and Copy Mechanism","version":1},"cited_work":{"arxiv_id":"1611.03382","doi":null,"metadata_source":"pith","pith_arxiv_id":"1611.03382","snapshot_observed_at":"2026-08-14T05:59:39.718872Z","title":"Efficient Summarization with Read-Again and Copy Mechanism","venue":"cs.CL","work_id":"c3360cac-26ae-4ca7-9704-46112432836d","year":2016},"citing_paper":{"arxiv_id":"1909.00325","last_updated":"2019-09-01T05:26:30Z","snapshot_observed_at":"2026-08-18T09:43:30.585353Z","submitted_at":"2019-09-01T05:26:30Z","title":"Repurposing Decoder-Transformer Language Models for Abstractive Summarization","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-14T05:59:39.677951Z"},"links":{"cited_paper":"/paper/1611.03382","citing_paper":"/paper/1909.00325"},"observation_digest":"sha256:23861a0fc1d6a2c9d34ba05bc4f408f7fda53a780d26018deef11e9e7651dfec","observation_id":"5089fa09-b005-4bdc-9518-906389c4e046","resolution":{"observed_at":"2026-08-14T05:59:39.724024Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1611.03382","last_updated":"2016-11-10T16:23:04Z","snapshot_observed_at":"2026-08-18T01:18:19.161878Z","submitted_at":"2016-11-10T16:23:04Z","title":"Efficient Summarization with Read-Again and Copy Mechanism","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.03382","snapshot_observed_at":"2026-08-15T22:35:06.071283Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.06862","last_updated":"2025-05-11T06:14:39Z","snapshot_observed_at":"2026-08-16T10:40:04.788436Z","submitted_at":"2025-05-11T06:14:39Z","title":"A Split-then-Join Approach to Abstractive Summarization for Very Long Documents in a Low Resource Setting","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:06.071283Z"},"links":{"cited_paper":"/paper/1611.03382","citing_paper":"/paper/2505.06862"},"observation_digest":"sha256:b3daccc0989501d2d2a9dde3befe86948cb69f639d636e3502f3b4d58b2e7145","observation_id":"dada56ee-6a47-47b9-b9dd-24eca79f5781","resolution":{"observed_at":"2026-08-15T22:35:06.071283Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1611.03382/citation-record","integrity":"/paper/1611.03382/integrity","json":"/paper/1611.03382/citation-record.json","paper":"/paper/1611.03382"},"outbound":[],"paper":{"arxiv_id":"1611.03382","last_updated":"2016-11-10T16:23:04Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-18T01:18:19.161878Z","submitted_at":"2016-11-10T16:23:04Z","title":"Efficient Summarization with Read-Again and Copy Mechanism"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1611.03382."}