{"as_of":"2026-08-23T07:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8e24bad78efc67659ac8212df0c3494e1339b596b7c9c1b4638b3046abd74414","coverage":[{"denominator":47,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":47,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T04:20:47.677019Z","state":"measured"},{"denominator":47,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":47,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+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/2608.10043/citation-record","integrity":"/paper/2608.10043/integrity","json":"/paper/2608.10043/citation-record.json","paper":"/paper/2608.10043"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:20:47.252308Z","title":"Do developers update their library dependencies? an empirical study on the impact of security advisories on library migration,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.252308Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:279ee172bf8e80d2ddf9d351dfd2ad94e3dee441962631bafc94bed22d013601","observation_id":"7a38d52e-31a2-4bb5-8419-02f1d04e8a75","resolution":{"observed_at":"2026-08-14T04:20:47.252308Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:20:49.105922Z","title":"2025 Open Source Security and Risk Analysis Report,","venue":null,"work_id":"9ca0c5dd-4256-4b77-b494-3217f5261f34","year":2025},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.260867Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:421ee329f9e1269d7854dc08700701e36f9f89bbb1ffc8dfd07efb50fd2e215b","observation_id":"798defa7-cd17-4b56-8530-de0cbe1cc0a0","resolution":{"observed_at":"2026-08-14T04:20:49.112502Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:20:49.082732Z","title":"Software reuse cuts both ways: An empirical analysis of its relationship with security vulnerabil- ities,","venue":null,"work_id":"1499bdf9-968e-46fb-88d7-593143b601bf","year":2021},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.268308Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:aa32ad0be4a3a6d1a05452f388a05db9096ba8d794ffa484553eec3dfcee71ef","observation_id":"265b725b-d747-4f95-bbb2-26d947def582","resolution":{"observed_at":"2026-08-14T04:20:49.091274Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:20:49.054316Z","title":"madler/zlib GitHub Repository,","venue":null,"work_id":"ee81b277-e821-412b-82a7-676ba5d64005","year":2026},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.276966Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:21ddc7cdbcc75ce31d7c79fac97a23a3365bfb1a51e82d6c923d4a4bc723dadb","observation_id":"ea1fbe4d-b3f3-4580-aa62-0b5a608be124","resolution":{"observed_at":"2026-08-14T04:20:49.062673Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:20:49.033350Z","title":"curl/curl GitHub Repository,","venue":null,"work_id":"16335367-7f53-4593-82bf-bfa4e81def39","year":2026},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.284505Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:8918ce1c6c7a9a48eac380e6c93021585efb02b8cf7c73ba244a75e3883342c8","observation_id":"7c548538-0cdd-4b38-b747-3be11110f763","resolution":{"observed_at":"2026-08-14T04:20:49.040779Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:20:49.009064Z","title":"Modx: binary level partially imported third-party library detection via program modularization and semantic matching,","venue":null,"work_id":"b8764e91-1fad-4634-8c5b-aa29f7e7bfe7","year":2022},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.293187Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:c76e9ef72864d37869ddad8eae280d2ca15329a791e29f067dc539fc03692f67","observation_id":"6f477f41-8525-4eed-b93d-43e7b69aadb2","resolution":{"observed_at":"2026-08-14T04:20:49.017080Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:20:48.985140Z","title":"Libam: An area matching framework for de- tecting third-party libraries in binaries,","venue":null,"work_id":"a3b2c136-919e-4e16-a7fa-f4a8a72d234a","year":2023},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.303550Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:d9524ab07da84756120044812fd8446a82e4547b50a253c84e9b1b824b82b97e","observation_id":"226a4eed-cd63-4f49-99b7-8a0a74889c85","resolution":{"observed_at":"2026-08-14T04:20:48.992553Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T04:20:47.310938Z","title":"Interpretation-enabled software reuse detection based on a multi-level birthmark model,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.310938Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:c398a61705ddca9f2ba7a99ba48b1705ea0eb5ffbb82bce506ef0b8e23c8dfd1","observation_id":"3b0a4766-2356-4603-af88-db012bf63293","resolution":{"observed_at":"2026-08-14T04:20:47.310938Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:20:48.958497Z","title":"Libvdiff: Library version difference guided oss version identification in binaries,","venue":null,"work_id":"02e0b30c-f49a-42f3-88be-7b7f90aa3291","year":2024},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.318369Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:521058501b0897ef79fbe52b5ddd5be9813bb16a5349cc104ce5d7be53a6b21e","observation_id":"c424e7ef-fb75-45c9-a3bc-f2aff999c8b4","resolution":{"observed_at":"2026-08-14T04:20:48.965277Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:20:48.933241Z","title":"Libdb: An effective and efficient framework for detecting third-party libraries in binaries,","venue":null,"work_id":"e1f47a2d-3d38-44b8-844d-5c20f4202020","year":2022},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.325074Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:bcdc1aefc62ecc801061f5cce0691660aae355e5e365d2ff118f776a2fb59418","observation_id":"072a4d4d-8ef2-4b5e-9432-aca81654101c","resolution":{"observed_at":"2026-08-14T04:20:48.940623Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:20:48.906946Z","title":"Bbdetector: A precise and scalable third-party library detection in binary executables with fine- grained function-level features,","venue":null,"work_id":"76009315-1517-4012-a662-f4f1ba915f23","year":2022},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.332652Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:1b714e2e246d5492853666067e4e3d34d78b52be1d08f7176ed0e113787d3012","observation_id":"612da2dd-e313-4848-b294-6e346ff219e3","resolution":{"observed_at":"2026-08-14T04:20:48.918777Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:20:48.882781Z","title":"Moddiff: modularity similarity- based malware homologation detection,","venue":null,"work_id":"0af82f99-8b9f-469d-99cf-cfaa76d25f52","year":2023},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.338713Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:19cd4653cbb7fa73d4ffffa36636be1e39e478f465c999b4135057872b3cdac9","observation_id":"cd42fedc-56e9-4ce8-b51d-ec81c3a6b319","resolution":{"observed_at":"2026-08-14T04:20:48.890143Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:20:48.854028Z","title":"Bcd: Decomposing binary code into components using graph-based clustering,","venue":null,"work_id":"5d1547aa-2183-44e1-aed0-b0519e3f7313","year":2018},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.347716Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:b533544741bcccbd63fb9d2af38549b9d16c8578cb0be0172c55c753ab7ec996","observation_id":"40f02b23-71d2-4ca9-9d13-ebcf2dcd96d6","resolution":{"observed_at":"2026-08-14T04:20:48.863972Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:20:48.829085Z","title":"Searching open- source vulnerability function based on software modularization,","venue":null,"work_id":"8649ece5-2bbb-47b8-b4ed-50c9b60a1467","year":2023},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.354507Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:645997de651bb43c5074c15924e5bdff5efc149d9a611dc217abd067ca049daa","observation_id":"ef599294-f4c7-418b-a406-8247390a2c40","resolution":{"observed_at":"2026-08-14T04:20:48.838046Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:20:48.796006Z","title":"Libdx: A cross-platform and accurate system to detect third-party libraries in binary code,","venue":null,"work_id":"2a4acf21-f0db-4e4d-a666-54a10337e402","year":2020},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.360769Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:dbc964b197dd8e5da37ded5ff4025240ef7c91d405fa20be94a6fd41d2b8ff19","observation_id":"cb3521e6-ca80-4e89-9535-ed03a0f1259c","resolution":{"observed_at":"2026-08-14T04:20:48.809081Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:20:48.767921Z","title":"Reliable third-party library detection in android and its security applications,","venue":null,"work_id":"bd5ad12b-5f8b-447e-b845-32ced8f16c16","year":2016},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.369887Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:68fa5d7a22e8157e89280ccceaf0283750685b19e0295ff49f040e0ea2d6a852","observation_id":"3f65902e-b874-412d-94bb-8ea11e9ddee9","resolution":{"observed_at":"2026-08-14T04:20:48.774744Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:20:48.741711Z","title":"Libd: Scalable and precise third-party library detection in android markets,","venue":null,"work_id":"e13b3655-fa2c-49a4-b70e-f6e8d80aa80c","year":2017},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.378692Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:16d42d575ca8de2646a9c67c4a08eafe80bee4aaa254aa7a1e1ae751312683d3","observation_id":"bc45c663-0f08-42cb-9a82-5da31a21c908","resolution":{"observed_at":"2026-08-14T04:20:48.749265Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:20:48.707695Z","title":"Libradar: Fast and accurate detection of third-party libraries in android apps,","venue":null,"work_id":"96277291-cbc4-497f-ba10-0cb8aacc784d","year":2016},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.386551Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:6c1cd113928582593999b9feabe5fd16a7f61896b00342e94a353e09edf8a50e","observation_id":"d3cb929c-a7e0-4ee9-9009-b6efe1eaab67","resolution":{"observed_at":"2026-08-14T04:20:48.716766Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:20:48.673506Z","title":"Atvhunter: Reliable version detection of third-party libraries for vulnerability identi- fication in android applications,","venue":null,"work_id":"a46d6d42-ae5e-40e6-8e1f-21aa791ea064","year":2021},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.394294Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:c7c5a3e7e831e23695a7b811dfcde896cd18c12d727cf9bfb0d26cdb6d6adea3","observation_id":"d623250b-e7aa-431d-bb00-eea3d6fe4cd5","resolution":{"observed_at":"2026-08-14T04:20:48.682955Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:20:48.652313Z","title":"Automated third-party library detection for android applications: Are we there yet?","venue":null,"work_id":"8d66e1ba-5a9e-4ea3-b890-ea195637805a","year":2020},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.410659Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:121485e04db3e829e8a0d9329ce6d82663a5ff871d0f8c63df3f52367ac5a886","observation_id":"3f26cc83-9f2f-4c01-ab90-8d9d599cc290","resolution":{"observed_at":"2026-08-14T04:20:48.659084Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:20:48.626978Z","title":"Libid: reliable identification of obfuscated third-party android libraries,","venue":null,"work_id":"39fcda52-072e-4743-a59d-e8c9953cf74c","year":2019},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.417496Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:ee711d6b5df14cc497480cffc5dce5155b5e15c331d008cd20f57ff8d4f8e38c","observation_id":"f366ff21-c3c6-45e0-ad39-492c2f269649","resolution":{"observed_at":"2026-08-14T04:20:48.633819Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:20:48.598552Z","title":"Detecting third-party libraries in android applications with high precision and recall,","venue":null,"work_id":"3771176a-0e93-4e67-801d-cb802a420969","year":2018},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.428716Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:fa602ef759a9d9dd0d8d05e5e2214d23c5d0933a7b8f7ff6d9ceedcd4e0db4c1","observation_id":"42f771c0-d549-4c26-bd9e-ec110d780267","resolution":{"observed_at":"2026-08-14T04:20:48.606970Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:20:48.574841Z","title":"Fast algorithm for detecting community structure in networks,","venue":null,"work_id":"f940aadf-8b36-47c6-bd61-a8ed749f133d","year":2004},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.437651Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:03c5dcc29d52153feb3878294f0753ef20a6b14596a33b2fb1f4dd74839102c1","observation_id":"574704ed-e520-406d-bf7e-802d77330b72","resolution":{"observed_at":"2026-08-14T04:20:48.582157Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:20:48.554728Z","title":"Bingo: Cross-architecture cross-os binary search,","venue":null,"work_id":"54e3b2f2-d69b-47ca-a098-83284f13f373","year":2016},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.444840Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:f7bf18634c805e08b7f24755bc75ba94b4c1b4fea0f787306944b2f83df1b212","observation_id":"41801887-b60c-4ac0-9014-11d96ef6581d","resolution":{"observed_at":"2026-08-14T04:20:48.561082Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:20:48.531853Z","title":"Asm2vec: Boosting static representation robustness for binary clone search against code obfusca- tion and compiler optimization,","venue":null,"work_id":"16a1f347-c222-4832-9407-c30e076c2b52","year":2019},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.451447Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:e1e3f645a0436b5aca2a1409892efb994185f838e9ed6cf54ec89802c77d46d5","observation_id":"c1db221f-e7e1-4da8-a32b-f0f555419144","resolution":{"observed_at":"2026-08-14T04:20:48.538295Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T04:20:47.461876Z","title":"1-to-1 or 1-to-n? investigating the effect of function inlining on binary similarity analysis,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.461876Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:d87dd1859562c1a30c3fe04f49c2add8b0b450f645e7e0eb3536e2704da87723","observation_id":"80954531-ce24-4f42-aed5-c80d1e50b170","resolution":{"observed_at":"2026-08-14T04:20:47.461876Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.15159","last_updated":"2022-10-27T03:57:12Z","snapshot_observed_at":"2026-08-16T16:20:46.655901Z","submitted_at":"2022-10-27T03:57:12Z","title":"Comparing One with Many -- Solving Binary2source Function Matching Under Function Inlining","version":1},"cited_work":{"arxiv_id":"2210.15159","doi":null,"metadata_source":"pith","pith_arxiv_id":"2210.15159","snapshot_observed_at":"2026-08-14T04:20:47.854631Z","title":"Comparing One with Many -- Solving Binary2source Function Matching Under Function Inlining","venue":"cs.SE","work_id":"00524989-362a-46b7-9489-dd87bb3aa6a4","year":2022},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.476139Z"},"links":{"cited_paper":"/paper/2210.15159","citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:3a9aaca15fc554e839d44a17c73dbf4867ab5b86276abd97bd5cbf1d0bde6082","observation_id":"3f33594f-4c15-42b3-93dd-e45a35a2034f","resolution":{"observed_at":"2026-08-14T04:20:47.860840Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:20:48.480721Z","title":"Cross-inlining binary function similarity detection,","venue":null,"work_id":"48cc16d0-d53f-4cae-a5f0-39ae76b11e39","year":2024},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.483122Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:f9ba19e92d58769211fc4a958e54bbe0ee73e1c887d2ca48525dba9c17167dfc","observation_id":"93c5de95-4e04-44cf-8d99-de84e860060d","resolution":{"observed_at":"2026-08-14T04:20:48.491653Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:20:48.453261Z","title":"Reifunc: Identifying recurring inline functions in binary code,","venue":null,"work_id":"62fbddb3-b355-469f-8fa4-4f70797dbca6","year":2024},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.514751Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:fda028da348686cb9f884a3c63c0543894f39df8c7a6468d13e6a912b5420008","observation_id":"8ebd0625-00ab-4b14-a9ff-352c9c554491","resolution":{"observed_at":"2026-08-14T04:20:48.461175Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:20:48.428905Z","title":"Optrans: enhancing binary code similarity detection with function in- lining re-optimization,","venue":null,"work_id":"dd96529d-88e4-4313-9c60-0b9833732352","year":2025},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.539007Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:74773e570c155627f9383d8ff3dae6b7eb7e2be38e4551c1281d967c4ae3d10c","observation_id":"6fa831ee-6780-48dd-8c08-fae332de36bc","resolution":{"observed_at":"2026-08-14T04:20:48.435065Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:20:48.401892Z","title":"Library functions identification in binary code by using graph isomorphism testings,","venue":null,"work_id":"fb713e51-56dd-4817-a1ed-34bfc951da93","year":2015},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.544917Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:e136ac704275b28d337c6dfc4bd536a3249a0bc8f7015ac027bc1e21c21b60a5","observation_id":"1485a8ef-f6e7-47d7-b16d-967ba91db91e","resolution":{"observed_at":"2026-08-14T04:20:48.410549Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:20:48.363560Z","title":"Using reduced execution flow graph to identify library functions in binary code,","venue":null,"work_id":"bc04fd71-8b61-4d2f-8d66-cf9e29d78a9d","year":2016},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.551899Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:4f07b33bdd7f7eb7e09f23208b5c61c0c0e24a6bc2ce7e75b745479e66dc1806","observation_id":"7614c3f6-3954-43bf-b071-82427730eb30","resolution":{"observed_at":"2026-08-14T04:20:48.373937Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:20:48.335154Z","title":"Learning to find usages of library functions in optimized binaries,","venue":null,"work_id":"88f9796a-cf6e-4b0e-a151-e4a23e2ceb6e","year":2022},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.558998Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:a0f31284efde9abd9a7e710e47a6a0b74be64542b3d02cd15387cf395bb411bd","observation_id":"645eeee7-59d5-42c0-adc8-b1d17035e9d2","resolution":{"observed_at":"2026-08-14T04:20:48.344178Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:20:48.303915Z","title":"Bino: Automatic recognition of inline binary functions from template classes,","venue":null,"work_id":"59e50385-77ac-482e-8543-55ae70bf9ab1","year":2023},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.566923Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:daa2dc53a0c674bb650a4df35adc1344943b464d87a42f4bfcd68d968622ed55","observation_id":"8b36358b-a73c-4e43-8fae-9e7098c4766b","resolution":{"observed_at":"2026-08-14T04:20:48.311588Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:20:48.276043Z","title":"Fsmell: recognizing inline function in binary code,","venue":null,"work_id":"e0cfd1ab-0445-4940-bd3d-57770fe82e8b","year":2023},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.574769Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:3a9ecc68a81f79d472397b0b46ea41f41129cf2b8b10ce6f6a7a2d92ead1ec8d","observation_id":"236e5eaa-c29e-4a9b-9347-df096273b7b6","resolution":{"observed_at":"2026-08-14T04:20:48.286182Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3765521","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:20:47.721497Z","title":"Highliner: Enhancing binary analysis through nlp-based instruction- level detection of c++ inline functions,","venue":null,"work_id":"3b31c455-b711-4816-b3c1-880f56ce7824","year":2025},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.581819Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:8ff5b84e1d348c2a3e4d24daa3b5d3cc22b99ca6013e6a8a5cbfb707e082c59f","observation_id":"df6f2046-6168-4042-80b0-3ef217b13a61","resolution":{"observed_at":"2026-08-14T04:20:47.730711Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:20:48.249176Z","title":"A deep dive into function inlining and its security implications for ml-based binary analysis,","venue":null,"work_id":"f942753f-e64b-490c-9cb3-d3be9a4c9548","year":2026},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.590318Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:d4dc9a6aeffe210c71a40b9ecabe511296c4eb15462eca7a941d50cf8b62dc98","observation_id":"3e501a77-a7ba-4ae4-8167-b3d26594b743","resolution":{"observed_at":"2026-08-14T04:20:48.260188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:20:48.216234Z","title":"Towards an oracle for binary decomposition under compilation vari- ance,","venue":null,"work_id":"dcd7ae96-25a2-4c36-90cd-2b12e8f8f9cd","year":2026},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.604024Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:4d6fbfc983e405ac6cc572751a82cff5baa9357f3ab34482d2663ff017ff3c00","observation_id":"3e237565-0b57-49e1-aad5-f40d0fd019d7","resolution":{"observed_at":"2026-08-14T04:20:48.230143Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:20:48.177462Z","title":"Revisiting binary code similarity analysis using interpretable feature engineering and lessons learned,","venue":null,"work_id":"fc8c6626-2a1b-4f82-a70a-db76ca3b5dbc","year":2023},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.622619Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:9b006d08f7c7d9ee4f32b37ad98026a19468297028a5f06cb5c59b3cf45e721b","observation_id":"12e6d12b-e8fb-4641-ab3b-8defceb6ab2a","resolution":{"observed_at":"2026-08-14T04:20:48.188262Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:20:48.142960Z","title":"SoftSec-KAIST/BinKit: Binary Code Similarity Analysis Benchmark,","venue":null,"work_id":"5f16e58a-6c98-4659-bc24-3df41016e70e","year":2026},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.631892Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:85e470d7a57bc821302ad2c4c53f8f6acebdac4656ef0f0d55c31dbda4ee1f7a","observation_id":"60861b1a-0b15-4e02-9718-5a692d0765cc","resolution":{"observed_at":"2026-08-14T04:20:48.151708Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-14T04:20:47.639387Z","title":"jtrans: jump-aware transformer for binary code similarity detection,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.639387Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:ab77c0ccd0f151ca49b6e458d3f5e1a76191ff88bb9929250cc8b74ceccd3cb0","observation_id":"9f2f4698-ddc0-4495-aa18-780ea73fe7de","resolution":{"observed_at":"2026-08-14T04:20:47.639387Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:20:48.115977Z","title":"Optimize Options (Using the GNU Compiler Collection (GCC)),","venue":null,"work_id":"ae0bf1c1-a026-4023-875d-836afa37450e","year":2026},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.646628Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:4c165a7630429acd18d583cc1db1ce1faa48517d7482dfed8db7fe24884a6a39","observation_id":"43753f5b-cdfc-4888-bbba-e7c707d52b3a","resolution":{"observed_at":"2026-08-14T04:20:48.124513Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:20:48.077474Z","title":"IDA Pro Disassembler and Debugger - Hex Rays,","venue":null,"work_id":"78a931e2-9d2f-4826-b9e3-c118e9eb7f61","year":2026},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.653279Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:506eb48a21c5bfa4dcaf509ee443852312f4d1d34f292dd22848980382924500","observation_id":"405ae8ca-a99e-400d-b833-1b32ce025efe","resolution":{"observed_at":"2026-08-14T04:20:48.085992Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:20:48.051459Z","title":"capstone on PyPI,","venue":null,"work_id":"37b1ed72-c707-4cfd-84a8-c0d7b96f6054","year":2026},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.659078Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:c91a70e5061fc2f6d9bb708d26d8b2b7b1ff551c5a204214cca4cd27c34b9aeb","observation_id":"9aaea243-5caa-4aea-b3d2-ee29f668d7c0","resolution":{"observed_at":"2026-08-14T04:20:48.061941Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:20:48.027477Z","title":"readelf(1) — Linux manual page,","venue":null,"work_id":"d36ceddb-fc5e-4e0f-9ec3-e3e9e0366bda","year":2026},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.665037Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:2b6403c192520460517aa27138a9b77d9f1fee3b08c1a619000a2d2fe57ad4b5","observation_id":"b46f8a73-702a-4235-b805-3707ccc030bd","resolution":{"observed_at":"2026-08-14T04:20:48.035546Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:20:48.002219Z","title":"Neural network- based graph embedding for cross-platform binary code similarity detec- tion,","venue":null,"work_id":"d1c47705-d741-45c1-8e92-0dcef06aa2df","year":2017},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.670808Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:8974373d06e75e9589ec029ec5d5145c046ed42518ebddaeeb1a3eab059b4715","observation_id":"aa91c5de-3739-4780-bd0d-2c910fdc795f","resolution":{"observed_at":"2026-08-14T04:20:48.009759Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T04:20:47.970246Z","title":"Sok: All you ever wanted to know about x86/x64 binary disassembly but were afraid to ask,","venue":null,"work_id":"c93911da-5fdf-4a14-a397-87d26540fc22","year":2021},"citing_paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-14T04:20:47.677019Z"},"links":{"citing_paper":"/paper/2608.10043"},"observation_digest":"sha256:f0b88fa218a6d5baa3244e5e6c9cdf859c89211afcc0b9bd97cdb7e44229b7b5","observation_id":"5b04cc1e-8d9c-4192-8e4b-eb5c0970fb18","resolution":{"observed_at":"2026-08-14T04:20:47.979079Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.10043","last_updated":"2026-08-10T09:37:42Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-18T05:42:47.041166Z","submitted_at":"2026-08-10T09:37:42Z","title":"N2NMatcher: Towards Inlining-Resilient Binary Decomposition and Module Matching"},"reference_resolution":{"displayed":47,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":2,"verified_fuzzy":41},"total_outbound_references":47},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 0 inbound Pith citation observations for arXiv:2608.10043."}