{"as_of":"2026-08-20T17:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d1a67cfceeefcb6e7274b86df5ed6183b74fb19832bfd43820d2e8118f9d1dc1","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T23:46:10.521070Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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/2412.02329/citation-record","integrity":"/paper/2412.02329/integrity","json":"/paper/2412.02329/citation-record.json","paper":"/paper/2412.02329"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:46:11.513910Z","title":"Crypto’graph: Leveraging privacy-preserving distributed link prediction for robust graph learn- 20 ing","venue":null,"work_id":"7a4bf0ff-d8cf-429d-bc8c-fb9f536c3862","year":2024},"citing_paper":{"arxiv_id":"2412.02329","last_updated":"2024-12-06T14:20:15Z","snapshot_observed_at":"2026-08-20T07:20:34.457082Z","submitted_at":"2024-12-03T09:42:28Z","title":"GRAND : Graph Reconstruction from potential partial Adjacency and Neighborhood Data","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T23:46:10.358985Z"},"links":{"citing_paper":"/paper/2412.02329"},"observation_digest":"sha256:a4298ed42149ae37a8507787e5821fc218d21f1a5c7dce90ac16d8cfce620a4c","observation_id":"60ebfe05-9fd3-42fe-8981-fcce216ed365","resolution":{"observed_at":"2026-08-11T23:46:11.519912Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T23:46:11.492356Z","title":"Characterizing and recog- nizing exact-distance squares of graphs","venue":null,"work_id":"062420a5-f0df-4e9a-90ef-69c60c3ed3fc","year":2024},"citing_paper":{"arxiv_id":"2412.02329","last_updated":"2024-12-06T14:20:15Z","snapshot_observed_at":"2026-08-20T07:20:34.457082Z","submitted_at":"2024-12-03T09:42:28Z","title":"GRAND : Graph Reconstruction from potential partial Adjacency and Neighborhood Data","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T23:46:10.365241Z"},"links":{"citing_paper":"/paper/2412.02329"},"observation_digest":"sha256:f19a73f2624941cbfc10caf9e2cef83fd89e51fab8cb58ecb738dd863d07c52a","observation_id":"f9331b47-0e5b-48d1-bf4f-a2406ca6ec56","resolution":{"observed_at":"2026-08-11T23:46:11.498040Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T23:46:11.474174Z","title":"Chv´ etal","venue":null,"work_id":"13b0d10b-ca32-46d8-b844-4737e2b4c634","year":null},"citing_paper":{"arxiv_id":"2412.02329","last_updated":"2024-12-06T14:20:15Z","snapshot_observed_at":"2026-08-20T07:20:34.457082Z","submitted_at":"2024-12-03T09:42:28Z","title":"GRAND : Graph Reconstruction from potential partial Adjacency and Neighborhood Data","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T23:46:10.371258Z"},"links":{"citing_paper":"/paper/2412.02329"},"observation_digest":"sha256:526ca3c0ee2af0ec0d663839a8c9cb9aaa3912138eb08ef50108fc3bf7239858","observation_id":"2adf7399-30d8-427e-8fc6-7073d80b318b","resolution":{"observed_at":"2026-08-11T23:46:11.480720Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T23:46:11.456980Z","title":"Fast sequential creation of random realizations of degree sequences","venue":null,"work_id":"fcb1dd8f-42ac-46d1-8f45-ec89115b775d","year":2016},"citing_paper":{"arxiv_id":"2412.02329","last_updated":"2024-12-06T14:20:15Z","snapshot_observed_at":"2026-08-20T07:20:34.457082Z","submitted_at":"2024-12-03T09:42:28Z","title":"GRAND : Graph Reconstruction from potential partial Adjacency and Neighborhood Data","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T23:46:10.383605Z"},"links":{"citing_paper":"/paper/2412.02329"},"observation_digest":"sha256:234acca90c28940e64c794676d21b29b90a243281f88172eb0ea12520aeb2e60","observation_id":"6933cf15-aff7-4860-8636-9f27acbc3398","resolution":{"observed_at":"2026-08-11T23:46:11.462560Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T23:46:11.440447Z","title":"Applications of link prediction in social networks: A review","venue":null,"work_id":"8475d053-27f3-4829-b474-056922067364","year":2020},"citing_paper":{"arxiv_id":"2412.02329","last_updated":"2024-12-06T14:20:15Z","snapshot_observed_at":"2026-08-20T07:20:34.457082Z","submitted_at":"2024-12-03T09:42:28Z","title":"GRAND : Graph Reconstruction from potential partial Adjacency and Neighborhood Data","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T23:46:10.389807Z"},"links":{"citing_paper":"/paper/2412.02329"},"observation_digest":"sha256:a53f558de656a583b377e8d939f11bfaf1ecdf7c3091a7db6447d705fc240393","observation_id":"dbd2babc-4b3e-483c-95ca-c0e5bab44880","resolution":{"observed_at":"2026-08-11T23:46:11.445662Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T23:46:11.422941Z","title":"Privacy-preserving link prediction","venue":null,"work_id":"38ca1c27-dce2-40d2-8b47-307a082395ae","year":null},"citing_paper":{"arxiv_id":"2412.02329","last_updated":"2024-12-06T14:20:15Z","snapshot_observed_at":"2026-08-20T07:20:34.457082Z","submitted_at":"2024-12-03T09:42:28Z","title":"GRAND : Graph Reconstruction from potential partial Adjacency and Neighborhood Data","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T23:46:10.394953Z"},"links":{"citing_paper":"/paper/2412.02329"},"observation_digest":"sha256:736c384c1339b0a327efab5614565b2867dbd22f8655aa4cbc8c2411415902b0","observation_id":"4b3a2932-f051-4437-931f-dc788c4b55e9","resolution":{"observed_at":"2026-08-11T23:46:11.428450Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T23:46:10.406069Z","title":"The approximation of one matrix by another of lower rank","venue":null,"work_id":null,"year":1936},"citing_paper":{"arxiv_id":"2412.02329","last_updated":"2024-12-06T14:20:15Z","snapshot_observed_at":"2026-08-20T07:20:34.457082Z","submitted_at":"2024-12-03T09:42:28Z","title":"GRAND : Graph Reconstruction from potential partial Adjacency and Neighborhood Data","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T23:46:10.406069Z"},"links":{"citing_paper":"/paper/2412.02329"},"observation_digest":"sha256:5ae2284c3521bd97da4ca18da84dfa92abd08e22b2bfc7b609b5675072729d0a","observation_id":"84fde940-2e61-4e3e-bd69-b08e980204ca","resolution":{"observed_at":"2026-08-11T23:46:10.406069Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/icdm.2012.154","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:46:10.599372Z","title":"Reconstructing graphs from neighborhood data","venue":null,"work_id":"1da4d6b2-bbec-4773-a28e-c1d4e214d66a","year":2012},"citing_paper":{"arxiv_id":"2412.02329","last_updated":"2024-12-06T14:20:15Z","snapshot_observed_at":"2026-08-20T07:20:34.457082Z","submitted_at":"2024-12-03T09:42:28Z","title":"GRAND : Graph Reconstruction from potential partial Adjacency and Neighborhood Data","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T23:46:10.411257Z"},"links":{"citing_paper":"/paper/2412.02329"},"observation_digest":"sha256:5fadabf9562f43ce4670eaed8d405d1fe94c0ba2c092ecf7851ebadf19e7a585","observation_id":"b1959d90-0e12-48e6-9bb1-30dc892c2644","resolution":{"observed_at":"2026-08-11T23:46:10.607657Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T23:46:11.374908Z","title":"A survey of link prediction in social networks","venue":null,"work_id":"e6bf5a2d-5019-4bd1-a4d7-ddec8cece8da","year":2011},"citing_paper":{"arxiv_id":"2412.02329","last_updated":"2024-12-06T14:20:15Z","snapshot_observed_at":"2026-08-20T07:20:34.457082Z","submitted_at":"2024-12-03T09:42:28Z","title":"GRAND : Graph Reconstruction from potential partial Adjacency and Neighborhood Data","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T23:46:10.417224Z"},"links":{"citing_paper":"/paper/2412.02329"},"observation_digest":"sha256:bea603871108625397595f1754623c2b2c6168296fa57b0b6fc1a33a36a2fc30","observation_id":"8898a7fa-c829-4ae5-b3d4-434c98fdd13d","resolution":{"observed_at":"2026-08-11T23:46:11.382087Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T23:46:10.422131Z","title":"Matrix analysis","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2412.02329","last_updated":"2024-12-06T14:20:15Z","snapshot_observed_at":"2026-08-20T07:20:34.457082Z","submitted_at":"2024-12-03T09:42:28Z","title":"GRAND : Graph Reconstruction from potential partial Adjacency and Neighborhood Data","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T23:46:10.422131Z"},"links":{"citing_paper":"/paper/2412.02329"},"observation_digest":"sha256:925b932785378cb5b3f53c4d59b25d9d9b67b9bb4365ccf9bde925f9782827d3","observation_id":"a9cd5a7e-b41f-4aac-bf83-c5498e5d1086","resolution":{"observed_at":"2026-08-11T23:46:10.422131Z","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-11T23:46:11.342715Z","title":"Recognizing graphic degree sequences and generating all realizations","venue":null,"work_id":"a0a3af4a-ed0c-4e2c-a1c3-72cfd9d9fd06","year":2011},"citing_paper":{"arxiv_id":"2412.02329","last_updated":"2024-12-06T14:20:15Z","snapshot_observed_at":"2026-08-20T07:20:34.457082Z","submitted_at":"2024-12-03T09:42:28Z","title":"GRAND : Graph Reconstruction from potential partial Adjacency and Neighborhood Data","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T23:46:10.427164Z"},"links":{"citing_paper":"/paper/2412.02329"},"observation_digest":"sha256:8ae6140d41f1571bbfa79f7aa8b516e1762a073e399e530e5bb7e9f874201727","observation_id":"f98c3958-271c-49c4-a12a-7b3426ec90e5","resolution":{"observed_at":"2026-08-11T23:46:11.348462Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2005.06149","last_updated":"2020-05-13T04:43:46Z","snapshot_observed_at":"2026-08-17T08:47:47.338276Z","submitted_at":"2020-05-13T04:43:46Z","title":"DeepRobust: A PyTorch Library for Adversarial Attacks and Defenses","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.06149","snapshot_observed_at":"2026-08-11T23:46:10.432230Z","title":"Deeprobust: A pytorch library for adversarial attacks and defenses","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2412.02329","last_updated":"2024-12-06T14:20:15Z","snapshot_observed_at":"2026-08-20T07:20:34.457082Z","submitted_at":"2024-12-03T09:42:28Z","title":"GRAND : Graph Reconstruction from potential partial Adjacency and Neighborhood Data","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T23:46:10.432230Z"},"links":{"cited_paper":"/paper/2005.06149","citing_paper":"/paper/2412.02329"},"observation_digest":"sha256:6fa0e67903dcfb51b684a4a787714bb7833871a1c874242f86647e3949833068","observation_id":"1942516d-8219-4483-94e2-254a4cafa5eb","resolution":{"observed_at":"2026-08-11T23:46:10.432230Z","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-11T23:46:11.323147Z","title":"The structural analysis of criminal networks","venue":null,"work_id":"1b7e1033-c299-4b81-a50e-91c107a7cf62","year":2021},"citing_paper":{"arxiv_id":"2412.02329","last_updated":"2024-12-06T14:20:15Z","snapshot_observed_at":"2026-08-20T07:20:34.457082Z","submitted_at":"2024-12-03T09:42:28Z","title":"GRAND : Graph Reconstruction from potential partial Adjacency and Neighborhood Data","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T23:46:10.438407Z"},"links":{"citing_paper":"/paper/2412.02329"},"observation_digest":"sha256:fd55950bd3dff3c6fb982d9674d21a9fa5d4fece1bb40017bac2fbed4a21ded6","observation_id":"f868829d-e2fe-4544-97fd-71163e279823","resolution":{"observed_at":"2026-08-11T23:46:11.329066Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T23:46:11.304188Z","title":"Computing roots of graphs is hard","venue":null,"work_id":"0994d73f-2fd3-47ed-80a0-32bae14c8138","year":1994},"citing_paper":{"arxiv_id":"2412.02329","last_updated":"2024-12-06T14:20:15Z","snapshot_observed_at":"2026-08-20T07:20:34.457082Z","submitted_at":"2024-12-03T09:42:28Z","title":"GRAND : Graph Reconstruction from potential partial Adjacency and Neighborhood Data","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T23:46:10.444022Z"},"links":{"citing_paper":"/paper/2412.02329"},"observation_digest":"sha256:419caf9536d9fbe0e374b1abba0c1816c6fc359ad2c67a379d8a739bec207bf7","observation_id":"8dd0a680-bf8c-48c5-85a4-caca7eeaed0b","resolution":{"observed_at":"2026-08-11T23:46:11.309989Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T23:46:10.449037Z","title":"Computing roots of graphs is hard","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2412.02329","last_updated":"2024-12-06T14:20:15Z","snapshot_observed_at":"2026-08-20T07:20:34.457082Z","submitted_at":"2024-12-03T09:42:28Z","title":"GRAND : Graph Reconstruction from potential partial Adjacency and Neighborhood Data","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T23:46:10.449037Z"},"links":{"citing_paper":"/paper/2412.02329"},"observation_digest":"sha256:71893fdc7eaf145f5cadd378115810588cdb21e009e814de73b6d65dbb2accb7","observation_id":"832917bf-7e10-4404-b4e2-362235b18ff4","resolution":{"observed_at":"2026-08-11T23:46:10.449037Z","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-11T23:46:11.285608Z","title":"Biological network analysis with deep learning","venue":null,"work_id":"db53db32-b04e-480a-9056-09df90e0dec5","year":2021},"citing_paper":{"arxiv_id":"2412.02329","last_updated":"2024-12-06T14:20:15Z","snapshot_observed_at":"2026-08-20T07:20:34.457082Z","submitted_at":"2024-12-03T09:42:28Z","title":"GRAND : Graph Reconstruction from potential partial Adjacency and Neighborhood Data","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T23:46:10.454267Z"},"links":{"citing_paper":"/paper/2412.02329"},"observation_digest":"sha256:7e2ab3b6a45eddc82c0823efc635106806b136081e15db4976441b74719611fa","observation_id":"1c867fe8-f0b6-4dc3-8521-ca4a4ddd656d","resolution":{"observed_at":"2026-08-11T23:46:11.291905Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T23:46:10.458964Z","title":"Using graph theory to analyze biological networks","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2412.02329","last_updated":"2024-12-06T14:20:15Z","snapshot_observed_at":"2026-08-20T07:20:34.457082Z","submitted_at":"2024-12-03T09:42:28Z","title":"GRAND : Graph Reconstruction from potential partial Adjacency and Neighborhood Data","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T23:46:10.458964Z"},"links":{"citing_paper":"/paper/2412.02329"},"observation_digest":"sha256:a2e037e47eefd8f33755e64055a1d7c504b1989ee1e41d9252c28528932f7e65","observation_id":"e7baa8e4-ca90-433a-a21a-992c54a9eeab","resolution":{"observed_at":"2026-08-11T23:46:10.458964Z","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-11T23:46:11.257158Z","title":"Rossi and Nesreen K","venue":null,"work_id":"ce1e7a37-c73c-4298-a8f2-cf6519cfbb5d","year":2015},"citing_paper":{"arxiv_id":"2412.02329","last_updated":"2024-12-06T14:20:15Z","snapshot_observed_at":"2026-08-20T07:20:34.457082Z","submitted_at":"2024-12-03T09:42:28Z","title":"GRAND : Graph Reconstruction from potential partial Adjacency and Neighborhood Data","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T23:46:10.464255Z"},"links":{"citing_paper":"/paper/2412.02329"},"observation_digest":"sha256:a7b0dc10f68b6da3af2ef5dc5e09dd75c09a6845107461e99eb4f1efee0843fa","observation_id":"527193a4-3882-416b-b4e1-86fc124c01f0","resolution":{"observed_at":"2026-08-11T23:46:11.262455Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T23:46:11.239146Z","title":"Silva, Ing-Ren Tsang, George D","venue":null,"work_id":"8e46bec1-dc69-43d4-ad1d-ddfa495da8fb","year":2010},"citing_paper":{"arxiv_id":"2412.02329","last_updated":"2024-12-06T14:20:15Z","snapshot_observed_at":"2026-08-20T07:20:34.457082Z","submitted_at":"2024-12-03T09:42:28Z","title":"GRAND : Graph Reconstruction from potential partial Adjacency and Neighborhood Data","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T23:46:10.469839Z"},"links":{"citing_paper":"/paper/2412.02329"},"observation_digest":"sha256:6993b8d7afc24be8560c591a69857644ea0b118671d90e8915fcaca403a80bc8","observation_id":"59ddd4de-28a9-4e56-bb5b-2e6aa6a2a00d","resolution":{"observed_at":"2026-08-11T23:46:11.245052Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T23:46:10.475404Z","title":"van Dam and Willem H","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2412.02329","last_updated":"2024-12-06T14:20:15Z","snapshot_observed_at":"2026-08-20T07:20:34.457082Z","submitted_at":"2024-12-03T09:42:28Z","title":"GRAND : Graph Reconstruction from potential partial Adjacency and Neighborhood Data","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T23:46:10.475404Z"},"links":{"citing_paper":"/paper/2412.02329"},"observation_digest":"sha256:9b75d5bd7fcd198b58c44e7dcb650cd4dc6f4b8a6c0b8f79889c6fafc73c313a","observation_id":"b3be6dbe-0865-4544-8611-8130fa567c77","resolution":{"observed_at":"2026-08-11T23:46:10.475404Z","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-11T23:46:11.216852Z","title":"Graph spectra for complex networks","venue":null,"work_id":"463f5b0a-7737-47be-bbd5-ad816b1dc431","year":2023},"citing_paper":{"arxiv_id":"2412.02329","last_updated":"2024-12-06T14:20:15Z","snapshot_observed_at":"2026-08-20T07:20:34.457082Z","submitted_at":"2024-12-03T09:42:28Z","title":"GRAND : Graph Reconstruction from potential partial Adjacency and Neighborhood Data","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T23:46:10.480579Z"},"links":{"citing_paper":"/paper/2412.02329"},"observation_digest":"sha256:bc1f6de1e65ad9b5b758589d0fd0325482ac29f6f7f4caf696802fa8fd9e51ba","observation_id":"5fb78e42-40fd-47f4-adfb-26eae623d5e3","resolution":{"observed_at":"2026-08-11T23:46:11.224585Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T23:46:10.486550Z","title":"Co-eigenvector graphs","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.02329","last_updated":"2024-12-06T14:20:15Z","snapshot_observed_at":"2026-08-20T07:20:34.457082Z","submitted_at":"2024-12-03T09:42:28Z","title":"GRAND : Graph Reconstruction from potential partial Adjacency and Neighborhood Data","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T23:46:10.486550Z"},"links":{"citing_paper":"/paper/2412.02329"},"observation_digest":"sha256:7f66cb3de06e6b8746415a107c4a1d1a606c0b8956c5f95e57f3e9013e8ee071","observation_id":"44572724-5871-464f-95a4-fd8fe39a4816","resolution":{"observed_at":"2026-08-11T23:46:10.486550Z","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-11T23:46:11.198637Z","title":"Detection of drug-drug interactions by modeling interaction profile fingerprints","venue":null,"work_id":"be8f2483-84b2-4ac0-a2d6-1ee40b093549","year":2013},"citing_paper":{"arxiv_id":"2412.02329","last_updated":"2024-12-06T14:20:15Z","snapshot_observed_at":"2026-08-20T07:20:34.457082Z","submitted_at":"2024-12-03T09:42:28Z","title":"GRAND : Graph Reconstruction from potential partial Adjacency and Neighborhood Data","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T23:46:10.492507Z"},"links":{"citing_paper":"/paper/2412.02329"},"observation_digest":"sha256:76adbf105add54526716a1d7f69ba0525625787f5db110d3fae0eb444a996189","observation_id":"b2caaf09-aac7-43ec-b3c8-acf267669134","resolution":{"observed_at":"2026-08-11T23:46:11.204162Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T23:46:10.498141Z","title":"Puttaswamy, and Ben Y","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2412.02329","last_updated":"2024-12-06T14:20:15Z","snapshot_observed_at":"2026-08-20T07:20:34.457082Z","submitted_at":"2024-12-03T09:42:28Z","title":"GRAND : Graph Reconstruction from potential partial Adjacency and Neighborhood Data","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T23:46:10.498141Z"},"links":{"citing_paper":"/paper/2412.02329"},"observation_digest":"sha256:8c5b7dc772e8c3a72b412339e65a16e0585c4faf1052783b1b84931dedf22ce3","observation_id":"5583cb7d-abf2-4352-a468-ae0f6c6db428","resolution":{"observed_at":"2026-08-11T23:46:10.498141Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:46:10.503767Z","title":"Ad- versarial examples for graph data: Deep insights into attack and defense","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.02329","last_updated":"2024-12-06T14:20:15Z","snapshot_observed_at":"2026-08-20T07:20:34.457082Z","submitted_at":"2024-12-03T09:42:28Z","title":"GRAND : Graph Reconstruction from potential partial Adjacency and Neighborhood Data","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T23:46:10.503767Z"},"links":{"citing_paper":"/paper/2412.02329"},"observation_digest":"sha256:ab2fe08b2fcc4a0a61caa8292cee333ef9457ece8069db662b5cd83fef24ac7b","observation_id":"218f70fe-6cd1-4f0a-8bde-eab758b32871","resolution":{"observed_at":"2026-08-11T23:46:10.503767Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:46:10.509828Z","title":"Gunter, and Bo Li","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.02329","last_updated":"2024-12-06T14:20:15Z","snapshot_observed_at":"2026-08-20T07:20:34.457082Z","submitted_at":"2024-12-03T09:42:28Z","title":"GRAND : Graph Reconstruction from potential partial Adjacency and Neighborhood Data","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T23:46:10.509828Z"},"links":{"citing_paper":"/paper/2412.02329"},"observation_digest":"sha256:fb8c52bb4666aebc1666555de22702ae7200b3e3a97a2d62c13b4255d76becd8","observation_id":"c6178ebe-3d63-445d-8e89-98fb49190c16","resolution":{"observed_at":"2026-08-11T23:46:10.509828Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:46:10.515611Z","title":"Predicting potential drug-drug interactions by integrating chemical, biological, phenotypic and network data","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.02329","last_updated":"2024-12-06T14:20:15Z","snapshot_observed_at":"2026-08-20T07:20:34.457082Z","submitted_at":"2024-12-03T09:42:28Z","title":"GRAND : Graph Reconstruction from potential partial Adjacency and Neighborhood Data","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T23:46:10.515611Z"},"links":{"citing_paper":"/paper/2412.02329"},"observation_digest":"sha256:c40ef6654e4683b6ec6336d6aa581dc1c65fa4569f98fbcbb5fc8be16e2cf245","observation_id":"8b326a05-4329-4c8a-a7a1-1a41435aa879","resolution":{"observed_at":"2026-08-11T23:46:10.515611Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:46:10.521070Z","title":"Adversarial attacks on neural networks for graph data","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.02329","last_updated":"2024-12-06T14:20:15Z","snapshot_observed_at":"2026-08-20T07:20:34.457082Z","submitted_at":"2024-12-03T09:42:28Z","title":"GRAND : Graph Reconstruction from potential partial Adjacency and Neighborhood Data","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T23:46:10.521070Z"},"links":{"citing_paper":"/paper/2412.02329"},"observation_digest":"sha256:85b85ecb2f41631f1a9f81de96a1bbeed4a7e660b68281d3c31857e4b75dc303","observation_id":"73329c0f-f21e-4ea8-a999-b6ef288518be","resolution":{"observed_at":"2026-08-11T23:46:10.521070Z","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.1016/s0167-5060(08)70883-5","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:46:10.626692Z","title":null,"venue":null,"work_id":"1c3f6934-7309-4df4-8733-aa031c820098","year":null},"citing_paper":{"arxiv_id":"2412.02329","last_updated":"2024-12-06T14:20:15Z","snapshot_observed_at":"2026-08-20T07:20:34.457082Z","submitted_at":"2024-12-03T09:42:28Z","title":"GRAND : Graph Reconstruction from potential partial Adjacency and Neighborhood Data","version":2},"reference_index":1980,"source":"pdf_text","source_observed_at":"2026-08-11T23:46:10.377266Z"},"links":{"citing_paper":"/paper/2412.02329"},"observation_digest":"sha256:8e1e686c544fa872fea193c048ced74325e7e7e509c815140bbdfa394e52406f","observation_id":"c6ea7c5b-c3aa-460e-8da3-fd9d85f602c7","resolution":{"observed_at":"2026-08-11T23:46:10.632350Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-11T23:46:10.400445Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.02329","last_updated":"2024-12-06T14:20:15Z","snapshot_observed_at":"2026-08-20T07:20:34.457082Z","submitted_at":"2024-12-03T09:42:28Z","title":"GRAND : Graph Reconstruction from potential partial Adjacency and Neighborhood Data","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-11T23:46:10.400445Z"},"links":{"citing_paper":"/paper/2412.02329"},"observation_digest":"sha256:b666c37efcc66b7a314a36fe2b56a8d5b6361bb6cd2c1a8db4b4f70c6151c0fe","observation_id":"25b875c3-20a6-456d-8bb5-ebf3c501a8d4","resolution":{"observed_at":"2026-08-11T23:46:10.400445Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.02329","last_updated":"2024-12-06T14:20:15Z","latest_version":2,"primary_category":"cs.CR","snapshot_observed_at":"2026-08-20T07:20:34.457082Z","submitted_at":"2024-12-03T09:42:28Z","title":"GRAND : Graph Reconstruction from potential partial Adjacency and Neighborhood Data"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":2,"verified_fuzzy":15},"total_outbound_references":30},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:2412.02329."}