{"as_of":"2026-08-08T15:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6f128be24b6c26ba8477d212d58bff68f60598d3f452bf0cd1a643a5095cc37e","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":18,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:45:47.770405Z","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-07-04T15:39:56.696477Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2104.14516","last_updated":"2021-04-29T17:32:56Z","snapshot_observed_at":"2026-08-04T17:14:40.836608Z","submitted_at":"2021-04-29T17:32:56Z","title":"Constructions in combinatorics via neural networks","version":1},"cited_work":{"arxiv_id":"2104.14516","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.14516","snapshot_observed_at":"2026-07-04T15:39:56.696477Z","title":"ArXiv abs/2104.14516 (2021)","venue":null,"work_id":"4dfb898c-d69f-4278-9022-bf903e72cef6","year":2021},"citing_paper":{"arxiv_id":"2409.19379","last_updated":"2026-05-11T14:16:55Z","snapshot_observed_at":"2026-07-06T19:23:50.186410Z","submitted_at":"2024-09-28T15:06:31Z","title":"Automated conjecturing with \\emph{TxGraffiti}","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-05-23T21:14:31.015026Z"},"links":{"cited_paper":"/paper/2104.14516","citing_paper":"/paper/2409.19379"},"observation_digest":"sha256:76439428a53fb99cdd78ca848c37ca0af7be2bfe14c76b334ba562b3f84b5e9b","observation_id":"754052a9-f93d-4b28-a0a3-4db88cc772fc","resolution":{"observed_at":"2026-05-23T21:15:49.417979Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.14516","last_updated":"2021-04-29T17:32:56Z","snapshot_observed_at":"2026-08-04T17:14:40.836608Z","submitted_at":"2021-04-29T17:32:56Z","title":"Constructions in combinatorics via neural networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.14516","snapshot_observed_at":"2026-08-07T12:45:47.770405Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-07T23:35:50.996640Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T12:45:47.770405Z"},"links":{"cited_paper":"/paper/2104.14516","citing_paper":"/paper/2505.23881"},"observation_digest":"sha256:0f300e95c11dff84fd1fa28c6ba915a7a8161781e1003a3b08e49314df8d02e4","observation_id":"cffcac38-add9-4570-a9f4-017dce64b0a0","resolution":{"observed_at":"2026-08-07T12:45:47.770405Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.14516","last_updated":"2021-04-29T17:32:56Z","snapshot_observed_at":"2026-08-04T17:14:40.836608Z","submitted_at":"2021-04-29T17:32:56Z","title":"Constructions in combinatorics via neural networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.14516","snapshot_observed_at":"2026-08-05T14:51:46.471960Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.20825","last_updated":"2025-08-28T14:21:46Z","snapshot_observed_at":"2026-08-07T17:26:41.573833Z","submitted_at":"2025-08-28T14:21:46Z","title":"Computer-assisted graph theory: a survey","version":1},"reference_index":238,"source":"pdf_text","source_observed_at":"2026-08-05T14:51:46.471960Z"},"links":{"cited_paper":"/paper/2104.14516","citing_paper":"/paper/2508.20825"},"observation_digest":"sha256:07772af7ae2d1ebeb3a2fbcf4272876bfa0f1dc1f33d8bcaf97e0413a8b04fef","observation_id":"35bca099-cca6-41bd-b8e3-aee1111bcc17","resolution":{"observed_at":"2026-08-05T14:51:46.471960Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.14516","last_updated":"2021-04-29T17:32:56Z","snapshot_observed_at":"2026-08-04T17:14:40.836608Z","submitted_at":"2021-04-29T17:32:56Z","title":"Constructions in combinatorics via neural networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.14516","snapshot_observed_at":"2026-08-05T12:25:56.728914Z","title":"Constructions in combinatorics via neural networks,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.01607","last_updated":"2025-09-01T16:37:17Z","snapshot_observed_at":"2026-08-07T10:53:11.416949Z","submitted_at":"2025-09-01T16:37:17Z","title":"Reinforcement learning for graph theory, Parallelizing Wagner's approach","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T12:25:56.728914Z"},"links":{"cited_paper":"/paper/2104.14516","citing_paper":"/paper/2509.01607"},"observation_digest":"sha256:ee28b7683cb3b5cd30b1ef381069ec21b7ba13899c1a0b91940f26b1d1d4457c","observation_id":"a3909692-2597-47fb-8666-9a58c688f572","resolution":{"observed_at":"2026-08-05T12:25:56.728914Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.14516","last_updated":"2021-04-29T17:32:56Z","snapshot_observed_at":"2026-08-04T17:14:40.836608Z","submitted_at":"2021-04-29T17:32:56Z","title":"Constructions in combinatorics via neural networks","version":1},"cited_work":{"arxiv_id":"2104.14516","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.14516","snapshot_observed_at":"2026-07-04T15:39:56.696477Z","title":"ArXiv abs/2104.14516 (2021)","venue":null,"work_id":"4dfb898c-d69f-4278-9022-bf903e72cef6","year":2021},"citing_paper":{"arxiv_id":"2511.02864","last_updated":"2025-12-22T12:49:01Z","snapshot_observed_at":"2026-08-07T08:27:55.662438Z","submitted_at":"2025-11-03T16:04:07Z","title":"Mathematical exploration and discovery at scale","version":3},"reference_index":296,"source":"pdf_text","source_observed_at":"2026-05-18T01:18:42.333269Z"},"links":{"cited_paper":"/paper/2104.14516","citing_paper":"/paper/2511.02864"},"observation_digest":"sha256:ef7134587a6c4357a2e9a7eea1cb97570228085c51a5b84b8bdd7ff509277e53","observation_id":"58be5a06-3ac3-4152-abda-3e2008de0056","resolution":{"observed_at":"2026-05-18T01:20:34.525839Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.14516","last_updated":"2021-04-29T17:32:56Z","snapshot_observed_at":"2026-08-04T17:14:40.836608Z","submitted_at":"2021-04-29T17:32:56Z","title":"Constructions in combinatorics via neural networks","version":1},"cited_work":{"arxiv_id":"2104.14516","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.14516","snapshot_observed_at":"2026-07-04T15:39:56.696477Z","title":"ArXiv abs/2104.14516 (2021)","venue":null,"work_id":"4dfb898c-d69f-4278-9022-bf903e72cef6","year":2021},"citing_paper":{"arxiv_id":"2601.11482","last_updated":"2026-05-05T17:33:08Z","snapshot_observed_at":"2026-08-02T06:46:31.811979Z","submitted_at":"2026-01-16T18:03:27Z","title":"A Genetic Algorithm for Generating Extreme Examples in Arithmetic Dynamics","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-16T13:22:51.651262Z"},"links":{"cited_paper":"/paper/2104.14516","citing_paper":"/paper/2601.11482"},"observation_digest":"sha256:3eadd30f1a476703216ccb0f83d0dbee290a6b8dacca55a43b5f9d4d01731f5c","observation_id":"6a37b9a9-28dc-4c3d-8a49-c877787d7464","resolution":{"observed_at":"2026-05-16T13:22:55.188682Z","resolver_source":"arxiv_id","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.14516","last_updated":"2021-04-29T17:32:56Z","snapshot_observed_at":"2026-08-04T17:14:40.836608Z","submitted_at":"2021-04-29T17:32:56Z","title":"Constructions in combinatorics via neural networks","version":1},"cited_work":{"arxiv_id":"2104.14516","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.14516","snapshot_observed_at":"2026-07-04T15:39:56.696477Z","title":"ArXiv abs/2104.14516 (2021)","venue":null,"work_id":"4dfb898c-d69f-4278-9022-bf903e72cef6","year":2021},"citing_paper":{"arxiv_id":"2601.13209","last_updated":"2026-05-02T15:26:09Z","snapshot_observed_at":"2026-07-06T22:42:08.271837Z","submitted_at":"2026-01-19T16:38:18Z","title":"AI for Mathematics: Progress, Challenges, and Prospects","version":5},"reference_index":139,"source":"pdf_text","source_observed_at":"2026-05-16T13:24:57.923863Z"},"links":{"cited_paper":"/paper/2104.14516","citing_paper":"/paper/2601.13209"},"observation_digest":"sha256:6d046ed743dfaea0ad4876eb146e6af9a85c194bb3419fc038318a3aba35d323","observation_id":"701c7983-d402-4339-b645-b1abc0e40579","resolution":{"observed_at":"2026-05-16T13:27:55.661935Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.14516","last_updated":"2021-04-29T17:32:56Z","snapshot_observed_at":"2026-08-04T17:14:40.836608Z","submitted_at":"2021-04-29T17:32:56Z","title":"Constructions in combinatorics via neural networks","version":1},"cited_work":{"arxiv_id":"2104.14516","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.14516","snapshot_observed_at":"2026-07-04T15:39:56.696477Z","title":"ArXiv abs/2104.14516 (2021)","venue":null,"work_id":"4dfb898c-d69f-4278-9022-bf903e72cef6","year":2021},"citing_paper":{"arxiv_id":"2602.03433","last_updated":"2026-02-03T11:56:08Z","snapshot_observed_at":"2026-07-06T22:44:18.875334Z","submitted_at":"2026-02-03T11:56:08Z","title":"When control meets large language models: From words to dynamics","version":1},"reference_index":108,"source":"pdf_text","source_observed_at":"2026-05-21T14:52:44.632671Z"},"links":{"cited_paper":"/paper/2104.14516","citing_paper":"/paper/2602.03433"},"observation_digest":"sha256:bcfff38583ba6af0f5c5cd79f99a8defa6b1a6e56b8598b699102fb8f9a6f806","observation_id":"f96b3901-b640-448a-abda-3007be91532d","resolution":{"observed_at":"2026-05-21T14:54:13.183542Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.14516","last_updated":"2021-04-29T17:32:56Z","snapshot_observed_at":"2026-08-04T17:14:40.836608Z","submitted_at":"2021-04-29T17:32:56Z","title":"Constructions in combinatorics via neural networks","version":1},"cited_work":{"arxiv_id":"2104.14516","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.14516","snapshot_observed_at":"2026-07-04T15:39:56.696477Z","title":"ArXiv abs/2104.14516 (2021)","venue":null,"work_id":"4dfb898c-d69f-4278-9022-bf903e72cef6","year":2021},"citing_paper":{"arxiv_id":"2602.17276","last_updated":"2026-04-14T00:51:01Z","snapshot_observed_at":"2026-07-06T22:46:26.082843Z","submitted_at":"2026-02-19T11:25:22Z","title":"RLGT: A reinforcement learning framework for extremal graph theory","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-05-15T21:21:07.914983Z"},"links":{"cited_paper":"/paper/2104.14516","citing_paper":"/paper/2602.17276"},"observation_digest":"sha256:236efc47685108bb02512dd1eca9c36e0615ab93baaeea81b819f773c8af5b79","observation_id":"e14e376e-00f4-47b7-b743-d56fe48087c6","resolution":{"observed_at":"2026-05-15T21:21:38.155104Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.14516","last_updated":"2021-04-29T17:32:56Z","snapshot_observed_at":"2026-08-04T17:14:40.836608Z","submitted_at":"2021-04-29T17:32:56Z","title":"Constructions in combinatorics via neural networks","version":1},"cited_work":{"arxiv_id":"2104.14516","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.14516","snapshot_observed_at":"2026-07-04T15:39:56.696477Z","title":"ArXiv abs/2104.14516 (2021)","venue":null,"work_id":"4dfb898c-d69f-4278-9022-bf903e72cef6","year":2021},"citing_paper":{"arxiv_id":"2604.06107","last_updated":"2026-04-07T17:19:33Z","snapshot_observed_at":"2026-08-02T22:31:38.680706Z","submitted_at":"2026-04-07T17:19:33Z","title":"Artificial Intelligence and the Structure of Mathematics","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-05-10T19:12:23.402808Z"},"links":{"cited_paper":"/paper/2104.14516","citing_paper":"/paper/2604.06107"},"observation_digest":"sha256:de3b54869e70b8ef27f487ccb9d9af8206b2cdc161e413a95d29bd087bb34aff","observation_id":"086d3eaa-6885-4846-af98-58f699eadf89","resolution":{"observed_at":"2026-05-10T23:20:53.095077Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.14516","last_updated":"2021-04-29T17:32:56Z","snapshot_observed_at":"2026-08-04T17:14:40.836608Z","submitted_at":"2021-04-29T17:32:56Z","title":"Constructions in combinatorics via neural networks","version":1},"cited_work":{"arxiv_id":"2104.14516","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.14516","snapshot_observed_at":"2026-07-04T15:39:56.696477Z","title":"ArXiv abs/2104.14516 (2021)","venue":null,"work_id":"4dfb898c-d69f-4278-9022-bf903e72cef6","year":2021},"citing_paper":{"arxiv_id":"2604.07240","last_updated":"2026-04-08T16:06:43Z","snapshot_observed_at":"2026-08-03T11:26:08.010806Z","submitted_at":"2026-04-08T16:06:43Z","title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-10T17:48:17.363568Z"},"links":{"cited_paper":"/paper/2104.14516","citing_paper":"/paper/2604.07240"},"observation_digest":"sha256:c1af49c693165b4275e58465e49c76bc40536cc044746a5acbd0cb48b2856f8b","observation_id":"95e3724f-775f-492c-83d2-6f170646829d","resolution":{"observed_at":"2026-05-11T06:05:58.112559Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.14516","last_updated":"2021-04-29T17:32:56Z","snapshot_observed_at":"2026-08-04T17:14:40.836608Z","submitted_at":"2021-04-29T17:32:56Z","title":"Constructions in combinatorics via neural networks","version":1},"cited_work":{"arxiv_id":"2104.14516","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.14516","snapshot_observed_at":"2026-07-04T15:39:56.696477Z","title":"ArXiv abs/2104.14516 (2021)","venue":null,"work_id":"4dfb898c-d69f-4278-9022-bf903e72cef6","year":2021},"citing_paper":{"arxiv_id":"2604.16188","last_updated":"2026-04-17T15:57:13Z","snapshot_observed_at":"2026-07-06T23:03:34.795570Z","submitted_at":"2026-04-17T15:57:13Z","title":"Some results on small ordered and cyclic Ramsey numbers","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-05-10T07:58:45.944692Z"},"links":{"cited_paper":"/paper/2104.14516","citing_paper":"/paper/2604.16188"},"observation_digest":"sha256:917ae1018efd9bdbe0987c9103b811e072d23950d8a152a6bfbd5aeb8f72fad8","observation_id":"fe9fb160-5b51-43e3-a2c5-d81a924de27b","resolution":{"observed_at":"2026-05-10T08:02:25.469817Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.14516","last_updated":"2021-04-29T17:32:56Z","snapshot_observed_at":"2026-08-04T17:14:40.836608Z","submitted_at":"2021-04-29T17:32:56Z","title":"Constructions in combinatorics via neural networks","version":1},"cited_work":{"arxiv_id":"2104.14516","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.14516","snapshot_observed_at":"2026-07-04T15:39:56.696477Z","title":"ArXiv abs/2104.14516 (2021)","venue":null,"work_id":"4dfb898c-d69f-4278-9022-bf903e72cef6","year":2021},"citing_paper":{"arxiv_id":"2605.19063","last_updated":"2026-05-18T19:36:08Z","snapshot_observed_at":"2026-08-03T13:38:05.438466Z","submitted_at":"2026-05-18T19:36:08Z","title":"Mapping Uncharted Symmetries: Machine Discovery in Combinatorics","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-20T11:49:11.047902Z"},"links":{"cited_paper":"/paper/2104.14516","citing_paper":"/paper/2605.19063"},"observation_digest":"sha256:5264367d9bea79eb2a1e2524d5097762fd4f0ffc9c3eede3f17bc1972745a12c","observation_id":"0a49c6c9-ae61-40d1-9f9b-1a20d3ba94bf","resolution":{"observed_at":"2026-05-20T11:53:15.046995Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.14516","last_updated":"2021-04-29T17:32:56Z","snapshot_observed_at":"2026-08-04T17:14:40.836608Z","submitted_at":"2021-04-29T17:32:56Z","title":"Constructions in combinatorics via neural networks","version":1},"cited_work":{"arxiv_id":"2104.14516","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.14516","snapshot_observed_at":"2026-07-04T15:39:56.696477Z","title":"ArXiv abs/2104.14516 (2021)","venue":null,"work_id":"4dfb898c-d69f-4278-9022-bf903e72cef6","year":2021},"citing_paper":{"arxiv_id":"2606.26399","last_updated":"2026-06-24T21:34:08Z","snapshot_observed_at":"2026-08-08T02:38:29.907041Z","submitted_at":"2026-06-24T21:34:08Z","title":"Geometry-Aware MCTS for Extremal Problems in Combinatorial Geometry","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-26T01:31:06.792515Z"},"links":{"cited_paper":"/paper/2104.14516","citing_paper":"/paper/2606.26399"},"observation_digest":"sha256:fd2b1cfc64018db4f9031ba3998e3e4b5651a3bd2febb38284f71bb0db73d1fb","observation_id":"e285d7e7-d905-4685-a0fb-db42f9056c00","resolution":{"observed_at":"2026-07-04T15:39:56.698043Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.14516","last_updated":"2021-04-29T17:32:56Z","snapshot_observed_at":"2026-08-04T17:14:40.836608Z","submitted_at":"2021-04-29T17:32:56Z","title":"Constructions in combinatorics via neural networks","version":1},"cited_work":{"arxiv_id":"2104.14516","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.14516","snapshot_observed_at":"2026-07-04T15:39:56.696477Z","title":"ArXiv abs/2104.14516 (2021)","venue":null,"work_id":"4dfb898c-d69f-4278-9022-bf903e72cef6","year":2021},"citing_paper":{"arxiv_id":"2606.26660","last_updated":"2026-06-25T06:47:39Z","snapshot_observed_at":"2026-07-07T00:00:56.276365Z","submitted_at":"2026-06-25T06:47:39Z","title":"Generating Special Triangulations with Transformers","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-26T03:27:36.821748Z"},"links":{"cited_paper":"/paper/2104.14516","citing_paper":"/paper/2606.26660"},"observation_digest":"sha256:eebe3b1b1ccd667bf23253b8b7a851f4ea5f9984efdcd58ec2819c1b72599986","observation_id":"faefc9c6-987c-4986-b8fe-531d0cad801d","resolution":{"observed_at":"2026-07-04T14:29:54.892100Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.14516","last_updated":"2021-04-29T17:32:56Z","snapshot_observed_at":"2026-08-04T17:14:40.836608Z","submitted_at":"2021-04-29T17:32:56Z","title":"Constructions in combinatorics via neural networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.14516","snapshot_observed_at":"2026-07-14T07:21:37.460300Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.11061","last_updated":"2026-07-17T03:00:57Z","snapshot_observed_at":"2026-08-02T07:20:40.708987Z","submitted_at":"2026-07-13T03:58:41Z","title":"Tight lower bound for the spectral radius of connected graphs with given matching number","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-14T07:21:37.460300Z"},"links":{"cited_paper":"/paper/2104.14516","citing_paper":"/paper/2607.11061"},"observation_digest":"sha256:58ad83843b97d8c377ebd3ba8eb8210e24ffd82dba8863b25d2822b99b860219","observation_id":"fe17f43b-2e51-4bd6-9892-185e56e02302","resolution":{"observed_at":"2026-07-14T07:21:37.460300Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.14516","last_updated":"2021-04-29T17:32:56Z","snapshot_observed_at":"2026-08-04T17:14:40.836608Z","submitted_at":"2021-04-29T17:32:56Z","title":"Constructions in combinatorics via neural networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.14516","snapshot_observed_at":"2026-08-02T07:20:42.299283Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.11061","last_updated":"2026-07-17T03:00:57Z","snapshot_observed_at":"2026-08-02T07:20:40.708987Z","submitted_at":"2026-07-13T03:58:41Z","title":"Tight lower bound for the spectral radius of connected graphs with given matching number","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T07:20:42.299283Z"},"links":{"cited_paper":"/paper/2104.14516","citing_paper":"/paper/2607.11061"},"observation_digest":"sha256:1059a658c74dca280488496a3f7a8d0b88a40fcd48100417279b60c3b9adcf25","observation_id":"934e4563-a29d-4185-be65-69068588d7d7","resolution":{"observed_at":"2026-08-02T07:20:42.299283Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.14516","last_updated":"2021-04-29T17:32:56Z","snapshot_observed_at":"2026-08-04T17:14:40.836608Z","submitted_at":"2021-04-29T17:32:56Z","title":"Constructions in combinatorics via neural networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.14516","snapshot_observed_at":"2026-08-03T00:54:45.358699Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28632","last_updated":"2026-04-19T11:13:41Z","snapshot_observed_at":"2026-08-07T08:06:51.294062Z","submitted_at":"2026-04-19T11:13:41Z","title":"LLM Framework for Discovering Major Mathematical Conjectures: AI's Quest for the Next Riemann Hypothesis","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T00:54:45.358699Z"},"links":{"cited_paper":"/paper/2104.14516","citing_paper":"/paper/2607.28632"},"observation_digest":"sha256:058fb397010d212cb961e2169d658e3c10c91867c838e9652bbb9c1738e99379","observation_id":"86ef7331-4dac-4b56-a8e4-601f10825e24","resolution":{"observed_at":"2026-08-03T00:54:45.358699Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2104.14516/citation-record","integrity":"/paper/2104.14516/integrity","json":"/paper/2104.14516/citation-record.json","paper":"/paper/2104.14516"},"outbound":[],"paper":{"arxiv_id":"2104.14516","last_updated":"2021-04-29T17:32:56Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-04T17:14:40.836608Z","submitted_at":"2021-04-29T17:32:56Z","title":"Constructions in combinatorics via neural networks"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 18 inbound Pith citation observations for arXiv:2104.14516."}