{"as_of":"2026-08-19T05:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:266ac8b20a621f95349bb752f4f9938db031493b9463dd9144e2698042ad27e8","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-16T11:53:39.055796Z","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-07T04:13:14.146159Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1902.01534","last_updated":"2020-02-27T05:13:59Z","snapshot_observed_at":"2026-08-18T22:41:16.612796Z","submitted_at":"2019-02-05T04:06:26Z","title":"A Practical Maximum Clique Algorithm for Matching with Pairwise Constraints","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.01534","snapshot_observed_at":"2026-08-16T11:53:39.055796Z","title":"A practical maximum clique algorithm for matching with pairwise constraints,","venue":null,"work_id":null,"year":1902},"citing_paper":{"arxiv_id":"2504.14440","last_updated":"2025-05-20T15:16:55Z","snapshot_observed_at":"2026-08-18T00:47:27.030113Z","submitted_at":"2025-04-20T01:22:40Z","title":"SG-Reg: Generalizable and Efficient Scene Graph Registration","version":2},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-16T11:53:39.055796Z"},"links":{"cited_paper":"/paper/1902.01534","citing_paper":"/paper/2504.14440"},"observation_digest":"sha256:4280667db134d35f10b475907782547e64d2f5337198dd1fda7f7336a607adfc","observation_id":"89b1223a-2285-4102-afb8-d0389542ff06","resolution":{"observed_at":"2026-08-16T11:53:39.055796Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1902.01534","last_updated":"2020-02-27T05:13:59Z","snapshot_observed_at":"2026-08-18T22:41:16.612796Z","submitted_at":"2019-02-05T04:06:26Z","title":"A Practical Maximum Clique Algorithm for Matching with Pairwise Constraints","version":2},"cited_work":{"arxiv_id":"1902.01534","doi":null,"metadata_source":"pith","pith_arxiv_id":"1902.01534","snapshot_observed_at":"2026-08-07T04:13:14.146159Z","title":"A Practical Maximum Clique Algorithm for Matching with Pairwise Constraints","venue":"cs.CV","work_id":"5bd1eecc-bad8-43c7-907b-613d9c3d22d4","year":2019},"citing_paper":{"arxiv_id":"2506.11547","last_updated":"2025-06-13T08:00:03Z","snapshot_observed_at":"2026-08-11T07:56:41.402912Z","submitted_at":"2025-06-13T08:00:03Z","title":"Linearly Solving Robust Rotation Estimation","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-07T04:13:13.797006Z"},"links":{"cited_paper":"/paper/1902.01534","citing_paper":"/paper/2506.11547"},"observation_digest":"sha256:01ae0b624c105ba842b21adad557fd6ef2ef9e682b0fba1d746fac64b953c512","observation_id":"d8bbeb53-e49b-4bea-8056-41d4a56a8560","resolution":{"observed_at":"2026-08-07T04:13:14.150311Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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":"1902.01534","last_updated":"2020-02-27T05:13:59Z","snapshot_observed_at":"2026-08-18T22:41:16.612796Z","submitted_at":"2019-02-05T04:06:26Z","title":"A Practical Maximum Clique Algorithm for Matching with Pairwise Constraints","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.01534","snapshot_observed_at":"2026-08-15T18:33:47.743430Z","title":"A practical maximum clique algorithm for matching with pairwise constraints","venue":null,"work_id":null,"year":1902},"citing_paper":{"arxiv_id":"2508.02339","last_updated":"2025-08-04T12:21:05Z","snapshot_observed_at":"2026-08-17T00:54:39.995924Z","submitted_at":"2025-08-04T12:21:05Z","title":"Correspondence-Free Fast and Robust Spherical Point Pattern Registration","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-15T18:33:47.743430Z"},"links":{"cited_paper":"/paper/1902.01534","citing_paper":"/paper/2508.02339"},"observation_digest":"sha256:8a2e6e7b7c3eca8936a0aea553e3e9f71b89b5f46210aafd2aaaac5afe1cf378","observation_id":"56d51c14-14e0-4a79-ae19-fd4ad92328a9","resolution":{"observed_at":"2026-08-15T18:33:47.743430Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1902.01534/citation-record","integrity":"/paper/1902.01534/integrity","json":"/paper/1902.01534/citation-record.json","paper":"/paper/1902.01534"},"outbound":[],"paper":{"arxiv_id":"1902.01534","last_updated":"2020-02-27T05:13:59Z","latest_version":2,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-18T22:41:16.612796Z","submitted_at":"2019-02-05T04:06:26Z","title":"A Practical Maximum Clique Algorithm for Matching with Pairwise Constraints"},"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 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1902.01534."}