{"as_of":"2026-08-13T20:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d3ce4e8411627ebcfad55560b195d042aee0280f9ff731569fa64881265872af","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T06:03:11.285821Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-30T19:28:18.398259Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-20T16:43:34.714745Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.01349","last_updated":"2025-08-02T12:54:59Z","snapshot_observed_at":"2026-08-12T08:15:41.497598Z","submitted_at":"2025-08-02T12:54:59Z","title":"Classification of polyhedral graphs by numbers of common neighbours","version":1},"cited_work":{"arxiv_id":"2508.01349","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.01349","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"9cecdd6d-6801-4532-9fde-b56b8c1129f8","year":null},"citing_paper":{"arxiv_id":"2605.16224","last_updated":"2026-05-15T17:35:45Z","snapshot_observed_at":"2026-07-06T23:27:24.957966Z","submitted_at":"2026-05-15T17:35:45Z","title":"The Facial Common Neighbourhood Graph","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-20T16:43:09.063800Z"},"links":{"cited_paper":"/paper/2508.01349","citing_paper":"/paper/2605.16224"},"observation_digest":"sha256:6b8fd3947d1e90fc0a37bebc491368ab828b0fe7d79875b6ecee6a5089e39921","observation_id":"248b8446-9df7-401d-9f79-7ad64b9eb018","resolution":{"observed_at":"2026-05-20T16:43:34.716648Z","resolver_source":"arxiv_id","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":"2508.01349","last_updated":"2025-08-02T12:54:59Z","snapshot_observed_at":"2026-08-12T08:15:41.497598Z","submitted_at":"2025-08-02T12:54:59Z","title":"Classification of polyhedral graphs by numbers of common neighbours","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.01349","snapshot_observed_at":"2026-07-30T19:28:18.398259Z","title":"Classification of polyhedral graphs by numbers of common neighbours.arXiv:2508.01349, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26842","last_updated":"2026-07-29T12:30:26Z","snapshot_observed_at":"2026-08-12T21:33:22.449839Z","submitted_at":"2026-07-29T12:30:26Z","title":"Automorphism Groups in Extremal Families of Polyhedral Graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-30T19:28:18.398259Z"},"links":{"cited_paper":"/paper/2508.01349","citing_paper":"/paper/2607.26842"},"observation_digest":"sha256:6f3e826d2afcc65fc017f6a11bc3a907c7549af471986665a95e676d8c64034a","observation_id":"aeb1a4d1-0507-4b5a-8fe2-7e897abef0d0","resolution":{"observed_at":"2026-07-30T19:28:18.398259Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2508.01349/citation-record","integrity":"/paper/2508.01349/integrity","json":"/paper/2508.01349/citation-record.json","paper":"/paper/2508.01349"},"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-06T06:03:30.523768Z","title":null,"venue":null,"work_id":"df54d596-315d-4fb6-9d4e-867567c40da0","year":2019},"citing_paper":{"arxiv_id":"2508.01349","last_updated":"2025-08-02T12:54:59Z","snapshot_observed_at":"2026-08-12T08:15:41.497598Z","submitted_at":"2025-08-02T12:54:59Z","title":"Classification of polyhedral graphs by numbers of common neighbours","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T06:03:11.207652Z"},"links":{"citing_paper":"/paper/2508.01349"},"observation_digest":"sha256:f7962c5785e8301c6bafbc3fadadb57148fcd1232933fda994848a3888c53f00","observation_id":"7421ed26-fa43-420a-92f3-a16e085a693a","resolution":{"observed_at":"2026-08-06T06:03:30.695877Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T06:03:30.166006Z","title":"Erickson, S","venue":null,"work_id":"c15b13b8-a6b9-47af-8011-6d0e853919fa","year":1999},"citing_paper":{"arxiv_id":"2508.01349","last_updated":"2025-08-02T12:54:59Z","snapshot_observed_at":"2026-08-12T08:15:41.497598Z","submitted_at":"2025-08-02T12:54:59Z","title":"Classification of polyhedral graphs by numbers of common neighbours","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T06:03:11.213313Z"},"links":{"citing_paper":"/paper/2508.01349"},"observation_digest":"sha256:72815af2d1ca59fbdadc8b90fa8ad7997f5c7a03a14de782b2ae3f0d661e0c09","observation_id":"0af9c0e5-15a8-4730-baac-c58a33010ef6","resolution":{"observed_at":"2026-08-06T06:03:30.327900Z","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-06T06:03:29.905896Z","title":"Gavrilyuk, S","venue":null,"work_id":"aad11959-8601-42d3-9d11-951593b50ff8","year":2014},"citing_paper":{"arxiv_id":"2508.01349","last_updated":"2025-08-02T12:54:59Z","snapshot_observed_at":"2026-08-12T08:15:41.497598Z","submitted_at":"2025-08-02T12:54:59Z","title":"Classification of polyhedral graphs by numbers of common neighbours","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T06:03:11.218445Z"},"links":{"citing_paper":"/paper/2508.01349"},"observation_digest":"sha256:e38cb2fd8449b69691c47e44b40494745a996c5e6dd88da7794272e9687c4e81","observation_id":"dfb8e7d6-5c11-47e5-b979-046e1d5b67aa","resolution":{"observed_at":"2026-08-06T06:03:30.028758Z","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-06T06:03:29.650327Z","title":"Goddard and M","venue":null,"work_id":"76234e7e-f5a9-4326-ad4b-d3fcc936e79d","year":2002},"citing_paper":{"arxiv_id":"2508.01349","last_updated":"2025-08-02T12:54:59Z","snapshot_observed_at":"2026-08-12T08:15:41.497598Z","submitted_at":"2025-08-02T12:54:59Z","title":"Classification of polyhedral graphs by numbers of common neighbours","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T06:03:11.223345Z"},"links":{"citing_paper":"/paper/2508.01349"},"observation_digest":"sha256:2a303e2a248edeedebeb4e3060c22fa13d46ccd2dacdea75a70d03dfc909a266","observation_id":"13a1f142-62fa-42e1-8069-884fb4395939","resolution":{"observed_at":"2026-08-06T06:03:29.771395Z","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":{"arxiv_id":"2103.00228","last_updated":"2021-06-01T11:49:53Z","snapshot_observed_at":"2026-08-13T14:50:58.771040Z","submitted_at":"2021-02-27T14:26:00Z","title":"Deza graphs: a survey and new results","version":2},"cited_work":{"arxiv_id":"2103.00228","doi":null,"metadata_source":"pith","pith_arxiv_id":"2103.00228","snapshot_observed_at":"2026-08-06T06:03:26.599908Z","title":"Deza graphs: a survey and new results","venue":"math.CO","work_id":"246a8441-0cda-478c-b9d9-d60b7c6cb36e","year":2021},"citing_paper":{"arxiv_id":"2508.01349","last_updated":"2025-08-02T12:54:59Z","snapshot_observed_at":"2026-08-12T08:15:41.497598Z","submitted_at":"2025-08-02T12:54:59Z","title":"Classification of polyhedral graphs by numbers of common neighbours","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T06:03:11.228368Z"},"links":{"cited_paper":"/paper/2103.00228","citing_paper":"/paper/2508.01349"},"observation_digest":"sha256:36661bc0ac3dc064347b3cf026247cc0075629d54cb8190ab59175be39662dae","observation_id":"938f69cf-218d-4b49-ab58-03b5b78f3ead","resolution":{"observed_at":"2026-08-06T06:03:26.744474Z","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":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T06:03:29.387708Z","title":"Joret and C","venue":null,"work_id":"4d828ead-1fc7-4aba-9fcd-36243dad3185","year":2024},"citing_paper":{"arxiv_id":"2508.01349","last_updated":"2025-08-02T12:54:59Z","snapshot_observed_at":"2026-08-12T08:15:41.497598Z","submitted_at":"2025-08-02T12:54:59Z","title":"Classification of polyhedral graphs by numbers of common neighbours","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T06:03:11.233617Z"},"links":{"citing_paper":"/paper/2508.01349"},"observation_digest":"sha256:3be6681324efa8c5200a373fe3d7263622e57a2ebab405379e9436cede10b1c8","observation_id":"30b19eb4-59d3-4b25-8770-8de873b5fcfe","resolution":{"observed_at":"2026-08-06T06:03:29.484293Z","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-06T06:03:29.067885Z","title":null,"venue":null,"work_id":"19f98cc7-a2ea-45e3-a752-b1d0b3f8446f","year":2018},"citing_paper":{"arxiv_id":"2508.01349","last_updated":"2025-08-02T12:54:59Z","snapshot_observed_at":"2026-08-12T08:15:41.497598Z","submitted_at":"2025-08-02T12:54:59Z","title":"Classification of polyhedral graphs by numbers of common neighbours","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T06:03:11.238413Z"},"links":{"citing_paper":"/paper/2508.01349"},"observation_digest":"sha256:5009a2274f808ec465e3acc0f6605b101d891399184a50bb568900fd42d83b29","observation_id":"b482841c-1877-4089-ac4b-0616cfd0ef70","resolution":{"observed_at":"2026-08-06T06:03:29.221865Z","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":null,"cited_work":{"arxiv_id":"2504.19204","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T06:03:26.378566Z","title":null,"venue":null,"work_id":"b2448e02-4bb6-4ac7-a3c3-f1fc37a2635c","year":null},"citing_paper":{"arxiv_id":"2508.01349","last_updated":"2025-08-02T12:54:59Z","snapshot_observed_at":"2026-08-12T08:15:41.497598Z","submitted_at":"2025-08-02T12:54:59Z","title":"Classification of polyhedral graphs by numbers of common neighbours","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T06:03:11.243626Z"},"links":{"citing_paper":"/paper/2508.01349"},"observation_digest":"sha256:76d6b6c1c2fd919226fa89087acb09a6ed20c13f10dd673ebfea6dff2c5507e5","observation_id":"0d4f7768-699a-4cb1-ba09-cdca687462b0","resolution":{"observed_at":"2026-08-06T06:03:26.523307Z","resolver_source":"raw_fallback","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":"2506.16864","last_updated":"2025-06-20T09:30:16Z","snapshot_observed_at":"2026-08-12T08:15:04.824650Z","submitted_at":"2025-06-20T09:30:16Z","title":"Regularity and separation for Sierpi\\'nski products of graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.16864","snapshot_observed_at":"2026-08-06T06:03:11.248490Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.01349","last_updated":"2025-08-02T12:54:59Z","snapshot_observed_at":"2026-08-12T08:15:41.497598Z","submitted_at":"2025-08-02T12:54:59Z","title":"Classification of polyhedral graphs by numbers of common neighbours","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T06:03:11.248490Z"},"links":{"cited_paper":"/paper/2506.16864","citing_paper":"/paper/2508.01349"},"observation_digest":"sha256:513ceabc223e854cc8de6cf8d4ec43235e7c529d62a62fa5df740f7adeef1c12","observation_id":"595cdd5a-04e7-445a-a79e-8985628a7ffc","resolution":{"observed_at":"2026-08-06T06:03:11.248490Z","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-06T06:03:28.868898Z","title":null,"venue":null,"work_id":"8ca0f6f2-6618-4059-864a-a7ffd8ed4260","year":2024},"citing_paper":{"arxiv_id":"2508.01349","last_updated":"2025-08-02T12:54:59Z","snapshot_observed_at":"2026-08-12T08:15:41.497598Z","submitted_at":"2025-08-02T12:54:59Z","title":"Classification of polyhedral graphs by numbers of common neighbours","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T06:03:11.253479Z"},"links":{"citing_paper":"/paper/2508.01349"},"observation_digest":"sha256:81afa08245ed72a86400c61aa94220dd2ec789046876cecf66b7409b23cdadf4","observation_id":"fb179d2b-ced3-4c31-83d0-3ecaccb8e7e3","resolution":{"observed_at":"2026-08-06T06:03:28.968120Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T06:03:28.504512Z","title":"Papadopoulos, R","venue":null,"work_id":"76a3df5d-268d-439d-9852-0eb61137cf24","year":2015},"citing_paper":{"arxiv_id":"2508.01349","last_updated":"2025-08-02T12:54:59Z","snapshot_observed_at":"2026-08-12T08:15:41.497598Z","submitted_at":"2025-08-02T12:54:59Z","title":"Classification of polyhedral graphs by numbers of common neighbours","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T06:03:11.258061Z"},"links":{"citing_paper":"/paper/2508.01349"},"observation_digest":"sha256:3b7a1f79ad9734d3ec721e9a6149bc85039c757700ba5bf5b2c35da1045f1ed6","observation_id":"b564956d-b3eb-4215-a534-f72097e6cdd7","resolution":{"observed_at":"2026-08-06T06:03:28.703809Z","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-06T06:03:28.253666Z","title":"Reidl, F","venue":null,"work_id":"5167e578-9255-4923-80af-7f2b02b231ca","year":2019},"citing_paper":{"arxiv_id":"2508.01349","last_updated":"2025-08-02T12:54:59Z","snapshot_observed_at":"2026-08-12T08:15:41.497598Z","submitted_at":"2025-08-02T12:54:59Z","title":"Classification of polyhedral graphs by numbers of common neighbours","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T06:03:11.262759Z"},"links":{"citing_paper":"/paper/2508.01349"},"observation_digest":"sha256:597e759c6f744725ac50f4a3bd20483d6ca0168066db39af4c1863bb37129efd","observation_id":"d95f4e6b-29c5-4da0-b57b-acef7051c882","resolution":{"observed_at":"2026-08-06T06:03:28.328309Z","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-06T06:03:28.005591Z","title":"Wang and F","venue":null,"work_id":"2aa76060-a3d5-4559-836a-6f12b90165c7","year":2008},"citing_paper":{"arxiv_id":"2508.01349","last_updated":"2025-08-02T12:54:59Z","snapshot_observed_at":"2026-08-12T08:15:41.497598Z","submitted_at":"2025-08-02T12:54:59Z","title":"Classification of polyhedral graphs by numbers of common neighbours","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T06:03:11.267601Z"},"links":{"citing_paper":"/paper/2508.01349"},"observation_digest":"sha256:96432af7ce95184571f95f28b66aadec10e5533a6f29319e7cec6f19106b0806","observation_id":"28199a2e-fdbe-4733-9266-406d732f5f41","resolution":{"observed_at":"2026-08-06T06:03:28.101229Z","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-06T06:03:27.742149Z","title":"Wang and L","venue":null,"work_id":"599770dd-47f1-4a81-81ec-d9eb7b3e109f","year":2015},"citing_paper":{"arxiv_id":"2508.01349","last_updated":"2025-08-02T12:54:59Z","snapshot_observed_at":"2026-08-12T08:15:41.497598Z","submitted_at":"2025-08-02T12:54:59Z","title":"Classification of polyhedral graphs by numbers of common neighbours","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T06:03:11.272359Z"},"links":{"citing_paper":"/paper/2508.01349"},"observation_digest":"sha256:dbb1f2a16ed3c965b25f0b664ca1567688ca0b2467c428b0178635d027219fa6","observation_id":"15f8d18e-efb7-4ee1-abe2-66566ea959d1","resolution":{"observed_at":"2026-08-06T06:03:27.923805Z","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-06T06:03:27.522926Z","title":null,"venue":null,"work_id":"3398d357-5ef8-419c-aaab-6ff231a42f37","year":2022},"citing_paper":{"arxiv_id":"2508.01349","last_updated":"2025-08-02T12:54:59Z","snapshot_observed_at":"2026-08-12T08:15:41.497598Z","submitted_at":"2025-08-02T12:54:59Z","title":"Classification of polyhedral graphs by numbers of common neighbours","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T06:03:11.276896Z"},"links":{"citing_paper":"/paper/2508.01349"},"observation_digest":"sha256:fcc77e7306f8d894696d81662525e2c0ae79926ec313c7565b46000b13858278","observation_id":"6362529b-77e2-42db-b4ba-6af79673556d","resolution":{"observed_at":"2026-08-06T06:03:27.603579Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T06:03:27.274693Z","title":null,"venue":null,"work_id":"661b2867-b4cb-48e7-8bf5-2d96751bc0a6","year":1932},"citing_paper":{"arxiv_id":"2508.01349","last_updated":"2025-08-02T12:54:59Z","snapshot_observed_at":"2026-08-12T08:15:41.497598Z","submitted_at":"2025-08-02T12:54:59Z","title":"Classification of polyhedral graphs by numbers of common neighbours","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T06:03:11.281437Z"},"links":{"citing_paper":"/paper/2508.01349"},"observation_digest":"sha256:51fb0bfe7a57d796a05582df7ea89f972cbe2d51c70af558b9b1586fbe2fa0a1","observation_id":"c9c057cf-170a-45f2-bf0e-24289a9268d6","resolution":{"observed_at":"2026-08-06T06:03:27.403038Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T06:03:26.928901Z","title":null,"venue":null,"work_id":"dc4f09c8-7393-4f95-83b5-79d29e084b1b","year":2016},"citing_paper":{"arxiv_id":"2508.01349","last_updated":"2025-08-02T12:54:59Z","snapshot_observed_at":"2026-08-12T08:15:41.497598Z","submitted_at":"2025-08-02T12:54:59Z","title":"Classification of polyhedral graphs by numbers of common neighbours","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T06:03:11.285821Z"},"links":{"citing_paper":"/paper/2508.01349"},"observation_digest":"sha256:6fcec97df6dcce8df65d9573a5759adc0b16c8000348b6f5f52c5eb1150810bd","observation_id":"280a6a35-de5b-4070-9c74-23ab30a2fcaf","resolution":{"observed_at":"2026-08-06T06:03:27.108026Z","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"}}],"paper":{"arxiv_id":"2508.01349","last_updated":"2025-08-02T12:54:59Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-12T08:15:41.497598Z","submitted_at":"2025-08-02T12:54:59Z","title":"Classification of polyhedral graphs by numbers of common neighbours"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":2,"verified_fuzzy":8},"total_outbound_references":17},"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 13 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 2 inbound Pith citation observations for arXiv:2508.01349."}