{"as_of":"2026-08-16T11:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f8ce44f23251cf18aa565073485b1effa838902c7197e70b25cc9af02bf8dc8b","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T11:21:40.141652Z","state":"measured"},{"denominator":17,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":17,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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.09364/citation-record","integrity":"/paper/1908.09364/integrity","json":"/paper/1908.09364/citation-record.json","paper":"/paper/1908.09364"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:21:40.058988Z","title":"URL https://arxiv.org/abs/1801.01944","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.09364","last_updated":"2019-08-27T07:53:03Z","snapshot_observed_at":"2026-08-14T11:11:39.258923Z","submitted_at":"2019-08-25T17:20:15Z","title":"Adversarial Edit Attacks for Tree Data","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T11:21:40.058988Z"},"links":{"citing_paper":"/paper/1908.09364"},"observation_digest":"sha256:17ab0233beeab24d49cf95c8bea5d239930d1509182294ac37125a923cf80076","observation_id":"a8299b03-480d-4beb-b44c-c7c33334544c","resolution":{"observed_at":"2026-08-14T11:21:40.058988Z","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-14T11:21:40.678177Z","title":"Kevin Eykholt, Ivan Evtimov, Earlence Fernandes, Bo Li, Amir Rahmati, Chaowei Xiao, Atul Prakash, Tadayoshi Kohno, and Dawn Song","venue":null,"work_id":"df6c510f-9371-41cb-8cf0-4a4b726809f5","year":2006},"citing_paper":{"arxiv_id":"1908.09364","last_updated":"2019-08-27T07:53:03Z","snapshot_observed_at":"2026-08-14T11:11:39.258923Z","submitted_at":"2019-08-25T17:20:15Z","title":"Adversarial Edit Attacks for Tree Data","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T11:21:40.064220Z"},"links":{"citing_paper":"/paper/1908.09364"},"observation_digest":"sha256:e80139ef7fbb2d16ee48af4d444e17b099c599a544e55fec226751c16ed38ff0","observation_id":"c54a3895-e43c-4b7c-92c2-dc2538b89cb6","resolution":{"observed_at":"2026-08-14T11:21:40.684043Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1707.08945","last_updated":"2018-04-10T16:22:47Z","snapshot_observed_at":"2026-08-14T20:44:49.961329Z","submitted_at":"2017-07-27T17:37:22Z","title":"Robust Physical-World Attacks on Deep Learning Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.08945","snapshot_observed_at":"2026-08-14T11:21:40.069945Z","title":"Claudio Gallicchio and Alessio Micheli","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.09364","last_updated":"2019-08-27T07:53:03Z","snapshot_observed_at":"2026-08-14T11:11:39.258923Z","submitted_at":"2019-08-25T17:20:15Z","title":"Adversarial Edit Attacks for Tree Data","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T11:21:40.069945Z"},"links":{"cited_paper":"/paper/1707.08945","citing_paper":"/paper/1908.09364"},"observation_digest":"sha256:0539dd285e219ab9f5adaae78a1b6e53a0a7eeb9bfcd1b81986874c691dabdb5","observation_id":"6633d827-d4f4-4c57-9b9b-d3581ea72cb6","resolution":{"observed_at":"2026-08-14T11:21:40.069945Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6572","last_updated":"2015-03-20T20:19:16Z","snapshot_observed_at":"2026-08-12T17:13:46.394331Z","submitted_at":"2014-12-20T01:17:12Z","title":"Explaining and Harnessing Adversarial Examples","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6572","snapshot_observed_at":"2026-08-14T11:21:40.091100Z","title":"Diederik P","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.09364","last_updated":"2019-08-27T07:53:03Z","snapshot_observed_at":"2026-08-14T11:11:39.258923Z","submitted_at":"2019-08-25T17:20:15Z","title":"Adversarial Edit Attacks for Tree Data","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T11:21:40.091100Z"},"links":{"cited_paper":"/paper/1412.6572","citing_paper":"/paper/1908.09364"},"observation_digest":"sha256:21bdc931b65c8eb71307aaf248987384931a17ba5544744abe1fc82c1f29e41f","observation_id":"6e9cd02a-84cd-4dd4-9f99-ecf42c3ced29","resolution":{"observed_at":"2026-08-14T11:21:40.091100Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-08-14T18:51:16.666127Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-14T11:21:40.098245Z","title":"Aleksander Madry, Aleksandar Makelov, Ludwig Schmidt, Dim itris Tsipras, and Adrian Vladu","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.09364","last_updated":"2019-08-27T07:53:03Z","snapshot_observed_at":"2026-08-14T11:11:39.258923Z","submitted_at":"2019-08-25T17:20:15Z","title":"Adversarial Edit Attacks for Tree Data","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T11:21:40.098245Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/1908.09364"},"observation_digest":"sha256:b1c18a5e4a0bf7cb4c4162951bf34d80685da2408f71b122738b713d1fddfb46","observation_id":"558bc452-40ea-4a0f-81ef-a970180e6764","resolution":{"observed_at":"2026-08-14T11:21:40.098245Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1805.06869","last_updated":"2022-09-14T09:30:03Z","snapshot_observed_at":"2026-08-14T19:14:07.460463Z","submitted_at":"2018-05-17T17:16:07Z","title":"Revisiting the tree edit distance and its backtracing: A tutorial","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1805.06869","snapshot_observed_at":"2026-08-14T11:21:40.112242Z","title":"Benjamin Paaßen","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.09364","last_updated":"2019-08-27T07:53:03Z","snapshot_observed_at":"2026-08-14T11:11:39.258923Z","submitted_at":"2019-08-25T17:20:15Z","title":"Adversarial Edit Attacks for Tree Data","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T11:21:40.112242Z"},"links":{"cited_paper":"/paper/1805.06869","citing_paper":"/paper/1908.09364"},"observation_digest":"sha256:c8e382b96787db502488c4109cdaac33162c6e08790963ea400e178dbe3480de","observation_id":"55f91421-4602-4ee0-9ee0-29728db53383","resolution":{"observed_at":"2026-08-14T11:21:40.112242Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1710.08864","last_updated":"2019-10-17T07:46:53Z","snapshot_observed_at":"2026-08-14T20:20:45.576551Z","submitted_at":"2017-10-24T16:02:19Z","title":"One pixel attack for fooling deep neural networks","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.08864","snapshot_observed_at":"2026-08-14T11:21:40.125342Z","title":"Christian Szegedy, Wojciech Zaremba, Ilya Sutskever, Joan Bruna, Dumitru Erhan, Ian Good- fellow, and Rob Fergus","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.09364","last_updated":"2019-08-27T07:53:03Z","snapshot_observed_at":"2026-08-14T11:11:39.258923Z","submitted_at":"2019-08-25T17:20:15Z","title":"Adversarial Edit Attacks for Tree Data","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T11:21:40.125342Z"},"links":{"cited_paper":"/paper/1710.08864","citing_paper":"/paper/1908.09364"},"observation_digest":"sha256:b87f1fc09dbb4b9019dc7521b99728a4bd67986043e3b68bbb4a5529636fc4dc","observation_id":"40cc071b-4d1d-4994-a80c-27daeb740ea8","resolution":{"observed_at":"2026-08-14T11:21:40.125342Z","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-14T11:21:40.141652Z","title":"URL https://arxiv.org/abs/1805.07984","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.09364","last_updated":"2019-08-27T07:53:03Z","snapshot_observed_at":"2026-08-14T11:11:39.258923Z","submitted_at":"2019-08-25T17:20:15Z","title":"Adversarial Edit Attacks for Tree Data","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T11:21:40.141652Z"},"links":{"citing_paper":"/paper/1908.09364"},"observation_digest":"sha256:cbc1c844d8653ebba3eca515879c5413892db0a94f1337ccd695764181e5b988","observation_id":"b34fd013-fc45-4a03-97a9-bad9a1576571","resolution":{"observed_at":"2026-08-14T11:21:40.141652Z","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-14T11:21:40.135776Z","title":"Daniel Zügner, Amir Akbarnejad, and Stephan Günnemann","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.09364","last_updated":"2019-08-27T07:53:03Z","snapshot_observed_at":"2026-08-14T11:11:39.258923Z","submitted_at":"2019-08-25T17:20:15Z","title":"Adversarial Edit Attacks for Tree Data","version":2},"reference_index":1989,"source":"pdf_text","source_observed_at":"2026-08-14T11:21:40.135776Z"},"links":{"citing_paper":"/paper/1908.09364"},"observation_digest":"sha256:78cdbca6ecb827f651039014f9f3b1821e5afb2c362c320abc254f5e9c730867","observation_id":"8428f400-3cb9-477e-973f-9c97904c0409","resolution":{"observed_at":"2026-08-14T11:21:40.135776Z","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.1016/j.tcs.2004.12.030","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:21:40.224257Z","title":"Nicholas Carlini and David Wagner","venue":null,"work_id":"256f2cdd-d66b-419e-9ecd-7aed44378cbd","year":2004},"citing_paper":{"arxiv_id":"1908.09364","last_updated":"2019-08-27T07:53:03Z","snapshot_observed_at":"2026-08-14T11:11:39.258923Z","submitted_at":"2019-08-25T17:20:15Z","title":"Adversarial Edit Attacks for Tree Data","version":2},"reference_index":2005,"source":"pdf_text","source_observed_at":"2026-08-14T11:21:40.037489Z"},"links":{"citing_paper":"/paper/1908.09364"},"observation_digest":"sha256:d6d5315af822aeff042b6e2e30cd025389d4c2de3a540eface0a6ec424c6fe1e","observation_id":"66b2a136-485b-426c-9017-878ede85c84b","resolution":{"observed_at":"2026-08-14T11:21:40.229444Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-21735-7_18","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:21:40.243111Z","title":"Naveed Akhtar and Ajmal Mian","venue":null,"work_id":"b6f5fab8-842a-4768-8edb-5c73961b1dff","year":null},"citing_paper":{"arxiv_id":"1908.09364","last_updated":"2019-08-27T07:53:03Z","snapshot_observed_at":"2026-08-14T11:11:39.258923Z","submitted_at":"2019-08-25T17:20:15Z","title":"Adversarial Edit Attacks for Tree Data","version":2},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-14T11:21:40.025645Z"},"links":{"citing_paper":"/paper/1908.09364"},"observation_digest":"sha256:2c49fbfaa868d3b047ffb9f048f15d96e301704bab333e07107dec4764ddf924","observation_id":"25114985-97c9-4770-95d8-e18e07967314","resolution":{"observed_at":"2026-08-14T11:21:40.252436Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.neucom.2012.08.017","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:21:40.188756Z","title":"Andrej Gisbrecht and Frank-Michael Schleif","venue":null,"work_id":"9136047c-8109-44fa-819a-d723e51c635f","year":2012},"citing_paper":{"arxiv_id":"1908.09364","last_updated":"2019-08-27T07:53:03Z","snapshot_observed_at":"2026-08-14T11:11:39.258923Z","submitted_at":"2019-08-25T17:20:15Z","title":"Adversarial Edit Attacks for Tree Data","version":2},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-14T11:21:40.076008Z"},"links":{"citing_paper":"/paper/1908.09364"},"observation_digest":"sha256:c27569a313e19193c8722b2d268e2e7f17967e1616b56ecfa02f4c9a44e5039e","observation_id":"e09e42cf-10d1-4933-a728-b77c4d80c283","resolution":{"observed_at":"2026-08-14T11:21:40.200354Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1312.6199","last_updated":"2014-02-19T16:33:14Z","snapshot_observed_at":"2026-08-15T16:41:15.505782Z","submitted_at":"2013-12-21T03:36:08Z","title":"Intriguing properties of neural networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1312.6199","snapshot_observed_at":"2026-08-14T11:21:40.130177Z","title":"Kaizhong Zhang and Dennis Shasha","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.09364","last_updated":"2019-08-27T07:53:03Z","snapshot_observed_at":"2026-08-14T11:11:39.258923Z","submitted_at":"2019-08-25T17:20:15Z","title":"Adversarial Edit Attacks for Tree Data","version":2},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-14T11:21:40.130177Z"},"links":{"cited_paper":"/paper/1312.6199","citing_paper":"/paper/1908.09364"},"observation_digest":"sha256:7d6cf98650cf1bb9b338bb607837e1b0ccb264f6d9a9ca8abc804afd5429dc46","observation_id":"ece0db2d-0466-43eb-92f7-6827eefe8ebc","resolution":{"observed_at":"2026-08-14T11:21:40.130177Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1411.1646","last_updated":"2014-11-06T16:03:26Z","snapshot_observed_at":"2026-08-14T23:12:38.440975Z","submitted_at":"2014-11-06T16:03:26Z","title":"Metric and non-metric proximity transformations at linear costs","version":1},"cited_work":{"arxiv_id":"1411.1646","doi":null,"metadata_source":"pith","pith_arxiv_id":"1411.1646","snapshot_observed_at":"2026-08-14T11:21:40.496336Z","title":"Metric and non-metric proximity transformations at linear costs","venue":"cs.DS","work_id":"c908b27c-2fdf-47a4-95c6-b1bd97c6a18a","year":2014},"citing_paper":{"arxiv_id":"1908.09364","last_updated":"2019-08-27T07:53:03Z","snapshot_observed_at":"2026-08-14T11:11:39.258923Z","submitted_at":"2019-08-25T17:20:15Z","title":"Adversarial Edit Attacks for Tree Data","version":2},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-14T11:21:40.080857Z"},"links":{"cited_paper":"/paper/1411.1646","citing_paper":"/paper/1908.09364"},"observation_digest":"sha256:d18812df3996c98b693fdd5a8d7c81941fa31ecda9a02ccc28b5c11131d1c605","observation_id":"55ed8774-084e-4ec4-9692-1c233c099ff8","resolution":{"observed_at":"2026-08-14T11:21:40.502937Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:21:40.045577Z","title":"3All implementations and experiments are available at https://gitlab.ub.uni-bielefeld.de/bpaassen/adversarial-edit-attacks Preprint of Paaßen","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.09364","last_updated":"2019-08-27T07:53:03Z","snapshot_observed_at":"2026-08-14T11:11:39.258923Z","submitted_at":"2019-08-25T17:20:15Z","title":"Adversarial Edit Attacks for Tree Data","version":2},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-14T11:21:40.045577Z"},"links":{"citing_paper":"/paper/1908.09364"},"observation_digest":"sha256:af4de4813652caa3b969fb58c7503f25aeba0c40a77f1c77e0992e8b1d48b4a6","observation_id":"cfb5bd9f-df87-4d2c-97de-16c4322f7182","resolution":{"observed_at":"2026-08-14T11:21:40.045577Z","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-14T11:21:40.031720Z","title":"Philip Bille","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.09364","last_updated":"2019-08-27T07:53:03Z","snapshot_observed_at":"2026-08-14T11:11:39.258923Z","submitted_at":"2019-08-25T17:20:15Z","title":"Adversarial Edit Attacks for Tree Data","version":2},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-14T11:21:40.031720Z"},"links":{"citing_paper":"/paper/1908.09364"},"observation_digest":"sha256:76d26ebe69299ca8a45a7ed8f62c9b310cccaf0bf9b6d2e3c0304a26453d0adc","observation_id":"dbfc7631-8e4b-4572-81fd-cb2d97bcc62d","resolution":{"observed_at":"2026-08-14T11:21:40.031720Z","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-14T11:21:40.699708Z","title":"8 Nicholas Carlini and David Wagner","venue":null,"work_id":"4ef57e24-6f52-4588-84d6-47edeaeaa553","year":2018},"citing_paper":{"arxiv_id":"1908.09364","last_updated":"2019-08-27T07:53:03Z","snapshot_observed_at":"2026-08-14T11:11:39.258923Z","submitted_at":"2019-08-25T17:20:15Z","title":"Adversarial Edit Attacks for Tree Data","version":2},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-14T11:21:40.053101Z"},"links":{"citing_paper":"/paper/1908.09364"},"observation_digest":"sha256:9b87d0e76a5118414696f08d29bda38ced6db63000f726e95b888dd24b6fac29","observation_id":"3f04d8b3-1e8b-46cc-be55-699738d2983e","resolution":{"observed_at":"2026-08-14T11:21:40.705749Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.09364","last_updated":"2019-08-27T07:53:03Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T11:11:39.258923Z","submitted_at":"2019-08-25T17:20:15Z","title":"Adversarial Edit Attacks for Tree Data"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":11,"verified_exact":3,"verified_fuzzy":2},"total_outbound_references":17},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 0 inbound Pith citation observations for arXiv:1908.09364."}