{"as_of":"2026-08-10T16:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5c43513166e80689870fa3e10e9db1c888b4da85005ce63e4a6d2072ecaf33a2","coverage":[{"denominator":4,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T15:03:21.869780Z","state":"measured"},{"denominator":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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-10T05:44:54.431365Z","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-10T05:44:55.336865Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2605.26959","last_updated":"2026-05-27T04:48:39Z","snapshot_observed_at":"2026-08-09T03:49:28.784182Z","submitted_at":"2026-05-26T12:49:49Z","title":"MerLean-Prover: A Recursive Looping Harness for Lean 4 Theorem Proving","version":2},"cited_work":{"arxiv_id":"2605.26959","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.26959","snapshot_observed_at":"2026-08-10T05:44:55.336865Z","title":"MerLean-Prover: A Recursive Looping Harness for Lean 4 Theorem Proving","venue":"cs.LO","work_id":"77803f90-d260-47dd-9b07-c5dd380002ad","year":2026},"citing_paper":{"arxiv_id":"2608.07360","last_updated":"2026-08-07T16:02:23Z","snapshot_observed_at":"2026-08-10T16:12:06.115145Z","submitted_at":"2026-08-07T16:02:23Z","title":"Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T05:44:54.431365Z"},"links":{"cited_paper":"/paper/2605.26959","citing_paper":"/paper/2608.07360"},"observation_digest":"sha256:c6dd3a54b5bc6636e9428e38dd57153078edcb0fd4b3ca341eb0752127408e03","observation_id":"ca86a389-b365-4884-bd4e-23139050df87","resolution":{"observed_at":"2026-08-10T05:44:55.341613Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2605.26959/citation-record","integrity":"/paper/2605.26959/integrity","json":"/paper/2605.26959/citation-record.json","paper":"/paper/2605.26959"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T15:03:21.869780Z","title":"These conditions together state that ‘N‘ acts regularly on ‘α‘; in particular ‘Nat.card N = p‘","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2605.26959","last_updated":"2026-05-27T04:48:39Z","snapshot_observed_at":"2026-08-09T03:49:28.784182Z","submitted_at":"2026-05-26T12:49:49Z","title":"MerLean-Prover: A Recursive Looping Harness for Lean 4 Theorem Proving","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-29T15:03:21.869780Z"},"links":{"citing_paper":"/paper/2605.26959"},"observation_digest":"sha256:9b3453869d5c86a8cdabf4f7af388938665b9f34481145c344faf2a07b9808e2","observation_id":"8681f7c0-9958-4105-a500-6d7caf1f0f7e","resolution":{"observed_at":"2026-06-29T15:03:21.869780Z","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-06-29T15:03:21.869780Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.26959","last_updated":"2026-05-27T04:48:39Z","snapshot_observed_at":"2026-08-09T03:49:28.784182Z","submitted_at":"2026-05-26T12:49:49Z","title":"MerLean-Prover: A Recursive Looping Harness for Lean 4 Theorem Proving","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-29T15:03:21.869780Z"},"links":{"citing_paper":"/paper/2605.26959"},"observation_digest":"sha256:2435717adb2df4f8616169221f56cb4cc7413c98931a124f57383cf148e8b497","observation_id":"7816c47f-1b9b-45fe-bfa0-aa7bd26c5952","resolution":{"observed_at":"2026-06-29T15:03:21.869780Z","resolver_source":null,"status":"parse_uncertain"},"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-06-29T15:03:21.869780Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.26959","last_updated":"2026-05-27T04:48:39Z","snapshot_observed_at":"2026-08-09T03:49:28.784182Z","submitted_at":"2026-05-26T12:49:49Z","title":"MerLean-Prover: A Recursive Looping Harness for Lean 4 Theorem Proving","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-29T15:03:21.869780Z"},"links":{"citing_paper":"/paper/2605.26959"},"observation_digest":"sha256:216a12e2ffbc461b6f10214b3123afc78d2eb9a8b7eb4df55f2ddf5bb977114c","observation_id":"94a50dce-ae22-4a8c-a341-e98f553f1d6f","resolution":{"observed_at":"2026-06-29T15:03:21.869780Z","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-06-29T15:03:21.869780Z","title":"These conditions state that ‘N‘ acts regularly on ‘α‘","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.26959","last_updated":"2026-05-27T04:48:39Z","snapshot_observed_at":"2026-08-09T03:49:28.784182Z","submitted_at":"2026-05-26T12:49:49Z","title":"MerLean-Prover: A Recursive Looping Harness for Lean 4 Theorem Proving","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-29T15:03:21.869780Z"},"links":{"citing_paper":"/paper/2605.26959"},"observation_digest":"sha256:d3a210a6868e3d610d243818d9ad0eaf3f20aabf39e9f99b89eb08f3c323111f","observation_id":"032de1d5-5f21-434a-8e7f-5666a018719d","resolution":{"observed_at":"2026-06-29T15:03:21.869780Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2605.26959","last_updated":"2026-05-27T04:48:39Z","latest_version":2,"primary_category":"cs.LO","snapshot_observed_at":"2026-08-09T03:49:28.784182Z","submitted_at":"2026-05-26T12:49:49Z","title":"MerLean-Prover: A Recursive Looping Harness for Lean 4 Theorem Proving"},"reference_resolution":{"displayed":4,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":1,"unresolved":3,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":4},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 4 of 4 outbound references and 1 inbound Pith citation observation for arXiv:2605.26959."}