{"as_of":"2026-08-21T16:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:843df007d5c11649a489b6753e7260b2bc88d209d254555795aa6fd3ee5832be","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-05-17T01:35:42.375860Z","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-21T06:32:19.484+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/2512.04280/citation-record","integrity":"/paper/2512.04280/integrity","json":"/paper/2512.04280/citation-record.json","paper":"/paper/2512.04280"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A comparative study of subgraph matching isomorphic methods in social networks","venue":null,"work_id":"83603dee-7427-4c5a-bfc5-1ed19f4880e5","year":2018},"citing_paper":{"arxiv_id":"2512.04280","last_updated":"2026-04-24T18:48:21Z","snapshot_observed_at":"2026-07-06T22:37:45.947333Z","submitted_at":"2025-12-03T21:45:11Z","title":"A customizable inexact subgraph matching algorithm for attributed graphs","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-17T01:35:42.375860Z"},"links":{"citing_paper":"/paper/2512.04280"},"observation_digest":"sha256:69b37548c7cf47c26abe16258dfda65f3aa4d31b2f19dbd13cd692f63ffc1d2b","observation_id":"24124082-3095-4e6c-80dd-751704be982f","resolution":{"observed_at":"2026-05-17T01:41:25.764505Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-05T21:23:00.469572Z","title":"Road network detection using probabilistic and graph theoretical methods","venue":null,"work_id":"1af91bb1-aa8d-40a9-9eb8-60f058a5d8c4","year":2012},"citing_paper":{"arxiv_id":"2512.04280","last_updated":"2026-04-24T18:48:21Z","snapshot_observed_at":"2026-07-06T22:37:45.947333Z","submitted_at":"2025-12-03T21:45:11Z","title":"A customizable inexact subgraph matching algorithm for attributed graphs","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-17T01:35:42.375860Z"},"links":{"citing_paper":"/paper/2512.04280"},"observation_digest":"sha256:a3fb3545b246e5c1335aad8c0e7384c2883d2df70f62dd4cadc67f5a7c539e9a","observation_id":"ebc89421-affa-4ce4-ae05-3a695f1e37e3","resolution":{"observed_at":"2026-05-17T01:41:25.797241Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-05T21:23:00.469572Z","title":"SAGA: a subgraph matching tool for biological graphs","venue":null,"work_id":"5b1f1af8-8ee3-4a58-8d60-2bbfd40ec166","year":2007},"citing_paper":{"arxiv_id":"2512.04280","last_updated":"2026-04-24T18:48:21Z","snapshot_observed_at":"2026-07-06T22:37:45.947333Z","submitted_at":"2025-12-03T21:45:11Z","title":"A customizable inexact subgraph matching algorithm for attributed graphs","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-17T01:35:42.375860Z"},"links":{"citing_paper":"/paper/2512.04280"},"observation_digest":"sha256:5450af20d7b7891cf0112ed88783e18576d27b3be8537d1deba966a40f5939fa","observation_id":"6d820eec-f921-4cb5-8541-4b88f2adc0fa","resolution":{"observed_at":"2026-05-17T01:41:25.809500Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-05T21:23:00.469572Z","title":"GADDI: distance index based subgraph matching in biological networks","venue":null,"work_id":"b6c5e88e-a700-4294-8f1e-f113afc37c8e","year":2009},"citing_paper":{"arxiv_id":"2512.04280","last_updated":"2026-04-24T18:48:21Z","snapshot_observed_at":"2026-07-06T22:37:45.947333Z","submitted_at":"2025-12-03T21:45:11Z","title":"A customizable inexact subgraph matching algorithm for attributed graphs","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-17T01:35:42.375860Z"},"links":{"citing_paper":"/paper/2512.04280"},"observation_digest":"sha256:5fbb40ece71c325956cb1b7955416ba20c37e8c536775d47d17fd27bf916ad0b","observation_id":"14957d4d-afe0-4737-b698-d45bfa873c85","resolution":{"observed_at":"2026-05-17T01:41:25.779351Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-05T21:23:00.469572Z","title":"VF2 Plus: An improved version of VF2 for biological graphs","venue":null,"work_id":"f74a076a-b80c-4106-8c6f-f954120a6f37","year":2015},"citing_paper":{"arxiv_id":"2512.04280","last_updated":"2026-04-24T18:48:21Z","snapshot_observed_at":"2026-07-06T22:37:45.947333Z","submitted_at":"2025-12-03T21:45:11Z","title":"A customizable inexact subgraph matching algorithm for attributed graphs","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-17T01:35:42.375860Z"},"links":{"citing_paper":"/paper/2512.04280"},"observation_digest":"sha256:7ad81238cea88159613eed96add3b8f5b46de1fcd9270f792f5f2b2300771310","observation_id":"20b124af-ed8d-4718-8c79-96fa8137c249","resolution":{"observed_at":"2026-05-17T01:41:25.773120Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-05T21:23:00.469572Z","title":"A subgraph isomorphism algorithm and its application to biochemical data","venue":null,"work_id":"67b9eca0-28ff-4f8f-8152-468b853e4907","year":2013},"citing_paper":{"arxiv_id":"2512.04280","last_updated":"2026-04-24T18:48:21Z","snapshot_observed_at":"2026-07-06T22:37:45.947333Z","submitted_at":"2025-12-03T21:45:11Z","title":"A customizable inexact subgraph matching algorithm for attributed graphs","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-17T01:35:42.375860Z"},"links":{"citing_paper":"/paper/2512.04280"},"observation_digest":"sha256:784dd29e552392a1c1c09b04a9bfe4d827dde30491e10e1a6bdd2b7f59e7a125","observation_id":"6c4f54c3-75cf-461f-8e04-1e96011d7287","resolution":{"observed_at":"2026-05-17T01:41:25.794307Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-05T21:23:00.469572Z","title":"LibAM: An Area Matching Framework for Detecting Third-party Libraries in Binaries","venue":null,"work_id":"29f8ff76-600f-43f1-8430-a220b0de4a68","year":2023},"citing_paper":{"arxiv_id":"2512.04280","last_updated":"2026-04-24T18:48:21Z","snapshot_observed_at":"2026-07-06T22:37:45.947333Z","submitted_at":"2025-12-03T21:45:11Z","title":"A customizable inexact subgraph matching algorithm for attributed graphs","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-17T01:35:42.375860Z"},"links":{"citing_paper":"/paper/2512.04280"},"observation_digest":"sha256:ce7e6f729fdd956dcf850a8a147cb7a0570f0afe826b7584b8f0fdd15f2ccc90","observation_id":"0654f6db-721c-4264-acdf-ea813885762a","resolution":{"observed_at":"2026-05-17T01:41:25.782463Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-05T21:23:00.469572Z","title":"Graph-based comparison of executable objects (english version)","venue":null,"work_id":"df8e460b-5cba-41b8-bab0-7bcabaf236c1","year":2005},"citing_paper":{"arxiv_id":"2512.04280","last_updated":"2026-04-24T18:48:21Z","snapshot_observed_at":"2026-07-06T22:37:45.947333Z","submitted_at":"2025-12-03T21:45:11Z","title":"A customizable inexact subgraph matching algorithm for attributed graphs","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-17T01:35:42.375860Z"},"links":{"citing_paper":"/paper/2512.04280"},"observation_digest":"sha256:a31fc45d32d10aa6d736a2b73d6061277bb9f824223746cb89caf88e0bc7e836","observation_id":"443e484f-49e3-4ac6-8f72-b1050def6477","resolution":{"observed_at":"2026-05-17T01:41:25.791556Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-05T21:23:00.469572Z","title":"Libdb: An effective and efficient framework for detecting third-party libraries in binaries","venue":null,"work_id":"b4a3be48-5cf9-4757-9a20-7a98b2f5f9e5","year":2022},"citing_paper":{"arxiv_id":"2512.04280","last_updated":"2026-04-24T18:48:21Z","snapshot_observed_at":"2026-07-06T22:37:45.947333Z","submitted_at":"2025-12-03T21:45:11Z","title":"A customizable inexact subgraph matching algorithm for attributed graphs","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-17T01:35:42.375860Z"},"links":{"citing_paper":"/paper/2512.04280"},"observation_digest":"sha256:074d77225bd47e5b12106258ef6b368480ef4c8788ec3e3610de1b97b5927cca","observation_id":"5f3bf8ea-8bf9-412d-a936-fc82453ec18d","resolution":{"observed_at":"2026-05-17T01:41:25.806121Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-05T21:23:00.469572Z","title":"Interpretation-enabled software reuse detection based on a multi-level birthmark model","venue":null,"work_id":"6e6e74e8-3092-47ad-afa4-8e1baa559fcd","year":2021},"citing_paper":{"arxiv_id":"2512.04280","last_updated":"2026-04-24T18:48:21Z","snapshot_observed_at":"2026-07-06T22:37:45.947333Z","submitted_at":"2025-12-03T21:45:11Z","title":"A customizable inexact subgraph matching algorithm for attributed graphs","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-17T01:35:42.375860Z"},"links":{"citing_paper":"/paper/2512.04280"},"observation_digest":"sha256:2c459526b569e5570a1b11c7e7b60647bf0feb29e1decb65b9d694eb37cd8ca5","observation_id":"99701dbf-29f3-4f96-9122-bf57e9a5af24","resolution":{"observed_at":"2026-05-17T01:41:25.770238Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-05T21:23:00.469572Z","title":"Graph matching applications in pattern recognition and image processing","venue":null,"work_id":"3a3a9eaa-f370-4605-82cb-2d024e9f07d9","year":2003},"citing_paper":{"arxiv_id":"2512.04280","last_updated":"2026-04-24T18:48:21Z","snapshot_observed_at":"2026-07-06T22:37:45.947333Z","submitted_at":"2025-12-03T21:45:11Z","title":"A customizable inexact subgraph matching algorithm for attributed graphs","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-17T01:35:42.375860Z"},"links":{"citing_paper":"/paper/2512.04280"},"observation_digest":"sha256:ffc205f77498cadc3f66645746e7f6adc50d4e9caf20695ae3ec7416b8663796","observation_id":"974ab421-d1b4-4904-807e-dde2ebf01542","resolution":{"observed_at":"2026-05-17T01:41:25.815081Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-05T21:23:00.469572Z","title":"Symbol recognition by error-tolerant subgraph matching between region adjacency graphs","venue":null,"work_id":"0e79ee44-c580-4acc-b25c-6c22319f935c","year":2001},"citing_paper":{"arxiv_id":"2512.04280","last_updated":"2026-04-24T18:48:21Z","snapshot_observed_at":"2026-07-06T22:37:45.947333Z","submitted_at":"2025-12-03T21:45:11Z","title":"A customizable inexact subgraph matching algorithm for attributed graphs","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-17T01:35:42.375860Z"},"links":{"citing_paper":"/paper/2512.04280"},"observation_digest":"sha256:c4018de951bee28bd40e07fe6863118d20985c6aed7f0f3323399db9988a30d1","observation_id":"a64ba5cd-91eb-4ad4-90be-33ba1371398e","resolution":{"observed_at":"2026-05-17T01:41:25.800085Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-05T21:23:00.469572Z","title":"Efficient attributed graph matching and its application to image analysis","venue":null,"work_id":"8d74ab28-8247-4c56-b836-8ad490e4f2c9","year":1995},"citing_paper":{"arxiv_id":"2512.04280","last_updated":"2026-04-24T18:48:21Z","snapshot_observed_at":"2026-07-06T22:37:45.947333Z","submitted_at":"2025-12-03T21:45:11Z","title":"A customizable inexact subgraph matching algorithm for attributed graphs","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-17T01:35:42.375860Z"},"links":{"citing_paper":"/paper/2512.04280"},"observation_digest":"sha256:fab5893bdbc9390e543351a529682ee817d351e777fe81a78091a5d44ce1a06e","observation_id":"257bfd62-8fea-41d8-b993-643cdb92e561","resolution":{"observed_at":"2026-05-17T01:41:25.812522Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-05T21:23:00.469572Z","title":"Structural matching in computer vision using probabilistic relaxation","venue":null,"work_id":"4de57628-84da-4283-9a82-943ac725802a","year":1995},"citing_paper":{"arxiv_id":"2512.04280","last_updated":"2026-04-24T18:48:21Z","snapshot_observed_at":"2026-07-06T22:37:45.947333Z","submitted_at":"2025-12-03T21:45:11Z","title":"A customizable inexact subgraph matching algorithm for attributed graphs","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-17T01:35:42.375860Z"},"links":{"citing_paper":"/paper/2512.04280"},"observation_digest":"sha256:40eeac841b565ef3683b057c5b92cd16cf8cb0c46d23f1d7a4cf042128ce2593","observation_id":"1462f0ce-ef1e-4dab-aedb-e2b1aba5d93c","resolution":{"observed_at":"2026-05-17T01:41:25.785464Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-05T21:23:00.469572Z","title":"Thirty years of graph matching in pattern recognition","venue":null,"work_id":"15b8e93f-2dc1-4dad-bb5f-80d4e5ecff66","year":2004},"citing_paper":{"arxiv_id":"2512.04280","last_updated":"2026-04-24T18:48:21Z","snapshot_observed_at":"2026-07-06T22:37:45.947333Z","submitted_at":"2025-12-03T21:45:11Z","title":"A customizable inexact subgraph matching algorithm for attributed graphs","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-17T01:35:42.375860Z"},"links":{"citing_paper":"/paper/2512.04280"},"observation_digest":"sha256:b5048a6ab6fed721f8a23226f9e8a34a4969502d4a6700ac9a5f5f96f11b7840","observation_id":"e59bdbe8-3b30-429f-8166-d07bdeeeff41","resolution":{"observed_at":"2026-05-17T01:41:25.776234Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-05T21:23:00.469572Z","title":"The complexity of theorem-proving procedures","venue":null,"work_id":"7f02d67f-269b-4443-942c-cd00ff45844d","year":2023},"citing_paper":{"arxiv_id":"2512.04280","last_updated":"2026-04-24T18:48:21Z","snapshot_observed_at":"2026-07-06T22:37:45.947333Z","submitted_at":"2025-12-03T21:45:11Z","title":"A customizable inexact subgraph matching algorithm for attributed graphs","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-17T01:35:42.375860Z"},"links":{"citing_paper":"/paper/2512.04280"},"observation_digest":"sha256:7fd0e2e0cd2b328cdd24eb6b080bb3388f7e2e49d76899d18d056ee29456aa05","observation_id":"8c005768-83c0-4914-92cc-ba065bbbecc4","resolution":{"observed_at":"2026-05-17T01:38:51.268973Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-05T21:23:00.469572Z","title":"An algorithm for subgraph isomorphism","venue":null,"work_id":"709ef119-b032-4a2c-ade6-851aaccb7762","year":1976},"citing_paper":{"arxiv_id":"2512.04280","last_updated":"2026-04-24T18:48:21Z","snapshot_observed_at":"2026-07-06T22:37:45.947333Z","submitted_at":"2025-12-03T21:45:11Z","title":"A customizable inexact subgraph matching algorithm for attributed graphs","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-17T01:35:42.375860Z"},"links":{"citing_paper":"/paper/2512.04280"},"observation_digest":"sha256:b60f7e851e9cd827af112a435e60360267e4eb1ff651985d4baf0640624a878c","observation_id":"96d43417-dfe3-41e7-920b-893683621bbe","resolution":{"observed_at":"2026-05-17T01:41:25.767380Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-05T21:23:00.469572Z","title":"A (sub) graph isomorphism algorithm for matching large graphs","venue":null,"work_id":"b1e85e1e-9839-446b-99d8-6c64d16d62d1","year":2004},"citing_paper":{"arxiv_id":"2512.04280","last_updated":"2026-04-24T18:48:21Z","snapshot_observed_at":"2026-07-06T22:37:45.947333Z","submitted_at":"2025-12-03T21:45:11Z","title":"A customizable inexact subgraph matching algorithm for attributed graphs","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-17T01:35:42.375860Z"},"links":{"citing_paper":"/paper/2512.04280"},"observation_digest":"sha256:3719832876cde7fa61930a2422fe646f8e25a23e27b31cc9e060fc3501d8f037","observation_id":"046dbc0a-ebf2-48c3-ade8-06d0ebbae798","resolution":{"observed_at":"2026-05-17T01:41:25.802899Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-05T21:23:00.469572Z","title":"Introducing VF3: A new al- gorithm for subgraph isomorphism","venue":null,"work_id":"039562b4-6454-4a52-8df3-bad39b012e03","year":2017},"citing_paper":{"arxiv_id":"2512.04280","last_updated":"2026-04-24T18:48:21Z","snapshot_observed_at":"2026-07-06T22:37:45.947333Z","submitted_at":"2025-12-03T21:45:11Z","title":"A customizable inexact subgraph matching algorithm for attributed graphs","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-17T01:35:42.375860Z"},"links":{"citing_paper":"/paper/2512.04280"},"observation_digest":"sha256:aa352a45d727c008b7cdb5cfbba94fa91b2e87f83027677feba3e53372f413c4","observation_id":"e71fbec5-aab2-4ad1-9de9-5412bf537d32","resolution":{"observed_at":"2026-05-17T01:41:25.788640Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-05T21:23:00.469572Z","title":"Taming verification hardness: an efficient algorithm for testing subgraph isomorphism","venue":null,"work_id":"b7d4b75d-7f48-4469-b25d-cafd54d28754","year":2008},"citing_paper":{"arxiv_id":"2512.04280","last_updated":"2026-04-24T18:48:21Z","snapshot_observed_at":"2026-07-06T22:37:45.947333Z","submitted_at":"2025-12-03T21:45:11Z","title":"A customizable inexact subgraph matching algorithm for attributed graphs","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-17T01:35:42.375860Z"},"links":{"citing_paper":"/paper/2512.04280"},"observation_digest":"sha256:1ccbe846f461b14c60e4bfc8e81635dd440a5e066c917d44b46cd8fd86528f93","observation_id":"653c97a7-a347-4eb5-bb3d-31e853627ed6","resolution":{"observed_at":"2026-05-17T01:38:51.253896Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-05T21:23:00.469572Z","title":"Graphs-at-a-time: query language and access methods for graph databases","venue":null,"work_id":"f25ab9e3-8b95-4275-87c2-08d31eef1086","year":2008},"citing_paper":{"arxiv_id":"2512.04280","last_updated":"2026-04-24T18:48:21Z","snapshot_observed_at":"2026-07-06T22:37:45.947333Z","submitted_at":"2025-12-03T21:45:11Z","title":"A customizable inexact subgraph matching algorithm for attributed graphs","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-17T01:35:42.375860Z"},"links":{"citing_paper":"/paper/2512.04280"},"observation_digest":"sha256:4780059548a4d1902843452e7059d8cccf3ddb95975176523d5c80a4de2e51d5","observation_id":"72905ed3-3d0a-47f2-bdc2-2a3e0d018e20","resolution":{"observed_at":"2026-05-17T01:38:51.256952Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-05T21:23:00.469572Z","title":"On graph query optimization in large networks","venue":null,"work_id":"e35662b5-6e1d-41fc-bfc4-6b38399454d3","year":2010},"citing_paper":{"arxiv_id":"2512.04280","last_updated":"2026-04-24T18:48:21Z","snapshot_observed_at":"2026-07-06T22:37:45.947333Z","submitted_at":"2025-12-03T21:45:11Z","title":"A customizable inexact subgraph matching algorithm for attributed graphs","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-17T01:35:42.375860Z"},"links":{"citing_paper":"/paper/2512.04280"},"observation_digest":"sha256:f7e93f529cb1fdc76938d636aa002065e27a0f282e72f7c300ee906cc0ada8c2","observation_id":"a050c5ac-1602-4de5-ad4e-0805e42915e8","resolution":{"observed_at":"2026-05-17T01:38:51.260038Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-05T21:23:00.469572Z","title":"G-finder: Approximate attributed subgraph matching","venue":null,"work_id":"cc9a0cfe-7436-4198-9684-b08542b2d9a3","year":2019},"citing_paper":{"arxiv_id":"2512.04280","last_updated":"2026-04-24T18:48:21Z","snapshot_observed_at":"2026-07-06T22:37:45.947333Z","submitted_at":"2025-12-03T21:45:11Z","title":"A customizable inexact subgraph matching algorithm for attributed graphs","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-17T01:35:42.375860Z"},"links":{"citing_paper":"/paper/2512.04280"},"observation_digest":"sha256:4eb128d11037ebe86ada6c5b7f9b6921135ff525a2884f38f8ec02cf96fe4344","observation_id":"39058e79-1488-4ded-97ea-d5eb04719b9b","resolution":{"observed_at":"2026-05-17T01:38:51.266284Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-05T21:23:00.469572Z","title":"Tale: A tool for approximate large graph matching","venue":null,"work_id":"f27a04e3-122c-48ee-a3bb-4cacbd5f68c4","year":2008},"citing_paper":{"arxiv_id":"2512.04280","last_updated":"2026-04-24T18:48:21Z","snapshot_observed_at":"2026-07-06T22:37:45.947333Z","submitted_at":"2025-12-03T21:45:11Z","title":"A customizable inexact subgraph matching algorithm for attributed graphs","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-17T01:35:42.375860Z"},"links":{"citing_paper":"/paper/2512.04280"},"observation_digest":"sha256:e90e5b9010b5b05247b86e9cc254a43fd45a110a4753ee1b49e3c58ad54e2d44","observation_id":"44508027-8ea4-4eb0-9f6d-546052f38190","resolution":{"observed_at":"2026-05-17T01:38:51.247804Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-05T21:23:00.469572Z","title":"Inexact attributed subgraph matching","venue":null,"work_id":"e4355dd0-4311-42d9-ae64-e304966508bd","year":2020},"citing_paper":{"arxiv_id":"2512.04280","last_updated":"2026-04-24T18:48:21Z","snapshot_observed_at":"2026-07-06T22:37:45.947333Z","submitted_at":"2025-12-03T21:45:11Z","title":"A customizable inexact subgraph matching algorithm for attributed graphs","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-17T01:35:42.375860Z"},"links":{"citing_paper":"/paper/2512.04280"},"observation_digest":"sha256:2a5f2ecdec12be36569cc1f1f269b4201fe8b3483fb205272f2c039983ad0565","observation_id":"f098fcda-3820-417b-97fb-de7742eb90d9","resolution":{"observed_at":"2026-05-17T01:38:51.244770Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-05T21:23:00.469572Z","title":"Mage: Matching approxi- mate patterns in richly-attributed graphs","venue":null,"work_id":"58b21ac9-51a9-4148-b5b9-056be1670479","year":2014},"citing_paper":{"arxiv_id":"2512.04280","last_updated":"2026-04-24T18:48:21Z","snapshot_observed_at":"2026-07-06T22:37:45.947333Z","submitted_at":"2025-12-03T21:45:11Z","title":"A customizable inexact subgraph matching algorithm for attributed graphs","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-17T01:35:42.375860Z"},"links":{"citing_paper":"/paper/2512.04280"},"observation_digest":"sha256:77e9b88c483348c4477723e3b2973feba57859bbe859295187545a4692cdf302","observation_id":"ddd6d187-f505-4614-ab90-1517f07fab94","resolution":{"observed_at":"2026-05-17T01:38:51.250875Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-05T21:23:00.469572Z","title":"Cytoscape: a software environment for integrated models of biomolec- ular interaction networks","venue":null,"work_id":"10469144-c0bf-4354-96a9-75ffa68f2193","year":2003},"citing_paper":{"arxiv_id":"2512.04280","last_updated":"2026-04-24T18:48:21Z","snapshot_observed_at":"2026-07-06T22:37:45.947333Z","submitted_at":"2025-12-03T21:45:11Z","title":"A customizable inexact subgraph matching algorithm for attributed graphs","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-17T01:35:42.375860Z"},"links":{"citing_paper":"/paper/2512.04280"},"observation_digest":"sha256:290217d9bdd8e5408bb308453bf50d1cffd02c77e7061b30810addb513f3a3b2","observation_id":"6c152c9d-2047-4c6b-8bd9-039a41ca20bb","resolution":{"observed_at":"2026-05-17T01:38:51.263113Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-05T21:23:00.469572Z","title":"Similarity of binaries through re- optimization","venue":null,"work_id":"50faf312-c813-44c5-b5b1-078ae7e3d660","year":2017},"citing_paper":{"arxiv_id":"2512.04280","last_updated":"2026-04-24T18:48:21Z","snapshot_observed_at":"2026-07-06T22:37:45.947333Z","submitted_at":"2025-12-03T21:45:11Z","title":"A customizable inexact subgraph matching algorithm for attributed graphs","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-17T01:35:42.375860Z"},"links":{"citing_paper":"/paper/2512.04280"},"observation_digest":"sha256:1bf3adc9736487b9c1cb0abbc93bf05dfe732ed59fba988b29111465350023a2","observation_id":"324e9e51-1270-45de-8ffb-17afd23e51be","resolution":{"observed_at":"2026-05-17T01:38:51.241732Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-05T21:23:00.469572Z","title":"Scalable graph-based bug search for firmware images","venue":null,"work_id":"757893f3-7fdf-452d-b9e9-216db5995223","year":2016},"citing_paper":{"arxiv_id":"2512.04280","last_updated":"2026-04-24T18:48:21Z","snapshot_observed_at":"2026-07-06T22:37:45.947333Z","submitted_at":"2025-12-03T21:45:11Z","title":"A customizable inexact subgraph matching algorithm for attributed graphs","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-17T01:35:42.375860Z"},"links":{"citing_paper":"/paper/2512.04280"},"observation_digest":"sha256:3f7bb11e361da7c2c61654bc4e6735dba179e8907e20ddf28cba30aff875d8e7","observation_id":"f690f30e-22f4-4846-a894-f75b2b32ebba","resolution":{"observed_at":"2026-05-17T01:38:51.238815Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-05T21:23:00.469572Z","title":"A survey of binary code similarity","venue":null,"work_id":"9d840132-9d4f-42a8-aa0b-6e1f2ebd2534","year":2021},"citing_paper":{"arxiv_id":"2512.04280","last_updated":"2026-04-24T18:48:21Z","snapshot_observed_at":"2026-07-06T22:37:45.947333Z","submitted_at":"2025-12-03T21:45:11Z","title":"A customizable inexact subgraph matching algorithm for attributed graphs","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-17T01:35:42.375860Z"},"links":{"citing_paper":"/paper/2512.04280"},"observation_digest":"sha256:1cc3e729755dae9ba9f2c9867f507d44e63e78d3e3336b52793c00116ca905a3","observation_id":"1d3ce0f5-f229-4eb3-8cec-7100fd17a627","resolution":{"observed_at":"2026-05-17T01:38:51.235219Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2512.04280","last_updated":"2026-04-24T18:48:21Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T22:37:45.947333Z","submitted_at":"2025-12-03T21:45:11Z","title":"A customizable inexact subgraph matching algorithm for attributed graphs"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":30},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:2512.04280."}