{"as_of":"2026-08-15T14:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6c18b377577bb6b9f753637a2c70bfdb1a7bdf2638a80ee275547378a984e8ef","coverage":[{"denominator":10,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":10,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T15:16:20.022839Z","state":"measured"},{"denominator":10,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":10,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1908.01562/citation-record","integrity":"/paper/1908.01562/integrity","json":"/paper/1908.01562/citation-record.json","paper":"/paper/1908.01562"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:16:19.974562Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.01562","last_updated":"2019-08-05T11:24:11Z","snapshot_observed_at":"2026-08-15T11:49:08.180309Z","submitted_at":"2019-08-05T11:24:11Z","title":"Heuristic Algorithm for Generalized Function Matching","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-14T15:16:19.974562Z"},"links":{"citing_paper":"/paper/1908.01562"},"observation_digest":"sha256:2e972b87ec555d9752c28b4dc655012dc3fa8625890012c2b9b337e222f6394e","observation_id":"77c684b3-9f2c-42a9-95a1-171953171bc0","resolution":{"observed_at":"2026-08-14T15:16:19.974562Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:16:19.983185Z","title":", author Aumann, Y","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"1908.01562","last_updated":"2019-08-05T11:24:11Z","snapshot_observed_at":"2026-08-15T11:49:08.180309Z","submitted_at":"2019-08-05T11:24:11Z","title":"Heuristic Algorithm for Generalized Function Matching","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-14T15:16:19.983185Z"},"links":{"citing_paper":"/paper/1908.01562"},"observation_digest":"sha256:89a0124adf54ac3f0ca7dc5a69c7b014d4f92d4e1848f0709961bdad20f69635","observation_id":"1da11d1a-7ce9-44c6-a1b6-860f59640e75","resolution":{"observed_at":"2026-08-14T15:16:19.983185Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:16:19.988702Z","title":", author Nor, I","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"1908.01562","last_updated":"2019-08-05T11:24:11Z","snapshot_observed_at":"2026-08-15T11:49:08.180309Z","submitted_at":"2019-08-05T11:24:11Z","title":"Heuristic Algorithm for Generalized Function Matching","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-14T15:16:19.988702Z"},"links":{"citing_paper":"/paper/1908.01562"},"observation_digest":"sha256:0ccbe8a71330f7be415cd34a977a3cdf7154fac6f6aabaa6e5b535532f0e1335","observation_id":"4cad8310-e457-4e1c-a285-e01dd9b4e7be","resolution":{"observed_at":"2026-08-14T15:16:19.988702Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:16:20.199709Z","title":", author Popa, A","venue":null,"work_id":"c56e8fb2-f347-4376-9e02-0b353796501c","year":2010},"citing_paper":{"arxiv_id":"1908.01562","last_updated":"2019-08-05T11:24:11Z","snapshot_observed_at":"2026-08-15T11:49:08.180309Z","submitted_at":"2019-08-05T11:24:11Z","title":"Heuristic Algorithm for Generalized Function Matching","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-14T15:16:19.993878Z"},"links":{"citing_paper":"/paper/1908.01562"},"observation_digest":"sha256:d9966e31b4550c9da11da6316f715fa24f243e44fb4c11e4729b01dd263bd269","observation_id":"6064dd97-ee21-4df6-85c7-e593a4b00717","resolution":{"observed_at":"2026-08-14T15:16:20.203639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:16:19.999651Z","title":", author Wettroth Harrow, A","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"1908.01562","last_updated":"2019-08-05T11:24:11Z","snapshot_observed_at":"2026-08-15T11:49:08.180309Z","submitted_at":"2019-08-05T11:24:11Z","title":"Heuristic Algorithm for Generalized Function Matching","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-14T15:16:19.999651Z"},"links":{"citing_paper":"/paper/1908.01562"},"observation_digest":"sha256:0007c7f7f11b1abe0bf8cb5808afd3e3f239827701b67f35d5180d0aae656ecf","observation_id":"853969e6-9ee0-48b9-b01b-cc6286f65840","resolution":{"observed_at":"2026-08-14T15:16:19.999651Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:16:20.004008Z","title":", author Popa, A","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"1908.01562","last_updated":"2019-08-05T11:24:11Z","snapshot_observed_at":"2026-08-15T11:49:08.180309Z","submitted_at":"2019-08-05T11:24:11Z","title":"Heuristic Algorithm for Generalized Function Matching","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-14T15:16:20.004008Z"},"links":{"citing_paper":"/paper/1908.01562"},"observation_digest":"sha256:fc85058ad53342931442d021b8780c48b95320de86b77159d78553fd8abdda5c","observation_id":"f644273a-82d7-411d-a0a3-6cd05d159f57","resolution":{"observed_at":"2026-08-14T15:16:20.004008Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-015-0008-8","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:16:20.061768Z","title":", author Popa, A","venue":null,"work_id":"a257c3df-82e7-4f24-9cba-7e635d665b4d","year":2015},"citing_paper":{"arxiv_id":"1908.01562","last_updated":"2019-08-05T11:24:11Z","snapshot_observed_at":"2026-08-15T11:49:08.180309Z","submitted_at":"2019-08-05T11:24:11Z","title":"Heuristic Algorithm for Generalized Function Matching","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-14T15:16:20.008550Z"},"links":{"citing_paper":"/paper/1908.01562"},"observation_digest":"sha256:994da1a4b0294964e0d521b0f43ea2133d0434d024d0c68754057bd2ede9f1e3","observation_id":"cb6b2148-8dfe-426b-82a9-9bf59461ff3e","resolution":{"observed_at":"2026-08-14T15:16:20.066896Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":"7088.16711","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:16:20.182762Z","title":"Baker, B","venue":null,"work_id":"edd1df22-7a35-46f0-a087-ea152bf7d43e","year":1993},"citing_paper":{"arxiv_id":"1908.01562","last_updated":"2019-08-05T11:24:11Z","snapshot_observed_at":"2026-08-15T11:49:08.180309Z","submitted_at":"2019-08-05T11:24:11Z","title":"Heuristic Algorithm for Generalized Function Matching","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-14T15:16:20.013882Z"},"links":{"citing_paper":"/paper/1908.01562"},"observation_digest":"sha256:014f49a7db122a6ba7d92daf935a3047587a8e29afb47b8e99f5bfbc517d70fa","observation_id":"b6624fad-cd73-405f-a120-62a94cf6fba5","resolution":{"observed_at":"2026-08-14T15:16:20.191160Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:16:20.018153Z","title":", year 1995","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"1908.01562","last_updated":"2019-08-05T11:24:11Z","snapshot_observed_at":"2026-08-15T11:49:08.180309Z","submitted_at":"2019-08-05T11:24:11Z","title":"Heuristic Algorithm for Generalized Function Matching","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-14T15:16:20.018153Z"},"links":{"citing_paper":"/paper/1908.01562"},"observation_digest":"sha256:08143d75971326dafcf422bf719e1b43da9b835c5957863322e183160a3cd59b","observation_id":"0993645f-625a-44bc-b955-642539d0901e","resolution":{"observed_at":"2026-08-14T15:16:20.018153Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.11731","last_updated":"2021-05-17T12:07:54Z","snapshot_observed_at":"2026-08-06T00:16:31.129364Z","submitted_at":"2020-02-26T19:00:01Z","title":"Novel approach to neutron electric dipole moment search using weak measurement","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.11731","snapshot_observed_at":"2026-08-14T15:16:20.022839Z","title":", year 2002","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"1908.01562","last_updated":"2019-08-05T11:24:11Z","snapshot_observed_at":"2026-08-15T11:49:08.180309Z","submitted_at":"2019-08-05T11:24:11Z","title":"Heuristic Algorithm for Generalized Function Matching","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-14T15:16:20.022839Z"},"links":{"cited_paper":"/paper/2002.11731","citing_paper":"/paper/1908.01562"},"observation_digest":"sha256:0d30446457b4148cdcf5dd17a3fa2dbf8d841878cd1430edbb8076f71e9d3ad7","observation_id":"fe849eb6-24c8-4c31-86b4-13460e95c909","resolution":{"observed_at":"2026-08-14T15:16:20.022839Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"1908.01562","last_updated":"2019-08-05T11:24:11Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-15T11:49:08.180309Z","submitted_at":"2019-08-05T11:24:11Z","title":"Heuristic Algorithm for Generalized Function Matching"},"reference_resolution":{"displayed":10,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":7,"verified_exact":1,"verified_fuzzy":1},"total_outbound_references":10},"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 10 of 10 outbound references and 0 inbound Pith citation observations for arXiv:1908.01562."}