{"as_of":"2026-08-15T15:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:83be72d8136eae3ca1cdaf61f2d750105635f08fd0551458d57405857ad0d669","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T12:37:54.063370Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-10T14:54:08.963109Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1904.07531","last_updated":"2019-04-26T12:44:38Z","snapshot_observed_at":"2026-08-14T16:45:54.444749Z","submitted_at":"2019-04-16T08:30:31Z","title":"Understanding the Behaviors of BERT in Ranking","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.07531","snapshot_observed_at":"2026-08-14T12:37:54.063370Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"1908.06780","last_updated":"2019-08-19T13:14:02Z","snapshot_observed_at":"2026-08-15T14:17:32.312314Z","submitted_at":"2019-08-19T13:14:02Z","title":"A Study of BERT for Non-Factoid Question-Answering under Passage Length Constraints","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-14T12:37:54.063370Z"},"links":{"cited_paper":"/paper/1904.07531","citing_paper":"/paper/1908.06780"},"observation_digest":"sha256:8c6e0e235593609da848d2d091bc3989606c00d7f9103742ebf02dd8beb3990b","observation_id":"d2dbef9a-50cf-4969-9d5b-9f2ab012babf","resolution":{"observed_at":"2026-08-14T12:37:54.063370Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.07531","last_updated":"2019-04-26T12:44:38Z","snapshot_observed_at":"2026-08-14T16:45:54.444749Z","submitted_at":"2019-04-16T08:30:31Z","title":"Understanding the Behaviors of BERT in Ranking","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.07531","snapshot_observed_at":"2026-08-14T11:46:30.700988Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"1908.08326","last_updated":"2019-09-06T09:02:30Z","snapshot_observed_at":"2026-08-15T04:14:43.290741Z","submitted_at":"2019-08-22T11:44:12Z","title":"Revisiting Semantic Representation and Tree Search for Similar Question Retrieval","version":8},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-14T11:46:30.700988Z"},"links":{"cited_paper":"/paper/1904.07531","citing_paper":"/paper/1908.08326"},"observation_digest":"sha256:3627f59a49eaafcef0b7b9214ab5a837b75816f9866571b179716f98f9bd44b2","observation_id":"76897e12-3efd-4817-8bcb-2fe52a4c491f","resolution":{"observed_at":"2026-08-14T11:46:30.700988Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.07531","last_updated":"2019-04-26T12:44:38Z","snapshot_observed_at":"2026-08-14T16:45:54.444749Z","submitted_at":"2019-04-16T08:30:31Z","title":"Understanding the Behaviors of BERT in Ranking","version":4},"cited_work":{"arxiv_id":"1904.07531","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1904.07531","snapshot_observed_at":"2026-07-04T23:34:59.028690Z","title":null,"venue":null,"work_id":"d2532aa9-cc81-453f-9f26-51ba4dbd662f","year":2019},"citing_paper":{"arxiv_id":"1908.10084","last_updated":"2019-08-27T08:50:17Z","snapshot_observed_at":"2026-08-14T05:02:11.716316Z","submitted_at":"2019-08-27T08:50:17Z","title":"Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-05-10T14:54:08.729352Z"},"links":{"cited_paper":"/paper/1904.07531","citing_paper":"/paper/1908.10084"},"observation_digest":"sha256:851ec39ca80f49fdf0b5be0aeb8e78e5defdaf7d5298a1ee6b58bf78ebe8d218","observation_id":"c9db4c81-d1a6-47c5-a63b-5208689677ff","resolution":{"observed_at":"2026-07-04T23:34:59.028690Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.07531","last_updated":"2019-04-26T12:44:38Z","snapshot_observed_at":"2026-08-14T16:45:54.444749Z","submitted_at":"2019-04-16T08:30:31Z","title":"Understanding the Behaviors of BERT in Ranking","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.07531","snapshot_observed_at":"2026-08-12T17:55:23.823856Z","title":"Understanding the behaviors of bert in ranking","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2411.12156","last_updated":"2024-11-19T01:26:20Z","snapshot_observed_at":"2026-08-13T10:28:20.380423Z","submitted_at":"2024-11-19T01:26:20Z","title":"HNCSE: Advancing Sentence Embeddings via Hybrid Contrastive Learning with Hard Negatives","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-12T17:55:23.823856Z"},"links":{"cited_paper":"/paper/1904.07531","citing_paper":"/paper/2411.12156"},"observation_digest":"sha256:10babbf22551c2211e07250755ba7a4216a196bf188e60cee5a560e6220a55bb","observation_id":"855ed875-37a6-4c54-a6e4-ab3275a4a96d","resolution":{"observed_at":"2026-08-12T17:55:23.823856Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.07531","last_updated":"2019-04-26T12:44:38Z","snapshot_observed_at":"2026-08-14T16:45:54.444749Z","submitted_at":"2019-04-16T08:30:31Z","title":"Understanding the Behaviors of BERT in Ranking","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.07531","snapshot_observed_at":"2026-08-10T17:48:52.348333Z","title":"Understanding the behaviors of bert in ranking","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2501.13959","last_updated":"2025-07-16T04:56:27Z","snapshot_observed_at":"2026-08-13T13:56:46.628120Z","submitted_at":"2025-01-21T06:32:25Z","title":"Learning an Effective Premise Retrieval Model for Efficient Mathematical Formalization","version":3},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-10T17:48:52.348333Z"},"links":{"cited_paper":"/paper/1904.07531","citing_paper":"/paper/2501.13959"},"observation_digest":"sha256:f29b2d6dd10d679375486b8d99e510ffa4f1b597ba8ef59caed74a57cc0c2f80","observation_id":"2bf71c4c-a44c-4065-bbe1-6f2826cd11e7","resolution":{"observed_at":"2026-08-10T17:48:52.348333Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.07531","last_updated":"2019-04-26T12:44:38Z","snapshot_observed_at":"2026-08-14T16:45:54.444749Z","submitted_at":"2019-04-16T08:30:31Z","title":"Understanding the Behaviors of BERT in Ranking","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.07531","snapshot_observed_at":"2026-08-08T19:15:25.490363Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.06872","last_updated":"2025-02-08T06:50:47Z","snapshot_observed_at":"2026-08-15T12:04:36.201002Z","submitted_at":"2025-02-08T06:50:47Z","title":"Towards Trustworthy Retrieval Augmented Generation for Large Language Models: A Survey","version":1},"reference_index":142,"source":"pdf_text","source_observed_at":"2026-08-08T19:15:25.490363Z"},"links":{"cited_paper":"/paper/1904.07531","citing_paper":"/paper/2502.06872"},"observation_digest":"sha256:8f2ad2481a7759b7fc107d5496da6fcdf759f0234138b1cce84dba21530ff77a","observation_id":"bdeab8b2-bf6a-45d3-bf0f-10f6f48e75b2","resolution":{"observed_at":"2026-08-08T19:15:25.490363Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1904.07531/citation-record","integrity":"/paper/1904.07531/integrity","json":"/paper/1904.07531/citation-record.json","paper":"/paper/1904.07531"},"outbound":[],"paper":{"arxiv_id":"1904.07531","last_updated":"2019-04-26T12:44:38Z","latest_version":4,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-14T16:45:54.444749Z","submitted_at":"2019-04-16T08:30:31Z","title":"Understanding the Behaviors of BERT in Ranking"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:1904.07531."}