{"as_of":"2026-08-11T07:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2ca313339b1705ce114838a24b98213e3cfaf9272a3bd42dd0194b5a78747c36","coverage":[{"denominator":23,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-17T01:30:24.949010Z","state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T09:08:31.059333Z","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-07-04T16:09:57.506844Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2512.04475","last_updated":"2026-05-09T17:08:21Z","snapshot_observed_at":"2026-08-03T03:14:46.516808Z","submitted_at":"2025-12-04T05:30:31Z","title":"GraphBench: Next-generation graph learning benchmarking","version":5},"cited_work":{"arxiv_id":"2512.04475","doi":null,"metadata_source":"pith","pith_arxiv_id":"2512.04475","snapshot_observed_at":"2026-07-04T16:09:57.506844Z","title":"2512.04475 , archiveprefix =","venue":"cs.LG","work_id":"d99ec5ae-3c47-45af-960f-f2641e5535c0","year":2025},"citing_paper":{"arxiv_id":"2605.07397","last_updated":"2026-05-08T07:53:42Z","snapshot_observed_at":"2026-07-06T23:19:46.018236Z","submitted_at":"2026-05-08T07:53:42Z","title":"Have Graph -- Will Lift? The Case for Higher-Order Benchmarks","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-05-11T02:05:19.611399Z"},"links":{"cited_paper":"/paper/2512.04475","citing_paper":"/paper/2605.07397"},"observation_digest":"sha256:6f180f5898a9f80d7823386d5cd72e1a25b5c791a46c8fe7c9a5f098b5364349","observation_id":"9b3913bb-125d-43b5-8643-896ce9db5575","resolution":{"observed_at":"2026-05-12T02:43:44.617822Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2512.04475","last_updated":"2026-05-09T17:08:21Z","snapshot_observed_at":"2026-08-03T03:14:46.516808Z","submitted_at":"2025-12-04T05:30:31Z","title":"GraphBench: Next-generation graph learning benchmarking","version":5},"cited_work":{"arxiv_id":"2512.04475","doi":null,"metadata_source":"pith","pith_arxiv_id":"2512.04475","snapshot_observed_at":"2026-07-04T16:09:57.506844Z","title":"2512.04475 , archiveprefix =","venue":"cs.LG","work_id":"d99ec5ae-3c47-45af-960f-f2641e5535c0","year":2025},"citing_paper":{"arxiv_id":"2605.28703","last_updated":"2026-05-27T16:30:39Z","snapshot_observed_at":"2026-08-06T17:44:15.196975Z","submitted_at":"2026-05-27T16:30:39Z","title":"A Fresh Look at Lamarckian Evolution and the Baldwin Effect","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-29T09:08:31.059333Z"},"links":{"cited_paper":"/paper/2512.04475","citing_paper":"/paper/2605.28703"},"observation_digest":"sha256:f5abcd1b4bf27f8bfb5d23d019d570190290195102fb87a5cf78a52be41cdca5","observation_id":"be35ddf0-d2b0-4844-8032-c45649a304c0","resolution":{"observed_at":"2026-06-29T09:13:16.160683Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2512.04475","last_updated":"2026-05-09T17:08:21Z","snapshot_observed_at":"2026-08-03T03:14:46.516808Z","submitted_at":"2025-12-04T05:30:31Z","title":"GraphBench: Next-generation graph learning benchmarking","version":5},"cited_work":{"arxiv_id":"2512.04475","doi":null,"metadata_source":"pith","pith_arxiv_id":"2512.04475","snapshot_observed_at":"2026-07-04T16:09:57.506844Z","title":"2512.04475 , archiveprefix =","venue":"cs.LG","work_id":"d99ec5ae-3c47-45af-960f-f2641e5535c0","year":2025},"citing_paper":{"arxiv_id":"2606.24509","last_updated":"2026-06-23T12:41:43Z","snapshot_observed_at":"2026-08-08T03:35:19.936330Z","submitted_at":"2026-06-23T12:41:43Z","title":"A Fair Evaluation of Graph Foundation Models for Node Property Prediction","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-26T00:50:39.622302Z"},"links":{"cited_paper":"/paper/2512.04475","citing_paper":"/paper/2606.24509"},"observation_digest":"sha256:f9d45a1a79ae69e142b1eb914cf6190bbc51c9bfa9e721ecfa3c2ce98c122bc4","observation_id":"3f57ad82-a69e-40f5-891c-d4064e1cdb89","resolution":{"observed_at":"2026-07-04T16:09:57.508225Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2512.04475/citation-record","integrity":"/paper/2512.04475/integrity","json":"/paper/2512.04475/citation-record.json","paper":"/paper/2512.04475"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"SHA-256 collision attack with programmatic SAT","venue":null,"work_id":"20cb08b4-03c7-4846-9f14-3e5ba183bd8e","year":2024},"citing_paper":{"arxiv_id":"2512.04475","last_updated":"2026-05-09T17:08:21Z","snapshot_observed_at":"2026-08-03T03:14:46.516808Z","submitted_at":"2025-12-04T05:30:31Z","title":"GraphBench: Next-generation graph learning benchmarking","version":5},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-17T01:30:24.949010Z"},"links":{"citing_paper":"/paper/2512.04475"},"observation_digest":"sha256:96bbd94e717184961af82d8ce6f0b6a99d166601b65865644379e0c5dada0998","observation_id":"26b78d71-d544-4a69-872f-a27496f65223","resolution":{"observed_at":"2026-05-17T01:31:24.827593Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"28561e6c-69b7-4c7d-8d11-45b6c79088f6","year":2016},"citing_paper":{"arxiv_id":"2512.04475","last_updated":"2026-05-09T17:08:21Z","snapshot_observed_at":"2026-08-03T03:14:46.516808Z","submitted_at":"2025-12-04T05:30:31Z","title":"GraphBench: Next-generation graph learning benchmarking","version":5},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-17T01:30:24.949010Z"},"links":{"citing_paper":"/paper/2512.04475"},"observation_digest":"sha256:7ef7cc1fcb23555221c57a3a6e99fdbbdc66e944c20a9aa1a3237ce96122c1e0","observation_id":"6586f7f9-9c55-4f95-90c9-6008eb18d034","resolution":{"observed_at":"2026-05-17T01:31:24.839424Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"BreakID-kissat in SAT Competition 2024 (System Description)","venue":null,"work_id":"5d230f48-cbb3-4a76-aef0-ee123c00cb95","year":2024},"citing_paper":{"arxiv_id":"2512.04475","last_updated":"2026-05-09T17:08:21Z","snapshot_observed_at":"2026-08-03T03:14:46.516808Z","submitted_at":"2025-12-04T05:30:31Z","title":"GraphBench: Next-generation graph learning benchmarking","version":5},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-17T01:30:24.949010Z"},"links":{"citing_paper":"/paper/2512.04475"},"observation_digest":"sha256:6e9f6f932ae70fd0b1f570ee70555288a8b6a65cca7278aea6edefe26958fc95","observation_id":"a82feb28-b905-45a6-bbfe-934f290f7c19","resolution":{"observed_at":"2026-05-17T01:31:24.857090Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Breakid-kissat in sat competition 2023 (system description)","venue":null,"work_id":"327e5b83-a80c-4081-aba1-16d6f51bbe23","year":2023},"citing_paper":{"arxiv_id":"2512.04475","last_updated":"2026-05-09T17:08:21Z","snapshot_observed_at":"2026-08-03T03:14:46.516808Z","submitted_at":"2025-12-04T05:30:31Z","title":"GraphBench: Next-generation graph learning benchmarking","version":5},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-17T01:30:24.949010Z"},"links":{"citing_paper":"/paper/2512.04475"},"observation_digest":"sha256:f7c436d7b9defa58a088e5755dfda342bae554e00f4da410c2160173bee0bd83","observation_id":"2d7993e2-f20c-4a9a-bdcb-2c33690ba314","resolution":{"observed_at":"2026-05-17T01:31:24.825031Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"0c001e1e-e6e6-4220-b70b-7dfc458cb39a","year":2023},"citing_paper":{"arxiv_id":"2512.04475","last_updated":"2026-05-09T17:08:21Z","snapshot_observed_at":"2026-08-03T03:14:46.516808Z","submitted_at":"2025-12-04T05:30:31Z","title":"GraphBench: Next-generation graph learning benchmarking","version":5},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-17T01:30:24.949010Z"},"links":{"citing_paper":"/paper/2512.04475"},"observation_digest":"sha256:b615754ea03b17e70af512bea729047997baacf66d57b3b5cb01e0ac79aacaad","observation_id":"e6291ac1-39a5-41f6-9003-380be1d97297","resolution":{"observed_at":"2026-05-17T01:31:24.837113Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"ASAP.V2 and ASAP.V3: sequential optimization of an algorithm selector and a scheduler","venue":null,"work_id":"f59d2df3-6f7e-4ca2-8691-b57571e4be58","year":2017},"citing_paper":{"arxiv_id":"2512.04475","last_updated":"2026-05-09T17:08:21Z","snapshot_observed_at":"2026-08-03T03:14:46.516808Z","submitted_at":"2025-12-04T05:30:31Z","title":"GraphBench: Next-generation graph learning benchmarking","version":5},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-17T01:30:24.949010Z"},"links":{"citing_paper":"/paper/2512.04475"},"observation_digest":"sha256:00e4b0378cbd7ece2029e08b4c31a03698aee9beeea07b95aedba6b427899160","observation_id":"3ded264d-eefe-4aa3-af3c-f8c6da23191d","resolution":{"observed_at":"2026-05-17T01:31:24.832374Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Sbva-cadical and sbva-kissat: Structured bounded variable addition","venue":null,"work_id":"fe7070bd-57c3-4f59-b7e3-fad791087a4c","year":2023},"citing_paper":{"arxiv_id":"2512.04475","last_updated":"2026-05-09T17:08:21Z","snapshot_observed_at":"2026-08-03T03:14:46.516808Z","submitted_at":"2025-12-04T05:30:31Z","title":"GraphBench: Next-generation graph learning benchmarking","version":5},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-17T01:30:24.949010Z"},"links":{"citing_paper":"/paper/2512.04475"},"observation_digest":"sha256:1015d111e6c88136ac0761635404a6d93353f890a0681a4493b112dba8bb3345","observation_id":"39ec37db-5e07-4de2-987b-303bea584b05","resolution":{"observed_at":"2026-05-17T01:31:24.841719Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"SAT competition 2018.Journal on Satisfiability, Boolean Modeling and Computation, (1)","venue":null,"work_id":"472cf290-f027-4b52-980a-c604fa7ad552","year":2018},"citing_paper":{"arxiv_id":"2512.04475","last_updated":"2026-05-09T17:08:21Z","snapshot_observed_at":"2026-08-03T03:14:46.516808Z","submitted_at":"2025-12-04T05:30:31Z","title":"GraphBench: Next-generation graph learning benchmarking","version":5},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-17T01:30:24.949010Z"},"links":{"citing_paper":"/paper/2512.04475"},"observation_digest":"sha256:f931ae181cce45ab8f66572c3edf1966bf54920c9047e69c28c85a0b5f089f45","observation_id":"86eebc36-b8cd-4259-99a8-9e03b581786e","resolution":{"observed_at":"2026-05-17T01:31:24.834736Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.ccc.2020.22","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"ISBN 9783959771566","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"e8be12ca-ff49-4725-bc1d-bfcf798ef5a0","year":2020},"citing_paper":{"arxiv_id":"2512.04475","last_updated":"2026-05-09T17:08:21Z","snapshot_observed_at":"2026-08-03T03:14:46.516808Z","submitted_at":"2025-12-04T05:30:31Z","title":"GraphBench: Next-generation graph learning benchmarking","version":5},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-17T01:30:24.949010Z"},"links":{"citing_paper":"/paper/2512.04475"},"observation_digest":"sha256:40e1ca1b70846dd58d9fdfe4f5e6f2735a96b158e36f38c5aea3f52130a838fc","observation_id":"be287195-a853-4fef-923b-2cfd9f4b5f7d","resolution":{"observed_at":"2026-05-17T01:31:24.430746Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"8996.369025","doi":"10.1145/368996.369025","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"title =","venue":"Communications of the ACM","work_id":"b5079c47-8e78-4dab-b7eb-da5a034f534b","year":1962},"citing_paper":{"arxiv_id":"2512.04475","last_updated":"2026-05-09T17:08:21Z","snapshot_observed_at":"2026-08-03T03:14:46.516808Z","submitted_at":"2025-12-04T05:30:31Z","title":"GraphBench: Next-generation graph learning benchmarking","version":5},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-17T01:30:24.949010Z"},"links":{"citing_paper":"/paper/2512.04475"},"observation_digest":"sha256:434e2cef847e0882e6adf9420058e5fd1e3b7aeef6aef78419d5117020153385","observation_id":"c51ff40b-57df-4d41-917e-8c86ac475ebf","resolution":{"observed_at":"2026-05-17T01:31:24.441141Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-07-11T02:49:24.476915+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T02:49:24.476915+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"W Li, R Li, Y Ma, S O Chan, D Pan, and B Yu","venue":null,"work_id":"71db434d-d0fe-4cc3-9fd4-0cf82f68a2a8","year":2024},"citing_paper":{"arxiv_id":"2512.04475","last_updated":"2026-05-09T17:08:21Z","snapshot_observed_at":"2026-08-03T03:14:46.516808Z","submitted_at":"2025-12-04T05:30:31Z","title":"GraphBench: Next-generation graph learning benchmarking","version":5},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-17T01:30:24.949010Z"},"links":{"citing_paper":"/paper/2512.04475"},"observation_digest":"sha256:5f3319a6898e3c2ce0b8f0ce7d83203dd67cb0b2f03a7179294759b3d3f57087","observation_id":"757ae426-e8da-468f-bc60-cfe8289152f2","resolution":{"observed_at":"2026-05-17T01:31:24.829831Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The algorithm selection competitions 2015 and","venue":null,"work_id":"bf45b676-6a92-4bb9-bf90-65838f514381","year":2015},"citing_paper":{"arxiv_id":"2512.04475","last_updated":"2026-05-09T17:08:21Z","snapshot_observed_at":"2026-08-03T03:14:46.516808Z","submitted_at":"2025-12-04T05:30:31Z","title":"GraphBench: Next-generation graph learning benchmarking","version":5},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-17T01:30:24.949010Z"},"links":{"citing_paper":"/paper/2512.04475"},"observation_digest":"sha256:662a8542a9ae9ef4bcbaa1495af4c862b8ddf680adaf5bccfe186265cd62a560","observation_id":"5063bd97-aa69-429b-9a98-dd9f71653464","resolution":{"observed_at":"2026-05-17T01:31:24.861653Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"4cc650ff-a083-4e7f-ba08-df878ba95867","year":2024},"citing_paper":{"arxiv_id":"2512.04475","last_updated":"2026-05-09T17:08:21Z","snapshot_observed_at":"2026-08-03T03:14:46.516808Z","submitted_at":"2025-12-04T05:30:31Z","title":"GraphBench: Next-generation graph learning benchmarking","version":5},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-17T01:30:24.949010Z"},"links":{"citing_paper":"/paper/2512.04475"},"observation_digest":"sha256:c49580c917dc5b5bd735d9ce2b15343be6216d34b77eed252c1761017d29f620","observation_id":"38373f80-fa1e-4a69-9443-bcbf700024e1","resolution":{"observed_at":"2026-05-17T01:31:24.863818Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Problems and results of iwls 2023 programming contest","venue":null,"work_id":"0f25a0ed-6e7b-4265-8856-1f7ea129745e","year":2023},"citing_paper":{"arxiv_id":"2512.04475","last_updated":"2026-05-09T17:08:21Z","snapshot_observed_at":"2026-08-03T03:14:46.516808Z","submitted_at":"2025-12-04T05:30:31Z","title":"GraphBench: Next-generation graph learning benchmarking","version":5},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-17T01:30:24.949010Z"},"links":{"citing_paper":"/paper/2512.04475"},"observation_digest":"sha256:c0a38b42bacbece91820047d68f747bffb33bdf95bdd339ffacad1a85cf87020","observation_id":"8d26f596-67f0-4783-a825-08178f8a365d","resolution":{"observed_at":"2026-05-17T01:31:24.852619Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Accessed: 2025-09-23","venue":null,"work_id":"a3142f83-e036-4920-9e47-cc03e3ffacbd","year":2025},"citing_paper":{"arxiv_id":"2512.04475","last_updated":"2026-05-09T17:08:21Z","snapshot_observed_at":"2026-08-03T03:14:46.516808Z","submitted_at":"2025-12-04T05:30:31Z","title":"GraphBench: Next-generation graph learning benchmarking","version":5},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-17T01:30:24.949010Z"},"links":{"citing_paper":"/paper/2512.04475"},"observation_digest":"sha256:3315878d005c82998f2a46f954542856f380d3698b094879cb53b6406a784b70","observation_id":"3acdd8e4-dc38-4898-9b31-490951111e7b","resolution":{"observed_at":"2026-05-17T01:31:24.850552Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1057/s41599-024-03253-5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"doi: 10.1057/s41599-024-03253-5","venue":"Humanities and Social Sciences Communications","work_id":"2acad382-45e7-4be0-bd07-c7526b441754","year":null},"citing_paper":{"arxiv_id":"2512.04475","last_updated":"2026-05-09T17:08:21Z","snapshot_observed_at":"2026-08-03T03:14:46.516808Z","submitted_at":"2025-12-04T05:30:31Z","title":"GraphBench: Next-generation graph learning benchmarking","version":5},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-17T01:30:24.949010Z"},"links":{"citing_paper":"/paper/2512.04475"},"observation_digest":"sha256:00a00d805fde5d8e07f232c1e476471f9e22bfb426f9c2d7acf40b6799332d1b","observation_id":"242fbd10-28fc-40f3-bc5e-f69093a1a70c","resolution":{"observed_at":"2026-05-17T01:31:24.434932Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"fd1e0c7f-fd40-403f-9614-f03775fac2e6","year":2023},"citing_paper":{"arxiv_id":"2512.04475","last_updated":"2026-05-09T17:08:21Z","snapshot_observed_at":"2026-08-03T03:14:46.516808Z","submitted_at":"2025-12-04T05:30:31Z","title":"GraphBench: Next-generation graph learning benchmarking","version":5},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-17T01:30:24.949010Z"},"links":{"citing_paper":"/paper/2512.04475"},"observation_digest":"sha256:ae027bafb06f7309ca32a5e9b101304ef5eb946fce8b88bbd7852ee28dcdad10","observation_id":"97685557-6d49-4384-94de-dbc7b881d714","resolution":{"observed_at":"2026-05-17T01:31:24.846114Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"578d2153-27d8-4567-aa54-f2592109b4b4","year":2023},"citing_paper":{"arxiv_id":"2512.04475","last_updated":"2026-05-09T17:08:21Z","snapshot_observed_at":"2026-08-03T03:14:46.516808Z","submitted_at":"2025-12-04T05:30:31Z","title":"GraphBench: Next-generation graph learning benchmarking","version":5},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-17T01:30:24.949010Z"},"links":{"citing_paper":"/paper/2512.04475"},"observation_digest":"sha256:117a4b40a212edb391df5b9d5b0a8eb0eb172929415eb24854212cf95eb96dda","observation_id":"e2a3a3de-5154-460d-98c6-df1014c4e289","resolution":{"observed_at":"2026-05-17T01:31:24.820198Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On the complexity of derivation in propositional calculus","venue":null,"work_id":"c9cb6adb-82e7-45af-a3e5-662a00b6b6bf","year":1967},"citing_paper":{"arxiv_id":"2512.04475","last_updated":"2026-05-09T17:08:21Z","snapshot_observed_at":"2026-08-03T03:14:46.516808Z","submitted_at":"2025-12-04T05:30:31Z","title":"GraphBench: Next-generation graph learning benchmarking","version":5},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-17T01:30:24.949010Z"},"links":{"citing_paper":"/paper/2512.04475"},"observation_digest":"sha256:1b0f0e4446181421285f63c73287da4180c6237d005022aca588a8daa0009e8c","observation_id":"a9520510-8812-442c-83ee-be184a3243bf","resolution":{"observed_at":"2026-05-17T01:31:24.859298Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Dataset details Here, we provide additional details on the datasets","venue":null,"work_id":"b1ef41de-6f7e-4e1f-b993-0aa5b9551042","year":2023},"citing_paper":{"arxiv_id":"2512.04475","last_updated":"2026-05-09T17:08:21Z","snapshot_observed_at":"2026-08-03T03:14:46.516808Z","submitted_at":"2025-12-04T05:30:31Z","title":"GraphBench: Next-generation graph learning benchmarking","version":5},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-17T01:30:24.949010Z"},"links":{"citing_paper":"/paper/2512.04475"},"observation_digest":"sha256:8c55de52998103c978b54fca4a74e56ba033f458af8bfc80544b504a04b2aaf4","observation_id":"dd90995a-bce5-4df5-8db7-323e66efcb4e","resolution":{"observed_at":"2026-05-17T01:31:24.848329Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Experimental setup Similar to Bechler-Speicher et al","venue":null,"work_id":"0fe63ac4-e591-4fe4-bd90-9dcb0749d31b","year":2025},"citing_paper":{"arxiv_id":"2512.04475","last_updated":"2026-05-09T17:08:21Z","snapshot_observed_at":"2026-08-03T03:14:46.516808Z","submitted_at":"2025-12-04T05:30:31Z","title":"GraphBench: Next-generation graph learning benchmarking","version":5},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-17T01:30:24.949010Z"},"links":{"citing_paper":"/paper/2512.04475"},"observation_digest":"sha256:a05fb3410e46de8cb90350ca5fc0634eb413634b15ba9490a5615df1929fcc50","observation_id":"418212bf-b539-4e7d-b25a-2b7086d25d23","resolution":{"observed_at":"2026-05-17T01:31:24.843899Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"128 128 128 128 128 128 128 128 128 B.2","venue":null,"work_id":"3993eb85-6feb-4c55-8cad-4d66677eb13b","year":2025},"citing_paper":{"arxiv_id":"2512.04475","last_updated":"2026-05-09T17:08:21Z","snapshot_observed_at":"2026-08-03T03:14:46.516808Z","submitted_at":"2025-12-04T05:30:31Z","title":"GraphBench: Next-generation graph learning benchmarking","version":5},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-17T01:30:24.949010Z"},"links":{"citing_paper":"/paper/2512.04475"},"observation_digest":"sha256:7d9f14ffc50a6543124a26d5c117824b5226418fcc477a6ad31b6251c608637d","observation_id":"93715e9b-8621-47da-b817-6b83d7233855","resolution":{"observed_at":"2026-05-17T01:31:24.854729Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"384 384 384 384 Attn","venue":null,"work_id":"0de6a6c9-849c-463e-a6d6-14b5cae64c32","year":2025},"citing_paper":{"arxiv_id":"2512.04475","last_updated":"2026-05-09T17:08:21Z","snapshot_observed_at":"2026-08-03T03:14:46.516808Z","submitted_at":"2025-12-04T05:30:31Z","title":"GraphBench: Next-generation graph learning benchmarking","version":5},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-17T01:30:24.949010Z"},"links":{"citing_paper":"/paper/2512.04475"},"observation_digest":"sha256:92bdf849388e9cc72152b65fcf541248e8b1784b60e13d80be2b94c716989975","observation_id":"196e139f-41ba-429c-a256-e16b90e5dec7","resolution":{"observed_at":"2026-05-17T01:31:24.822534Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2512.04475","last_updated":"2026-05-09T17:08:21Z","latest_version":5,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-03T03:14:46.516808Z","submitted_at":"2025-12-04T05:30:31Z","title":"GraphBench: Next-generation graph learning benchmarking"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":5,"verified_exact":2,"verified_fuzzy":15},"total_outbound_references":23},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 23 of 23 outbound references and 3 inbound Pith citation observations for arXiv:2512.04475."}