{"as_of":"2026-08-07T09:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2f3c23af96547cc51d395e5aedc6d1d8396414da96e8153491aa326404e0cb18","coverage":[{"denominator":26,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":26,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-13T02:55:15.819959Z","state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2607.09452/citation-record","integrity":"/paper/2607.09452/integrity","json":"/paper/2607.09452/citation-record.json","paper":"/paper/2607.09452"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T02:55:15.819959Z","title":"Addison-Wesley, 2 edn","venue":null,"work_id":null,"year":2006},"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":1,"source":"pdf_text","source_observed_at":"2026-07-13T02:55:15.819959Z"},"links":{"citing_paper":"/paper/2607.09452"},"observation_digest":"sha256:32d30c967d0b706687e08eb7750a1adecdfdd19d45663492cc4be0881d6882b6","observation_id":"57725063-ffd2-4c2e-84ef-6c3c82766554","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T02:55:15.819959Z","title":null,"venue":null,"work_id":null,"year":2018},"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":2,"source":"pdf_text","source_observed_at":"2026-07-13T02:55:15.819959Z"},"links":{"citing_paper":"/paper/2607.09452"},"observation_digest":"sha256:0928a1812f2367ded0abfb8d50c9802e5812b880c9c28467399f610514c745ba","observation_id":"5ba6839c-086c-4ef9-9204-3a5f9ef2f368","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.23919/cycon62501","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T02:59:20.676882Z","title":null,"venue":null,"work_id":"b90b474e-21f6-4e32-ab4a-6ddf6b6a8402","year":2024},"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":3,"source":"pdf_text","source_observed_at":"2026-07-13T02:55:15.819959Z"},"links":{"citing_paper":"/paper/2607.09452"},"observation_digest":"sha256:b9b57235b8a1730975e16dfabe127033adca16c2c47e44c1467aecff2ef8e7f6","observation_id":"ce743507-15b3-4f3d-92b7-40c7eebbcd25","resolution":{"observed_at":"2026-07-13T02:59:20.679549Z","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-07-20T19:22:42.914681+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-20T19:22:42.914681+00:00","source":"openalex_status_cache"},{"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":"10.1002/spe.4380250706","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Software Practice and Experience","work_id":"c41e0a65-71ac-4fad-9e17-3bf1120f527c","year":1995},"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":4,"source":"pdf_text","source_observed_at":"2026-07-13T02:55:15.819959Z"},"links":{"citing_paper":"/paper/2607.09452"},"observation_digest":"sha256:24945f6558be03166eb3a5a4ccdaa7d713b534f0078eda2a3169da8aaf6ecad4","observation_id":"661ef4f6-fb4b-4462-9b97-3784fa5652fe","resolution":{"observed_at":"2026-07-13T02:59:20.686095Z","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-07-20T19:22:43.156193+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-20T19:22:43.156193+00:00","source":"openalex_status_cache"},{"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-07-13T02:55:15.819959Z","title":"In: Proc","venue":null,"work_id":null,"year":2019},"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":5,"source":"pdf_text","source_observed_at":"2026-07-13T02:55:15.819959Z"},"links":{"citing_paper":"/paper/2607.09452"},"observation_digest":"sha256:afc317029eca0316cfe80faa6ab561c07a1eb84e4ee02d85056206117123b164","observation_id":"48131367-0ae4-48d9-826e-bb8512671398","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T02:55:15.819959Z","title":"In: Proc","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":6,"source":"pdf_text","source_observed_at":"2026-07-13T02:55:15.819959Z"},"links":{"citing_paper":"/paper/2607.09452"},"observation_digest":"sha256:9ef30d028d219649d14c9cda765e4caaaadf1a196d77b6890bc1e12c7ec416c6","observation_id":"35f98dd3-e070-4eb1-bd3a-df6766ac567b","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T02:55:15.819959Z","title":"In: Proc","venue":null,"work_id":null,"year":2024},"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":7,"source":"pdf_text","source_observed_at":"2026-07-13T02:55:15.819959Z"},"links":{"citing_paper":"/paper/2607.09452"},"observation_digest":"sha256:05f14d2779e0f7e999bc96fd4228390d43c76449cd186c25b66272f7094fc324","observation_id":"41b5530b-3c41-48da-897c-b516de0541d6","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"}},{"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T02:55:15.819959Z","title":"org/binutils/docs/binutils/nm.html, part of GNU Binutils","venue":null,"work_id":null,"year":2026},"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":9,"source":"pdf_text","source_observed_at":"2026-07-13T02:55:15.819959Z"},"links":{"citing_paper":"/paper/2607.09452"},"observation_digest":"sha256:4ebad398d16ebbfec863adac430124fdb2d6b55b7a0a3eece344986dd687300f","observation_id":"9046d4ff-2838-4d69-9c88-1ece91449e04","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"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":10,"source":"pdf_text","source_observed_at":"2026-07-13T02:55:15.819959Z"},"links":{"citing_paper":"/paper/2607.09452"},"observation_digest":"sha256:c198c788aa5931c8b6e2906c7f19250513ddac8dbebf2763d3aa4e1639d24120","observation_id":"53f84c96-54a7-4020-af67-3755fcdeb74d","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"}},{"citation":{"cited_paper":{"arxiv_id":"2604.24827","last_updated":"2026-07-05T14:51:01Z","snapshot_observed_at":"2026-08-03T04:45:05.539489Z","submitted_at":"2026-04-27T15:46:23Z","title":"Incompressible Knowledge Probes: Estimating Black-Box LLM Parameter Counts via Factual Capacity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.24827","snapshot_observed_at":"2026-07-13T02:55:15.819959Z","title":"Gagnon et al","venue":null,"work_id":null,"year":2026},"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":11,"source":"pdf_text","source_observed_at":"2026-07-13T02:55:15.819959Z"},"links":{"cited_paper":"/paper/2604.24827","citing_paper":"/paper/2607.09452"},"observation_digest":"sha256:d2b69297c5bc35e906e25d77aa9f104aa2b57dea71a45b13cbcb4167732dd4b9","observation_id":"3f4c6e98-bd0f-4d91-8114-0e30b999e6ab","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T02:55:15.819959Z","title":"In: Proc","venue":null,"work_id":null,"year":2021},"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":12,"source":"pdf_text","source_observed_at":"2026-07-13T02:55:15.819959Z"},"links":{"citing_paper":"/paper/2607.09452"},"observation_digest":"sha256:8ddb07b0b39cbed5a796572c7a78d152e01f75ea28f4b336f5549a1f6249281a","observation_id":"cf2b7249-7484-4830-91fa-bbdf6b1e6fc0","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"}},{"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-07-13T02:55:15.819959Z","title":null,"venue":null,"work_id":null,"year":2019},"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":13,"source":"pdf_text","source_observed_at":"2026-07-13T02:55:15.819959Z"},"links":{"cited_paper":"/paper/1811.05296","citing_paper":"/paper/2607.09452"},"observation_digest":"sha256:469eae494c2418ef049f18e18128e1567805c3b62edd9bc7fb3e981d330014b0","observation_id":"e4b0ff8f-aca4-41ac-b03a-278e397f73fe","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"}},{"citation":{"cited_paper":{"arxiv_id":"1711.00830","last_updated":"2017-11-02T17:28:36Z","snapshot_observed_at":"2026-08-05T02:11:07.388236Z","submitted_at":"2017-11-02T17:28:36Z","title":"BinPro: A Tool for Binary Source Code Provenance","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.00830","snapshot_observed_at":"2026-07-13T02:55:15.819959Z","title":null,"venue":null,"work_id":null,"year":2017},"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":14,"source":"pdf_text","source_observed_at":"2026-07-13T02:55:15.819959Z"},"links":{"cited_paper":"/paper/1711.00830","citing_paper":"/paper/2607.09452"},"observation_digest":"sha256:1ed880397c58b15db8bde523bfbdfcfd2745e574dcbe0426bbce6d49fa065b84","observation_id":"c34c6112-cafe-4210-b697-8e8575cb812d","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T02:55:15.819959Z","title":"In: Proc","venue":null,"work_id":null,"year":2022},"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":15,"source":"pdf_text","source_observed_at":"2026-07-13T02:55:15.819959Z"},"links":{"citing_paper":"/paper/2607.09452"},"observation_digest":"sha256:4775eae8d4b6f431fb44f51a21f2db2113ee8e05560a71dd097e1929b409c7f1","observation_id":"caf4865f-6eba-4529-864f-147c8620f232","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.70828/kheh5209","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":null,"work_id":"21677789-e1ed-45db-9bf5-e54154389a2d","year":2022},"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":16,"source":"pdf_text","source_observed_at":"2026-07-13T02:55:15.819959Z"},"links":{"citing_paper":"/paper/2607.09452"},"observation_digest":"sha256:8896e62d5a41d70530a3c0efcdc20bdfa410c79b29aa125228c8d8788fd1e3f2","observation_id":"ec966cb1-5e0a-4530-b869-1b9c8c990a45","resolution":{"observed_at":"2026-07-13T02:59:20.641371Z","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-07-20T19:22:44.514361+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-20T19:22:44.514361+00:00","source":"openalex_status_cache"},{"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-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":17,"source":"pdf_text","source_observed_at":"2026-07-13T02:55:15.819959Z"},"links":{"citing_paper":"/paper/2607.09452"},"observation_digest":"sha256:3a1e927f1a9305a3737bcd6967c7a4aa0d762086060113aaa9b7bacf426099fc","observation_id":"1c8548e5-1f92-42d0-8293-5cdccdd2a368","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"}},{"citation":{"cited_paper":{"arxiv_id":"2403.08799","last_updated":"2024-02-03T18:14:13Z","snapshot_observed_at":"2026-07-06T17:44:09.081164Z","submitted_at":"2024-02-03T18:14:13Z","title":"Automating SBOM Generation with Zero-Shot Semantic Similarity","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.08799","snapshot_observed_at":"2026-07-13T02:55:15.819959Z","title":null,"venue":null,"work_id":null,"year":2024},"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":18,"source":"pdf_text","source_observed_at":"2026-07-13T02:55:15.819959Z"},"links":{"cited_paper":"/paper/2403.08799","citing_paper":"/paper/2607.09452"},"observation_digest":"sha256:e774989a88e42d4e4697f8c0ff7b52b11ebb68869aee23b9e0557d0e8ed2d2a0","observation_id":"66f49ae0-c11a-421c-9e79-37e30745b384","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T02:55:15.819959Z","title":"In: Foundations and Practice of Security","venue":null,"work_id":null,"year":2013},"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":19,"source":"pdf_text","source_observed_at":"2026-07-13T02:55:15.819959Z"},"links":{"citing_paper":"/paper/2607.09452"},"observation_digest":"sha256:264e3b101e925327381877c455a60bbb3dbc4f37cb3318c784488487228c3d1d","observation_id":"bc1e5bf2-7731-4ea2-bb61-7c75b58e70d7","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T02:55:15.819959Z","title":"In: Proc","venue":null,"work_id":null,"year":2024},"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":20,"source":"pdf_text","source_observed_at":"2026-07-13T02:55:15.819959Z"},"links":{"citing_paper":"/paper/2607.09452"},"observation_digest":"sha256:73ff59dc8fbd5116d748a062a81c2de8a73d064e671953ddd73e7db98b5101c3","observation_id":"7e79e961-5d4c-4366-b1f7-0597273a7a9b","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2025.357923","doi":"10.1109/jiot.2025.3579231","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"IEEE Internet Things J.12(24), 51842– 51853 (2025).https://doi.org/10.1109/JIOT.2025.3579231","venue":"IEEE Internet of Things Journal","work_id":"dab5d27d-eafd-4703-9d93-a3fd26120036","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":21,"source":"pdf_text","source_observed_at":"2026-07-13T02:55:15.819959Z"},"links":{"citing_paper":"/paper/2607.09452"},"observation_digest":"sha256:4057fcb39daeb4ab2f0f4b3308a362a584e0c63e9755e6fe0ec70e7818420088","observation_id":"e1978228-6352-496c-b9f5-e5ad2a913bb5","resolution":{"observed_at":"2026-07-13T02:59:20.660047Z","resolver_source":"arxiv_id","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-07-20T19:22:44.97881+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-20T19:22:44.97881+00:00","source":"openalex_status_cache"},{"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-07-13T02:55:15.819959Z","title":"In: Proc","venue":null,"work_id":null,"year":2024},"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":22,"source":"pdf_text","source_observed_at":"2026-07-13T02:55:15.819959Z"},"links":{"citing_paper":"/paper/2607.09452"},"observation_digest":"sha256:07aaca8e6a920e7e7f0186dfb1cf155697e5cbf7214920517fe6b9e9bc0f6b1c","observation_id":"caf820a9-66b9-4fae-a162-21c13d624d44","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T02:55:15.819959Z","title":null,"venue":null,"work_id":null,"year":2022},"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":23,"source":"pdf_text","source_observed_at":"2026-07-13T02:55:15.819959Z"},"links":{"citing_paper":"/paper/2607.09452"},"observation_digest":"sha256:0827c435fa9995d0f1ffe63d98fc4bf79020eaf161037cadc425c54c7795b428","observation_id":"ee86e0a3-c745-4b5c-a4d1-9063088f8314","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T02:55:15.819959Z","title":null,"venue":null,"work_id":null,"year":2024},"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":24,"source":"pdf_text","source_observed_at":"2026-07-13T02:55:15.819959Z"},"links":{"citing_paper":"/paper/2607.09452"},"observation_digest":"sha256:015cfaaf3192185c3dd44f0d742d5747452c0f9a824f17c820b39329677191b9","observation_id":"c3789d72-66b8-41d8-b66a-de87d0241c14","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T02:55:15.819959Z","title":null,"venue":null,"work_id":null,"year":2020},"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":25,"source":"pdf_text","source_observed_at":"2026-07-13T02:55:15.819959Z"},"links":{"citing_paper":"/paper/2607.09452"},"observation_digest":"sha256:2ce4b960f152be49697c5473da49f8ef2d773fcc395e8147f1811755e4e85642","observation_id":"5c5f71dd-2c56-4551-89fd-e30b6eabb3e9","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T02:55:15.819959Z","title":"In: Proc","venue":null,"work_id":null,"year":2019},"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":26,"source":"pdf_text","source_observed_at":"2026-07-13T02:55:15.819959Z"},"links":{"citing_paper":"/paper/2607.09452"},"observation_digest":"sha256:75cda1a168103ba391d998a98ea197c71f472d71728b352f9272b123963d80c3","observation_id":"39a09db4-527d-4ccc-8857-ad173f70240e","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"}}],"paper":{"arxiv_id":"2607.09452","last_updated":"2026-07-10T14:22:30Z","latest_version":1,"primary_category":"cs.SE","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"},"reference_resolution":{"displayed":26,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":22,"verified_exact":4,"verified_fuzzy":0},"total_outbound_references":26},"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 26 of 26 outbound references and 0 inbound Pith citation observations for arXiv:2607.09452."}