{"as_of":"2026-08-13T22:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e59954b966cbec3282fe8d3a8ee1dd0540893b559df841243d563bb1994c88a3","coverage":[{"denominator":60,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":60,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T21:08:26.637176Z","state":"measured"},{"denominator":61,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":61,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T15:03:46.025771Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-06T15:03:48.375515Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"cited_work":{"arxiv_id":"2411.09158","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.09158","snapshot_observed_at":"2026-08-06T15:03:48.375515Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","venue":"cs.AI","work_id":"5af87b20-97c6-4ab9-8065-c0f908f62588","year":2024},"citing_paper":{"arxiv_id":"2507.17780","last_updated":"2025-07-23T00:49:32Z","snapshot_observed_at":"2026-08-12T12:28:39.237024Z","submitted_at":"2025-07-23T00:49:32Z","title":"In Reverie Together: Ten Years of Mathematical Discovery with a Machine Collaborator","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T15:03:46.025771Z"},"links":{"cited_paper":"/paper/2411.09158","citing_paper":"/paper/2507.17780"},"observation_digest":"sha256:212b53bdf9ab47bc8f781bf88e23cedbf96df33d4f1fc49c179c6ff8cd6957e0","observation_id":"ddc37b47-c888-4e15-a0d7-3d8aa28f9dcb","resolution":{"observed_at":"2026-08-06T15:03:48.380454Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2411.09158/citation-record","integrity":"/paper/2411.09158/integrity","json":"/paper/2411.09158/citation-record.json","paper":"/paper/2411.09158"},"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-12T21:08:27.532695Z","title":null,"venue":null,"work_id":"4cf8ca4a-b2aa-42c7-9366-0c7f440684bd","year":2024},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:25.183959Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:3fb862caebae418e207df8d3bb6fbea93192636a36ca3e4304f24643226d7858","observation_id":"341b780b-96f3-40ec-80a6-c2ac4328706c","resolution":{"observed_at":"2026-08-12T21:08:27.584021Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:25.233620Z","title":"The Essential Turing, 395–432 (2004)","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:25.233620Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:048c672cd22c15fa6e560b1e0ebbb21ab498af39bd1d2de98bfc723cc2f315cd","observation_id":"d9d4a57e-0479-4862-86a0-a23058d736df","resolution":{"observed_at":"2026-08-12T21:08:25.233620Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:25.236440Z","title":null,"venue":null,"work_id":null,"year":1958},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:25.236440Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:d084d64f6e655a5e85124ef88b5f27e0f0ba5426588d1cea8004d6680f3fb2f7","observation_id":"53e34046-c5af-4f8f-8a59-f59d6422950c","resolution":{"observed_at":"2026-08-12T21:08:25.236440Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:25.239932Z","title":"Computation, Logic, Philosophy, 63–75 (1990)","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:25.239932Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:4d8f661b58d7aa0caac0251d205a954e15a7f0ff96a9a68d95f64868100baddc","observation_id":"e13db8c6-66fe-47c8-a6ec-8ccfaf011116","resolution":{"observed_at":"2026-08-12T21:08:25.239932Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:25.242969Z","title":"In: 7th Int","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:25.242969Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:9bb33214c6e109bfef78fa467797eaea3cfed339db618e2213880adfc786262a","observation_id":"16984dad-6e31-41ee-9ee4-4cce5a433640","resolution":{"observed_at":"2026-08-12T21:08:25.242969Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:25.246006Z","title":null,"venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:25.246006Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:08b1c85d8c1b85a772cdda1f6d95a176e50144e126bbba9d013f87c5927ef068","observation_id":"e5bd2599-1d10-465f-bf38-ce2b430f244c","resolution":{"observed_at":"2026-08-12T21:08:25.246006Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:25.367294Z","title":null,"venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:25.367294Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:632931b0ee8cb70f959e55591899f002f9530976a4e4b4a1e7714e30ebfbe924","observation_id":"ce40d9fd-b173-4841-bc0d-844b01b7282a","resolution":{"observed_at":"2026-08-12T21:08:25.367294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:25.510129Z","title":null,"venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:25.510129Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:e5278e59fcabd64f8d97a55d405cd1abf7eab6333664bc6098d53c335d699e63","observation_id":"f93fe8cc-d7eb-4c19-b33a-54aa0d9fd5e9","resolution":{"observed_at":"2026-08-12T21:08:25.510129Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:25.513392Z","title":"In: 4th Proceedings Clemson Miniconference (1989)","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:25.513392Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:1e9f923b5c9b5b1a7dc2b28846b2351ce4c172751be5e221300dd26653dc4fcf","observation_id":"b98d228e-d723-47d4-9e99-9a3a7750bc27","resolution":{"observed_at":"2026-08-12T21:08:25.513392Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:25.516619Z","title":"Technical report, University of Puget Sound Dept","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:25.516619Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:0da2e1795e9c0bccfba03aa5bb2d21dbe7a94a1e6fca8fb6978a377789c3b606","observation_id":"46605135-7657-4018-91b4-170d4da91117","resolution":{"observed_at":"2026-08-12T21:08:25.516619Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:25.519775Z","title":"Ars Comb","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:25.519775Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:409e4ce464022130d991d9b365a5c49c40286d360fd00fa8d48d8136752f2cb5","observation_id":"acca571b-6ea8-453d-9b00-d576892075bf","resolution":{"observed_at":"2026-08-12T21:08:25.519775Z","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-12T21:08:27.443702Z","title":"Technical report, Universite de Paris-Sud (1991)","venue":null,"work_id":"cf59fe28-bd7c-4c78-86cc-92222daaf30c","year":1991},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:25.670535Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:171e2a4928212912ec80e691f3f6d306ac8fd0790fcc4c25619111454f575414","observation_id":"7fb51103-10e6-4693-9a47-c3ea61bafa68","resolution":{"observed_at":"2026-08-12T21:08:27.478037Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:25.715673Z","title":null,"venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:25.715673Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:a4356159e47faab97017671f1b43480f673f761bc5d5f6c1a6f95551d7360927","observation_id":"6275672d-1ce0-441e-a2ec-8f4a34414747","resolution":{"observed_at":"2026-08-12T21:08:25.715673Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:25.719211Z","title":"Discrete Math","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:25.719211Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:11568ee08ed984fca77a0222eb72bb842f675df510993bdb6cf67c30eb2920ea","observation_id":"feb642ef-8ff1-434e-a217-3484752ccd75","resolution":{"observed_at":"2026-08-12T21:08:25.719211Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:25.721948Z","title":"Discrete Math","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:25.721948Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:569e13ca4824c867b94fd1eb856201559436e86082386f891292b8251cfb1aa1","observation_id":"9b1fed68-2021-49f1-9f8d-7aa96e9a2d8a","resolution":{"observed_at":"2026-08-12T21:08:25.721948Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:25.724819Z","title":"Ars Comb","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:25.724819Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:423d3207c847e6f48be672c647bf41169a4d2d3ba54c2217f7f35beb253b588b","observation_id":"26e1bb3b-2e06-46ea-a059-0ac80a1f0429","resolution":{"observed_at":"2026-08-12T21:08:25.724819Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:25.728277Z","title":null,"venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:25.728277Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:2a924ce223ca9750e582c22ee5311356d34dc45b7f6439c3a654a3f05d91acad","observation_id":"ba710a85-6017-456d-9415-f386357b2236","resolution":{"observed_at":"2026-08-12T21:08:25.728277Z","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-12T21:08:27.336401Z","title":"Discrete 29 Appl","venue":null,"work_id":"36a53c36-d418-4311-8fb1-ab9a574cb101","year":1997},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:25.731948Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:3c06e774488e59020ea89ecfee1ede69ed76e9bc0a45d4321eab0e376569b928","observation_id":"13cf3ffa-4ff7-4848-a207-d804ea6ef7b5","resolution":{"observed_at":"2026-08-12T21:08:27.412166Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:25.815323Z","title":"Ars Comb","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:25.815323Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:142bf04b34607fe8ad0458106e0bd719e698490de1a9d7b4f8110707a74cc520","observation_id":"76a2e264-5978-46ce-87e1-9f13b2e7d013","resolution":{"observed_at":"2026-08-12T21:08:25.815323Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:25.818587Z","title":"Discrete Math","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:25.818587Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:cb6f271d516ba2d20245cae1459d3741b9fc4e91ce01f7b9e07ba83fc581bfa1","observation_id":"de360e45-4a71-4971-9dce-6a8e4902661a","resolution":{"observed_at":"2026-08-12T21:08:25.818587Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:25.822757Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:25.822757Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:80a435ed1b330f31afef741bcdfad00f02dbddba88e8b0695696f20af08ccab0","observation_id":"c62b619a-69b6-4c24-b8f3-cd11a12153b0","resolution":{"observed_at":"2026-08-12T21:08:25.822757Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:25.825367Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:25.825367Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:fe14661c1de389fae8afb4040dd2c852c72dd52db0b40d344b6f42423c41f31e","observation_id":"486c4e80-3b4a-4c0a-befd-4994ae9ecb13","resolution":{"observed_at":"2026-08-12T21:08:25.825367Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:25.829080Z","title":null,"venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:25.829080Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:2bdfd387eb7d7ece9c924b9be94bf50a78f61e3936a9316bb6521ea56a6cc274","observation_id":"ca148bf3-61d6-40e1-90af-d3cd549b5d77","resolution":{"observed_at":"2026-08-12T21:08:25.829080Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:25.832748Z","title":"Linear Algebra Appl","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:25.832748Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:a0b57d3a30cedcd24e04834f7dc4f20dc8f40e8648859874c0711bb34b84e695","observation_id":"80d1e59e-45d7-4738-ae25-25f061079ae4","resolution":{"observed_at":"2026-08-12T21:08:25.832748Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:25.835727Z","title":"Discrete Math","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:25.835727Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:d3fc4b1e05dd6b282ba6aeedb53d4d417e01f4311ac5c456ce1b94899b3315ff","observation_id":"aa499667-91f7-4317-af82-32c39ce059b0","resolution":{"observed_at":"2026-08-12T21:08:25.835727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:25.838732Z","title":"MATCH Commun","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:25.838732Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:4a1b473f48bd04416afb7985b39c7c20892991abcfbc7333e48b79c7918aabde","observation_id":"bfc19cfa-5883-4cd0-9932-bc22c9300e71","resolution":{"observed_at":"2026-08-12T21:08:25.838732Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:25.927300Z","title":"Linear Algebra Appl","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:25.927300Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:f472b3e7b2ab696e8b36ae0614e9c6fd4546e7a795c4d8c110991e8d52f8497e","observation_id":"939b5877-47ce-4cb7-bfe5-a012f1e56b55","resolution":{"observed_at":"2026-08-12T21:08:25.927300Z","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-12T21:08:27.216919Z","title":null,"venue":null,"work_id":"371b05f8-0070-4037-8395-26ca40661954","year":2005},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:26.014451Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:3fc644dea8d4a358d95ee0a27d29218bbeb73e1f9c0a611526fca64bafc8c681","observation_id":"5d845b75-1df6-45ec-8006-21128534b79c","resolution":{"observed_at":"2026-08-12T21:08:27.281255Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:26.017663Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:26.017663Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:9fda53699a20cab486e84a0df118b4849fdeceb6f9e2070d7fc471862706a1c5","observation_id":"f3548b70-8500-4d11-ac33-860012de8dff","resolution":{"observed_at":"2026-08-12T21:08:26.017663Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:26.021110Z","title":"MATCH Commun","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:26.021110Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:2c05761ffadd455136f6955d4a58445c67156b9a1cd3ef3430ba6b1d8d0152b6","observation_id":"5d5a1c91-594a-4215-b5b4-cddcd44c11e3","resolution":{"observed_at":"2026-08-12T21:08:26.021110Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:26.025261Z","title":"Discrete Math","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:26.025261Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:9efd68de02dab713e80a39464662f1fff78776d9334e0c6039e0206653c3528f","observation_id":"8b1c55d6-b23f-4e38-b19d-2c8db0a787bf","resolution":{"observed_at":"2026-08-12T21:08:26.025261Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:26.030732Z","title":null,"venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:26.030732Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:acb72a986ec9ab3a3e7f69fffd85ff2bbf7a89136a6fcbda13fb388dad448eda","observation_id":"6554e281-0e06-44d0-87a8-ace782869250","resolution":{"observed_at":"2026-08-12T21:08:26.030732Z","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-12T21:08:27.152094Z","title":null,"venue":null,"work_id":"fb739a00-f18d-4370-96a3-d1191a6d56d7","year":1998},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:26.048984Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:0e9e85961a820d77bf7d32c20df8c2690b12ec2d3efe0f2313acbd27e01f61d2","observation_id":"d3450df1-2c63-45c1-a8c3-dccd0a8e8372","resolution":{"observed_at":"2026-08-12T21:08:27.190763Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:26.151698Z","title":"leapfrog, cylinder and fullerene graphs","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:26.151698Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:a6030f0de5d6308300208d604c907e2b62eb5426f535a98007e540420f88ebcc","observation_id":"fd323ca1-4668-4bb3-8fba-0c50ae6ad1f2","resolution":{"observed_at":"2026-08-12T21:08:26.151698Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:26.177911Z","title":null,"venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:26.177911Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:223b30fd739354b537de186c909a7e79f4e932a0219407c6872a36551407e915","observation_id":"319a041a-4091-4a56-ace0-7f71af58f58d","resolution":{"observed_at":"2026-08-12T21:08:26.177911Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:26.181343Z","title":"In: Graphs and Discovery DIMACS: Ser","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:26.181343Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:798fc4d6bbf8bf994647e37129e41ea1907f9a79aed0da51b2de83dfa1a1cfb1","observation_id":"7e3ebf96-eedf-497f-b093-6f0700efc666","resolution":{"observed_at":"2026-08-12T21:08:26.181343Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:26.185436Z","title":"In: Graphs and Discovery DIMACS: Ser","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:26.185436Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:52305a6f00a9e1a4ec3ba3424cf173b1db6755b3b978d9f90c279e0c4cd45e5b","observation_id":"4e6c87a9-f16c-4f22-8876-9003fd36d208","resolution":{"observed_at":"2026-08-12T21:08:26.185436Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:26.188669Z","title":null,"venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:26.188669Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:23ac5cd6981a66b05bba2baabfb7fbb579c2199c06ea84e5283d5ebf8fcb11a7","observation_id":"4abcb4c1-5fea-4444-b525-b1b3c066a49e","resolution":{"observed_at":"2026-08-12T21:08:26.188669Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:26.192433Z","title":"MATCH Commun","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:26.192433Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:f88504aad4eea8a3a4489a8bb4e04038e403b7e4331460730372ac6bc16a1dd2","observation_id":"a2ea22e2-5da2-4e59-974d-3c8232509ce9","resolution":{"observed_at":"2026-08-12T21:08:26.192433Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:26.195469Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:26.195469Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:270c7137ba6773bf7951f65c87364f61470bdee6fbcf9d2d72d7e6f96de77c1f","observation_id":"dd87c1fc-c32c-459e-9616-fa1cb2207601","resolution":{"observed_at":"2026-08-12T21:08:26.195469Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:26.210308Z","title":"Discrete Math","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:26.210308Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:4d6069f7a5fa65d45cf4e594929b2e2afe46b13907363dba88b2578f3743fb29","observation_id":"e6f0aa85-c7ff-44ce-bebb-c8d8704702e9","resolution":{"observed_at":"2026-08-12T21:08:26.210308Z","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-12T21:08:27.014048Z","title":"Discrete Appl","venue":null,"work_id":"2d1c938e-ed83-41cb-974d-2e6369cfd2d5","year":2014},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:26.263389Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:de77ad3d7efe31173c2773c6e2bf5e0f932bd0f574153778f8918e4eea60a783","observation_id":"8855b765-a695-4f13-a344-621951b02133","resolution":{"observed_at":"2026-08-12T21:08:27.066816Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:26.267129Z","title":"Discrete Math","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:26.267129Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:a34204b901ad9e8cca04a420af9f550f7150bc20302f660a907e02a1f307290b","observation_id":"c5bc1e30-be6c-4bc7-8dbb-34b09a9010ed","resolution":{"observed_at":"2026-08-12T21:08:26.267129Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:26.269760Z","title":"Discrete Appl","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:26.269760Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:6f6422dcda140e769f2ef19ea41244a8f33b4bf198f5a640d60a7d91b9e10e2d","observation_id":"47675e8d-c0f7-4ec6-b7ba-23fef91fef0f","resolution":{"observed_at":"2026-08-12T21:08:26.269760Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:26.272630Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:26.272630Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:261f868f4d54677cd1c405667dbcbcc8cf406d07542d444738fe6ae4bc3dba6a","observation_id":"b4519d83-6304-4220-99ea-e5a15c482b25","resolution":{"observed_at":"2026-08-12T21:08:26.272630Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:26.275134Z","title":"Australas","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:26.275134Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:784f2820383b982f348ac27cfbd2f855c696537fde69eb2b3dda538038bcd3fe","observation_id":"0c493f52-79c6-4265-a119-c70a93e600b2","resolution":{"observed_at":"2026-08-12T21:08:26.275134Z","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-12T21:08:26.937446Z","title":null,"venue":null,"work_id":"ba18c9f7-c9f7-411c-9ef9-b23ecca29fb7","year":2021},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:26.278232Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:7bc160e8db4054d5948954bbb45feac835bd457b02b40134c0b950700ae95acf","observation_id":"8f124538-e2b1-42bf-8cfd-c209c84336f0","resolution":{"observed_at":"2026-08-12T21:08:26.942119Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:26.281007Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:26.281007Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:f8678a33971ae714f5c386a1023fc918acb0a6e3069a3c5a85f3cacdc24fa4ef","observation_id":"6ed2d924-c766-4a0f-9f16-6820f21ef8cf","resolution":{"observed_at":"2026-08-12T21:08:26.281007Z","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-12T21:08:26.806747Z","title":null,"venue":null,"work_id":"216a94cc-cc7f-4fa1-840a-d910483ecdd6","year":2020},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:26.377434Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:3163b685ce902bd576a92273bf8ddcbb58207ced333e826e8ea4c654f1ca04f3","observation_id":"fe1da56b-c1fa-4e1a-a2b8-ce355a59af38","resolution":{"observed_at":"2026-08-12T21:08:26.900926Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:26.418971Z","title":null,"venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:26.418971Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:b34891fdd96344d48fb7e8c3227a653cfa8f89bb359e972ff9fda2070a06a9ea","observation_id":"0c740ea6-9eea-4f9d-a3eb-9ed98a4b6df4","resolution":{"observed_at":"2026-08-12T21:08:26.418971Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:26.421971Z","title":null,"venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:26.421971Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:9050e06a5d683d7220912214df454987cf86c105f1426d5e39b7f6e82ffd1ebe","observation_id":"3bd00251-9767-4a24-af1e-ed5e1e8a5e62","resolution":{"observed_at":"2026-08-12T21:08:26.421971Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:26.455318Z","title":null,"venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:26.455318Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:94c48a469022d1cb634080c4610182988ed060ed153bf7ff6f0daa7d5375b446","observation_id":"858c2582-5f56-4d9b-9afb-70ca8daa84ef","resolution":{"observed_at":"2026-08-12T21:08:26.455318Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:26.513388Z","title":null,"venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:26.513388Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:3ae0a6a0df0ba11c58861f23890d0468d3164a650f673f35ba018fd4c2d2cc4b","observation_id":"ad30abf6-e709-41f1-97c9-47dfabf2f59a","resolution":{"observed_at":"2026-08-12T21:08:26.513388Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:26.516572Z","title":"In: Proceedings of the 16th International Joint Conference on Artificial Intelligence, vol","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:26.516572Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:d522c07d546627a21bd01ad734761a938ea3c584974818f75bf3d3e0fb2cb2df","observation_id":"3a2d9659-17a5-479a-9062-6777c8b38eef","resolution":{"observed_at":"2026-08-12T21:08:26.516572Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:26.520210Z","title":null,"venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:26.520210Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:8f5a8d3079203e66b611bfe377fe35e0cae210236e8d48ca9b6af316db9d711f","observation_id":"4210e19c-6fb1-4b51-9d06-9cd9c0c1ddec","resolution":{"observed_at":"2026-08-12T21:08:26.520210Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:26.523659Z","title":"Springer, Hei- delberg (2002)","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:26.523659Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:81ea4f440d9a292c4ecf0de7d7c0ca6a646d59c93a50e6be74b7e7bdf1bd1856","observation_id":"c66a1504-95a9-4eba-89c0-b6e0e2b57d26","resolution":{"observed_at":"2026-08-12T21:08:26.523659Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:26.527707Z","title":"Discrete Math","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:26.527707Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:4cbc1f42bca4c5e926e39c09f0d8c938c3ed9cfb1e003461b32e3e2e8c934cb1","observation_id":"2d4d44e2-4dd7-44c7-852f-ef3d2c3f10ab","resolution":{"observed_at":"2026-08-12T21:08:26.527707Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:26.631173Z","title":"Discrete Math","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:26.631173Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:b69dac85d1c4b0ba6bbb05f2060c3d32c9ec9968006c90f01f5fcd8aa05a99c2","observation_id":"ac7eab23-8128-48b4-b7cf-0714371a33cf","resolution":{"observed_at":"2026-08-12T21:08:26.631173Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T21:08:26.633724Z","title":"Discrete Appl","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:26.633724Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:5b53a496396cbd8628817576d0f4f25d5b0a6ead4bbf1a2a0a562d66a1819e53","observation_id":"d52042d1-8857-4fb4-9e84-1fda4ac23bfc","resolution":{"observed_at":"2026-08-12T21:08:26.633724Z","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-12T21:08:26.669555Z","title":"In: Operations Research Proceedings 2018: Selected Papers of the Annual Inter- national Conference of the German Operations Research Society, pp","venue":null,"work_id":"fdd5e4b0-7c68-4bf0-a88f-d6500156f5c6","year":2019},"citing_paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-12T21:08:26.637176Z"},"links":{"citing_paper":"/paper/2411.09158"},"observation_digest":"sha256:157c9cc12b221a7240e329b6673cc19c1f4b249bc25308dc97d534007dbdd15a","observation_id":"0b001add-ab59-4a0b-8e03-20c13df08300","resolution":{"observed_at":"2026-08-12T21:08:26.755441Z","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"}}],"paper":{"arxiv_id":"2411.09158","last_updated":"2024-11-14T03:24:45Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-13T18:56:48.984753Z","submitted_at":"2024-11-14T03:24:45Z","title":"The \\emph{Optimist}: Towards Fully Automated Graph Theory Research"},"reference_resolution":{"displayed":60,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":56,"verified_exact":0,"verified_fuzzy":4},"total_outbound_references":60},"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 60 of 60 outbound references and 1 inbound Pith citation observation for arXiv:2411.09158."}