{"as_of":"2026-08-16T11:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:930fc1e6bcbbe122ac0ec4b810ea31716a71a02c692dd34a6d707643bc8c09df","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T12:50:03.516132Z","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-16T06:30:59.297886+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/1908.06418/citation-record","integrity":"/paper/1908.06418/integrity","json":"/paper/1908.06418/citation-record.json","paper":"/paper/1908.06418"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:50:04.255818Z","title":"Subgraph isomorphism, matching relational structures and maximal cliques,","venue":null,"work_id":"9eefcefb-d802-44fe-bf03-5f0ee26d98d1","year":1976},"citing_paper":{"arxiv_id":"1908.06418","last_updated":"2019-08-18T10:15:59Z","snapshot_observed_at":"2026-08-16T02:25:21.427750Z","submitted_at":"2019-08-18T10:15:59Z","title":"The Maximum Common Subgraph Problem: A Portfolio Approach","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T12:50:03.357395Z"},"links":{"citing_paper":"/paper/1908.06418"},"observation_digest":"sha256:d5ac96d06cf4937d6c1ef2e3e401e77c20d27e3dcc864de8cb96196d26728497","observation_id":"b93c86d1-76fa-4266-8b34-5640a32e4302","resolution":{"observed_at":"2026-08-14T12:50:04.260660Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:50:04.239178Z","title":"Finding all cliques of an undirected graph (algorithm 457),","venue":null,"work_id":"b7f561fe-766f-40f3-bf66-dfe9b60258dd","year":1973},"citing_paper":{"arxiv_id":"1908.06418","last_updated":"2019-08-18T10:15:59Z","snapshot_observed_at":"2026-08-16T02:25:21.427750Z","submitted_at":"2019-08-18T10:15:59Z","title":"The Maximum Common Subgraph Problem: A Portfolio Approach","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T12:50:03.362898Z"},"links":{"citing_paper":"/paper/1908.06418"},"observation_digest":"sha256:1a6ffee2466d63f3029eeec5ebe66b72cf94b3cab99c484a0e394434cd97a2bd","observation_id":"1e875d12-7ed8-4e29-befa-535a9293bfd1","resolution":{"observed_at":"2026-08-14T12:50:04.245430Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1642.31717","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:50:03.854989Z","title":"A partitioning algorithm for maximum common subgraph problems,","venue":null,"work_id":"17cc5916-61c4-4e96-b4fd-5cd2c59a421b","year":2017},"citing_paper":{"arxiv_id":"1908.06418","last_updated":"2019-08-18T10:15:59Z","snapshot_observed_at":"2026-08-16T02:25:21.427750Z","submitted_at":"2019-08-18T10:15:59Z","title":"The Maximum Common Subgraph Problem: A Portfolio Approach","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T12:50:03.369200Z"},"links":{"citing_paper":"/paper/1908.06418"},"observation_digest":"sha256:19f4cf4f0ba95a7089df8c2b7802f3e861317f1f2d395d4ef8832161c79d61a0","observation_id":"9a56e984-3e1d-4dde-96ca-79c12b25a985","resolution":{"observed_at":"2026-08-14T12:50:03.862347Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:50:04.222077Z","title":"The SAT Competition Web Page,","venue":null,"work_id":"2854c894-21d5-453b-af2c-c9cbe0a403f7","year":2014},"citing_paper":{"arxiv_id":"1908.06418","last_updated":"2019-08-18T10:15:59Z","snapshot_observed_at":"2026-08-16T02:25:21.427750Z","submitted_at":"2019-08-18T10:15:59Z","title":"The Maximum Common Subgraph Problem: A Portfolio Approach","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T12:50:03.375146Z"},"links":{"citing_paper":"/paper/1908.06418"},"observation_digest":"sha256:33781f4aa511dec35f5ff23754bada9463f6c0b97518751ae28a3867cee91756","observation_id":"bea18798-0f5a-48fc-986f-00abcf1a3d49","resolution":{"observed_at":"2026-08-14T12:50:04.227590Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:50:04.203310Z","title":"The SMT Competition Web Page,","venue":null,"work_id":"e116a303-3096-44d1-8df5-a05b46360ffe","year":2014},"citing_paper":{"arxiv_id":"1908.06418","last_updated":"2019-08-18T10:15:59Z","snapshot_observed_at":"2026-08-16T02:25:21.427750Z","submitted_at":"2019-08-18T10:15:59Z","title":"The Maximum Common Subgraph Problem: A Portfolio Approach","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T12:50:03.381760Z"},"links":{"citing_paper":"/paper/1908.06418"},"observation_digest":"sha256:3972131a233748d9893789adf4346e8d2512d8bdad37b08d384b2d065917d176","observation_id":"1da4eae4-be2a-46d4-9eea-5c3430f01bad","resolution":{"observed_at":"2026-08-14T12:50:04.209278Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:50:04.182120Z","title":"Portfolios of subgraph iso- morphism algorithms,","venue":null,"work_id":"99a04f52-621d-464c-89b2-15ff93e61bfc","year":2016},"citing_paper":{"arxiv_id":"1908.06418","last_updated":"2019-08-18T10:15:59Z","snapshot_observed_at":"2026-08-16T02:25:21.427750Z","submitted_at":"2019-08-18T10:15:59Z","title":"The Maximum Common Subgraph Problem: A Portfolio Approach","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T12:50:03.388286Z"},"links":{"citing_paper":"/paper/1908.06418"},"observation_digest":"sha256:a18eed56fad552e44e94d84cba450541fd87a9c9f925042688ff029cb693e76f","observation_id":"df21e1f5-3209-4e3d-a6f5-4042b8b3b185","resolution":{"observed_at":"2026-08-14T12:50:04.186904Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0167-8655(02)00253-2","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:50:03.585137Z","title":"A large database of graphs and its use for benchmarking graph isomorphism algorithms,","venue":null,"work_id":"e55cf2c6-9133-4e6c-b860-32ad98f81762","year":2003},"citing_paper":{"arxiv_id":"1908.06418","last_updated":"2019-08-18T10:15:59Z","snapshot_observed_at":"2026-08-16T02:25:21.427750Z","submitted_at":"2019-08-18T10:15:59Z","title":"The Maximum Common Subgraph Problem: A Portfolio Approach","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T12:50:03.395768Z"},"links":{"citing_paper":"/paper/1908.06418"},"observation_digest":"sha256:851a99fabebbe9c9d2064d26d7caf0bccd59b5eaf90a2a6e5ee6387ff19eab5c","observation_id":"9daa59a1-8a1d-41fb-ae24-90b6c4233779","resolution":{"observed_at":"2026-08-14T12:50:03.591171Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:50:04.165665Z","title":"A database of graphs for iso- morphism and sub-graph isomorphism benchmarking,","venue":null,"work_id":"b7da3439-58cf-4f1c-aea1-011b9b38e25c","year":2001},"citing_paper":{"arxiv_id":"1908.06418","last_updated":"2019-08-18T10:15:59Z","snapshot_observed_at":"2026-08-16T02:25:21.427750Z","submitted_at":"2019-08-18T10:15:59Z","title":"The Maximum Common Subgraph Problem: A Portfolio Approach","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T12:50:03.401406Z"},"links":{"citing_paper":"/paper/1908.06418"},"observation_digest":"sha256:fad1bec13f3bb7528e6de22bb1ec70509612291eea03c1a9430e32d4de71612d","observation_id":"d1ce6098-3412-40b0-9650-a31ffeda3608","resolution":{"observed_at":"2026-08-14T12:50:04.171083Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:50:04.150678Z","title":"A comparison of algorithms for maximum common subgraph on randomly connected graphs,","venue":null,"work_id":"d2227bd6-96d8-4a15-990a-8c9eb5fc0819","year":2002},"citing_paper":{"arxiv_id":"1908.06418","last_updated":"2019-08-18T10:15:59Z","snapshot_observed_at":"2026-08-16T02:25:21.427750Z","submitted_at":"2019-08-18T10:15:59Z","title":"The Maximum Common Subgraph Problem: A Portfolio Approach","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T12:50:03.407635Z"},"links":{"citing_paper":"/paper/1908.06418"},"observation_digest":"sha256:c7df7f19758e796cc8dc1204f9edc8667f6bd346c459c92ea4e5f6c6c1705559","observation_id":"13b86d0f-9823-4031-a9ac-81a74b74adbf","resolution":{"observed_at":"2026-08-14T12:50:04.155386Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:50:04.135598Z","title":"Challenging complexity of maximum common subgraph detection algorithms: A performance analysis of three algorithms on a wide database of graphs","venue":null,"work_id":"168e1e43-7016-4b80-997b-b77705893c9b","year":2007},"citing_paper":{"arxiv_id":"1908.06418","last_updated":"2019-08-18T10:15:59Z","snapshot_observed_at":"2026-08-16T02:25:21.427750Z","submitted_at":"2019-08-18T10:15:59Z","title":"The Maximum Common Subgraph Problem: A Portfolio Approach","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T12:50:03.413910Z"},"links":{"citing_paper":"/paper/1908.06418"},"observation_digest":"sha256:7e25400b4f7359fc035f46e01e8a44a367ebad1efd79aa6508b8bee9d99f175b","observation_id":"3077f088-7369-4646-8019-93b069f5e9ea","resolution":{"observed_at":"2026-08-14T12:50:04.141017Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:50:04.120399Z","title":"Finding maximum common connected sub- graphs using clique detection or constraint satisfaction algorithms,","venue":null,"work_id":"e0cc2370-67c5-434b-9b23-613d8e0b0d50","year":2008},"citing_paper":{"arxiv_id":"1908.06418","last_updated":"2019-08-18T10:15:59Z","snapshot_observed_at":"2026-08-16T02:25:21.427750Z","submitted_at":"2019-08-18T10:15:59Z","title":"The Maximum Common Subgraph Problem: A Portfolio Approach","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T12:50:03.421017Z"},"links":{"citing_paper":"/paper/1908.06418"},"observation_digest":"sha256:267556738fbd07e0b297c95af44501008914d6746a964c7951466dc8d9ca237a","observation_id":"067d69fd-9ac0-4bae-bdda-20decafd2beb","resolution":{"observed_at":"2026-08-14T12:50:04.125760Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:50:04.104394Z","title":"Searching for a maximum common induced subgraph by decomposing the compatibility graph,","venue":null,"work_id":"1a103c3e-f985-4d30-bc8a-8f91d52ef406","year":2014},"citing_paper":{"arxiv_id":"1908.06418","last_updated":"2019-08-18T10:15:59Z","snapshot_observed_at":"2026-08-16T02:25:21.427750Z","submitted_at":"2019-08-18T10:15:59Z","title":"The Maximum Common Subgraph Problem: A Portfolio Approach","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T12:50:03.426281Z"},"links":{"citing_paper":"/paper/1908.06418"},"observation_digest":"sha256:68c3420f63a94b11d55ce688fbce181fd9b05a4ff2e4288a475a9c205c625a7f","observation_id":"c3287914-ae62-4485-9cc8-552af3439f1f","resolution":{"observed_at":"2026-08-14T12:50:04.110308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:50:04.090170Z","title":"Approximating the maximum common subgraph isomorphism problem with a weighted graph,","venue":null,"work_id":"70f7b157-b4d5-4d79-add3-43d6e01fcf63","year":2015},"citing_paper":{"arxiv_id":"1908.06418","last_updated":"2019-08-18T10:15:59Z","snapshot_observed_at":"2026-08-16T02:25:21.427750Z","submitted_at":"2019-08-18T10:15:59Z","title":"The Maximum Common Subgraph Problem: A Portfolio Approach","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T12:50:03.432834Z"},"links":{"citing_paper":"/paper/1908.06418"},"observation_digest":"sha256:43d5cd8e4ff7b625ad5907b3caec35584d7404123a4ec7270a0729caefb424d3","observation_id":"7d8393e4-1c2e-4446-b477-54fab0718e88","resolution":{"observed_at":"2026-08-14T12:50:04.094928Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7868.17578","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:50:03.777089Z","title":"Graph clustering using the weighted minimum common supergraph,","venue":null,"work_id":"2d74b3ac-9dcc-4937-a13d-2ef42392717e","year":2003},"citing_paper":{"arxiv_id":"1908.06418","last_updated":"2019-08-18T10:15:59Z","snapshot_observed_at":"2026-08-16T02:25:21.427750Z","submitted_at":"2019-08-18T10:15:59Z","title":"The Maximum Common Subgraph Problem: A Portfolio Approach","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T12:50:03.437389Z"},"links":{"citing_paper":"/paper/1908.06418"},"observation_digest":"sha256:c4a25ec69d2c92be84e9ee354ab5310021e399b73d599987987e6c746ee36036","observation_id":"d8a0bc83-af5d-428a-ab42-3d0ece66c7f3","resolution":{"observed_at":"2026-08-14T12:50:03.784525Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:50:04.073557Z","title":"A measure of similarity between graph vertices: Applications to synonym extraction and web searching,","venue":null,"work_id":"a8f1fcc6-2c7b-4209-bb0c-f700c4bd3cd7","year":null},"citing_paper":{"arxiv_id":"1908.06418","last_updated":"2019-08-18T10:15:59Z","snapshot_observed_at":"2026-08-16T02:25:21.427750Z","submitted_at":"2019-08-18T10:15:59Z","title":"The Maximum Common Subgraph Problem: A Portfolio Approach","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T12:50:03.442080Z"},"links":{"citing_paper":"/paper/1908.06418"},"observation_digest":"sha256:a6b9be604c211e4e5bc1959e314d211b0c94eda14975870e248a2d6df1db4ebc","observation_id":"70fff84d-0a03-430e-aff8-8b0531d5129f","resolution":{"observed_at":"2026-08-14T12:50:04.078724Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:50:04.056099Z","title":"Graph similarity and matching,","venue":null,"work_id":"b0f44a70-cbca-4034-940e-fa6b5f00d96a","year":2005},"citing_paper":{"arxiv_id":"1908.06418","last_updated":"2019-08-18T10:15:59Z","snapshot_observed_at":"2026-08-16T02:25:21.427750Z","submitted_at":"2019-08-18T10:15:59Z","title":"The Maximum Common Subgraph Problem: A Portfolio Approach","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T12:50:03.451423Z"},"links":{"citing_paper":"/paper/1908.06418"},"observation_digest":"sha256:6f68916d5640d4a34d6a1bdf44710b48ab982532f9692e69d8d928436d9865db","observation_id":"04b46d85-5efb-440d-a34b-29906bc85584","resolution":{"observed_at":"2026-08-14T12:50:04.061625Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:50:04.040082Z","title":"Mcsplit implementations,","venue":null,"work_id":"17b222ae-bca3-4421-92a2-afd3ef13e210","year":2017},"citing_paper":{"arxiv_id":"1908.06418","last_updated":"2019-08-18T10:15:59Z","snapshot_observed_at":"2026-08-16T02:25:21.427750Z","submitted_at":"2019-08-18T10:15:59Z","title":"The Maximum Common Subgraph Problem: A Portfolio Approach","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T12:50:03.455975Z"},"links":{"citing_paper":"/paper/1908.06418"},"observation_digest":"sha256:3462ef0de79f0ae533387766d9f681c9409efa139cdfc0692881fb72623d129d","observation_id":"c289da0b-4ca5-4b74-b759-97f6a2e7ac0c","resolution":{"observed_at":"2026-08-14T12:50:04.044859Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:50:04.018289Z","title":"Solving hard subgraph problems in parallel,","venue":null,"work_id":"ab761f04-1c9c-4226-8ad8-28b660c2b5ce","year":2017},"citing_paper":{"arxiv_id":"1908.06418","last_updated":"2019-08-18T10:15:59Z","snapshot_observed_at":"2026-08-16T02:25:21.427750Z","submitted_at":"2019-08-18T10:15:59Z","title":"The Maximum Common Subgraph Problem: A Portfolio Approach","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T12:50:03.460649Z"},"links":{"citing_paper":"/paper/1908.06418"},"observation_digest":"sha256:edb3821fda785dbbd45e7885728a7a1605616b01931b7b7c31d8c023bd469470","observation_id":"ff842078-ef1d-4fb0-b1a3-9113dd659a68","resolution":{"observed_at":"2026-08-14T12:50:04.023530Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:50:04.000313Z","title":"Observations from parallelising three maximum common (connected) subgraph algorithms,","venue":null,"work_id":"e2a22165-a528-4543-b8e3-98a16a4106a4","year":2018},"citing_paper":{"arxiv_id":"1908.06418","last_updated":"2019-08-18T10:15:59Z","snapshot_observed_at":"2026-08-16T02:25:21.427750Z","submitted_at":"2019-08-18T10:15:59Z","title":"The Maximum Common Subgraph Problem: A Portfolio Approach","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T12:50:03.465213Z"},"links":{"citing_paper":"/paper/1908.06418"},"observation_digest":"sha256:d0e362dda1bf4d326ac03c8a5737ab863317ebc84defdd3f0f29a28b35113fd9","observation_id":"12ad6dbd-6924-4c4c-83c6-95397a3f3632","resolution":{"observed_at":"2026-08-14T12:50:04.005780Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:50:03.984383Z","title":"Hardware Model Checking Competition 2014: An Analysis and Comparison of Model Checkers and Benchmarks,","venue":null,"work_id":"0d4b6249-d8bb-4d88-b28d-b949cedfcc79","year":2014},"citing_paper":{"arxiv_id":"1908.06418","last_updated":"2019-08-18T10:15:59Z","snapshot_observed_at":"2026-08-16T02:25:21.427750Z","submitted_at":"2019-08-18T10:15:59Z","title":"The Maximum Common Subgraph Problem: A Portfolio Approach","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T12:50:03.470327Z"},"links":{"citing_paper":"/paper/1908.06418"},"observation_digest":"sha256:765ac7c841472b35495cb8e590cebe537f283cf3d9753f51f880325d7a00c336","observation_id":"c0c2f812-83bd-427b-8b14-3175f95960bc","resolution":{"observed_at":"2026-08-14T12:50:03.989680Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:50:03.966303Z","title":"Experiments with mas- sively parallel constraint solving,","venue":null,"work_id":"71f871c4-7f31-4576-84ce-cf58ecfc4394","year":2003},"citing_paper":{"arxiv_id":"1908.06418","last_updated":"2019-08-18T10:15:59Z","snapshot_observed_at":"2026-08-16T02:25:21.427750Z","submitted_at":"2019-08-18T10:15:59Z","title":"The Maximum Common Subgraph Problem: A Portfolio Approach","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T12:50:03.476800Z"},"links":{"citing_paper":"/paper/1908.06418"},"observation_digest":"sha256:cb805f451a7bafd23bd463260bd5de65b365a67ba5f12b47aa091cf3b9f934b4","observation_id":"d0dfab56-7d84-43b3-83e1-0b62919bda3b","resolution":{"observed_at":"2026-08-14T12:50:03.973578Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:50:03.950334Z","title":"SATzilla: Portfolio- based Algorithm Selection for SAT,","venue":null,"work_id":"f434d759-cd6f-4b30-b8f3-e64c1253ae62","year":2008},"citing_paper":{"arxiv_id":"1908.06418","last_updated":"2019-08-18T10:15:59Z","snapshot_observed_at":"2026-08-16T02:25:21.427750Z","submitted_at":"2019-08-18T10:15:59Z","title":"The Maximum Common Subgraph Problem: A Portfolio Approach","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T12:50:03.482202Z"},"links":{"citing_paper":"/paper/1908.06418"},"observation_digest":"sha256:34821261142037636c5d85174f2e245b3f70d594d1257f149305c81a17abc25e","observation_id":"30839f89-d832-4e0d-83a2-ca156f297432","resolution":{"observed_at":"2026-08-14T12:50:03.955179Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:50:03.934774Z","title":"A self-adaptive multi-engine solver for quantified boolean formulas,","venue":null,"work_id":"d5e79b6b-e7db-485e-8281-cd8d905e9903","year":null},"citing_paper":{"arxiv_id":"1908.06418","last_updated":"2019-08-18T10:15:59Z","snapshot_observed_at":"2026-08-16T02:25:21.427750Z","submitted_at":"2019-08-18T10:15:59Z","title":"The Maximum Common Subgraph Problem: A Portfolio Approach","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T12:50:03.487220Z"},"links":{"citing_paper":"/paper/1908.06418"},"observation_digest":"sha256:127400cceeeddbc477fcff16f4d1747ca1b3dedc00d1998ef740cff504758c9c","observation_id":"d700580c-e543-4cb1-92da-3866ea51b9c1","resolution":{"observed_at":"2026-08-14T12:50:03.940103Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:50:03.919118Z","title":"Manysat: a parallel sat solver,","venue":null,"work_id":"44044bcc-d1eb-462a-914f-820c065b2d1b","year":2009},"citing_paper":{"arxiv_id":"1908.06418","last_updated":"2019-08-18T10:15:59Z","snapshot_observed_at":"2026-08-16T02:25:21.427750Z","submitted_at":"2019-08-18T10:15:59Z","title":"The Maximum Common Subgraph Problem: A Portfolio Approach","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T12:50:03.496973Z"},"links":{"citing_paper":"/paper/1908.06418"},"observation_digest":"sha256:c69e0f1e87ff0fb74cf23cfe073fb39b8a89c0c8526e793f42bf8da7c9242e83","observation_id":"ea275d50-0767-43f2-9d6e-55da683fc6a5","resolution":{"observed_at":"2026-08-14T12:50:03.923764Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:50:03.903619Z","title":"Clique and constraint models for maximum common (connected) subgraph prob- lems,","venue":null,"work_id":"b2ff4500-0702-4b39-b1ff-0777d25f3aa9","year":2016},"citing_paper":{"arxiv_id":"1908.06418","last_updated":"2019-08-18T10:15:59Z","snapshot_observed_at":"2026-08-16T02:25:21.427750Z","submitted_at":"2019-08-18T10:15:59Z","title":"The Maximum Common Subgraph Problem: A Portfolio Approach","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T12:50:03.501601Z"},"links":{"citing_paper":"/paper/1908.06418"},"observation_digest":"sha256:d1e855791e4df055966a4cefd4a3f6f3366918cc240c6440ea2d4851d21b9aeb","observation_id":"ab34afea-84ae-43f9-a2cc-dc33e0302c0f","resolution":{"observed_at":"2026-08-14T12:50:03.908357Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:50:03.888190Z","title":"Between subgraph isomor- phism and maximum common subgraph,","venue":null,"work_id":"7e206e29-9d73-470b-990e-80b54a355073","year":2017},"citing_paper":{"arxiv_id":"1908.06418","last_updated":"2019-08-18T10:15:59Z","snapshot_observed_at":"2026-08-16T02:25:21.427750Z","submitted_at":"2019-08-18T10:15:59Z","title":"The Maximum Common Subgraph Problem: A Portfolio Approach","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T12:50:03.506552Z"},"links":{"citing_paper":"/paper/1908.06418"},"observation_digest":"sha256:89840be59ae8c7fa1c676631da97db2e4c387e0c15ea3be8bfc336b32227ec11","observation_id":"b1c84b82-dfd1-4d37-9a1f-0bf73ec34d89","resolution":{"observed_at":"2026-08-14T12:50:03.893583Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:50:03.873094Z","title":"The partitioned preassigned pivot proce- dure (p4),","venue":null,"work_id":"61971293-ed17-4bc2-9ca4-e6ee58e671a4","year":1972},"citing_paper":{"arxiv_id":"1908.06418","last_updated":"2019-08-18T10:15:59Z","snapshot_observed_at":"2026-08-16T02:25:21.427750Z","submitted_at":"2019-08-18T10:15:59Z","title":"The Maximum Common Subgraph Problem: A Portfolio Approach","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T12:50:03.511291Z"},"links":{"citing_paper":"/paper/1908.06418"},"observation_digest":"sha256:f39e9f934c152e7f4b47d3fc60526018f1a7a8a288ce73ac366073162fad7400","observation_id":"272de602-99e5-4004-968e-77f2313acbbb","resolution":{"observed_at":"2026-08-14T12:50:03.877979Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"5240.29571","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:50:03.703782Z","title":"Boosting combinatorial search through randomization,","venue":null,"work_id":"2ee74ff7-84b4-460f-bcd4-ee24271454b0","year":1998},"citing_paper":{"arxiv_id":"1908.06418","last_updated":"2019-08-18T10:15:59Z","snapshot_observed_at":"2026-08-16T02:25:21.427750Z","submitted_at":"2019-08-18T10:15:59Z","title":"The Maximum Common Subgraph Problem: A Portfolio Approach","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T12:50:03.516132Z"},"links":{"citing_paper":"/paper/1908.06418"},"observation_digest":"sha256:88bf79187210a8e9ecba958e1333b38400200b404add3546726af100770d43ee","observation_id":"34aec93a-00e7-4ea1-85e1-be0053b59743","resolution":{"observed_at":"2026-08-14T12:50:03.711905Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/s0036144502415960","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:50:03.569330Z","title":"Available: https://doi.org/10.1137/S0036144502415960","venue":null,"work_id":"3351a2a0-047e-4821-bdc1-e16e4ff54308","year":null},"citing_paper":{"arxiv_id":"1908.06418","last_updated":"2019-08-18T10:15:59Z","snapshot_observed_at":"2026-08-16T02:25:21.427750Z","submitted_at":"2019-08-18T10:15:59Z","title":"The Maximum Common Subgraph Problem: A Portfolio Approach","version":1},"reference_index":2004,"source":"pdf_text","source_observed_at":"2026-08-14T12:50:03.446811Z"},"links":{"citing_paper":"/paper/1908.06418"},"observation_digest":"sha256:ae8b480ed81a26ab051ab95119d0631a3192e74f6c012569333f661a65e1909b","observation_id":"62b323db-8b34-497a-94b9-774e3cde6a71","resolution":{"observed_at":"2026-08-14T12:50:03.573909Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10601-008-9051-2","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:50:03.551720Z","title":"Available: https://doi.org/10.1007/s10601-008-9051-2","venue":null,"work_id":"edae1a70-2c7e-417c-941c-b07c5e7ef127","year":null},"citing_paper":{"arxiv_id":"1908.06418","last_updated":"2019-08-18T10:15:59Z","snapshot_observed_at":"2026-08-16T02:25:21.427750Z","submitted_at":"2019-08-18T10:15:59Z","title":"The Maximum Common Subgraph Problem: A Portfolio Approach","version":1},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-14T12:50:03.492100Z"},"links":{"citing_paper":"/paper/1908.06418"},"observation_digest":"sha256:0dd13580a0b9956dca5ab79814d56ecba431fe5d7c9c3ace9d6c544850a69c9a","observation_id":"240290f2-e97e-47a1-96c8-aac5bcc69bca","resolution":{"observed_at":"2026-08-14T12:50:03.558008Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.06418","last_updated":"2019-08-18T10:15:59Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T02:25:21.427750Z","submitted_at":"2019-08-18T10:15:59Z","title":"The Maximum Common Subgraph Problem: A Portfolio Approach"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":0,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":0,"verified_exact":3,"verified_fuzzy":24},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:1908.06418."}