{"as_of":"2026-08-17T02:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2eb7d32093d368adad8658d5c9b89b2cf6888d15ace5320997d7c809c6991c61","coverage":[{"denominator":26,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":26,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T13:02:21.800839Z","state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"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.06320/citation-record","integrity":"/paper/1908.06320/integrity","json":"/paper/1908.06320/citation-record.json","paper":"/paper/1908.06320"},"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-14T13:02:22.276809Z","title":null,"venue":null,"work_id":"2a2ae48c-d5c6-4389-a017-853358052166","year":1979},"citing_paper":{"arxiv_id":"1908.06320","last_updated":"2019-10-28T16:23:28Z","snapshot_observed_at":"2026-08-16T11:43:39.858386Z","submitted_at":"2019-08-17T17:08:57Z","title":"Revisiting the Graph Isomorphism Problem with Semidefinite Programming","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:21.533487Z"},"links":{"citing_paper":"/paper/1908.06320"},"observation_digest":"sha256:cd9711064e01d925e180958aaeccfc7156d77b892eacddd00dec231ee83f4d9a","observation_id":"8100fa80-be2a-465b-bbfe-5d47e54b8196","resolution":{"observed_at":"2026-08-14T13:02:22.283263Z","resolver_source":"raw_fallback","status":"unresolved"},"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-14T13:02:22.250342Z","title":"Graph Isomorphism Is in the Low Hierarchy,","venue":null,"work_id":"775f93b5-0f32-44bc-be14-0757820a92cb","year":1988},"citing_paper":{"arxiv_id":"1908.06320","last_updated":"2019-10-28T16:23:28Z","snapshot_observed_at":"2026-08-16T11:43:39.858386Z","submitted_at":"2019-08-17T17:08:57Z","title":"Revisiting the Graph Isomorphism Problem with Semidefinite Programming","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:21.569251Z"},"links":{"citing_paper":"/paper/1908.06320"},"observation_digest":"sha256:5519e8a3704c91bcc5aaae7cf62173566be9fc54f906a569ac752e1432e82ebd","observation_id":"444db279-0743-4b7a-a0cf-3f5e3c617052","resolution":{"observed_at":"2026-08-14T13:02:22.256118Z","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-14T13:02:22.227920Z","title":"Canonical Labeling of Graphs,","venue":null,"work_id":"71925770-c983-4e6c-ae1e-4b20ef119e82","year":1983},"citing_paper":{"arxiv_id":"1908.06320","last_updated":"2019-10-28T16:23:28Z","snapshot_observed_at":"2026-08-16T11:43:39.858386Z","submitted_at":"2019-08-17T17:08:57Z","title":"Revisiting the Graph Isomorphism Problem with Semidefinite Programming","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:21.600632Z"},"links":{"citing_paper":"/paper/1908.06320"},"observation_digest":"sha256:12cef73507fce997ffb83e4243ae6fb67de232cef68697b2e852b2b21a94609e","observation_id":"e0265434-5d9e-48ff-a8ab-d4bb8e8ee850","resolution":{"observed_at":"2026-08-14T13:02:22.235430Z","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-14T13:02:22.209682Z","title":"Graph Isomorphism Prob- lem,","venue":null,"work_id":"32916290-b006-4a81-b32d-1316fad4056f","year":1985},"citing_paper":{"arxiv_id":"1908.06320","last_updated":"2019-10-28T16:23:28Z","snapshot_observed_at":"2026-08-16T11:43:39.858386Z","submitted_at":"2019-08-17T17:08:57Z","title":"Revisiting the Graph Isomorphism Problem with Semidefinite Programming","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:21.631634Z"},"links":{"citing_paper":"/paper/1908.06320"},"observation_digest":"sha256:cf2d5dde6bec21f5f883b211d6f1b8b01bdb1e89fc7f61c4d35e2a6f3ea905d1","observation_id":"d8a2fc01-441e-4b7f-82c9-3217660be321","resolution":{"observed_at":"2026-08-14T13:02:22.214373Z","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-14T13:02:22.190544Z","title":"Isomorphism of Graphs of Bounded Valence Can Be Tested in Polynomial Time,","venue":null,"work_id":"1e85e988-2a94-40b1-9e80-eceb5ba330ea","year":1982},"citing_paper":{"arxiv_id":"1908.06320","last_updated":"2019-10-28T16:23:28Z","snapshot_observed_at":"2026-08-16T11:43:39.858386Z","submitted_at":"2019-08-17T17:08:57Z","title":"Revisiting the Graph Isomorphism Problem with Semidefinite Programming","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:21.671498Z"},"links":{"citing_paper":"/paper/1908.06320"},"observation_digest":"sha256:1436ebf55d1be95f99f45ea3c71e6b68a5cbae2f3491c5c379011d0582d161b6","observation_id":"28e6d22a-4b13-4f1f-9075-8bd40189ff7b","resolution":{"observed_at":"2026-08-14T13:02:22.195845Z","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-14T13:02:22.174641Z","title":"Graph Isomorphism in Quasipolynomial Time,","venue":null,"work_id":"d767747a-b5c9-48fe-8095-d20d10bce3ed","year":2016},"citing_paper":{"arxiv_id":"1908.06320","last_updated":"2019-10-28T16:23:28Z","snapshot_observed_at":"2026-08-16T11:43:39.858386Z","submitted_at":"2019-08-17T17:08:57Z","title":"Revisiting the Graph Isomorphism Problem with Semidefinite Programming","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:21.677866Z"},"links":{"citing_paper":"/paper/1908.06320"},"observation_digest":"sha256:386aa1362a437d2c24f70da4b42151b23855e136c855a0291bbea7290f065097","observation_id":"c445defc-6122-4c62-9ba5-9d1377099c29","resolution":{"observed_at":"2026-08-14T13:02:22.179605Z","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-14T13:02:22.158175Z","title":"Linear Time Algorithm for Isomorphism of Planar Graphs,","venue":null,"work_id":"158024eb-a148-4562-b3f8-eea74eae1de6","year":1974},"citing_paper":{"arxiv_id":"1908.06320","last_updated":"2019-10-28T16:23:28Z","snapshot_observed_at":"2026-08-16T11:43:39.858386Z","submitted_at":"2019-08-17T17:08:57Z","title":"Revisiting the Graph Isomorphism Problem with Semidefinite Programming","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:21.686392Z"},"links":{"citing_paper":"/paper/1908.06320"},"observation_digest":"sha256:facaffa41b0c3111378d557cadb41a17294d2630bf688e76d327fd4ea3de36a6","observation_id":"c342ad92-ccf5-4e49-a711-c6d3c21b63fa","resolution":{"observed_at":"2026-08-14T13:02:22.163424Z","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-14T13:02:22.132591Z","title":"Isomorphism of Graphs with Bounded Eigen- value Multiplicity,","venue":null,"work_id":"862342e9-5d49-41c0-b1a4-889cdbcf4b87","year":1982},"citing_paper":{"arxiv_id":"1908.06320","last_updated":"2019-10-28T16:23:28Z","snapshot_observed_at":"2026-08-16T11:43:39.858386Z","submitted_at":"2019-08-17T17:08:57Z","title":"Revisiting the Graph Isomorphism Problem with Semidefinite Programming","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:21.693836Z"},"links":{"citing_paper":"/paper/1908.06320"},"observation_digest":"sha256:f189f21b89130e28dae782b15c83251f80a4991507eb932205d1e097bbe41e60","observation_id":"e7383057-e228-46c7-88e0-87beaa2923dc","resolution":{"observed_at":"2026-08-14T13:02:22.139981Z","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-14T13:02:22.115852Z","title":"Practical graph isomorphism, ii,","venue":null,"work_id":"819d9ca5-4d9d-411f-bf96-ae4b6fda9c3b","year":2014},"citing_paper":{"arxiv_id":"1908.06320","last_updated":"2019-10-28T16:23:28Z","snapshot_observed_at":"2026-08-16T11:43:39.858386Z","submitted_at":"2019-08-17T17:08:57Z","title":"Revisiting the Graph Isomorphism Problem with Semidefinite Programming","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:21.700490Z"},"links":{"citing_paper":"/paper/1908.06320"},"observation_digest":"sha256:24f11abef575a535e65d53c879183063139cf9af33111386491110299e8b9be6","observation_id":"93092291-5851-4d02-a1b9-7b3102d24834","resolution":{"observed_at":"2026-08-14T13:02:22.121072Z","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-14T13:02:22.101252Z","title":"Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs,","venue":null,"work_id":"3f77e244-c323-4460-a93f-2643dc779ef1","year":2007},"citing_paper":{"arxiv_id":"1908.06320","last_updated":"2019-10-28T16:23:28Z","snapshot_observed_at":"2026-08-16T11:43:39.858386Z","submitted_at":"2019-08-17T17:08:57Z","title":"Revisiting the Graph Isomorphism Problem with Semidefinite Programming","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:21.706024Z"},"links":{"citing_paper":"/paper/1908.06320"},"observation_digest":"sha256:e2f48c8a1be254f4f4411867713488220928f9ca4ead621946c19606379f43be","observation_id":"3f9dd651-774b-4ccf-9704-62c6e18336c2","resolution":{"observed_at":"2026-08-14T13:02:22.105732Z","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-14T13:02:22.085374Z","title":"Faster Symmetry Discovery using Sparsity of Symmetries,","venue":null,"work_id":"8edd1978-60d5-48e0-aa9f-a8118dc0eecc","year":2008},"citing_paper":{"arxiv_id":"1908.06320","last_updated":"2019-10-28T16:23:28Z","snapshot_observed_at":"2026-08-16T11:43:39.858386Z","submitted_at":"2019-08-17T17:08:57Z","title":"Revisiting the Graph Isomorphism Problem with Semidefinite Programming","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:21.711082Z"},"links":{"citing_paper":"/paper/1908.06320"},"observation_digest":"sha256:33de0662b9a9a92312f523a11e8e2193f96d8c3b3a078689096bb3a1ce18e41e","observation_id":"6f89c5e4-cd30-49cf-8ffe-d9bc3aea6b35","resolution":{"observed_at":"2026-08-14T13:02:22.090795Z","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-14T13:02:22.069773Z","title":"On convex relaxation of graph isomorphism,","venue":null,"work_id":"11f31d99-983b-4d2b-bb4e-b1cbb9fd3f87","year":2015},"citing_paper":{"arxiv_id":"1908.06320","last_updated":"2019-10-28T16:23:28Z","snapshot_observed_at":"2026-08-16T11:43:39.858386Z","submitted_at":"2019-08-17T17:08:57Z","title":"Revisiting the Graph Isomorphism Problem with Semidefinite Programming","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:21.716333Z"},"links":{"citing_paper":"/paper/1908.06320"},"observation_digest":"sha256:625926d1eac7f277a1e0a2007cd26de0dcb8dbb444c664e69f1f510ec8e78005","observation_id":"014d31f7-5ece-4175-8335-d0b43b37896d","resolution":{"observed_at":"2026-08-14T13:02:22.074391Z","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-14T13:02:22.054327Z","title":"An O(n3l) primal interior point algorithm for convex quadratic programming,","venue":null,"work_id":"3458a4e1-b8a7-4de0-b6c2-0dc11667861f","year":1990},"citing_paper":{"arxiv_id":"1908.06320","last_updated":"2019-10-28T16:23:28Z","snapshot_observed_at":"2026-08-16T11:43:39.858386Z","submitted_at":"2019-08-17T17:08:57Z","title":"Revisiting the Graph Isomorphism Problem with Semidefinite Programming","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:21.723223Z"},"links":{"citing_paper":"/paper/1908.06320"},"observation_digest":"sha256:2e10c802a67c415fc23bcea0e1228e274ca5d6744f87dcb40e603e4b47d88f55","observation_id":"5d743f39-958e-49a7-87b2-820f53fc4e30","resolution":{"observed_at":"2026-08-14T13:02:22.059330Z","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-14T13:02:22.038051Z","title":"Replicator Equations, Maximal Cliques, and Graph Isomorphism,","venue":null,"work_id":"31a9b9bd-3ca3-4be6-b3b2-53937ee4d351","year":1999},"citing_paper":{"arxiv_id":"1908.06320","last_updated":"2019-10-28T16:23:28Z","snapshot_observed_at":"2026-08-16T11:43:39.858386Z","submitted_at":"2019-08-17T17:08:57Z","title":"Revisiting the Graph Isomorphism Problem with Semidefinite Programming","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:21.729989Z"},"links":{"citing_paper":"/paper/1908.06320"},"observation_digest":"sha256:c60b0642be05b08e1df85f67ea2310d7fac40e803f59d531371d90cb7ee5660f","observation_id":"3b212001-1aad-415b-8e07-a86f270ee4e4","resolution":{"observed_at":"2026-08-14T13:02:22.042983Z","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-14T13:02:22.019890Z","title":"A note on the derivation of maximal common subgraphs of two directed or undirected graphs,","venue":null,"work_id":"15cf4451-ebc2-4fba-b965-4d3bb5e97f5e","year":1973},"citing_paper":{"arxiv_id":"1908.06320","last_updated":"2019-10-28T16:23:28Z","snapshot_observed_at":"2026-08-16T11:43:39.858386Z","submitted_at":"2019-08-17T17:08:57Z","title":"Revisiting the Graph Isomorphism Problem with Semidefinite Programming","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:21.736559Z"},"links":{"citing_paper":"/paper/1908.06320"},"observation_digest":"sha256:e6a06e63d80f86bca7325f202fcd3d3feb19f1a0608c0dbbc6d38ac0a02331bd","observation_id":"1c79eeb0-038a-4258-94fd-94db9b80fef4","resolution":{"observed_at":"2026-08-14T13:02:22.027290Z","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-14T13:02:22.003063Z","title":"Subgraph isomorphism, matching relational structures and maximal cliques,","venue":null,"work_id":"d7c00ea5-3087-4f35-9572-6775b0f25ecc","year":1976},"citing_paper":{"arxiv_id":"1908.06320","last_updated":"2019-10-28T16:23:28Z","snapshot_observed_at":"2026-08-16T11:43:39.858386Z","submitted_at":"2019-08-17T17:08:57Z","title":"Revisiting the Graph Isomorphism Problem with Semidefinite Programming","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:21.742990Z"},"links":{"citing_paper":"/paper/1908.06320"},"observation_digest":"sha256:eed591b776b79e375c0c0dfcd2006b7219136c1ed5f6f535c20386b9bced041d","observation_id":"3558f129-7206-47d8-9daf-76dc723a7e9c","resolution":{"observed_at":"2026-08-14T13:02:22.008104Z","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-14T13:02:21.986757Z","title":"A clique problem equivalent to graph isomorphism,","venue":null,"work_id":"f6a4ad0a-81be-42e9-9089-df15ca4f472d","year":1978},"citing_paper":{"arxiv_id":"1908.06320","last_updated":"2019-10-28T16:23:28Z","snapshot_observed_at":"2026-08-16T11:43:39.858386Z","submitted_at":"2019-08-17T17:08:57Z","title":"Revisiting the Graph Isomorphism Problem with Semidefinite Programming","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:21.749569Z"},"links":{"citing_paper":"/paper/1908.06320"},"observation_digest":"sha256:bd9f233a5ce75055c208657732a300d0255cf5a736169c8aad4bb19c7ab238ee","observation_id":"5e91bb2d-da70-4f54-9570-6e40aa143fe4","resolution":{"observed_at":"2026-08-14T13:02:21.991476Z","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-14T13:02:21.970677Z","title":"Enumerating all connected maximal common subgraphs in two graphs,","venue":null,"work_id":"68d46098-e715-4edd-a742-103a2a04474e","year":2001},"citing_paper":{"arxiv_id":"1908.06320","last_updated":"2019-10-28T16:23:28Z","snapshot_observed_at":"2026-08-16T11:43:39.858386Z","submitted_at":"2019-08-17T17:08:57Z","title":"Revisiting the Graph Isomorphism Problem with Semidefinite Programming","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:21.755415Z"},"links":{"citing_paper":"/paper/1908.06320"},"observation_digest":"sha256:b26db7e16fd37cb782adba13c1f5cc0e5e313817b47f51210523d339d5768b8d","observation_id":"1fb1cf95-bc08-407d-8a35-e88e0d62705e","resolution":{"observed_at":"2026-08-14T13:02:21.975472Z","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-14T13:02:21.954747Z","title":"Subgraph Matching Kernels for Attributed Graphs,","venue":null,"work_id":"e28e247e-c550-4a32-b622-0eac6d3bad26","year":2012},"citing_paper":{"arxiv_id":"1908.06320","last_updated":"2019-10-28T16:23:28Z","snapshot_observed_at":"2026-08-16T11:43:39.858386Z","submitted_at":"2019-08-17T17:08:57Z","title":"Revisiting the Graph Isomorphism Problem with Semidefinite Programming","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:21.760516Z"},"links":{"citing_paper":"/paper/1908.06320"},"observation_digest":"sha256:ccc86cbb4062b9be739fe5e23a904886e3568e6b5e6fbb94d0c65b604edd9609","observation_id":"765ff24f-1f96-45da-a233-c39d22c38448","resolution":{"observed_at":"2026-08-14T13:02:21.959842Z","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-14T13:02:21.938187Z","title":"Gr¨ otschel, L","venue":null,"work_id":"ef029fad-4e37-480f-a3cd-eb4b117fe36e","year":2012},"citing_paper":{"arxiv_id":"1908.06320","last_updated":"2019-10-28T16:23:28Z","snapshot_observed_at":"2026-08-16T11:43:39.858386Z","submitted_at":"2019-08-17T17:08:57Z","title":"Revisiting the Graph Isomorphism Problem with Semidefinite Programming","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:21.766103Z"},"links":{"citing_paper":"/paper/1908.06320"},"observation_digest":"sha256:d5e061af679d80f61e091fa54ee6a2748530eb4c9703a636b43e5bb1cc1b2e93","observation_id":"bb0b6d65-7d80-47ad-8b95-8543fc14f8ce","resolution":{"observed_at":"2026-08-14T13:02:21.943849Z","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-14T13:02:21.917397Z","title":"Nesterov and A","venue":null,"work_id":"684e697c-42ec-416d-b9d3-a577efadeaa6","year":1994},"citing_paper":{"arxiv_id":"1908.06320","last_updated":"2019-10-28T16:23:28Z","snapshot_observed_at":"2026-08-16T11:43:39.858386Z","submitted_at":"2019-08-17T17:08:57Z","title":"Revisiting the Graph Isomorphism Problem with Semidefinite Programming","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:21.770535Z"},"links":{"citing_paper":"/paper/1908.06320"},"observation_digest":"sha256:99cab535bd0c7c8e2ac29a9b25df2ed8327af48023f3f7dafebd17400fb3ba9f","observation_id":"48e7d619-1687-477e-9a5e-e7fd18501e8b","resolution":{"observed_at":"2026-08-14T13:02:21.923016Z","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-14T13:02:21.900661Z","title":"The ellipsoid method and its consequences in combinatorial optimization,","venue":null,"work_id":"533afc7c-7731-4bc0-95d3-54802639ee36","year":1981},"citing_paper":{"arxiv_id":"1908.06320","last_updated":"2019-10-28T16:23:28Z","snapshot_observed_at":"2026-08-16T11:43:39.858386Z","submitted_at":"2019-08-17T17:08:57Z","title":"Revisiting the Graph Isomorphism Problem with Semidefinite Programming","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:21.775651Z"},"links":{"citing_paper":"/paper/1908.06320"},"observation_digest":"sha256:3d1b501cc20275ca3ad89f7a11b0a3cf2c93701aaae9a49a805de9429530b084","observation_id":"3bc8e3b7-cd8b-4f3f-af87-025435c9229b","resolution":{"observed_at":"2026-08-14T13:02:21.905607Z","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-14T13:02:21.885077Z","title":"Semidefinite programming,","venue":null,"work_id":"1f53f2ab-3d24-4ead-ac73-07576e890c36","year":1996},"citing_paper":{"arxiv_id":"1908.06320","last_updated":"2019-10-28T16:23:28Z","snapshot_observed_at":"2026-08-16T11:43:39.858386Z","submitted_at":"2019-08-17T17:08:57Z","title":"Revisiting the Graph Isomorphism Problem with Semidefinite Programming","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:21.780723Z"},"links":{"citing_paper":"/paper/1908.06320"},"observation_digest":"sha256:5fc4ad7b5036172751ad5eea459b2ae2cbe9d7817fed8d67ecd88a0fee6f19cd","observation_id":"5fb353d0-c5ee-43af-8079-60f078448753","resolution":{"observed_at":"2026-08-14T13:02:21.889830Z","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-14T13:02:21.868431Z","title":"Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming,","venue":null,"work_id":"fa03c676-e977-44f8-b727-813a507cd182","year":1995},"citing_paper":{"arxiv_id":"1908.06320","last_updated":"2019-10-28T16:23:28Z","snapshot_observed_at":"2026-08-16T11:43:39.858386Z","submitted_at":"2019-08-17T17:08:57Z","title":"Revisiting the Graph Isomorphism Problem with Semidefinite Programming","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:21.786844Z"},"links":{"citing_paper":"/paper/1908.06320"},"observation_digest":"sha256:9cf1a546e9ec0237b3e4404d3ebbd11ddf46d42e021b0d6a2ed763c4cd85d89d","observation_id":"aa323971-ed02-4ff6-a509-fd57b2cbcecb","resolution":{"observed_at":"2026-08-14T13:02:21.873592Z","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-14T13:02:21.853123Z","title":"Finding dense subgraphs with semidefinite programming,","venue":null,"work_id":"ac1bfd37-fb74-48bb-901b-21b103cfe8d7","year":1998},"citing_paper":{"arxiv_id":"1908.06320","last_updated":"2019-10-28T16:23:28Z","snapshot_observed_at":"2026-08-16T11:43:39.858386Z","submitted_at":"2019-08-17T17:08:57Z","title":"Revisiting the Graph Isomorphism Problem with Semidefinite Programming","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:21.792447Z"},"links":{"citing_paper":"/paper/1908.06320"},"observation_digest":"sha256:06dc532d17c6ca29fccadb60ae7372b875918582f9e24a4e5618b37457593dde","observation_id":"c11f554b-afc4-4128-a66f-e51f46ea22a4","resolution":{"observed_at":"2026-08-14T13:02:21.857655Z","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-14T13:02:21.834378Z","title":"Finding and certifying a large hidden clique in a semiran- dom graph,","venue":null,"work_id":"78110ed5-3d57-406e-9909-da9dacf8b042","year":2000},"citing_paper":{"arxiv_id":"1908.06320","last_updated":"2019-10-28T16:23:28Z","snapshot_observed_at":"2026-08-16T11:43:39.858386Z","submitted_at":"2019-08-17T17:08:57Z","title":"Revisiting the Graph Isomorphism Problem with Semidefinite Programming","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T13:02:21.800839Z"},"links":{"citing_paper":"/paper/1908.06320"},"observation_digest":"sha256:cda0d94429075b02ad4583dd1c526b97ea427e7924e4c94ee0b5104f8798d0f6","observation_id":"e2c070e1-0cf2-446c-98d3-cfababc4b0e8","resolution":{"observed_at":"2026-08-14T13:02:21.841675Z","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"}}],"paper":{"arxiv_id":"1908.06320","last_updated":"2019-10-28T16:23:28Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T11:43:39.858386Z","submitted_at":"2019-08-17T17:08:57Z","title":"Revisiting the Graph Isomorphism Problem with Semidefinite Programming"},"reference_resolution":{"displayed":26,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":0,"verified_fuzzy":25},"total_outbound_references":26},"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 17 August 2026, this Paper Citation Record lists 26 of 26 outbound references and 0 inbound Pith citation observations for arXiv:1908.06320."}