{"as_of":"2026-08-07T15:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:aa088db6406e74894b7e441a18ede23c0ba2e181772e386f6923a3287595da57","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T14:49:06.411073Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-22T09:41:21.680087Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1811.05296","last_updated":"2019-12-19T10:06:09Z","snapshot_observed_at":"2026-08-06T08:10:22.657522Z","submitted_at":"2018-11-13T14:01:16Z","title":"SAFE: Self-Attentive Function Embeddings for Binary Similarity","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.05296","snapshot_observed_at":"2026-08-04T14:49:06.411073Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.23449","last_updated":"2026-07-10T17:20:34Z","snapshot_observed_at":"2026-08-07T06:18:54.878232Z","submitted_at":"2025-09-27T18:34:32Z","title":"Beyond Embeddings: Interpretable Feature Extraction for Binary Code Similarity","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-04T14:49:06.411073Z"},"links":{"cited_paper":"/paper/1811.05296","citing_paper":"/paper/2509.23449"},"observation_digest":"sha256:41e634758231841e31c53c08f5c8931ccbf26af49d8c91816514cd6a5fa6e6f5","observation_id":"ff39d80c-8496-4843-8466-b3c13b0f76c7","resolution":{"observed_at":"2026-08-04T14:49:06.411073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"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":"1811.05296","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1811.05296","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"2019.URL: https: //arxiv.org/abs/1811.05296","venue":null,"work_id":"504aa667-92b0-4d82-90fd-b0843b566ac0","year":2019},"citing_paper":{"arxiv_id":"2605.21615","last_updated":"2026-05-20T18:23:17Z","snapshot_observed_at":"2026-07-06T23:32:01.202542Z","submitted_at":"2026-05-20T18:23:17Z","title":"ASSEMBLAGE-DEEPHISTORY: A Cross-Build Binary Dataset with Temporal Coverage","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-05-22T09:40:21.746161Z"},"links":{"cited_paper":"/paper/1811.05296","citing_paper":"/paper/2605.21615"},"observation_digest":"sha256:684159510531171b0b024fa6c13e50b73e36f4998543c97fff5b3ada415f4c54","observation_id":"2d64885e-da2f-4ccc-b34b-0907c9d016d7","resolution":{"observed_at":"2026-05-22T09:41:21.682706Z","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-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"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"}}],"links":{"evidence":"/evidence","html":"/paper/1811.05296/citation-record","integrity":"/paper/1811.05296/integrity","json":"/paper/1811.05296/citation-record.json","paper":"/paper/1811.05296"},"outbound":[],"paper":{"arxiv_id":"1811.05296","last_updated":"2019-12-19T10:06:09Z","latest_version":4,"primary_category":"cs.CR","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"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1811.05296."}