{"as_of":"2026-08-10T02:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8d732cc79d7431833bc10b1e07634d05a4c4983ca01b1fed0c446441097c481b","coverage":[{"denominator":69,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":69,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T13:13:26.390358Z","state":"measured"},{"denominator":69,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":69,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2606.10264/citation-record","integrity":"/paper/2606.10264/integrity","json":"/paper/2606.10264/citation-record.json","paper":"/paper/2606.10264"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T13:13:26.390358Z","title":"Few-shot training llms for project-specific code-summarization","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:e3df086339521998e4f8b514b2073de351f75f2e6523165ccf5ad249789c21c1","observation_id":"1eb238d7-07d1-4b05-a046-fe70219dabeb","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Automatic semantic augmentation of language model prompts (for code summarization)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:06fe7f4885836abb72aaed4851dfc66f4d604f40a0d709428030195327eac9f3","observation_id":"70245449-d3ff-4409-b47f-8b09f50a6e09","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Computational verification of c protocol implementations by symbolic execution","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:5ec70f51667448177ec74a1b3c857361390b007ff5124daf21c94d81bb3d2aa9","observation_id":"7cddeb78-c144-413d-a274-ead292327be5","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Androzoo: Collecting millions of android apps for the research community","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:9f044b0a99b3283f605a89e938117c44e7841c5e6182e21acdac962dd734efaa","observation_id":"28cffb7f-f948-4013-9ae7-556212855179","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Jpf–se: A symbolic execution extension to java pathfinder","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:f137bfe79420063fa237b011e4b960c82ff6c076e0439961d87609289d096faa","observation_id":"96958593-4fcf-45e3-ae0e-f65694f72abc","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Flowdroid: Precise context, flow, field, object- sensitive and lifecycle-aware taint analysis for android apps.ACM sigplan notices, 49(6):259–269, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:a8ddc7f2619409b26d202353e7b18f30063038380a5c16abf0a9be00eb05da6f","observation_id":"0c80ce26-c99f-41f9-b169-edfacc64cc8b","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Static analysis as a feedback loop: Enhancing llm-generated code beyond correctness","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:797189d2403f2f087672c154546e3ecec99b604a2b64d8d1563e2421db3982c1","observation_id":"295e0516-d52b-4ffc-a89e-34ad25b15d30","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Iterative distribution-aware sampling for probabilistic symbolic execution","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:c5798d9a680f98be7626958e70b968f8c5823c28cfb0ef2ad83e26e957e615bf","observation_id":"233d405d-ac21-461c-a6ce-a9a1739e07da","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Constraint normalization and parameterized caching for quantitative program analysis","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:9f0c858664fe7f823d5a2c7212fdb0d739fcea731cde34955e0bb55cd7982592","observation_id":"b49f18a8-e040-44e8-9a83-0bcf84972c27","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Machine learning steered symbolic execution framework for complex software code.Formal Aspects of Computing, 33(3):301–323, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:13fac8bdaeb01f0214bf417214a69c4e8fd511b06f5be0ac628b0efcb149364e","observation_id":"a1d2379b-4259-4988-a75a-2af7fbae8dc1","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Sym- bolic execution for software testing in practice: preliminary assess- ment","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:eb66c1e6edb9bf9872532bbbec59a11fc57a62d73d97a89b53962a0480402726","observation_id":"d60bf9bc-f13c-4701-8cd0-b5d2df2c1668","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Klee symbolic execution engine in 2019.International Journal on Software Tools for Technology Transfer, 23(6):867–870, 2021","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:aca01348ee1c13af7ea7b97c6172c9d6e742550e3866568517ef3de93eb86554","observation_id":"ade16dc9-8c18-4380-a14b-72de0bde3e39","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Analyzing semantic correctness with symbolic execution: A case study on pkcs# 1 v1","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:e0174e796f1b369a16a4bf9b43e6517b0ecacfc4e3851d8c2b37d09e011be179","observation_id":"f90585a8-75f3-4707-a806-5a42375d26f8","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Simulation-directed invariant mining for software verification","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:28049947ecbef183f87031c2a9a2b454366b4f004972c203dcaa4edda82b5af1","observation_id":"2753b74c-46fc-48f4-8edb-a1f8e137eabe","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Counterexample-guided abstraction refinement","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:b86778eaf7a8117a4c8af0f9aab17ca17b6991ba916164f365927b38b5d28db9","observation_id":"b93f4ceb-612d-4cef-83de-af4c40c6f043","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Dytan: a generic dynamic taint analysis framework","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:58d591e60e2b3337106176e9c127aa14f14c0011f3eae908b790441d065b19e8","observation_id":"08fb20d0-00d9-4323-962a-1a372ea676d7","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Abstract interpretation.ACM Computing Surveys (CSUR), 28(2):324–328, 1996","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:a01e8c9189ac6d7b4836950d47a4d9b875a8379ec4a0a6918ce80df9d0d9d3e5","observation_id":"13ba1124-112f-40c7-a1fd-fa8ee3a495e8","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints","venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:66b806f4091de6cc3039e3ab72159a6b850001db87d35e46fa824f55fd20ff14","observation_id":"facf55f6-8886-4f16-92c5-c2fc4fa6a69e","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Abstract interpretation: past, present and future","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:bdb20ff5d9af4b1a91168c00073d287d5010d01072d42d699bcbd9fe75fdf5ce","observation_id":"71be4154-603a-44e1-acd7-de49e5e3a237","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Frama-c: A software analysis perspective","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:713f2aa457f52ca32c512554c63c45fdbcd5dab9ffe32eee524dbaab3d094e7f","observation_id":"95b69c71-5e63-42f3-a48c-7775d53b0b37","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Binsec/rel: Efficient relational symbolic execution for constant-time at binary- level","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:f4a7905176ccfeb4c8cab748ffc0b7bab07f9cc3d09b678ad129c643417cb867","observation_id":"8de9c327-f122-45bf-963f-7a2c1dc36c66","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Solving complex path conditions through heuristic search on induced polytopes","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:7532c046372f416641528bf7251c8f8f8c6b42721ea0b94a1471d6a4d2381f76","observation_id":"9903186b-349a-4e58-9b1a-7505a8f24fa0","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Exposing the rat in the tunnel: Using traffic analysis for tor-based malware detection","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:a7403f98f1c8f3ed0d321aa3df554b5e758ac3cb9831ef9940dc135234306be7","observation_id":"590eef34-8968-4c99-90c0-1eb4004ee3bc","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"F-droid: Free and open source android app reposi- tory","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:347dc7be004a4a500a16ba441973f9f6faf9409f591f3ff1a6ebbfd26b9716e3","observation_id":"e7ac86de-87a8-4586-9f6f-9df6e411f519","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Android testing via synthetic symbolic execution","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:cf7f5094fc4166fcecb789e375a89eeb95c78b244d6a3aaf8f63ea9ffd1fe0db","observation_id":"400f89d3-d2ac-418c-a03c-35d16273e0a3","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Adver- sities in abstract interpretation-accommodating robustness by abstract interpretation.ACM Transactions on Programming Languages and Systems, 46(2):1–31, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:eae4ba4943fff804da3f06ede0c78b54cdd63ff2e0ce4056ffba5d5bdcca5c02","observation_id":"5114b036-4e13-4a50-8a16-9fbc9c44dc5e","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Dart: Directed au- tomated random testing","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:801296b60b646f3d3f01d311caadd40f1ee00ccd597c416d9e75b5b60223dfbe","observation_id":"f2c48e99-968e-4cbd-8148-52ff6dbb2218","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Program analysis as constraint solving","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:23ef607521c52bd43e32eb294e6d63cca86b77bc325722b0fb8bc964a80ecd77","observation_id":"231f340e-24f8-4f2d-8d27-6148b1a096da","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"When to stop? towards efficient code generation in llms with excess token prevention","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:28f25adb466c3282eaaae4cd0959abd58e45f924acc83503d679d9954868cb2c","observation_id":"5258fa34-9f84-455a-9277-bdbec443fdbc","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Lazy counterfactual symbolic execution","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:e634a61e0d552f1c17691921ae5021b74855bee7fe2c5031daa6133450b10683","observation_id":"449a1d44-2a49-434f-bf82-9c99989c406a","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Learning to fuzz from symbolic execution with application to smart contracts","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:2112b3a4a573dc0f7a463fd45c055db97d3c3cb3d6153c2732e985de8f3ca87e","observation_id":"a2593a2e-cb52-4b62-a875-1533c5cbc167","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Learning to explore paths for symbolic execution","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:5fb572e634e6b16aa0fba7b662a2343804f1245c4b8991c72700fc39a9a83222","observation_id":"4a5430f2-b747-46e7-b1cf-d94c6119ee74","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Model execution tracing: a sys- tematic mapping study.Software and Systems Modeling, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:01e6f0dd03506002b7232167d0e124946cdac3e8f230e492c2317a8b2ccef7fe","observation_id":"f308f65c-7b94-4845-abb4-d49d4e9e97eb","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Enhancing reuse of constraint solutions to improve symbolic execution","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:08d8778f33f952bef9c50132823125762aea3c0f3e304d8029e6d0faf6544033","observation_id":"5c3df971-5039-4272-bdd9-b68c954966af","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Neurlux: dynamic malware analysis without feature engineering","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:3fbfa3b924512f885daaebaff813610dd4b6532e2d9e973f3e7f01a5202603d1","observation_id":"61215f02-2ffe-4844-86d6-9beb992bacd9","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Codellm-devkit: A framework for contextualizing code llms with program analysis insights","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:150783a96e3042b23b5574b47e00f565424a4509cba2c0cc9d03528c4cd9b15e","observation_id":"4321c9f2-e57f-42d4-9a2c-de17ebc5d9f3","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Abstract execution: A technique for efficiently tracing programs.Software: Practice and Experience, 20(12):1241–1258, 1990","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:0a99c58f92258f6af8b5cd99609e3bbc8792ddcae7744784d544f75d87fd4544","observation_id":"2755abef-24b3-4704-92d9-5325e0b31020","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Mining temporal properties of data invariants","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:e36670fd6ad56ece7940cd17e62788cf7bc7dd41b575b244b3b4fbdfc819328a","observation_id":"bf51546e-8a18-435b-a6fc-951d602d4fbb","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.13918","last_updated":"2024-12-19T20:05:59Z","snapshot_observed_at":"2026-08-04T18:03:55.294756Z","submitted_at":"2024-07-18T22:06:20Z","title":"Revisiting Concept Drift in Windows Malware Detection: Adaptation to Real Drifted Malware with Minimal Samples","version":2},"cited_work":{"arxiv_id":"2407.13918","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.13918","snapshot_observed_at":"2026-07-03T05:27:40.312845Z","title":"arXiv preprint arXiv:2407.13918 (2024)","venue":null,"work_id":"6186d328-b9ca-4ab4-8ad4-f12e1bb8858b","year":2024},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"cited_paper":"/paper/2407.13918","citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:77fae3018204a149e22ed1ff0bb372d9400c5d32bd0c44f149934e2b7e2d06ec","observation_id":"1e8bbf49-410f-41ba-870a-c5be9db60b89","resolution":{"observed_at":"2026-07-03T05:27:40.314478Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06-27T13:13:26.390358Z","title":"Foredroid: Scenario-aware analysis for android malware detection and explanation","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:863641fbfde5ab43138924b0735d23d0e7136f70e2f00ff1650ecc6783517e6d","observation_id":"63de247e-b12d-4be4-a672-6faf4b6202f5","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Symbolic execution of complex program driven by machine learning based constraint solving","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:578c8819ebda865b6841a76d81c2bcd7391c97ccb5a337e378527cd8bcfa61c6","observation_id":"0e352d05-1938-48b8-bc33-e88e9b245200","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Mining invariants from console logs for system problem detection","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:21eaa017e16b9fa621e4690f1f2c13d41ea41f6ecc1044fec38b28367f7efaa5","observation_id":"31a55021-7fcb-41cf-bac2-1e53602f2e62","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"System service call- oriented symbolic execution of android framework with applications to vulnerability discovery and exploit generation","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:1d3cb8e5c3c16fa3813f63af8181f778b35ffed5cbcb34a5813274077e087550","observation_id":"8a6d7ee5-b6fc-486e-9ee8-7f8967965664","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Type-constrained code generation with language models.Proceedings of the ACM on Programming Languages, 9(PLDI):601–626, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:5b63a9ef63098ef4b08b0f6526524a1630296795ed5241e2987b2e0e8c1eb59b","observation_id":"74ddf937-ec7f-4ff7-8916-cb1c51bed028","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Using an llm to help with code un- derstanding","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:d96a379ff24aace4f703a63739cc43eb6a1cb480fd5b15bfcdc9361be8b9880d","observation_id":"f55eb50c-a5ab-4af0-b033-e9e7e4cde4dd","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Dynamic taint analysis for automatic detection, analysis, and signaturegeneration of exploits on commodity software","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:58dffc1058a85f71eaca71c5dda5ff76c108fb09c70e242578a7df2f0de83ece","observation_id":"ec68472d-3d4a-46a9-97cf-9e4dc84c26a1","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Symbolic execution and recent applications to worst-case execution, load testing, and security analysis.Advances in Computers, 113:289–314, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:b038a3d9848182f5a5448f2d92207c34543d116a4ae14c0e3bf15dd800f343c5","observation_id":"c0d5f5e8-772a-47f4-8888-e2cdd08c4893","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Symbolic pathfinder: inte- grating symbolic execution with model checking for java bytecode analysis.Automated Software Engineering, 20(3):391–425, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:8348304176fc49478a72c2d3dd9d56e8df8985187c141623b56246fe41f1af46","observation_id":"322fb888-8ab8-4114-86ee-34632cfbcc0c","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Enhancing symbolic execution of heap-based pro- grams with separation logic for test input generation","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:c760f1f5ac579aca3514cb8bb7faeb971886fc31ee646284f2d80c4693c3886f","observation_id":"50fa71d2-d64e-4d7c-80b5-b15db5ffbf39","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Symbolic execution with SymCC: Don’t interpret, compile! In29th USENIX Security Symposium (USENIX Security 20), pages 181–198","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:33c35a57e7406541c28c7f0e356bcbb29448f8e0b8fa39288a0e0a9a8573d9cd","observation_id":"bf13d950-bdff-4ffc-b6bd-8f485f9147ee","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Symqemu: Compilation- based symbolic execution for binaries","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:15ef26b20658fe099d6f5518bdedd9a06003f5343a9588645f922ccde522e679","observation_id":"95eb53e2-fed4-48de-b7f6-0132a0f8d6fb","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.10084","last_updated":"2019-08-27T08:50:17Z","snapshot_observed_at":"2026-07-06T08:17:05.681370Z","submitted_at":"2019-08-27T08:50:17Z","title":"Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks","version":1},"cited_work":{"arxiv_id":"1908.10084","doi":"10.48550/arxiv.1908.10084","metadata_source":"pith","pith_arxiv_id":"1908.10084","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks","venue":"cs.CL","work_id":"27adfcc9-2a67-43d6-a844-78309012411f","year":2019},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"cited_paper":"/paper/1908.10084","citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:1dd085e0d169ff0c61ac9269bca12144f0f602c0bc47995f7ee4bbab7ee1dbcf","observation_id":"34b6760b-de8e-4b8a-8871-5d6ee6c8b74a","resolution":{"observed_at":"2026-07-03T05:27:40.316854Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-07-12T06:19:15.148899+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T06:19:15.148899+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+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-06-27T13:13:26.390358Z","title":"Unmasking the veiled: A comprehen- sive analysis of android evasive malware","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:cc6df3d3283fbb562d728a250f775d92987b85b73de62986b9ea409c6393e2a9","observation_id":"ea258476-74d7-4601-9c9a-ad52ca709b09","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Cute and jcute: Concolic unit testing and explicit path model-checking tools: (tool paper)","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:0f76bf17300bf2d0a9b4d0e98cde9c23129f69f3233208ae5d4594a6d003c25d","observation_id":"61e6528d-cead-4080-8489-cc97e8b095de","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"SoK: (State of) The Art of War: Offensive Techniques in Binary Analysis","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:3ecccf26688965bf340db9abccd7aed9d942f54cdbc5643bee71a67bf883cb00","observation_id":"c2380cdf-b611-437a-89d1-25d92673e1e1","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Soot - a java bytecode optimization framework","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:380a35e018bb733e9b48a5472e7e71defb2e6dffc63e98687f842884bc5860e3","observation_id":"69958755-1bf8-404a-b657-8b406dfebbdc","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Virusshare malware repository","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:edbd8029fab0c681eab58dff832df24d1d4493d4a7adeffc6017a6062f988ee9","observation_id":"59051f65-5343-42e8-945f-e1a2f73f3dca","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Exploring large language models for semantic analysis and categorization of android malware","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:c4d9e9edb07d10b5e70a9d0853a950640349c22631dea23675945e50091d84b1","observation_id":"5e431690-725e-4782-9cac-1f46fcd0773b","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Testeval: Benchmarking large language models for test case generation","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:1fa7458dfd1dcff4a2a2558b11c40cee9179713b1ae5899260320962f6ebfcab","observation_id":"6dd72123-e0e2-40f3-bd2c-8cc43aad7798","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Symgx: Detecting cross-boundary pointer vulnerabilities of sgx applications via static symbolic execution","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:631a0f87c21b9ef9f9fe04aaa884ffa33406c8c4a8e6542ac22de3d8e96d4102","observation_id":"743911bf-de36-4432-8d1c-75f716346d1b","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Symbolic execution of obfus- cated code","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:8cb804204e0e4dc0b46a6c3a7063842e3f060c90fddb6621d2dd87d02a6fc679","observation_id":"0949baa7-6284-47e6-9145-d7652e27a534","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"A comprehensive evaluation of android icc resolution techniques","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:9a32bb0784cd1713bfd2a56c9fc6d0b244123e89694e84c407d357d3dadf004e","observation_id":"e5d73323-45af-473e-8589-22f360aa8577","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Empc: Effective path prioritization for symbolic execution with path cover","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:4e3216242437def5a4aa8c470567d537989cba4dc64cf6fd6a790c8917feca6f","observation_id":"7de1ae7c-35c3-4df1-a0ed-d5d2c9e88f81","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"A comprehensive survey on automatic text summarization with explo- ration of llm-based methods.Neurocomputing, page 131928, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:bce3a4aac890bbf295961dcb66c3a64bfb497b95820b2dfe0fe08ec4be76cd4b","observation_id":"1bb5f909-b6a5-41a2-91a5-254362d0913f","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Ferry: State-Aware symbolic execution for exploring State-Dependent program paths","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:d0547d46478c7ee7c62b661d2a55a4b3cd924412a13503070d110c647decb944","observation_id":"725ac11c-d3db-4f9b-bab7-0c7e8a9ba754","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"Analyze conditional statements in Android Jimple bytecode to determine execution constraints for target method reachability","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:e7d9a16758a9c366173c06403cdc087db556d481e33b2ff15b8ad6bef5be2198","observation_id":"41b7b7b9-cc39-4a54-b134-aa7884b723b1","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:865027b2becf4c9fc9483d74d43d99397bce8007b8d8aecc8a7bbdd6943fd8bc","observation_id":"286b451b-6225-416c-9503-68f4df7b15ed","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:f77d495abb11f818376bc003107e9862d11f748762b7fe1de52c2d759e130bbe","observation_id":"cae9b819-21b5-413e-98a9-07583d05f1a8","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","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-06-27T13:13:26.390358Z","title":"branch_direction","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-06-27T13:13:26.390358Z"},"links":{"citing_paper":"/paper/2606.10264"},"observation_digest":"sha256:bf4e6a9cd4038362e8313d6f1f380f1fc27e4061fdeefd00112aefbe92eb756c","observation_id":"7a744963-b96e-4085-9bc0-f60e9760b574","resolution":{"observed_at":"2026-06-27T13:13:26.390358Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.10264","last_updated":"2026-06-09T00:09:50Z","latest_version":1,"primary_category":"cs.CR","snapshot_observed_at":"2026-08-08T22:04:49.843848Z","submitted_at":"2026-06-09T00:09:50Z","title":"RECON: An LLM-Enhanced Backward Constraint Analysis Framework"},"reference_resolution":{"displayed":69,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":67,"verified_exact":2,"verified_fuzzy":0},"total_outbound_references":69},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 69 of 69 outbound references and 0 inbound Pith citation observations for arXiv:2606.10264."}