{"as_of":"2026-08-14T01:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:84f5f490c0a23d568f94d7538b1f3d7d50bb7b21658523fa129a8a1197a5a684","coverage":[{"denominator":49,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":49,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T19:48:56.661383Z","state":"measured"},{"denominator":49,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":49,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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/2501.09736/citation-record","integrity":"/paper/2501.09736/integrity","json":"/paper/2501.09736/citation-record.json","paper":"/paper/2501.09736"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"8756.33690","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:48:58.473386Z","title":null,"venue":null,"work_id":"6cddabd4-f28b-4057-981d-f3508cb6fd52","year":2019},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.490642Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:ea9c3e9b0e8729dc9d2e88611305ae1ca1625364db3905dbb8ba34872e6430cd","observation_id":"b5ceab02-50d6-4f9f-ae55-df6f5a80dfc1","resolution":{"observed_at":"2026-08-10T19:48:58.478695Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T19:48:58.561492Z","title":null,"venue":null,"work_id":"5b1119f2-5a4d-46af-9de6-31297025b712","year":2018},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.495170Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:747072fea5ad807d777753f0cb49a7cd70d6247b1b501637ad8b15f9d52a208d","observation_id":"eb28b3ef-14ef-42fe-9d51-32add64ff388","resolution":{"observed_at":"2026-08-10T19:48:58.565012Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2001.02299","last_updated":"2024-09-07T18:19:08Z","snapshot_observed_at":"2026-08-12T16:11:20.323429Z","submitted_at":"2020-01-07T22:12:35Z","title":"The LDBC Social Network Benchmark","version":11},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.02299","snapshot_observed_at":"2026-08-10T19:48:56.499101Z","title":"Angles, J.B","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.499101Z"},"links":{"cited_paper":"/paper/2001.02299","citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:db5d68b7b3abcd8c7321b14b672dbb31f9f9c59a1bd43decce3d40ce39bd9e60","observation_id":"18169c38-9ddc-4e08-ada7-548c64ced2ab","resolution":{"observed_at":"2026-08-10T19:48:56.499101Z","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.3390/math10244830","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:48:56.874523Z","title":"Anwar, A.E","venue":null,"work_id":"7fdff18b-a6ed-4b23-87d1-06b40f25c538","year":2022},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.503252Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:8f2b919184ef857d554847e29d900d9759f67da3ca22eddf5c67a34452cd6781","observation_id":"a2dad1a0-147d-41aa-92e0-de92faf90cbb","resolution":{"observed_at":"2026-08-10T19:48:56.877986Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T19:48:58.552123Z","title":"Aparo, V","venue":null,"work_id":"d0cb1137-1fee-4c6e-9db0-6a84d89b80e2","year":2019},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.507306Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:36a5d971f617d4755828d4160ded68dfbccf6b76853055af58413b8ebda49c2d","observation_id":"cfe5e1e0-3c81-4a52-a97a-af2ffa979a11","resolution":{"observed_at":"2026-08-10T19:48:58.555152Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T19:48:56.510859Z","title":"Barabási and A","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.510859Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:25b6dd833103e947f085a5597db9bbddab678c06077c77595142e2c744576bb5","observation_id":"875d39f0-8025-4cf8-a6a4-78abb6148a4d","resolution":{"observed_at":"2026-08-10T19:48:56.510859Z","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.3390/genes12071004","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:48:56.858046Z","title":"Barbagallo, A","venue":null,"work_id":"c240a401-2483-46ed-aaa4-7fb03d7f50a8","year":2021},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.514824Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:6467659e57dfbff98944af1b053a0e0d6b4a9f258c78657cdd7b9f5a93e21171","observation_id":"cee28bda-3480-43d9-90dd-1506ea4cb0ce","resolution":{"observed_at":"2026-08-10T19:48:56.861591Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T19:48:56.517967Z","title":"Bhattarai, H","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.517967Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:46dd3c660a6663eca51d1ad996b0638dadfbec261bfcefddf8604c700dddccc1","observation_id":"bfba6391-4982-4793-95a5-734a7bb8a8cc","resolution":{"observed_at":"2026-08-10T19:48:56.517967Z","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-10T19:48:56.521202Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.521202Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:c33bcd73dc959841b7eb7ad5ac57cdb097a82e81fdb5c3832079c8d9d2828649","observation_id":"31c0b666-28ef-4948-9be8-cefffbc753c0","resolution":{"observed_at":"2026-08-10T19:48:56.521202Z","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-10T19:48:56.524472Z","title":"Bonnici and R","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.524472Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:e362c95ea8837cde79a355b369860f79faf82ef0e402d880ddf727cf5baae62a","observation_id":"0ac1c21e-9809-4169-b6c9-bae22c5eb180","resolution":{"observed_at":"2026-08-10T19:48:56.524472Z","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.1186/1471-2105-14-s7-s13","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:48:56.847217Z","title":"Bonnici, R","venue":null,"work_id":"21e238f0-39ae-43e1-a012-8f4ae92b8268","year":2013},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.527879Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:3fa9b6eb802726702d1cc0bc4db359055f0984d0e577eab019bd6d77bfb121a2","observation_id":"57a3c012-26d7-4758-887f-33955f6bf525","resolution":{"observed_at":"2026-08-10T19:48:56.851023Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T19:48:56.531011Z","title":"Carletti, P","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.531011Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:49fcd07e24125b08fe27da62d3d43856feea30aafbcce7b472181b48be8282df","observation_id":"a48ac82a-9940-4771-aaef-afadb8ff785a","resolution":{"observed_at":"2026-08-10T19:48:56.531011Z","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-10T19:48:56.534226Z","title":null,"venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.534226Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:7fbda55fbbc878ff78e6a611904a897babaace54260bf563842353013c572c98","observation_id":"365078f8-5f13-47c2-a268-b50750ac3b05","resolution":{"observed_at":"2026-08-10T19:48:56.534226Z","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-10T19:48:58.542321Z","title":"Cordella, P","venue":null,"work_id":"4f69fc6d-d626-4852-a0a5-075301d94367","year":2004},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.537406Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:64bc7e3d0f135b41e67c93187862ae8ca97bd0d4ee26f170c0779fd08f686420","observation_id":"cec3a9b2-29c0-4145-b862-fa3e508eefff","resolution":{"observed_at":"2026-08-10T19:48:58.545630Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1371/journal.pone.0061183","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:48:56.835606Z","title":"Demeyer, T","venue":null,"work_id":"21b0e91a-cd82-4a1b-ac4c-b65a95073249","year":2013},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.541602Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:05aedb0f4da548ac59832f3966b6af26fd4bdca7bc66304743c5ed48e63fd7e9","observation_id":"d1567871-a72e-4297-bab3-2e6bbb72d05a","resolution":{"observed_at":"2026-08-10T19:48:56.839927Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1901.08248","last_updated":"2019-01-24T06:34:15Z","snapshot_observed_at":"2026-08-12T02:03:47.644749Z","submitted_at":"2019-01-24T06:34:15Z","title":"TigerGraph: A Native MPP Graph Database","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.08248","snapshot_observed_at":"2026-08-10T19:48:56.545269Z","title":"Deutsch, Y","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.545269Z"},"links":{"cited_paper":"/paper/1901.08248","citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:d37f9761db7c57b78de10395dc933e1b4bd77307e24324f66e4c5b1369eeb349","observation_id":"a53f3992-0161-4cac-ac65-78657d8c0b08","resolution":{"observed_at":"2026-08-10T19:48:56.545269Z","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-10T19:48:56.549320Z","title":"Francis, A","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.549320Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:acd9991ed6cf6a33c55fa791de9489ff1b886d10d3660cf2f4aad5b1335d9d3b","observation_id":"abc3a8fe-714d-4c73-a4db-d13dc131b9c1","resolution":{"observed_at":"2026-08-10T19:48:56.549320Z","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-10T19:48:58.531347Z","title":"Giugno, V","venue":null,"work_id":"2c0a31d0-5ef2-47cd-9007-3cc7a04e39d8","year":2013},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.552832Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:22d52f52de9feea0c59c2b91555a8113f8b0b60f00086bbf282d8453b1fa7f1f","observation_id":"b1cd12cb-ea2b-4c7e-b003-f835480e2dfe","resolution":{"observed_at":"2026-08-10T19:48:58.535199Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-540-71681-5_7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-13T11:03:48.094449Z","title":"Grochow and M","venue":"Lecture notes in computer science","work_id":"d587da38-8b2f-4fad-b9e7-51100aaf5d41","year":2007},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.556732Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:fff7d999546dee88d92c38a20594f3445a45af62f27d0dcac51886b988551435","observation_id":"a737da02-efe5-4092-91a1-527892393115","resolution":{"observed_at":"2026-08-10T19:48:56.828532Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T19:48:56.560181Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.560181Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:756c456afb98625b2640bf0d69c65867dca1440bed48dd760d1bab93ebb92a7c","observation_id":"b3dd8418-c917-4bae-9d19-234f60205594","resolution":{"observed_at":"2026-08-10T19:48:56.560181Z","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-10T19:48:56.563710Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.563710Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:451afaaf1a2070095199cd5566d2f408c4754ac42156ec9213aa7984f39beeae","observation_id":"450d3e57-0804-4da6-aa5d-c644e8b938f6","resolution":{"observed_at":"2026-08-10T19:48:56.563710Z","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-10T19:48:56.567136Z","title":"He and A.K","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.567136Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:99a1a26ef7fc0fa93d84455dc5885db6248a64b86ea565c69ba25d7fcd61d808","observation_id":"78941dc5-f1eb-496e-a1ee-54eb626aac0e","resolution":{"observed_at":"2026-08-10T19:48:56.567136Z","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.1371/journal.pone.0097896","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:48:56.814837Z","title":"Houbraken, S","venue":null,"work_id":"a44c3256-cced-47b1-9897-bad51ed4eaf8","year":2014},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.570730Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:e7082d25f06cf0407fd26c894cd2e9716a6388929833e25ad129d700123cda9a","observation_id":"fddcbe77-cd14-4533-a151-659c2d12b2e3","resolution":{"observed_at":"2026-08-10T19:48:56.818055Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T19:48:58.520851Z","title":"Ingalalli, D","venue":null,"work_id":"ead2faca-5b39-4d2a-8ee4-f7dad54b5f75","year":2016},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.574357Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:f673a288e4faa9593a7a904741be38f5871ab2cd149c9a294ec56fd4c4cdb725","observation_id":"8f9deeb0-1fdb-426f-bbe4-e08a8b928199","resolution":{"observed_at":"2026-08-10T19:48:58.524479Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-031-02433-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:03:20.376878Z","title":"Katari, D","venue":"Synthesis lectures on mathematics and statistics","work_id":"8de5567a-eae9-4e4e-9dd5-e5251a4d8c59","year":2021},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.577782Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:540557622827b5aecede23f17222f660a1e7168180acc2cc797a5fb76d06ac2b","observation_id":"8cc3a71c-3cb6-4825-a862-8384348cd894","resolution":{"observed_at":"2026-08-10T19:48:56.807918Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00778-022-00749-x","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:48:56.793087Z","title":null,"venue":null,"work_id":"3e9a7fff-520d-4bcf-af14-3de84c20c117","year":2022},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.581512Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:a8e3e0e6660c0c2b825aa0cb431c58f2bbbfd36345ddb91e93fc57349a014e64","observation_id":"2b0867be-fe5d-4e0c-becb-b6fe27812ba5","resolution":{"observed_at":"2026-08-10T19:48:56.796810Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1017/s0960129501003577","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:48:56.782001Z","title":"Larrosa and G","venue":null,"work_id":"83bdc1e5-ec58-46d5-bcf4-011412fa5cd5","year":2002},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.585731Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:d65d4e45ac0bca386e99d2758718f0a0f78c311e287f15742e3b97959fd6e3cb","observation_id":"ecc6d4dc-3f84-4c38-a79d-b9106043162f","resolution":{"observed_at":"2026-08-10T19:48:56.785812Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T19:48:58.509718Z","title":"Leskovec and R","venue":null,"work_id":"fb325253-3d6a-4219-9e6c-c949205d1efe","year":2016},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.589383Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:86ce370d5ae65663298e676b722c677021e9df7ba4926a620b4e34d5a5b1cbdb","observation_id":"80e974ff-164f-4125-a9d5-51eaac851c0e","resolution":{"observed_at":"2026-08-10T19:48:58.513718Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T19:48:58.497724Z","title":"McCreesh, P","venue":null,"work_id":"dc3eb4b5-66bc-4b99-bb2c-5afae7babdca","year":2020},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.593030Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:18af24916cd15f734545e30a6f7f6f5035b7b0fa533234ae3e7206cc7e40cd9b","observation_id":"6cd0f7a2-7caa-4fcc-927e-eb92525f363f","resolution":{"observed_at":"2026-08-10T19:48:58.501298Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T19:48:56.596462Z","title":"McKay and A","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.596462Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:fb9e4641a1a7d727f61065a2e730d6cec065e9740ccdb1d043e55af4b21fa5e4","observation_id":"692da9e1-1ea0-4adf-b692-7bd327588d40","resolution":{"observed_at":"2026-08-10T19:48:56.596462Z","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-10T19:48:56.599998Z","title":"Mhedhbi, M","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.599998Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:edb6c5ee83a53dd3f477efaf208d45e68aa8badd7129c17bdcd84606e7dcb0c0","observation_id":"a05b0db8-651d-428d-871f-691cc337010c","resolution":{"observed_at":"2026-08-10T19:48:56.599998Z","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.1090/dimacs/028/14","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:48:56.764508Z","title":"Miyazaki","venue":null,"work_id":"112b66d9-96f4-468a-a1be-28d3d81bc01c","year":1997},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.603521Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:bce54ffaa07fe134ea8409a63b7cfaf87d274aaf620d7351e3339bdbc65cdfa6","observation_id":"a132af41-cef7-4724-9959-6d1cc25e4cb7","resolution":{"observed_at":"2026-08-10T19:48:56.768680Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.3390/app13095770","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:48:56.753195Z","title":"Monteiro, F","venue":null,"work_id":"8307d551-3cf4-403c-8835-d2d1538920f4","year":2023},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.607637Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:716428bc28f9fa1370ed211e7a4dec25367bd8518ff263eb7fbe17b05cd0c659","observation_id":"35ad163b-3790-4243-bc17-625664e17a6c","resolution":{"observed_at":"2026-08-10T19:48:56.757037Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T19:48:56.611179Z","title":"Moorman, T.K","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.611179Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:f1d965c45951d0ee8864e1a7be1f29a3470da19575ae5dc7765824c4ab4170e7","observation_id":"67b97bbc-fbe9-44c5-8a69-8e363c7a3aa1","resolution":{"observed_at":"2026-08-10T19:48:56.611179Z","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-10T19:48:56.614813Z","title":"Ren and J","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.614813Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:f78f6da72be5010bc93817637df4cd7f703d6fb61a1cae50b8cc6d973971a9ac","observation_id":"ecd72891-6aa4-4a52-8e92-7df9021ab6ab","resolution":{"observed_at":"2026-08-10T19:48:56.614813Z","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-10T19:48:56.618211Z","title":"Ribeiro and F","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.618211Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:763e3e348d606e36cd353d0353ce268e6e601e2670a1dbc73d6765771ab78a5e","observation_id":"6c19fc9e-0a67-48e0-855e-d1e9d6663554","resolution":{"observed_at":"2026-08-10T19:48:56.618211Z","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-10T19:48:56.621565Z","title":"Shang, Y","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.621565Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:ad3079ee6a912fffced61821b07351b7124de02fac7de2781c7ee21450843abe","observation_id":"2b45172c-48c9-46e7-b5a2-ac415b06c3f0","resolution":{"observed_at":"2026-08-10T19:48:56.621565Z","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/j.artint.2010.05.002","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:48:56.734515Z","title":null,"venue":null,"work_id":"bee7e533-2624-41fc-94a3-4b9966b21546","year":2010},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.624907Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:7532e7c6a3f036880d2452a1c4a7328d129c5bbc87903a64320c8f3db666b508","observation_id":"619349c0-061b-4acd-8415-ad828a9e5670","resolution":{"observed_at":"2026-08-10T19:48:56.738409Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T19:48:56.628521Z","title":"Sun and Q","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.628521Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:49cc13060327a28b5d72f096f4ed49acd86c1085ec04a08bf9d69304c6e19490","observation_id":"0afd6a31-41a2-497e-b5a2-9d09411a1dfa","resolution":{"observed_at":"2026-08-10T19:48:56.628521Z","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.1007/s11704-020-0360-y","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:48:56.723160Z","title":null,"venue":null,"work_id":"a7e0c785-485f-4d83-94ef-e13232c3d4ce","year":2021},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.631925Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:cfa40dd1c2023ae940eb62ff36c3f8cac205cf0effc7335af92cb9ba020b429b","observation_id":"ac7796fd-eb1d-4838-834c-5853a3bda511","resolution":{"observed_at":"2026-08-10T19:48:56.727022Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1093/database/baab026","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:48:56.712095Z","title":"Timón-Reina, M","venue":null,"work_id":"aecf297d-b663-4658-958d-50b3d487769c","year":2021},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.635588Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:3f32e2527f3b34b0c5ced94cf15589a2bbdd8e50ceab2749a8e287fde4bac65c","observation_id":"4657a8d1-4dd4-418a-8a9e-53d755b40ad0","resolution":{"observed_at":"2026-08-10T19:48:56.715955Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T19:48:56.638905Z","title":null,"venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.638905Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:6d8eeef75dc4e13f518cdae19fe31d8ca49cdeba83e4ae77010a211c7202aa2e","observation_id":"e006f76e-95cc-4f50-9d7d-12d046b5b0e8","resolution":{"observed_at":"2026-08-10T19:48:56.638905Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1970.19217","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:48:57.111126Z","title":null,"venue":null,"work_id":"21f786e2-3e76-4aaa-989f-afdd10e1e248","year":2011},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.642405Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:e2a21e8e72e03eb016001f32306ef4771294c6434836f81eb01b053f94c96ca5","observation_id":"e5812854-67f9-4d21-ac00-cd07d17b0ff8","resolution":{"observed_at":"2026-08-10T19:48:57.117813Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T19:48:58.487432Z","title":"Vilaça, F","venue":null,"work_id":"155c8939-0116-46f6-b676-529437b530bd","year":2010},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.645386Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:5c11dd15f906dbe7057f6b274dc13484dd1f29046f0f1e4901d0386496ef43e4","observation_id":"0809a04b-556e-4581-8dd4-2e50383399fd","resolution":{"observed_at":"2026-08-10T19:48:58.491021Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T19:48:56.648444Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.648444Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:7f619db990075cc376a6d9390052238f3561a6f52d3a1d18c6dc98c1922b0d12","observation_id":"65778a18-c434-4a50-8a65-f35e0719899e","resolution":{"observed_at":"2026-08-10T19:48:56.648444Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10601-009-9074-3","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:48:56.701092Z","title":"Zampelli, Y","venue":null,"work_id":"dcfb53fa-06ec-4b2d-bbea-9f7358448ade","year":2010},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.651409Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:522394ca90aad6e5a9f7c374a90e89b989cb2ca903932c48d405da932f4c6aa8","observation_id":"ea451304-5808-4ee8-b495-2a1b7276bfbe","resolution":{"observed_at":"2026-08-10T19:48:56.704886Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2012.06802","last_updated":"2021-04-20T15:28:09Z","snapshot_observed_at":"2026-08-13T20:47:19.314741Z","submitted_at":"2020-12-12T12:29:38Z","title":"Deep Analysis on Subgraph Isomorphism","version":2},"cited_work":{"arxiv_id":"2012.06802","doi":null,"metadata_source":"pith","pith_arxiv_id":"2012.06802","snapshot_observed_at":"2026-08-10T19:48:56.963612Z","title":"Deep Analysis on Subgraph Isomorphism","venue":"cs.DB","work_id":"7267cfd4-833b-4d54-87e4-8b9e8b0653fb","year":2020},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.654431Z"},"links":{"cited_paper":"/paper/2012.06802","citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:2a13643fcf4c6a5e08a0fc32ce26e9a9f96858ff08d5241d11c26460161c98be","observation_id":"3065e42a-0f78-4419-acf8-7b67e89761d9","resolution":{"observed_at":"2026-08-10T19:48:56.970039Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/1516360","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:48:56.688194Z","title":"Zhang, S","venue":null,"work_id":"da0c28c4-57cf-4e74-9ac3-bc908eb500b3","year":2009},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.657794Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:e10a7f39eff0d9897fdfb49de004122a3fc25a24a602ec1c7f802a87a7abaf89","observation_id":"4967f3c1-abe4-4f97-a96c-6c681e35a3bc","resolution":{"observed_at":"2026-08-10T19:48:56.693333Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T19:48:56.661383Z","title":"Zhao and J","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-10T19:48:56.661383Z"},"links":{"citing_paper":"/paper/2501.09736"},"observation_digest":"sha256:c12798d47f148cad12a04f43d33f64177558178217bb7e01906bbbdca543a2a0","observation_id":"21b3abf2-02f2-40fd-b373-88b97b377f2d","resolution":{"observed_at":"2026-08-10T19:48:56.661383Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2501.09736","last_updated":"2025-01-16T18:39:36Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-13T21:43:01.542597Z","submitted_at":"2025-01-16T18:39:36Z","title":"MultiGraphMatch: a subgraph matching algorithm for multigraphs"},"reference_resolution":{"displayed":49,"state_counts":{"malformed_identifier":2,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":21,"verified_exact":17,"verified_fuzzy":7},"total_outbound_references":49},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 49 of 49 outbound references and 0 inbound Pith citation observations for arXiv:2501.09736."}