{"as_of":"2026-08-10T10:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:030ce03bc4e83dcd65d5ed76e33fec857f948a04f4bfb07e07db548c135d7eb2","coverage":[{"denominator":56,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":56,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T23:40:03.872006Z","state":"measured"},{"denominator":57,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":57,"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-04T08:50:01.849595Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.06559","snapshot_observed_at":"2026-08-04T08:50:01.849595Z","title":"M´ esz´ aros","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.19563","last_updated":"2026-06-09T14:18:09Z","snapshot_observed_at":"2026-08-09T19:15:39.268522Z","submitted_at":"2025-10-22T13:17:36Z","title":"Local limits of determinantal processes","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T08:50:01.849595Z"},"links":{"cited_paper":"/paper/2509.06559","citing_paper":"/paper/2510.19563"},"observation_digest":"sha256:74ac5507a21d3af873a95ff74d7a3d3c0c6bdc78acd93b9a4183f5de0cad20b7","observation_id":"ff460cd2-8e81-4c17-8170-26ac753e034e","resolution":{"observed_at":"2026-08-04T08:50:01.849595Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2509.06559/citation-record","integrity":"/paper/2509.06559/integrity","json":"/paper/2509.06559/citation-record.json","paper":"/paper/2509.06559"},"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-04T23:40:04.580559Z","title":"The continuum random tree I.The Annals of Probability, 19(1):1 – 28, 1991","venue":null,"work_id":"8ae77763-7664-47fc-b4d5-5e67b014edaa","year":1991},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.686627Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:ad7a2e92a62a0bb0a0535e2eef3856114bbb6bfa4f0d17d0cce56922ba157349","observation_id":"3bbc31b5-0f6f-4ec7-9fa2-b044c919a4b6","resolution":{"observed_at":"2026-08-04T23:40:04.584294Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:40:04.569099Z","title":"The continuum random tree II","venue":null,"work_id":"c2f2fe9b-ca9e-4718-8849-a813be8a0858","year":1991},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.690945Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:6128b80007d4314f4cb2ed3a09a8e7e641eca5818d2adaf89ac81276f4b86446","observation_id":"01837088-9e50-47cc-82c2-f0e6eb04d4c3","resolution":{"observed_at":"2026-08-04T23:40:04.573663Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:40:04.558045Z","title":"The continuum random tree III.The Annals of Probability, pages 248–289, 1993","venue":null,"work_id":"590eae3d-b216-4c51-9959-5efaef8dce0a","year":1993},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.694500Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:ec2e1d4a8f921af0acf160e50e9d18ed388a312a9ca5c9655ccdd086c7e738ba","observation_id":"5c42a576-96f6-470c-a027-6fdd0b0fcdf3","resolution":{"observed_at":"2026-08-04T23:40:04.562062Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:40:04.546205Z","title":"The satisfiability threshold for random linear equations.Combinatorica, 40(2):179–235, 2020","venue":null,"work_id":"faf54d23-aa84-493c-862b-a154303803ea","year":2020},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.698693Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:24d7589f2f4390f75d49ea9202eb1ee2aab1956cd61d34fc13ac34200f11a618","observation_id":"cde6e3b7-eb2f-40ec-9af0-4f07779f893a","resolution":{"observed_at":"2026-08-04T23:40:04.550209Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:40:04.534597Z","title":"Topology of random geometric complexes: a survey","venue":null,"work_id":"3c0d0e8a-fb01-40dd-8195-45a73670b358","year":2018},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.702404Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:68e5cd2cf722ea8c8ed062e40e2a14da6d8d984a4589b4f7ecb6444d8b1132d3","observation_id":"5df1974b-6a71-45d0-a969-111c75bd765d","resolution":{"observed_at":"2026-08-04T23:40:04.538512Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:40:04.522826Z","title":"Random simplicial complexes: models and phe- nomena","venue":null,"work_id":"0ad7158a-8d93-416c-a5d6-b2768b7a275d","year":2022},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.705715Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:ed8f95e3c53349596a34af76413db895155b853d32f524ecb7ce3d35873a98b8","observation_id":"eb8d54f2-b14b-40b4-b346-b34b0f0ce84f","resolution":{"observed_at":"2026-08-04T23:40:04.526884Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:40:04.511369Z","title":"Counting graph homomorphisms","venue":null,"work_id":"8ad99777-80a1-466e-b498-1e554b92c02e","year":2006},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.709343Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:5cd5e3c7beb23abf6095d10104b3ba5d3a4c7634d93aa31ee64792101e034ece","observation_id":"0ac630cb-49a8-4689-b420-d762257e7e0e","resolution":{"observed_at":"2026-08-04T23:40:04.514953Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:40:04.500536Z","title":"Convergent sequences of dense graphs i: Subgraph frequencies, metric properties and testing.Advances in Mathematics, 219(6):1801–1851, 2008","venue":null,"work_id":"402e181f-7360-413b-b8d6-acca8663b0d2","year":2008},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.712443Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:071e5fa4bb82fdd3f87fc299b9101b1536f0c0c1788a044e061a735f88ac27a2","observation_id":"847fa2ed-9845-4b12-b412-73cc7618374b","resolution":{"observed_at":"2026-08-04T23:40:04.504401Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:40:03.716491Z","title":"Convergent sequences of dense graphs ii","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.716491Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:a26a5e5aec802d50cdd63e722a6beba31d39df445bc70192dd593d409c26ad95","observation_id":"e4849c54-53c8-469c-8329-50eccebdc34d","resolution":{"observed_at":"2026-08-04T23:40:03.716491Z","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-04T23:40:04.483907Z","title":"The large deviation principle for the Erdős- Rényi random graph.European Journal of Combinatorics, 32(7):1000–1017, 2011","venue":null,"work_id":"4bd88d4b-da74-47e5-b08a-c0853f8e6892","year":2011},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.720532Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:31bb43cfb4f7cae47306f0b6c4deafa8716f6fabb5f4ec5e3511ddef6e6e4cfd","observation_id":"da6283d3-2179-441c-aac2-33c70eb5e497","resolution":{"observed_at":"2026-08-04T23:40:04.487671Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:40:04.473484Z","title":"Vanishing of cohomology groups of random simplicial complexes.Random Structures & Algorithms, 56(2):461–500, 2020","venue":null,"work_id":"e52e899f-3dac-4d21-b9b9-2172a7972907","year":2020},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.723989Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:5efecf79471cce932ec2ae95a477593b4cb04fc86ea59f2724a7233c8c08360e","observation_id":"e5b81474-2bfd-4daa-a44e-dcacefcdebdf","resolution":{"observed_at":"2026-08-04T23:40:04.477077Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:40:04.461809Z","title":"Large deviations techniques and applications","venue":null,"work_id":"5e21cf48-2d9d-490d-9235-07863c801e06","year":null},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.727808Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:edc15f7a791d1c82ee5dfbf314f369eb55366ae3b9efb093973370df735b6e60","observation_id":"324272d9-e523-493b-998e-aecafdd05dcd","resolution":{"observed_at":"2026-08-04T23:40:04.466129Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:40:04.451809Z","title":"Graph limits and exchangeable random graphs.Ren- diconti di Matematica e delle sue Applicazioni","venue":null,"work_id":"e7412a3d-9d64-45c6-8411-92c3c5442994","year":2008},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.731061Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:00515b1e327949265f5eaa6a5e23e6aeefa1c4ae2fe73b74bdc00315070e9955","observation_id":"150d597d-6d10-478d-a951-cb4b2bb13df5","resolution":{"observed_at":"2026-08-04T23:40:04.455308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:40:04.441260Z","title":"Homologyofmulti-parameterrandomsimplicialcomplexes.Discrete & Computational Geometry, 62(1):87–127, 2019","venue":null,"work_id":"f5c14750-f53c-4242-b081-a86a0b4934e7","year":2019},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.734918Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:31dfbf096b08376a238488cb817467c761ca0ce57d90c8b373773f45c23ec5f7","observation_id":"036b3855-6cb4-4edf-8fc4-d05f99e07131","resolution":{"observed_at":"2026-08-04T23:40:04.445136Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:40:04.429909Z","title":"Reflection positivity, rank connectivity, andhomomorphismofgraphs.Journal of the American Mathematical Society, 20(1):37–51, 2007","venue":null,"work_id":"4700d929-2ca8-461b-8100-2d2e48489c44","year":2007},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.738179Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:61b2f2504d86fd89e494cbc4e5c8bc45d01fb88517193922185e56dee5cfa846","observation_id":"3442840b-2140-4385-ab99-b0351d91b918","resolution":{"observed_at":"2026-08-04T23:40:04.433578Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:40:04.416198Z","title":"Quick approximation to matrices and applications.Com- binatorica, 19(2):175–220, 1999","venue":null,"work_id":"69201d23-ed67-449d-9321-2464f9c2c416","year":1999},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.741555Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:008289ce888b35e0d7e54ceda922f28cdd8936f9c8351ae03275572699dace1c","observation_id":"f340b9a4-db48-4078-b846-516e913b8469","resolution":{"observed_at":"2026-08-04T23:40:04.420083Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:40:03.744848Z","title":"Random labelled trees and their branching networks.Journal of the Australian Mathematical Society, 30(2):229–237, 1980","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.744848Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:1ac9cc8ac50da5a2861e4ef8c336e494e910f7efefd34bd4748f33eac29cd628","observation_id":"9d465629-f4ed-4173-8c4e-21125cca2af7","resolution":{"observed_at":"2026-08-04T23:40:03.744848Z","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-04T23:40:04.399138Z","title":"Algebraic topology, 2000","venue":null,"work_id":"a01f083c-5215-4ce2-901c-9915c69762ff","year":2000},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.748308Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:cb1f4cb838a359f8b34178fe6b96e195e1d79dd8f15ccf0b759bd93fc23198e4","observation_id":"1a6a3706-b35d-4136-b8f5-e5dcced1d56a","resolution":{"observed_at":"2026-08-04T23:40:04.402802Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:40:04.389084Z","title":"The threshold for integer homology in random d-complexes.Discrete & Computational Geometry, 57:810–823, 2017","venue":null,"work_id":"59da464c-b963-44e6-b7d5-4b2eb7980ac8","year":2017},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.751536Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:662e777b68d163de9d481413d2799cb86873687ba74e48002714542e611c9607","observation_id":"a2e78f33-b18b-4d33-a0d9-f02919841339","resolution":{"observed_at":"2026-08-04T23:40:04.392719Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:40:03.754958Z","title":"Determinantal processes and independence.Probability Surveys, 3:206–229, 2006","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.754958Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:bf51364f74e9e5507495cc64726e3a65dc44db5e5079d587ab96105872191895","observation_id":"f6858258-37fe-4977-93e2-8fbbbed40ab1","resolution":{"observed_at":"2026-08-04T23:40:03.754958Z","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-04T23:40:04.369738Z","title":"Sharp vanishing thresholds for cohomology of random flag complexes","venue":null,"work_id":"2907e351-4378-47d7-860d-7bef5e1c473e","year":2014},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.758115Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:481fb3d55c2fac4e82cffad4b1fba9b3b20b13b7f3bb2c4a0eaa447c79b966e7","observation_id":"08edd824-013c-4d89-ac7f-ac3ffd0c09c9","resolution":{"observed_at":"2026-08-04T23:40:04.374640Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:40:04.357723Z","title":"Cohen–Lenstra heuristics for torsion in homology of random complexes.Experimental Mathematics, 29(3):347–359, 2020","venue":null,"work_id":"4285d62b-bfce-42a8-835a-5ebf27dfce56","year":2020},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.761302Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:6054dabd7514ae126a012916d95b7cce6d52b2882e16c809c47baa6e7e0bfeba","observation_id":"5faea396-efd2-4111-96bd-cf735b68b386","resolution":{"observed_at":"2026-08-04T23:40:04.362091Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:40:04.346444Z","title":"Topology and geometry of random 2-dimensional hypertrees.Discrete & Computational Geometry, 67(4):1229–1244, 2022","venue":null,"work_id":"5cf94e19-ac6d-4900-a146-2fc1c7813ab5","year":2022},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.764619Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:2e4db0741699f82dc19ca97b3f1cdfe142aecbbbca10ff3bc553caa4dd9df4ca","observation_id":"7cfc0ba0-d40a-4a86-a1d5-3f7ea9037e6b","resolution":{"observed_at":"2026-08-04T23:40:04.350338Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:40:04.334754Z","title":"Inside the critical window for cohomology of random k-complexes.Random Structures & Algorithms, 48(1):102–124, 2016","venue":null,"work_id":"e5b35859-53ae-43e0-a341-75c37cf409ac","year":2016},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.768034Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:1b032fe3d05a30b92d37bc6a9adcee0d2fd5b0b280a193ffd140d4218fb94785","observation_id":"69685445-e462-4791-9f45-1da1a6848f2e","resolution":{"observed_at":"2026-08-04T23:40:04.338950Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:40:04.321789Z","title":"Enumeration ofQ-acyclic simplicial complexes.Israel Journal of Mathematics, 45:337–351, 1983","venue":null,"work_id":"6c59180c-3df9-406f-b621-f938150ad5a8","year":1983},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.771128Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:bf538cb3da5fd73a1a9f5534330a640703a10ee47ec6b704a145dbe6ae0af1e6","observation_id":"7fc725f2-5cd2-4979-a76a-a4f1bff37469","resolution":{"observed_at":"2026-08-04T23:40:04.326088Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:40:04.309072Z","title":"Law of large numbers for Betti numbers of homogeneous and spatially independent random simplicial complexes.Random Structures & Algorithms, 60(1):68– 105, 2022","venue":null,"work_id":"f7143628-1f64-447a-939f-dee7ab1afbe6","year":2022},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.774323Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:c3c16484727a194b70e2c9a54e4a55df2a71e50c91b4678f70b24a33f9e802f4","observation_id":"9b71da69-2403-4d9f-afbb-6ef6fb4c09b2","resolution":{"observed_at":"2026-08-04T23:40:04.313562Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:40:04.296656Z","title":"Multigraph limits and exchangeability.Acta Mathe- matica Hungarica, 130:1–34, 2011","venue":null,"work_id":"cc7508a9-e5fa-455b-b045-0436c35d8b7f","year":2011},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.777392Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:788277e7601a1f9dcf7f5472f53f84cbcc34e7423990433cfc26e0afbbc72b18","observation_id":"41fa8562-f7da-4e2a-bab8-da90ca2dbe41","resolution":{"observed_at":"2026-08-04T23:40:04.301058Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:40:04.284614Z","title":"Uniqueness of Banach space valued graphons.Journal of Math- ematical Analysis and Applications, 474(1):413–440, 2019","venue":null,"work_id":"ae71e88f-94ff-4501-964c-b840c78cf477","year":2019},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.780658Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:f8f6a981beb1c2e45e9b9f9b05b13fa2e72eb569cd3918f36f743dbe955df71a","observation_id":"49a7a055-07c2-47a7-9d87-9b7164fe0fba","resolution":{"observed_at":"2026-08-04T23:40:04.288794Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:40:04.271910Z","title":"Multigraph limits, un- bounded kernels, and Banach space decorated graphs.Journal of Functional Analysis, 282(2):109284, 2022","venue":null,"work_id":"300fed5b-cdb8-47ad-8473-2d50b7dc455b","year":2022},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.783826Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:6906332375017bd0dfbde0883838ddcf012fa599d4c80a9d6407205dbc5b576b","observation_id":"bbf1de76-ec4e-4fee-9744-a482bb24dc49","resolution":{"observed_at":"2026-08-04T23:40:04.276736Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:40:03.787043Z","title":"Distribution of the cokernels of determinantal row-sparse matrices.arXiv preprint arXiv:2505.11700, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.787043Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:23d07ee9ac0bd1f647e9baefaaa2ae7d9203d7a4b676c12fa348d44c9b57a52a","observation_id":"a9201dee-16b9-4e33-8b3b-bd9979f37720","resolution":{"observed_at":"2026-08-04T23:40:03.787043Z","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-04T23:40:03.790122Z","title":"Homological connectivity of random 2-complexes","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.790122Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:f0f4ef5fa88e0f0c08f909d9e14be4772a28a3e218fa5ab39ac47ca5a707dd23","observation_id":"16454ee3-0ef0-4184-8049-6f5ce3a03456","resolution":{"observed_at":"2026-08-04T23:40:03.790122Z","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-04T23:40:03.793281Z","title":"On the phase transition in random simplicial complexes","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.793281Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:c0e1dbe7ca6da3f13f89f5de29ed95c6a8a01d2167501c3565404b4dbb7fcd66","observation_id":"aa8988e4-89d7-4de3-86a0-747e141dbe30","resolution":{"observed_at":"2026-08-04T23:40:03.793281Z","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-04T23:40:03.796397Z","title":"Enumeration and randomized constructions of hypertrees","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.796397Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:6d64b070cd587c74f7c9581d83169a0c8d200d2135603f8c687d2c5f2ceadd97","observation_id":"1ab1b96d-d096-46bf-a70a-1e4bed7057a6","resolution":{"observed_at":"2026-08-04T23:40:03.796397Z","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-04T23:40:04.239763Z","title":"The rank of connection matrices and the dimension of graph algebras","venue":null,"work_id":"b8a2e874-d468-4859-a775-491c3b26c52c","year":2006},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.799573Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:aecf22b7c6ac6fe9da9e7630b167ad0f9a7c63edc183f1c955c7129c73fe724a","observation_id":"56de0d4a-3287-4ff4-af04-89439496a891","resolution":{"observed_at":"2026-08-04T23:40:04.243719Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:40:03.802705Z","title":"American Mathematical Soc., 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.802705Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:680c7277a3fb54f9510fb1a35cb484533a0d17a88b1a026798c3c4cbf5774ed7","observation_id":"68f6a288-9d4d-4877-bd73-a72805c73227","resolution":{"observed_at":"2026-08-04T23:40:03.802705Z","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-04T23:40:04.220564Z","title":"Generalized quasirandom graphs.Journal of Combinatorial Theory, Series B, 98(1):146–163, 2008","venue":null,"work_id":"62247095-96ce-4446-8a12-0352d8318d7e","year":2008},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.806285Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:0e58c8670ab49a0a83cd230cc5cd39de57b41cd0bff0711ef866f11215e61695","observation_id":"fe404740-9f31-47f4-956f-3ce9bdabe3df","resolution":{"observed_at":"2026-08-04T23:40:04.224531Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:40:04.208144Z","title":"Limits of dense graph sequences.Journal of Combina- torial Theory, Series B, 96(6):933–957, 2006","venue":null,"work_id":"c9e2a42d-e81b-4392-b1c2-3f2bbcb28299","year":2006},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.809514Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:93a2da572fdf6f2fa77b9cce34164f7ccb19ba2b0f237aea8f9666e9438878ca","observation_id":"150f260b-9238-4d7e-8176-0ad1432f00ac","resolution":{"observed_at":"2026-08-04T23:40:04.212699Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:40:04.196055Z","title":"Szemerédi’s lemma for the analyst.GAFA Geometric And Functional Analysis, 17:252–270, 2007","venue":null,"work_id":"7aa87c84-c53c-406c-8b98-d5ca5fea1a64","year":2007},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.812717Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:706651f2c6df673c05fbb4c4cc685c3f48e150844ae7d6a81689500e42c26379","observation_id":"c847fe70-598a-4a34-9d69-394507ee2b15","resolution":{"observed_at":"2026-08-04T23:40:04.199970Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:40:04.184755Z","title":"Contractors and connectors of graph algebras.Journal of Graph Theory, 60(1):11–30, 2009","venue":null,"work_id":"da65eb1e-112e-49b8-9aa6-d71e2eca0b6e","year":2009},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.815949Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:e62f08d87bccbb33a4b95f0ee6f60c4925b4d9800c399e2eff44d861f6b991f2","observation_id":"3f26b323-e5a8-41d9-8d03-f2cb13fbc6c2","resolution":{"observed_at":"2026-08-04T23:40:04.188777Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"1010.5155","last_updated":"2010-10-25T15:02:15Z","snapshot_observed_at":"2026-07-06T02:18:10.837335Z","submitted_at":"2010-10-25T15:02:15Z","title":"Limits of compact decorated graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1010.5155","snapshot_observed_at":"2026-08-04T23:40:03.819619Z","title":"Limits of compact decorated graphs.arXiv preprint arXiv:1010.5155, 2010","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.819619Z"},"links":{"cited_paper":"/paper/1010.5155","citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:7dee9ddbb5b7f26f667abd18b4911826cb0d17f5fdd2a3f840e4f8e123fa06da","observation_id":"c1f9c148-0fd4-4532-876c-6cbaaf506b88","resolution":{"observed_at":"2026-08-04T23:40:03.819619Z","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-04T23:40:04.171946Z","title":"Testing properties of graphs and functions.Israel Journal of Mathematics, 178(1):113–156, 2010","venue":null,"work_id":"9f329939-62aa-41dd-91fc-a3acd08f716a","year":2010},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.823233Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:b31d0fe673bd103fc27bcc4b1d666dac2fa6de3f05405ceda602d3be0f1a60f2","observation_id":"aa55c1e1-1a55-47a8-932d-f586ae46789d","resolution":{"observed_at":"2026-08-04T23:40:04.176371Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:40:03.826554Z","title":"Integral homology of random simplicial complexes","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.826554Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:2ac4b6ee4bad22e28f2b70c95ff3b9f0d4b7cdc36027cf4e8cbc033cc5a84c78","observation_id":"928367ef-7d52-4575-a946-163ea06abd86","resolution":{"observed_at":"2026-08-04T23:40:03.826554Z","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-04T23:40:04.153142Z","title":"Determinantal probability measures.Publications Mathématiques de l’IHÉS, 98:167–212, 2003","venue":null,"work_id":"56db1341-63dc-45e2-a580-bd15fff6a169","year":2003},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.829690Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:fd4f8083ccb4930eb8d7103b26c7bbca99b85ae84683c4700e7eb73d12d0e71c","observation_id":"fcc1d139-e2d6-4e04-b8ae-c905011545cf","resolution":{"observed_at":"2026-08-04T23:40:04.157152Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:40:04.141774Z","title":"Randomcomplexesandℓ 2-Bettinumbers.Journal of Topology and Analysis, 1(02):153–175, 2009","venue":null,"work_id":"fe3554e1-9212-4241-b3d4-710b914aa649","year":2009},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.832937Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:14f9186e7828c435c1962db40b1eff6abc5f0ec5c85770c594965baa31e738e0","observation_id":"b97e1db5-b827-42c0-92b2-f77b9f35f627","resolution":{"observed_at":"2026-08-04T23:40:04.145629Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:40:03.836150Z","title":"Cambridge University Press, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.836150Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:05d8aa868229928668593345abc81b79ac4480422f2f37af88322e1de2b0d07e","observation_id":"62bca616-fa02-4f7a-aa34-46cdf91df585","resolution":{"observed_at":"2026-08-04T23:40:03.836150Z","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-04T23:40:04.123190Z","title":"Homological connectivity of random k-dimensional complexes.Random Structures & Algorithms, 34(3):408–417, 2009","venue":null,"work_id":"ac8684b5-0fa6-4ce9-be96-ad2f3832eaa4","year":2009},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.839313Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:0a9c53abae0ab2bca24e1d02fc1a912f04974072998689864bfb1f16e7f5efda","observation_id":"54a28841-4fff-40ea-9744-a225379e6a2b","resolution":{"observed_at":"2026-08-04T23:40:04.127075Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:40:03.842439Z","title":"The local weak limit of k-dimensional hypertrees.Transactions of the American Mathematical Society, 375(9):6127–6154, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.842439Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:b8420a06a0d035065734bd639195fd5fb7d9995a72086f84198008d8781fe671","observation_id":"997ff468-f857-48ed-a254-8d5f65ab8797","resolution":{"observed_at":"2026-08-04T23:40:03.842439Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.02308","last_updated":"2024-04-02T21:08:43Z","snapshot_observed_at":"2026-08-09T19:15:23.201906Z","submitted_at":"2024-04-02T21:08:43Z","title":"The $2$-torsion of determinantal hypertrees is not Cohen-Lenstra","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.02308","snapshot_observed_at":"2026-08-04T23:40:03.845663Z","title":"The2-torsion of determinantal hypertrees is not Cohen-Lenstra.arXiv preprint arXiv:2404.02308, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.845663Z"},"links":{"cited_paper":"/paper/2404.02308","citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:6cc1f8128bc12e0c2d8a15ce76fd173518f9afe0abc290496ae750fe553fcb90","observation_id":"3991fd78-baa5-435e-8c48-fe01e105c83b","resolution":{"observed_at":"2026-08-04T23:40:03.845663Z","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-04T23:40:04.106555Z","title":"Coboundary expansion for the union of determinantal hypertrees.Ran- dom Structures & Algorithms, 65(4):896–914, 2024","venue":null,"work_id":"864bf669-70c5-4f88-a7ed-061fcd12a866","year":2024},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.849290Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:d6dc904a0a221c125d882df72bc66cbe4ba796a69987a3ab98c33ca8c8461bee","observation_id":"28d40546-4b44-4904-96e8-927d6d1ec952","resolution":{"observed_at":"2026-08-04T23:40:04.110168Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:40:04.094205Z","title":"Bounds on the mod 2 homology of random 2-dimensional determinantal hypertrees.Combinatorica, 45(2):17, 2025","venue":null,"work_id":"22d219c3-ba87-47e3-b0f4-50447c52e42b","year":2025},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.852473Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:2d2f460f5b444c52deec86040963b597a8629556e6f35b24f8a34940327ccc73","observation_id":"4aed65d8-bf46-454c-ad9a-f7ffc0753a42","resolution":{"observed_at":"2026-08-04T23:40:04.098327Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:40:04.083389Z","title":"Cohen–Lenstra distribution for sparse matrices with determinantal bi- asing.International Mathematics Research Notices, 2025(3), 2025","venue":null,"work_id":"a3813081-081e-452a-8eb4-365ee8f5b778","year":2025},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.855584Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:e647d6581ff2768c5581bf9579a4d58d3a2e0eaad4c3bc72b0e7bbca0fcd5a9b","observation_id":"9e590117-6511-455f-9bca-096c9441f3b6","resolution":{"observed_at":"2026-08-04T23:40:04.087142Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2506.14694","last_updated":"2026-04-23T19:25:11Z","snapshot_observed_at":"2026-08-08T16:16:05.942461Z","submitted_at":"2025-06-17T16:32:41Z","title":"The homology torsion growth of determinantal hypertrees","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.14694","snapshot_observed_at":"2026-08-04T23:40:03.858916Z","title":"The homology torsion growth of determinantal hypertrees.arXiv preprint arXiv:2506.14694, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.858916Z"},"links":{"cited_paper":"/paper/2506.14694","citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:ecaa43872b50148fad27114b3c22268c89d1a43751dfb20cd6bb9d925878ac0c","observation_id":"ca9fcb52-32de-4030-9820-53c25080646a","resolution":{"observed_at":"2026-08-04T23:40:03.858916Z","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-04T23:40:04.073095Z","title":"Distribution of labelled trees by diameter","venue":null,"work_id":"409527f2-7404-4897-9fc7-e0cccefc901f","year":1982},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.862547Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:3cacbba9dfaa0b0ea7b8f6042c2ebaedc4a1bc6d8c3d5c74b288c220b2cafa4c","observation_id":"d4c4cdf3-6078-4e6d-be6c-7cf794242021","resolution":{"observed_at":"2026-08-04T23:40:04.076737Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:40:04.062177Z","title":"Regular partitions of graphs","venue":null,"work_id":"5f1723c8-ae44-45ba-966a-a04220677179","year":1978},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.865671Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:a9f3f557d37a5b7d7f95916fd993864decf0c8a0ac06c596f5cdcaf24e2ac803","observation_id":"39a2f4c9-aaf7-4309-b87e-1a8b5b29daf1","resolution":{"observed_at":"2026-08-04T23:40:04.065753Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:40:04.050293Z","title":"Simplex links in determinantal hypertrees.Journal of Applied and Computational Topology, pages 1–26, 2024","venue":null,"work_id":"ee5bc27c-c59a-48f0-a30d-72237ac5b601","year":2024},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.868776Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:3e96ec5e043173ab1e2e3ce0368576d218c31903807c8298dbd916aa1a2c602c","observation_id":"025bec2b-9341-4b9c-b9c3-2089e99dce27","resolution":{"observed_at":"2026-08-04T23:40:04.054320Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T23:40:04.034680Z","title":"Probability theory for random groups arising in number theory","venue":null,"work_id":"bdc7fed9-5840-49b5-9c2e-7c3c5202315c","year":2022},"citing_paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-04T23:40:03.872006Z"},"links":{"citing_paper":"/paper/2509.06559"},"observation_digest":"sha256:2b689a41bdc6e6bb460a9b044f92ebafac2b1004dfd928b6e505c49f3b9855cc","observation_id":"c358434e-dfd4-4f2c-8633-88d40fb48fea","resolution":{"observed_at":"2026-08-04T23:40:04.042225Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}}],"paper":{"arxiv_id":"2509.06559","last_updated":"2025-09-08T11:18:02Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-10T02:22:49.696751Z","submitted_at":"2025-09-08T11:18:02Z","title":"Using dense graph limit theory to count cocycles of random simplicial complexes"},"reference_resolution":{"displayed":56,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":14,"verified_exact":0,"verified_fuzzy":42},"total_outbound_references":56},"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 56 of 56 outbound references and 1 inbound Pith citation observation for arXiv:2509.06559."}