{"as_of":"2026-08-07T07:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4e15d0e4248d604ca38ad8ba517a6286c91fbb6b2342c521e6d569eb8d13e971","coverage":[{"denominator":68,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":68,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T14:49:09.228049Z","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-07T06:34:17.273281+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-13T02:55:15.819959Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.23449","snapshot_observed_at":"2026-07-13T02:55:15.819959Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.09452","last_updated":"2026-07-10T14:22:30Z","snapshot_observed_at":"2026-08-06T06:51:25.935991Z","submitted_at":"2026-07-10T14:22:30Z","title":"Practical Source Code Recovery from Binary Functions Using Anchor-Based Retrieval and LLM Reasoning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-13T02:55:15.819959Z"},"links":{"cited_paper":"/paper/2509.23449","citing_paper":"/paper/2607.09452"},"observation_digest":"sha256:cf086d6bc0263e3fd58345362cbd63b83b7f304a40af1b85c5da75a30a2ded90","observation_id":"9beaa4a5-5eb9-44b0-b0f8-a9229d9795a4","resolution":{"observed_at":"2026-07-13T02:55:15.819959Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2509.23449/citation-record","integrity":"/paper/2509.23449/integrity","json":"/paper/2509.23449/citation-record.json","paper":"/paper/2509.23449"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:01.279728Z","title":"Ghidra software reverse engineering framework, 2025-07-31","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:01.279728Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:f0a64c0ca497acffb9f80ed41df439c25141de24ce76db216c929f836a7bebfc","observation_id":"e26100ad-9a24-4398-a03f-cd1faeac94b2","resolution":{"observed_at":"2026-08-04T14:49:01.279728Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/wcre.2012.50","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Roy, and Juergen Rilling","venue":null,"work_id":"de3539b6-c749-416c-a4fb-a62076e1ac3b","year":2012},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:01.363280Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:717da4055ce46cc44eaadb6db7009f1f5443dd2fefe4732f1e03cf14706e28eb","observation_id":"58584180-3664-4ecf-be8c-2b5b8fe7e3a7","resolution":{"observed_at":"2026-08-04T14:53:32.413911Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:01.502339Z","title":"Beyond embeddings: Interpretable feature extraction for binary code similarity – artifact, 2025-08-","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:01.502339Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:b9c683da99d988cf9bf28ea8fec25ac4d27831434dab27236e7fcbbf6f4d09cf","observation_id":"a4e3740b-0d6c-4f35-8dbb-6c9e2f8f2a18","resolution":{"observed_at":"2026-08-04T14:49:01.502339Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:01.692102Z","title":"Fuzzing BusyBox: Leveraging LLM and crash reuse for em- bedded bug unearthing","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:01.692102Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:ecb403e4e01d24e58c639692a5e348220d49ff3bc4861d151ce5f8a995191888","observation_id":"63acbb41-bf36-4f11-a37a-f3dcd29564c2","resolution":{"observed_at":"2026-08-04T14:49:01.692102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:01.798782Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:01.798782Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:920067a92a99f059b5f0ec4584d1505e291cd36bb86b4f2de37c3b8d9f134bf9","observation_id":"0d2ddcf8-a608-436e-b32f-3b1900ab4c32","resolution":{"observed_at":"2026-08-04T14:49:01.798782Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:01.895933Z","title":"On the way to sboms: Investigating design issues and solutions in practice.ACM Trans","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:01.895933Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:a8aa941b3c49ecd9bf41a7b75c918db6275ac2c75cf9b50ca0f17d1482891165","observation_id":"88b37761-0793-4cdd-a5dc-aace8ad56efd","resolution":{"observed_at":"2026-08-04T14:49:01.895933Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.14165","last_updated":"2020-07-22T19:47:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-05-28T17:29:03Z","title":"Language Models are Few-Shot Learners","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.14165","snapshot_observed_at":"2026-08-04T14:49:02.016932Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:02.016932Z"},"links":{"cited_paper":"/paper/2005.14165","citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:32daf3e00c30fa7dc5b299f9e7d7a3c689c1f740e86f83854407cba894502f46","observation_id":"952c903b-38d9-4c3a-9454-33f79bab56f8","resolution":{"observed_at":"2026-08-04T14:49:02.016932Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:02.132046Z","title":"Model compression","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:02.132046Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:389f9b7ad377e43bc525be22fc41e4a9e73540e68f488be8a3c1b7d3289a1052","observation_id":"91d05fd4-5030-4a53-abdc-61d4ca9eadae","resolution":{"observed_at":"2026-08-04T14:49:02.132046Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:02.212328Z","title":"Openssl, 2025-08-05","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:02.212328Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:4d4b729fc0cb0edcf4772b54dd1551ec82f30ac5b75f5c27a4bfed43bfded37b","observation_id":"586e35a5-b9df-43fb-aa56-add3ac05756b","resolution":{"observed_at":"2026-08-04T14:49:02.212328Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:02.337819Z","title":"Mastering digital image alchemy, 2025-07-","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:02.337819Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:55257948034bd5aa9493a44c787a2bb2c81344623c60c3658d9a6c817faba597","observation_id":"f1d1c225-c391-4ab9-bde8-07f9ec21bebe","resolution":{"observed_at":"2026-08-04T14:49:02.337819Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:02.544036Z","title":"Firmup: Precise static detection of common vulnerabilities in firmware.SIGPLAN Not., 53(2):392–404, March 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:02.544036Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:fbfe18404d0c89414a49ecb15706d3ba2dccc66ea8128716d9b86d1559be7fd5","observation_id":"ff65957d-869c-480b-bbfa-bdd826abf549","resolution":{"observed_at":"2026-08-04T14:49:02.544036Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:02.673150Z","title":"Bert: Pre-training of deep bidi- rectional transformers for language understanding,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:02.673150Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:2fd658d73d7f7cd24dde5771ad7c5fd83c73cd4c50cb802b595ff493708cde26","observation_id":"c7613fa7-6ba4-4de6-9661-cd61fb7f69be","resolution":{"observed_at":"2026-08-04T14:49:02.673150Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:02.474254Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:02.474254Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:c460ad817b8a5b3641677d11aff32c66377e443bde4b3c86e5f0f180ebc707ec","observation_id":"2af22f72-5a62-46d3-9bfa-a50d81362f96","resolution":{"observed_at":"2026-08-04T14:49:02.474254Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:03.118708Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:03.118708Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:7d10bb7ba384cbbc1d3f6e86dc455cb2411589e5f2eb3305cddaf7444655c564","observation_id":"9aa8ca95-dd57-451a-aeb7-0f41b9e93243","resolution":{"observed_at":"2026-08-04T14:49:03.118708Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:03.224805Z","title":"Ding, Benjamin C.M","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:03.224805Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:677379561650590b410b28d107dd4f0bd039e1f11c80b88e7a556f78532456ac","observation_id":"ede88f3c-cf4d-41e6-b9d3-04c5039938bd","resolution":{"observed_at":"2026-08-04T14:49:03.224805Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:02.967045Z","title":"Coreutils - gnu core utilities, 2025-04-09","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:02.967045Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:804406d45447d26920fae795958498d0dd5cff7664092e8240b6269202a21634","observation_id":"716f4d49-09cc-421d-99a8-6478061d09c1","resolution":{"observed_at":"2026-08-04T14:49:02.967045Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:03.446224Z","title":"Blanket execution: Dynamic similarity testing for program binaries and components","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:03.446224Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:ddd760cc3a7e1db0a99c9b0f0c575a4507e52c09af7d3aefa969eaa23245016c","observation_id":"bfc6ced2-cfa5-4a78-8e0e-5868d0fa8dab","resolution":{"observed_at":"2026-08-04T14:49:03.446224Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:03.698773Z","title":"Large language models for code analysis: Do LLMs really do their job? In33rd USENIX Secu- rity Symposium (USENIX Security 24), pages 829– 846, Philadelphia, PA, August 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:03.698773Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:5140567778c9cee65b7c5d220f3b8d9c42937597c9233118d5c2f1c9c144354a","observation_id":"ebd489e0-f1a6-485f-a0cc-bdc736eafa59","resolution":{"observed_at":"2026-08-04T14:49:03.698773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:03.300603Z","title":"Graph-based comparison of ex- ecutable objects","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:03.300603Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:434ab33bd8fad04e982758448ee3651802e611a79ce75deecfd45a93234f18ea","observation_id":"252345a1-9c22-47aa-a93d-6485d5ecf00f","resolution":{"observed_at":"2026-08-04T14:49:03.300603Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2201.07420","last_updated":"2022-01-19T05:17:02Z","snapshot_observed_at":"2026-08-03T19:13:48.337870Z","submitted_at":"2022-01-19T05:17:02Z","title":"Cross-Language Binary-Source Code Matching with Intermediate Representations","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.07420","snapshot_observed_at":"2026-08-04T14:49:03.967600Z","title":"Cross- language binary-source code matching with intermedi- ate representations, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:03.967600Z"},"links":{"cited_paper":"/paper/2201.07420","citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:c17c56816065ade40d268eaa5788faea90e87d2b2373f58a76b8dc94321bf03a","observation_id":"007b718e-a94c-48d4-b443-a093f567df5b","resolution":{"observed_at":"2026-08-04T14:49:03.967600Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:04.052068Z","title":"Funcvul: An effective function level vul- nerability detection model using llm and code chunk,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:04.052068Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:b22f93f758f76eb83660da2cd99a15801629a50cde149881ece0d37dc76dab3c","observation_id":"22cf44ee-da7a-43ee-8029-1cab43360789","resolution":{"observed_at":"2026-08-04T14:49:04.052068Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:04.259092Z","title":"Code is not natural language: Unlock the power of Semantics-Oriented graph representation for binary code similarity detection","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:04.259092Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:1c9354f0a39bc7d75fb8fedcf095874e27eb4f5d99ec6b54409f12f40e04030d","observation_id":"f3a2f200-4faf-4429-9cac-6c610e635344","resolution":{"observed_at":"2026-08-04T14:49:04.259092Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3052973","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Extracting condi- tional formulas for cross-platform bug search","venue":null,"work_id":"7bf76d4b-568f-4a08-966f-63f3cc1e7585","year":2017},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:03.860379Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:31a1029fbb81433bcf258073bf285e0c8c2036bdea3eb4f38139cb99e50ab694","observation_id":"2f5d7854-cbcd-4513-b11f-d8121bc1e467","resolution":{"observed_at":"2026-08-04T14:53:31.584747Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:04.504824Z","title":"Richard Hipp","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:04.504824Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:8f113db6c129c313f198f215bd146348eed4dbfc9f033af5c6bb3b600dee72fb","observation_id":"dca5c9b6-71e7-4998-a566-bee1b0517686","resolution":{"observed_at":"2026-08-04T14:49:04.504824Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.12186","last_updated":"2024-11-12T13:24:25Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-09-18T17:57:57Z","title":"Qwen2.5-Coder Technical Report","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.12186","snapshot_observed_at":"2026-08-04T14:49:04.640798Z","title":"Qwen2.5- coder technical report, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:04.640798Z"},"links":{"cited_paper":"/paper/2409.12186","citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:2dbaeca31a84a92c09b01d89ba612c21cd5d4da56a81ffa5aad4b4239c5be3e4","observation_id":"bbdbde88-5cfd-4eca-af94-edc9f611633d","resolution":{"observed_at":"2026-08-04T14:49:04.640798Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:01.594432Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:01.594432Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:0fd8af7d31a3becec76ea101c56869d48c6bb986fb48b7fa4ec889564cb80b27","observation_id":"db4135e2-9466-474c-9e74-0029dab2c6ff","resolution":{"observed_at":"2026-08-04T14:49:01.594432Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:04.821660Z","title":"Scalable malware forensics using phy- logenetic analysis","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:04.821660Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:e151a8b8d483238b3e9c472eebb0d7866ea6b723743cfb517d8cdfc3842f3f34","observation_id":"ae2f3ce2-0d86-4067-8fe7-e507f3cbd137","resolution":{"observed_at":"2026-08-04T14:49:04.821660Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:04.379017Z","title":"Ida pro, 2025-02-28","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:04.379017Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:7a9083edf404113faba4bd155e86e63e4664ad617eaa0dc2beb5b30d5650723e","observation_id":"557ebe79-cabc-4a0c-9aa2-b8625ec28baf","resolution":{"observed_at":"2026-08-04T14:49:04.379017Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1405.4053","last_updated":"2014-05-22T23:23:19Z","snapshot_observed_at":"2026-07-06T03:43:52.929582Z","submitted_at":"2014-05-16T07:12:16Z","title":"Distributed Representations of Sentences and Documents","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1405.4053","snapshot_observed_at":"2026-08-04T14:49:05.054567Z","title":"Le and Tomas Mikolov","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:05.054567Z"},"links":{"cited_paper":"/paper/1405.4053","citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:132804a06cd84d25c85402805e454ecf4289520cf82e219301b849b45e59e5c6","observation_id":"b1fb3aa8-68c2-4129-88bb-2dc68651dc99","resolution":{"observed_at":"2026-08-04T14:49:05.054567Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:05.158208Z","title":"Understanding security risks of embedded devices through fine-grained firmware fingerprinting","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:05.158208Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:18ef41ae993f3bc57fcf7d61d8307da3b1da13de7e2b50f321437e2b7da4938c","observation_id":"45e6a6ce-809e-4f97-b19f-cd848b86c6e2","resolution":{"observed_at":"2026-08-04T14:49:05.158208Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:04.731564Z","title":"International Organization for Standardization, Geneva, Switzerland, February 2012","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:04.731564Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:24bba28c83506b84af81708f63a2954b4507c5936ae2eb7e71ed3b93d5c5a48c","observation_id":"fe26ede1-c66e-4ebc-a21c-3c7a5a0566ea","resolution":{"observed_at":"2026-08-04T14:49:04.731564Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:05.641242Z","title":"A structured self-attentive sentence embedding,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:05.641242Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:8e8c5e18c999d5c6b9430837a524c609920638a32959cd0b613c1cacb535bc4d","observation_id":"4301a5e5-d3d2-4aa4-b87b-eb5da1c8ecb6","resolution":{"observed_at":"2026-08-04T14:49:05.641242Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2001.08361","last_updated":"2020-01-23T03:59:20Z","snapshot_observed_at":"2026-07-06T08:52:12.656082Z","submitted_at":"2020-01-23T03:59:20Z","title":"Scaling Laws for Neural Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.08361","snapshot_observed_at":"2026-08-04T14:49:04.938009Z","title":"Brown, Benjamin Chess, Rewon Child, Scott Gray, Alec Radford, Jeffrey Wu, and Dario Amodei","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:04.938009Z"},"links":{"cited_paper":"/paper/2001.08361","citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:1ebf263c90a75cf305ddae0ad062fbfa1ee87280680ebed255db10d83e6325a5","observation_id":"4275a7cc-fb67-4b25-9283-3b52dc5876d0","resolution":{"observed_at":"2026-08-04T14:49:04.938009Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:06.098365Z","title":"Binary code similarity detection","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:06.098365Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:8a98667cea7342964d9cf84eb6cd29949f1bc44a5ec4a1ff7eaf91bf9f787c69","observation_id":"2a0749d4-ab69-4e20-bdd8-b88dfa7778a3","resolution":{"observed_at":"2026-08-04T14:49:06.098365Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:06.197443Z","title":"How machine learning is solving the binary function similarity problem","venue":null,"work_id":null,"year":2099},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:06.197443Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:9f2e7c4cc1e51b5b21bd3b5415c110efd5413587548f9a02c943fddbd1e6e3bd","observation_id":"f37d9503-b33b-429c-81d2-386b3b688330","resolution":{"observed_at":"2026-08-04T14:49:06.197443Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:05.326189Z","title":"Palmtree: Learn- ing an assembly language model for instruction em- bedding","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:05.326189Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:840be05694e1cbe598cb45a7c09b398cb2fbb8fa6983a406f6cfe1be1581f103","observation_id":"06176218-923a-49c4-a5b0-64403e9c4c49","resolution":{"observed_at":"2026-08-04T14:49:05.326189Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1310.4546","last_updated":"2013-10-16T23:28:53Z","snapshot_observed_at":"2026-07-06T03:25:47.809707Z","submitted_at":"2013-10-16T23:28:53Z","title":"Distributed Representations of Words and Phrases and their Compositionality","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1310.4546","snapshot_observed_at":"2026-08-04T14:49:06.487992Z","title":"Distributed representations of words and phrases and their compositionality, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:06.487992Z"},"links":{"cited_paper":"/paper/1310.4546","citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:8c8f3aeeb30b23fdc2ca61b9ab547947508396b2164df4d653c8756d011df83a","observation_id":"9e2fb869-4501-4ea5-bdd8-1b88a8803505","resolution":{"observed_at":"2026-08-04T14:49:06.487992Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-04T14:49:06.613149Z","title":"Gpt-4 technical report, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:06.613149Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:0dc4c8b16bc59e13dd2252446d6bbe8882db817bc871a865af90cd4a5a2ab084","observation_id":"57cb8f6c-f2b7-46fa-833d-7652d9caab37","resolution":{"observed_at":"2026-08-04T14:49:06.613149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:06.726205Z","title":"Malware detection by exploiting deep learning over bi- nary programs","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:06.726205Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:1c45be2a4f5c864c70539902a9c2673dbf3d5f8e889d913c66369983668e4665","observation_id":"4583e315-cb4b-4beb-90a3-5a68d9b5b3bb","resolution":{"observed_at":"2026-08-04T14:49:06.726205Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:05.848528Z","title":"Roberta: A robustly optimized bert pretraining approach,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:05.848528Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:6d1623492d750fc37ab41a1295ca91a593d1840e47102dde2eb9fd9e123b3811","observation_id":"6d73a372-7c58-445b-b73f-9dba6e4da768","resolution":{"observed_at":"2026-08-04T14:49:05.848528Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.11692","last_updated":"2019-07-26T17:48:29Z","snapshot_observed_at":"2026-07-31T22:31:37.910868Z","submitted_at":"2019-07-26T17:48:29Z","title":"RoBERTa: A Robustly Optimized BERT Pretraining Approach","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.11692","snapshot_observed_at":"2026-08-04T14:49:05.959135Z","title":null,"venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:05.959135Z"},"links":{"cited_paper":"/paper/1907.11692","citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:eed79053c471615e1803f87eaac65d9513d815248b93942847ebdc8c64d84702","observation_id":"d02522cf-31eb-4e1e-82b6-12f61363a6e6","resolution":{"observed_at":"2026-08-04T14:49:05.959135Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-11747-3_3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Penya, Borja Sanz, Carlos Laorden, and Pablo G","venue":"Lecture notes in computer science","work_id":"382e4f97-60a1-4d4f-ad81-22adc8d8f3eb","year":2010},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:07.326697Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:f403515a4a9578589b3899d831de98426e9862d2d198755e885716bc3dff8b97","observation_id":"50406123-8f0a-41ab-8a68-406668c44904","resolution":{"observed_at":"2026-08-04T14:53:31.255527Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:07.473327Z","title":"Binary similarity detection using machine learning","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:07.473327Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:1ff93d5b72ecca515ec7487d95e3b4fa88a9b2ac6e8326ba4ab31d679fc4906f","observation_id":"8e5d947f-7fe8-43b9-b1a9-3356620ee4f5","resolution":{"observed_at":"2026-08-04T14:49:07.473327Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:06.305886Z","title":"Safe: Self-attentive function embeddings for binary similarity,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:06.305886Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:40caea9ba886383e3c9f613ab58f483ae07c87496e5a81f2585c8baedc3b1966","observation_id":"f6e6d405-2d6b-4f2c-a527-e79d628f865f","resolution":{"observed_at":"2026-08-04T14:49:06.305886Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1811.05296","last_updated":"2019-12-19T10:06:09Z","snapshot_observed_at":"2026-08-06T08:10:22.657522Z","submitted_at":"2018-11-13T14:01:16Z","title":"SAFE: Self-Attentive Function Embeddings for Binary Similarity","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.05296","snapshot_observed_at":"2026-08-04T14:49:06.411073Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:06.411073Z"},"links":{"cited_paper":"/paper/1811.05296","citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:41e634758231841e31c53c08f5c8931ccbf26af49d8c91816514cd6a5fa6e6f5","observation_id":"ff39d80c-8496-4843-8466-b3c13b0f76c7","resolution":{"observed_at":"2026-08-04T14:49:06.411073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:07.811484Z","title":"Putty, 2025-02-08","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:07.811484Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:9442ec42311423bfd88530259a767ad1b99ebbaa8c5fa0197378c71672a735d3","observation_id":"644b2df5-1996-4bf9-9c77-4b55b011093a","resolution":{"observed_at":"2026-08-04T14:49:07.811484Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.06261","last_updated":"2025-12-19T14:25:46Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-07-07T17:36:04Z","title":"Gemini 2.5: Pushing the Frontier with Advanced Reasoning, Multimodality, Long Context, and Next Generation Agentic Capabilities","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.06261","snapshot_observed_at":"2026-08-04T14:49:07.942663Z","title":"Gemini 2.5: Pushing the frontier with ad- vanced reasoning, multimodality, long context, and next generation agentic capabilities, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:07.942663Z"},"links":{"cited_paper":"/paper/2507.06261","citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:72d0d531c4cdec62f9a579f03b8821b29c380c81ed2b2e21b029e461cc172698","observation_id":"9c5b00d2-7c23-4879-a113-81703e5e11ae","resolution":{"observed_at":"2026-08-04T14:49:07.942663Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.19786","last_updated":"2025-03-25T15:52:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-03-25T15:52:34Z","title":"Gemma 3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.19786","snapshot_observed_at":"2026-08-04T14:49:08.048649Z","title":"Gemma 3 technical report, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:08.048649Z"},"links":{"cited_paper":"/paper/2503.19786","citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:420e20174a7dac21574bb46ce322f4f7a9c84e4411f9f650562d63dbf545b579","observation_id":"50928234-53a7-4fd6-a8bc-39791d0f72ab","resolution":{"observed_at":"2026-08-04T14:49:08.048649Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:06.836234Z","title":"Nicholas","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:06.836234Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:5885f11b5c53ad8009181969f2d01dd5580f9e66b2e4bf56ca87b3dbbcf63139","observation_id":"6243e0ef-bd37-493f-9e61-91f72975b3da","resolution":{"observed_at":"2026-08-04T14:49:06.836234Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3721481","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"VenkataKeerthy, Soumya Banerjee, Sayan Dey, Yashas Andaluri, Raghul PS, Subrahmanyam Kalyana- sundaram, Fernando Magno Quintão Pereira, and Ra- makrishna Upadrasta","venue":"ACM Transactions on Software Engineering and Methodology","work_id":"8135b8bc-46e7-4f12-9e68-d62ae8206b8c","year":2025},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:08.322817Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:ab2cb56d918332dd07da7b16b064f58f443bc469efcedb8781cc8d4099637f7c","observation_id":"5e4d6614-5fce-4f8b-bf32-f0d058d966a4","resolution":{"observed_at":"2026-08-04T14:53:31.004733Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:07.097222Z","title":"A survey of binary code sim- ilarity detection techniques.Electronics, 13(9),","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:07.097222Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:b5299a7448cb4360aad7003dab6fba42cef55a90991718ca4d9fc77e1ba5f3c3","observation_id":"b7e5c1af-cfce-43d6-9dea-051a4c367aec","resolution":{"observed_at":"2026-08-04T14:49:07.097222Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:08.583948Z","title":"Clap: Learning transferable binary code representations with natural language su- pervision","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:08.583948Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:8014d46b61835327b1fd2a68a8e5209887aab509a38401df902ee885c27470b2","observation_id":"0b4755e0-1974-4cf3-9667-59306107f4fe","resolution":{"observed_at":"2026-08-04T14:49:08.583948Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:08.695015Z","title":"Improving ML-based binary function sim- ilarity detection by assessing and deprioritizing con- trol flow graph features","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:08.695015Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:dc3bf2a134c73f94f1ca9274444b713fe343563cd1fec445eb91234593303e46","observation_id":"9d2c96a1-2660-42ef-b570-47f073ed0c09","resolution":{"observed_at":"2026-08-04T14:49:08.695015Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:08.819956Z","title":"Enhancing machine learning based malware detection model by reinforcement learning","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:08.819956Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:1205083bdfe0c8e0d327c1366021cbbfa44ee110e7b0cbcdbe22046878f29186","observation_id":"172085b0-8160-4a99-95eb-77ab8b099d7d","resolution":{"observed_at":"2026-08-04T14:49:08.819956Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:07.611901Z","title":"curl - command line tool and library for transferring data with urls, 2025-07-16","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:07.611901Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:40001f8cc22ad5cde7364dda674987bdd6303d77fd0b53399792fb4a9f878784","observation_id":"34e4b480-ece7-498c-8ec3-4d0df79497bf","resolution":{"observed_at":"2026-08-04T14:49:07.611901Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:07.707109Z","title":"LLM4Decompile: Decompiling binary code with large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:07.707109Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:18a9c061d573bc315d09bf30424ca889275bbc9384546726cede0a84ce8db0a7","observation_id":"d7eb5f2e-5a2b-494a-9962-6f11162792b8","resolution":{"observed_at":"2026-08-04T14:49:07.707109Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:09.228049Z","title":"Semantic understanding of source and bi- nary code based on natural language processing","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:09.228049Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:79c8bb395915d96e69209d594ec94afb21ec3beb36c34e82e5e3437ddf0ae065","observation_id":"4405ff2f-3cfd-4314-9876-8aea8066ef16","resolution":{"observed_at":"2026-08-04T14:49:09.228049Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-04T14:49:08.198241Z","title":"Qwen3 technical report, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:08.198241Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:959be01e2010b893859bcf0e2ff2f0a44259419ec3928a9da835f1a5ad808a08","observation_id":"6d488a2b-d087-42d7-a1ff-a2b31cd4acba","resolution":{"observed_at":"2026-08-04T14:49:08.198241Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:08.425964Z","title":"Busybox, 2024-09-27","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:08.425964Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:73d187debc5ad2edc76fe22a74c929a08498303f0e0b2022f2b0f773a140e5b0","observation_id":"05c161da-3233-4c65-90b5-f0818c60d334","resolution":{"observed_at":"2026-08-04T14:49:08.425964Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:08.987203Z","title":"Spain: Security patch anal- ysis for binaries towards understanding the pain and pills","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:08.987203Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:6ecbf0ba1880f00598ddc0b4af47b4c6999d7689e3a16b6608bd28ccb810fe19","observation_id":"924e8caa-e678-4420-8b53-765a435d78ba","resolution":{"observed_at":"2026-08-04T14:49:08.987203Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:09.133702Z","title":"Order matters: Semantic- aware neural networks for binary code similar- ity detection.Proceedings of the AAAI Con- ference on Artificial Intelligence, 34(01):1145– 1152, Apr","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:09.133702Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:4f8294d0e97dfa7248f4d5f82283c037db3b17b2f620471a797f3f1f0a138138","observation_id":"759d76a4-23f7-46bf-bf48-333e94a35bac","resolution":{"observed_at":"2026-08-04T14:49:09.133702Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:03.560042Z","title":"URL: https://www","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:03.560042Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:76a20b9c042ec50011a4936a63cdf199f0d51fd02d2ac60ae3e9e6669939c64c","observation_id":"ecfa3226-5e81-4ad0-a595-1f5d69cb9287","resolution":{"observed_at":"2026-08-04T14:49:03.560042Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1703.03130","last_updated":"2017-03-09T04:42:30Z","snapshot_observed_at":"2026-08-01T16:29:44.580051Z","submitted_at":"2017-03-09T04:42:30Z","title":"A Structured Self-attentive Sentence Embedding","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1703.03130","snapshot_observed_at":"2026-08-04T14:49:05.753786Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:05.753786Z"},"links":{"cited_paper":"/paper/1703.03130","citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:b2b8558e1d2407408065553f31ba0389ce06117c891f49334ac5d5e589005120","observation_id":"9c07ce34-f881-4927-8441-f4d298c90284","resolution":{"observed_at":"2026-08-04T14:49:05.753786Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:06.978193Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:06.978193Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:6c8ec900a6171737a23f5ebe0e1d9f26c530870104305c1807d3a2ad0d22152c","observation_id":"48b564ce-e6fc-4c5d-8050-131d98d26af6","resolution":{"observed_at":"2026-08-04T14:49:06.978193Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.04805","last_updated":"2019-05-24T20:37:26Z","snapshot_observed_at":"2026-07-30T09:12:38.100527Z","submitted_at":"2018-10-11T00:50:01Z","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.04805","snapshot_observed_at":"2026-08-04T14:49:02.830536Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:02.830536Z"},"links":{"cited_paper":"/paper/1810.04805","citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:0a53d9ae2a382b8b234fa31f174c0d4967747525b02c5924a35d0f6236c3af8f","observation_id":"eed3e1f8-c664-4fac-b43e-b57059680328","resolution":{"observed_at":"2026-08-04T14:49:02.830536Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:05.481145Z","title":"doi: 10.1145/3460120.3484587","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:05.481145Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:0a91507d45b1bbabb97ecbd0a76c0bd4672e48a638db362c43956010c92c4f27","observation_id":"46f76aa7-b61e-467a-8242-8dd5062d2d9e","resolution":{"observed_at":"2026-08-04T14:49:05.481145Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T14:49:07.237200Z","title":null,"venue":null,"work_id":null,"year":2079},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:07.237200Z"},"links":{"citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:6e7842d5c47259fd9ccc3652c493835bc8d59adbf7cbef8018b998795a02a8cc","observation_id":"f1438e25-aaeb-4aac-8208-817e9bed46a0","resolution":{"observed_at":"2026-08-04T14:49:07.237200Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.19453","last_updated":"2025-06-24T09:30:40Z","snapshot_observed_at":"2026-08-06T23:04:35.834750Z","submitted_at":"2025-06-24T09:30:40Z","title":"FuncVul: An Effective Function Level Vulnerability Detection Model using LLM and Code Chunk","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.19453","snapshot_observed_at":"2026-08-04T14:49:04.136085Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:04.136085Z"},"links":{"cited_paper":"/paper/2506.19453","citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:53d8d39f35a6e0ac20a7a88d1598d6e16d4fbeb8747cfa6aee4223a207235561","observation_id":"970ba9b8-827f-4b4a-9e78-6623962351f4","resolution":{"observed_at":"2026-08-04T14:49:04.136085Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity"},"reference_resolution":{"displayed":68,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":62,"verified_exact":4,"verified_fuzzy":0},"total_outbound_references":68},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 68 of 68 outbound references and 1 inbound Pith citation observation for arXiv:2509.23449."}