{"as_of":"2026-08-16T17:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:559b09e51b505d187a8fb888e1dde42252fc1b10e5e56367fb591cc2b315b9d6","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T15:03:33.147939Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"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.01979/citation-record","integrity":"/paper/1908.01979/integrity","json":"/paper/1908.01979/citation-record.json","paper":"/paper/1908.01979"},"outbound":[{"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:03:33.603258Z","title":"Table II demonstrated that the inferred HD values are within an error margin of one, except for self-loop transitions whose 0-HD values can be precisely identified","venue":null,"work_id":"6e7fcbc5-d842-4f9a-b446-f0dcdfa28166","year":null},"citing_paper":{"arxiv_id":"1908.01979","last_updated":"2019-08-06T06:47:37Z","snapshot_observed_at":"2026-08-16T12:02:59.101440Z","submitted_at":"2019-08-06T06:47:37Z","title":"Non-Invasive Reverse Engineering of Finite State Machines Using Power Analysis and Boolean Satisfiability","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T15:03:33.023332Z"},"links":{"citing_paper":"/paper/1908.01979"},"observation_digest":"sha256:0b328a4413d73fc29349eed2f18d9a0c4fe6395a68bee7888a7128e62a6b4d6d","observation_id":"03bf6fdd-4fd9-441c-8d7c-62a54474c1db","resolution":{"observed_at":"2026-08-14T15:03:33.610272Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:03:33.584415Z","title":"Therefore, for any two transitions resulting in different outputs, it can be inferred that their resulting states are distinct from one another","venue":null,"work_id":"fd6830dc-1e9f-4416-81c0-b70fac92b01c","year":null},"citing_paper":{"arxiv_id":"1908.01979","last_updated":"2019-08-06T06:47:37Z","snapshot_observed_at":"2026-08-16T12:02:59.101440Z","submitted_at":"2019-08-06T06:47:37Z","title":"Non-Invasive Reverse Engineering of Finite State Machines Using Power Analysis and Boolean Satisfiability","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T15:03:33.032526Z"},"links":{"citing_paper":"/paper/1908.01979"},"observation_digest":"sha256:40ce7f5e60cd70d28878ed7a4bd08e3ac7a6a572804b7687c897b3b19797880b","observation_id":"e4566a27-eff8-4b2f-9bee-f5130686e05e","resolution":{"observed_at":"2026-08-14T15:03:33.590607Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:03:33.562241Z","title":null,"venue":null,"work_id":"d30a362d-511e-4ebb-8e99-7424245137f8","year":null},"citing_paper":{"arxiv_id":"1908.01979","last_updated":"2019-08-06T06:47:37Z","snapshot_observed_at":"2026-08-16T12:02:59.101440Z","submitted_at":"2019-08-06T06:47:37Z","title":"Non-Invasive Reverse Engineering of Finite State Machines Using Power Analysis and Boolean Satisfiability","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T15:03:33.043528Z"},"links":{"citing_paper":"/paper/1908.01979"},"observation_digest":"sha256:c570fe96b43b68747d871f18ebd61b70cc247c0ca0784348f5876cee8e946631","observation_id":"c2c8ccb4-e95c-4f93-b0ed-c9acb74a12dd","resolution":{"observed_at":"2026-08-14T15:03:33.568288Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:03:33.544067Z","title":"For example, benchmarks lion, train4 s8 have more than 50% of their total transitions as self- loops and converge faster than other machines of similar size","venue":null,"work_id":"7051dd82-c348-4ce2-b079-f1a2df068141","year":null},"citing_paper":{"arxiv_id":"1908.01979","last_updated":"2019-08-06T06:47:37Z","snapshot_observed_at":"2026-08-16T12:02:59.101440Z","submitted_at":"2019-08-06T06:47:37Z","title":"Non-Invasive Reverse Engineering of Finite State Machines Using Power Analysis and Boolean Satisfiability","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T15:03:33.051095Z"},"links":{"citing_paper":"/paper/1908.01979"},"observation_digest":"sha256:8f6b366fe73e35e7f582108a34bf7b934bdcf000d49108da08bae3f68e751948","observation_id":"7aaf90b2-7665-481f-b977-ccf0a208f6d2","resolution":{"observed_at":"2026-08-14T15:03:33.550009Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:03:33.523157Z","title":"Fewer state pairs with dissimilar outputs lead to a smaller set of state-output based constraints","venue":null,"work_id":"07aa4961-73dd-4c08-b5bb-be5250a380e1","year":null},"citing_paper":{"arxiv_id":"1908.01979","last_updated":"2019-08-06T06:47:37Z","snapshot_observed_at":"2026-08-16T12:02:59.101440Z","submitted_at":"2019-08-06T06:47:37Z","title":"Non-Invasive Reverse Engineering of Finite State Machines Using Power Analysis and Boolean Satisfiability","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T15:03:33.058258Z"},"links":{"citing_paper":"/paper/1908.01979"},"observation_digest":"sha256:4d37762420f637d28548bf6d5b2450be7158adea6762347d76556c79f5c46bdf","observation_id":"c68ffc0c-7af6-44ae-bcad-d21f5fe89c67","resolution":{"observed_at":"2026-08-14T15:03:33.529953Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:03:33.500983Z","title":"4: Recovery Percentage in One Round for Test Vector Size 100 and 1000 more time to converge with an increase in the number of bit vector variables and constraints","venue":null,"work_id":"00bb12e0-5b0a-45f2-a0dc-bdeacc229bd0","year":null},"citing_paper":{"arxiv_id":"1908.01979","last_updated":"2019-08-06T06:47:37Z","snapshot_observed_at":"2026-08-16T12:02:59.101440Z","submitted_at":"2019-08-06T06:47:37Z","title":"Non-Invasive Reverse Engineering of Finite State Machines Using Power Analysis and Boolean Satisfiability","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T15:03:33.065219Z"},"links":{"citing_paper":"/paper/1908.01979"},"observation_digest":"sha256:109be68b6bdeb07a7df49e842d1fd9f503035a3358de02a3f26dc41defa0fd15","observation_id":"0533cf04-22ae-454a-ad9e-8d6b474eacf4","resolution":{"observed_at":"2026-08-14T15:03:33.507307Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:03:33.481670Z","title":"Torrance and D","venue":null,"work_id":"f3861c68-50d6-4ffa-9be0-a9717a42d8ee","year":2011},"citing_paper":{"arxiv_id":"1908.01979","last_updated":"2019-08-06T06:47:37Z","snapshot_observed_at":"2026-08-16T12:02:59.101440Z","submitted_at":"2019-08-06T06:47:37Z","title":"Non-Invasive Reverse Engineering of Finite State Machines Using Power Analysis and Boolean Satisfiability","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T15:03:33.072399Z"},"links":{"citing_paper":"/paper/1908.01979"},"observation_digest":"sha256:47ce8305c2ed555c2cf726cfdfe4fb7ec79b8eaaab365ffbfce93abb740bd2e7","observation_id":"062c2bf7-7b0a-4669-8e01-f001324fd3ec","resolution":{"observed_at":"2026-08-14T15:03:33.487491Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:03:33.462616Z","title":null,"venue":null,"work_id":"5ae64096-d502-4cb0-8643-c2fa137de22a","year":2013},"citing_paper":{"arxiv_id":"1908.01979","last_updated":"2019-08-06T06:47:37Z","snapshot_observed_at":"2026-08-16T12:02:59.101440Z","submitted_at":"2019-08-06T06:47:37Z","title":"Non-Invasive Reverse Engineering of Finite State Machines Using Power Analysis and Boolean Satisfiability","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T15:03:33.078096Z"},"links":{"citing_paper":"/paper/1908.01979"},"observation_digest":"sha256:61eaf870297a40005f9bcf3eb2f87ed71c0f91f53fa845d016d5daacf1de4875","observation_id":"b6f83388-5571-4127-a225-514b6d34f5f5","resolution":{"observed_at":"2026-08-14T15:03:33.467482Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:03:33.440347Z","title":null,"venue":null,"work_id":"1361ec57-b5a5-4c98-8293-c50167108e00","year":2006},"citing_paper":{"arxiv_id":"1908.01979","last_updated":"2019-08-06T06:47:37Z","snapshot_observed_at":"2026-08-16T12:02:59.101440Z","submitted_at":"2019-08-06T06:47:37Z","title":"Non-Invasive Reverse Engineering of Finite State Machines Using Power Analysis and Boolean Satisfiability","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T15:03:33.083717Z"},"links":{"citing_paper":"/paper/1908.01979"},"observation_digest":"sha256:a4eed5a11d5155411b0bcee00e38f20c6669e74f38f647bdf5c7c9881c67a20b","observation_id":"d5469d1e-2297-4242-9b6f-fe1ff5be2328","resolution":{"observed_at":"2026-08-14T15:03:33.447158Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:03:33.417917Z","title":null,"venue":null,"work_id":"072d88c7-87bd-4d22-abab-bb9102a2ae5c","year":2001},"citing_paper":{"arxiv_id":"1908.01979","last_updated":"2019-08-06T06:47:37Z","snapshot_observed_at":"2026-08-16T12:02:59.101440Z","submitted_at":"2019-08-06T06:47:37Z","title":"Non-Invasive Reverse Engineering of Finite State Machines Using Power Analysis and Boolean Satisfiability","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T15:03:33.089374Z"},"links":{"citing_paper":"/paper/1908.01979"},"observation_digest":"sha256:c4640293eaba51890b9277220972c684e5a1ab9f1620aec6a4078a3aeca81c5f","observation_id":"38816fce-06c7-4bac-8a38-31f4922a0c5c","resolution":{"observed_at":"2026-08-14T15:03:33.424132Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:03:33.396231Z","title":null,"venue":null,"work_id":"09de2a58-ad7e-4f83-acbb-c21b7a10e4d1","year":1999},"citing_paper":{"arxiv_id":"1908.01979","last_updated":"2019-08-06T06:47:37Z","snapshot_observed_at":"2026-08-16T12:02:59.101440Z","submitted_at":"2019-08-06T06:47:37Z","title":"Non-Invasive Reverse Engineering of Finite State Machines Using Power Analysis and Boolean Satisfiability","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T15:03:33.095732Z"},"links":{"citing_paper":"/paper/1908.01979"},"observation_digest":"sha256:cbfbfec585420e0da1029ad09dd4fc219deb57ef5b56802b9f4d7fd6e1410a40","observation_id":"f1229912-dc1f-49bd-b6bd-67a5ac99bfe2","resolution":{"observed_at":"2026-08-14T15:03:33.402418Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:03:33.375920Z","title":"Brutscheck, Systematic analysis of unknown integrated circuits (Doc- toral Thesis), Dublin Institute of Technology, 2009","venue":null,"work_id":"db8cd1cc-0bc3-449f-9fa6-1a28567693e0","year":2009},"citing_paper":{"arxiv_id":"1908.01979","last_updated":"2019-08-06T06:47:37Z","snapshot_observed_at":"2026-08-16T12:02:59.101440Z","submitted_at":"2019-08-06T06:47:37Z","title":"Non-Invasive Reverse Engineering of Finite State Machines Using Power Analysis and Boolean Satisfiability","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T15:03:33.100856Z"},"links":{"citing_paper":"/paper/1908.01979"},"observation_digest":"sha256:fdc6726fd598cea9cdc809bf951239447b12222c3061177912ed5159a7dfd196","observation_id":"95cd089f-cf83-4680-8eb4-5065e974242f","resolution":{"observed_at":"2026-08-14T15:03:33.382131Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:03:33.355951Z","title":"Brutscheck, B","venue":null,"work_id":"b7b3915c-f6b4-43cd-8003-c0e1675e9020","year":2009},"citing_paper":{"arxiv_id":"1908.01979","last_updated":"2019-08-06T06:47:37Z","snapshot_observed_at":"2026-08-16T12:02:59.101440Z","submitted_at":"2019-08-06T06:47:37Z","title":"Non-Invasive Reverse Engineering of Finite State Machines Using Power Analysis and Boolean Satisfiability","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T15:03:33.106555Z"},"links":{"citing_paper":"/paper/1908.01979"},"observation_digest":"sha256:27807ba2be0af5aab8a173615134086d9035b3f993400152324d5c53a37a0f50","observation_id":"941b34a4-0c31-47cd-8f64-0984c9eeaa46","resolution":{"observed_at":"2026-08-14T15:03:33.361462Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:03:33.331479Z","title":"Smith, A non-destructive analysis method for integrated circuit-based finite state machines (Doctoral Thesis), Washington State University, 2016","venue":null,"work_id":"92520948-f6a0-4d41-89af-45f633231110","year":2016},"citing_paper":{"arxiv_id":"1908.01979","last_updated":"2019-08-06T06:47:37Z","snapshot_observed_at":"2026-08-16T12:02:59.101440Z","submitted_at":"2019-08-06T06:47:37Z","title":"Non-Invasive Reverse Engineering of Finite State Machines Using Power Analysis and Boolean Satisfiability","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T15:03:33.112019Z"},"links":{"citing_paper":"/paper/1908.01979"},"observation_digest":"sha256:af07cde6b4f95c668446bd1b27763b3d5e1def2a68383d15f875f36b205e975d","observation_id":"2d724e89-68f5-4df7-8a5e-a24c3e3761be","resolution":{"observed_at":"2026-08-14T15:03:33.338490Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:03:33.296681Z","title":"Smith, ”Non-destructive state machine reverse engineering,” in 2013 6th International Symposium on Resilient Control Systems (ISRCS), San Franscisco, 2013","venue":null,"work_id":"176685c4-3fb5-4b17-8485-d0dbcddf1a1c","year":2013},"citing_paper":{"arxiv_id":"1908.01979","last_updated":"2019-08-06T06:47:37Z","snapshot_observed_at":"2026-08-16T12:02:59.101440Z","submitted_at":"2019-08-06T06:47:37Z","title":"Non-Invasive Reverse Engineering of Finite State Machines Using Power Analysis and Boolean Satisfiability","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T15:03:33.117049Z"},"links":{"citing_paper":"/paper/1908.01979"},"observation_digest":"sha256:089093831cebedcebbeb9ee6bb8a72fa95e5956fb60453bbcbe0c78998c45650","observation_id":"a06a547d-2e1e-4c61-866b-a25053a4507c","resolution":{"observed_at":"2026-08-14T15:03:33.304126Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:03:33.275357Z","title":"Kocher, J","venue":null,"work_id":"46d7315b-b33c-4d0d-97cd-8887c00be40e","year":1999},"citing_paper":{"arxiv_id":"1908.01979","last_updated":"2019-08-06T06:47:37Z","snapshot_observed_at":"2026-08-16T12:02:59.101440Z","submitted_at":"2019-08-06T06:47:37Z","title":"Non-Invasive Reverse Engineering of Finite State Machines Using Power Analysis and Boolean Satisfiability","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T15:03:33.124065Z"},"links":{"citing_paper":"/paper/1908.01979"},"observation_digest":"sha256:8cb9c616131e82796aac38ea026ec78abbd8704c7c1ea20524b113a5a0836dd5","observation_id":"335b1a34-d56c-49e3-8dc3-a04c052c6a38","resolution":{"observed_at":"2026-08-14T15:03:33.281034Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:03:33.256437Z","title":"Mangard, E","venue":null,"work_id":"7771a10b-c1c8-4366-b6dd-08721164378c","year":2007},"citing_paper":{"arxiv_id":"1908.01979","last_updated":"2019-08-06T06:47:37Z","snapshot_observed_at":"2026-08-16T12:02:59.101440Z","submitted_at":"2019-08-06T06:47:37Z","title":"Non-Invasive Reverse Engineering of Finite State Machines Using Power Analysis and Boolean Satisfiability","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T15:03:33.134347Z"},"links":{"citing_paper":"/paper/1908.01979"},"observation_digest":"sha256:851d905be955760291b88306ff3ee3d560748e57168834fd4987374f2cb685d0","observation_id":"f6a7b4e9-4d84-47cc-ae9b-aee7c96a7e99","resolution":{"observed_at":"2026-08-14T15:03:33.261453Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:03:33.232324Z","title":"Yang, ”Logic Synthesis and Optimization Benchmarks User Guide Version 3.0,” Technical Report 1991-IWLS-UG-Saeyang, MCNC, Mi- croelectronics Center of North Carolina, 1991","venue":null,"work_id":"440b05a8-5a71-47ae-b136-5f17c4abc497","year":1991},"citing_paper":{"arxiv_id":"1908.01979","last_updated":"2019-08-06T06:47:37Z","snapshot_observed_at":"2026-08-16T12:02:59.101440Z","submitted_at":"2019-08-06T06:47:37Z","title":"Non-Invasive Reverse Engineering of Finite State Machines Using Power Analysis and Boolean Satisfiability","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T15:03:33.141366Z"},"links":{"citing_paper":"/paper/1908.01979"},"observation_digest":"sha256:7d8c9173b5cc315e3da71c96f987e8a43f449df1d0f09b24514ebeb494dd6e3a","observation_id":"857feb8e-52f6-4c41-8d0e-faec2e383de2","resolution":{"observed_at":"2026-08-14T15:03:33.239205Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:03:33.209626Z","title":null,"venue":null,"work_id":"83013786-0992-4a8a-926f-4e80670b498e","year":2008},"citing_paper":{"arxiv_id":"1908.01979","last_updated":"2019-08-06T06:47:37Z","snapshot_observed_at":"2026-08-16T12:02:59.101440Z","submitted_at":"2019-08-06T06:47:37Z","title":"Non-Invasive Reverse Engineering of Finite State Machines Using Power Analysis and Boolean Satisfiability","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T15:03:33.147939Z"},"links":{"citing_paper":"/paper/1908.01979"},"observation_digest":"sha256:212b68224b43a49dbbb07a5bd15beb62e1a1924cfa00c32286cd9a49580e2949","observation_id":"593afa74-d654-43be-a6f0-179ebc748319","resolution":{"observed_at":"2026-08-14T15:03:33.219408Z","resolver_source":"raw_fallback","status":"unresolved"},"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.01979","last_updated":"2019-08-06T06:47:37Z","latest_version":1,"primary_category":"eess.SY","snapshot_observed_at":"2026-08-16T12:02:59.101440Z","submitted_at":"2019-08-06T06:47:37Z","title":"Non-Invasive Reverse Engineering of Finite State Machines Using Power Analysis and Boolean Satisfiability"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":0,"verified_fuzzy":13},"total_outbound_references":19},"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 19 of 19 outbound references and 0 inbound Pith citation observations for arXiv:1908.01979."}