{"as_of":"2026-08-13T07:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:213589ad9d37d112a3c64ea51d583dac8e33dbac25f31877b0d87890af74090f","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T12:06:03.360866Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T17:59:52.881190Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-22T12:24:51.307229Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.17613","last_updated":"2024-11-26T17:27:09Z","snapshot_observed_at":"2026-08-12T11:53:05.913943Z","submitted_at":"2024-11-26T17:27:09Z","title":"An algorithm for uniform generation of unlabeled trees (P\\'olya trees), with an extension of Cayley's formula","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.17613","snapshot_observed_at":"2026-08-10T17:59:52.881190Z","title":"An algorithm for uniform generation of unlabeled trees (P´ olya trees), with an extension of Cayley’s formula","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.11731","last_updated":"2025-03-19T20:37:26Z","snapshot_observed_at":"2026-08-10T17:53:08.543396Z","submitted_at":"2025-01-20T20:31:36Z","title":"Counting the number of group orbits by marrying the Burnside process with importance sampling","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T17:59:52.881190Z"},"links":{"cited_paper":"/paper/2411.17613","citing_paper":"/paper/2501.11731"},"observation_digest":"sha256:45701b7fd401a003a30bbd61fabc269ecf6af734a00a169605a1ad62104a8d00","observation_id":"d05fdb80-c29b-48ff-a7d8-3efdb39d21c9","resolution":{"observed_at":"2026-08-10T17:59:52.881190Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.17613","last_updated":"2024-11-26T17:27:09Z","snapshot_observed_at":"2026-08-12T11:53:05.913943Z","submitted_at":"2024-11-26T17:27:09Z","title":"An algorithm for uniform generation of unlabeled trees (P\\'olya trees), with an extension of Cayley's formula","version":1},"cited_work":{"arxiv_id":"2411.17613","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.17613","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bartholdi and P","venue":null,"work_id":"a099c967-b28a-44db-a2be-ea5eee64c89e","year":2024},"citing_paper":{"arxiv_id":"2510.25202","last_updated":"2026-05-20T17:49:28Z","snapshot_observed_at":"2026-07-06T22:34:18.297603Z","submitted_at":"2025-10-29T06:14:29Z","title":"The dual Burnside process","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-22T12:22:17.215037Z"},"links":{"cited_paper":"/paper/2411.17613","citing_paper":"/paper/2510.25202"},"observation_digest":"sha256:35a903b87eea24869c637e0119f3d31041f08d5fea88e09f3b98a23b77ae5c82","observation_id":"dd1c3e26-2565-4fb3-80dc-1cfa099b48c7","resolution":{"observed_at":"2026-05-22T12:24:51.310578Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.17613","last_updated":"2024-11-26T17:27:09Z","snapshot_observed_at":"2026-08-12T11:53:05.913943Z","submitted_at":"2024-11-26T17:27:09Z","title":"An algorithm for uniform generation of unlabeled trees (P\\'olya trees), with an extension of Cayley's formula","version":1},"cited_work":{"arxiv_id":"2411.17613","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.17613","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bartholdi and P","venue":null,"work_id":"a099c967-b28a-44db-a2be-ea5eee64c89e","year":2024},"citing_paper":{"arxiv_id":"2605.06471","last_updated":"2026-07-23T09:16:26Z","snapshot_observed_at":"2026-08-12T02:54:11.288145Z","submitted_at":"2026-05-07T15:57:26Z","title":"Leap generators for composition schemes","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-08T08:18:34.154777Z"},"links":{"cited_paper":"/paper/2411.17613","citing_paper":"/paper/2605.06471"},"observation_digest":"sha256:27e8f922bb52d6ee09f6ff1020f850d0ee2fe925a2673ffabb33fc23829ec362","observation_id":"0eb05e31-7ffb-44a3-9eea-418590ce7e76","resolution":{"observed_at":"2026-05-11T20:41:12.436344Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.17613","last_updated":"2024-11-26T17:27:09Z","snapshot_observed_at":"2026-08-12T11:53:05.913943Z","submitted_at":"2024-11-26T17:27:09Z","title":"An algorithm for uniform generation of unlabeled trees (P\\'olya trees), with an extension of Cayley's formula","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.17613","snapshot_observed_at":"2026-08-02T14:55:04.356384Z","title":"An algorithm for uniform generation of unlabeled trees (P´ olya trees), with an extension of Cayley’s formula.arXiv preprint arXiv:2411.17613, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.06471","last_updated":"2026-07-23T09:16:26Z","snapshot_observed_at":"2026-08-12T02:54:11.288145Z","submitted_at":"2026-05-07T15:57:26Z","title":"Leap generators for composition schemes","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T14:55:04.356384Z"},"links":{"cited_paper":"/paper/2411.17613","citing_paper":"/paper/2605.06471"},"observation_digest":"sha256:8206759915cfb18590bc81e64028f297a6efc358005d5442c75a7a39c651ce4e","observation_id":"7e23df76-187c-48ce-9223-bec1ce3b0a59","resolution":{"observed_at":"2026-08-02T14:55:04.356384Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2411.17613/citation-record","integrity":"/paper/2411.17613/integrity","json":"/paper/2411.17613/citation-record.json","paper":"/paper/2411.17613"},"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-12T12:06:03.681020Z","title":"Martin, The Foata-Fuchs proof of Cayley’s formula, and 24 LAURENT BARTHOLDI AND PERSI DIACONIS its probabilistic uses , Electron","venue":null,"work_id":"de87aa29-59f2-45ea-8cfe-5d88ad91e15b","year":2023},"citing_paper":{"arxiv_id":"2411.17613","last_updated":"2024-11-26T17:27:09Z","snapshot_observed_at":"2026-08-12T11:53:05.913943Z","submitted_at":"2024-11-26T17:27:09Z","title":"An algorithm for uniform generation of unlabeled trees (P\\'olya trees), with an extension of Cayley's formula","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T12:06:03.271445Z"},"links":{"citing_paper":"/paper/2411.17613"},"observation_digest":"sha256:fd8fb8eb86789faa903313cde51db728e6086e81cc1c40ea318b8d64c1528c70","observation_id":"974681dd-1c63-4bb9-ac5f-748efd1328a1","resolution":{"observed_at":"2026-08-12T12:06:03.689791Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:06:03.547971Z","title":"61 (2023), no","venue":null,"work_id":"ba532111-a00f-4c13-8ca3-13cc59b82187","year":2023},"citing_paper":{"arxiv_id":"2411.17613","last_updated":"2024-11-26T17:27:09Z","snapshot_observed_at":"2026-08-12T11:53:05.913943Z","submitted_at":"2024-11-26T17:27:09Z","title":"An algorithm for uniform generation of unlabeled trees (P\\'olya trees), with an extension of Cayley's formula","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T12:06:03.316908Z"},"links":{"citing_paper":"/paper/2411.17613"},"observation_digest":"sha256:c45335019c04cbc288ebb577577ccd3d234d37c1c8e48016404562e6633e10a1","observation_id":"3964dd04-b189-4749-b2cc-edc9595253bc","resolution":{"observed_at":"2026-08-12T12:06:03.553794Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:06:03.666223Z","title":"Andersen and Persi Diaconis, Hit and run as a unifying device , J","venue":null,"work_id":"6fdab69d-dce6-4c55-807e-ec7f423de41c","year":2007},"citing_paper":{"arxiv_id":"2411.17613","last_updated":"2024-11-26T17:27:09Z","snapshot_observed_at":"2026-08-12T11:53:05.913943Z","submitted_at":"2024-11-26T17:27:09Z","title":"An algorithm for uniform generation of unlabeled trees (P\\'olya trees), with an extension of Cayley's formula","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T12:06:03.277343Z"},"links":{"citing_paper":"/paper/2411.17613"},"observation_digest":"sha256:c75942fcadc5ef9643c92b3e394ae605f93d762f2f6bc1c1bb7a7fccdc6e1606","observation_id":"d308b87d-ff72-4d40-9dc5-bb5f7a039cc2","resolution":{"observed_at":"2026-08-12T12:06:03.671169Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.5281/zenodo.14186424","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:06:03.396036Z","title":"Graph Theory 69 (2012), no","venue":null,"work_id":"a486d11e-c8cf-4091-ba01-e91e0426ca63","year":2012},"citing_paper":{"arxiv_id":"2411.17613","last_updated":"2024-11-26T17:27:09Z","snapshot_observed_at":"2026-08-12T11:53:05.913943Z","submitted_at":"2024-11-26T17:27:09Z","title":"An algorithm for uniform generation of unlabeled trees (P\\'olya trees), with an extension of Cayley's formula","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T12:06:03.360866Z"},"links":{"citing_paper":"/paper/2411.17613"},"observation_digest":"sha256:c7e9e5839e4574ff049a3cc3e39f2f7a7d179bb5113d20de8dd46960395b466e","observation_id":"800de190-d7fe-447d-85d9-6d27f10dd97f","resolution":{"observed_at":"2026-08-12T12:06:03.403185Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:06:03.630832Z","title":"Ziegler, Proofs from The Book , sixth ed., Springer, Berlin, 2018, See corrected reprint of the 1998 original [MR1723092], Including illustrations by Karl H","venue":null,"work_id":"e00c13d2-ea61-411f-b941-80c6ccbc546d","year":2018},"citing_paper":{"arxiv_id":"2411.17613","last_updated":"2024-11-26T17:27:09Z","snapshot_observed_at":"2026-08-12T11:53:05.913943Z","submitted_at":"2024-11-26T17:27:09Z","title":"An algorithm for uniform generation of unlabeled trees (P\\'olya trees), with an extension of Cayley's formula","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T12:06:03.288508Z"},"links":{"citing_paper":"/paper/2411.17613"},"observation_digest":"sha256:7bc795256bb4c2f947fcdf62fc0a80efa09ba28ded57ce296e4b9049103fd4ff","observation_id":"b760e775-5c8e-46bd-b777-206f1f982902","resolution":{"observed_at":"2026-08-12T12:06:03.635450Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:06:03.432927Z","title":"MR 353410 [LG05] Jean-Fran¸cois Le Gall, Random trees and applications , Probab","venue":null,"work_id":"1e8a3de4-7b06-442d-b47c-ecd8c7778003","year":2005},"citing_paper":{"arxiv_id":"2411.17613","last_updated":"2024-11-26T17:27:09Z","snapshot_observed_at":"2026-08-12T11:53:05.913943Z","submitted_at":"2024-11-26T17:27:09Z","title":"An algorithm for uniform generation of unlabeled trees (P\\'olya trees), with an extension of Cayley's formula","version":1},"reference_index":131,"source":"pdf_text","source_observed_at":"2026-08-12T12:06:03.350958Z"},"links":{"citing_paper":"/paper/2411.17613"},"observation_digest":"sha256:70b35c13dbaa4c7e072eaac46def3c9d9043d78928d38b5dc1fbbf4f1a142463","observation_id":"92d9575a-ac35-4488-b47e-b05a2d68853d","resolution":{"observed_at":"2026-08-12T12:06:03.444060Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:06:03.582088Z","title":"Colbourn and Kellogg S","venue":null,"work_id":"79d29783-c832-425c-abe2-24198301531b","year":1981},"citing_paper":{"arxiv_id":"2411.17613","last_updated":"2024-11-26T17:27:09Z","snapshot_observed_at":"2026-08-12T11:53:05.913943Z","submitted_at":"2024-11-26T17:27:09Z","title":"An algorithm for uniform generation of unlabeled trees (P\\'olya trees), with an extension of Cayley's formula","version":1},"reference_index":1965,"source":"pdf_text","source_observed_at":"2026-08-12T12:06:03.307418Z"},"links":{"citing_paper":"/paper/2411.17613"},"observation_digest":"sha256:0b30124404a9b13c02997c4815fd0929c995424df6687d8f3d8a745e78131087","observation_id":"5b9dc942-c8bf-449a-8fa2-373af60d12f0","resolution":{"observed_at":"2026-08-12T12:06:03.587577Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:06:03.509066Z","title":null,"venue":null,"work_id":"7c1fe4cf-b31a-47ea-ad53-0160e93e9a61","year":2007},"citing_paper":{"arxiv_id":"2411.17613","last_updated":"2024-11-26T17:27:09Z","snapshot_observed_at":"2026-08-12T11:53:05.913943Z","submitted_at":"2024-11-26T17:27:09Z","title":"An algorithm for uniform generation of unlabeled trees (P\\'olya trees), with an extension of Cayley's formula","version":1},"reference_index":2003,"source":"pdf_text","source_observed_at":"2026-08-12T12:06:03.327261Z"},"links":{"citing_paper":"/paper/2411.17613"},"observation_digest":"sha256:527e4c37f51ffdd1bac011f50813d2c4b7dc73ee2295210732b713d1d4ceafb0","observation_id":"3fa4aac4-7c69-4d40-9012-c674691de52d","resolution":{"observed_at":"2026-08-12T12:06:03.518131Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:06:03.414317Z","title":null,"venue":null,"work_id":"171e67e4-fa95-4320-998e-10098202997d","year":2006},"citing_paper":{"arxiv_id":"2411.17613","last_updated":"2024-11-26T17:27:09Z","snapshot_observed_at":"2026-08-12T11:53:05.913943Z","submitted_at":"2024-11-26T17:27:09Z","title":"An algorithm for uniform generation of unlabeled trees (P\\'olya trees), with an extension of Cayley's formula","version":1},"reference_index":2007,"source":"pdf_text","source_observed_at":"2026-08-12T12:06:03.356056Z"},"links":{"citing_paper":"/paper/2411.17613"},"observation_digest":"sha256:661f1a306f36f85265c9c3983e1f14c48d2e98d3daf5296efcb56d9a30777466","observation_id":"6726921e-6342-4091-9839-df31040179bc","resolution":{"observed_at":"2026-08-12T12:06:03.419758Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:06:03.455426Z","title":"Kolˇ cin and Vladimir P","venue":null,"work_id":"dfb616d2-bc87-461c-9b30-1ef414b1249d","year":1974},"citing_paper":{"arxiv_id":"2411.17613","last_updated":"2024-11-26T17:27:09Z","snapshot_observed_at":"2026-08-12T11:53:05.913943Z","submitted_at":"2024-11-26T17:27:09Z","title":"An algorithm for uniform generation of unlabeled trees (P\\'olya trees), with an extension of Cayley's formula","version":1},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-12T12:06:03.344517Z"},"links":{"citing_paper":"/paper/2411.17613"},"observation_digest":"sha256:0c5545eeece4e1dcdd286d7afff99863a9bf4c18ee9a620feccf01ebc914680d","observation_id":"77813c36-82ec-455b-b246-6595d79f0fce","resolution":{"observed_at":"2026-08-12T12:06:03.465776Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:06:03.598636Z","title":null,"venue":null,"work_id":"a2cb5f71-0764-4c6f-8d07-ff25c272390a","year":2016},"citing_paper":{"arxiv_id":"2411.17613","last_updated":"2024-11-26T17:27:09Z","snapshot_observed_at":"2026-08-12T11:53:05.913943Z","submitted_at":"2024-11-26T17:27:09Z","title":"An algorithm for uniform generation of unlabeled trees (P\\'olya trees), with an extension of Cayley's formula","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-12T12:06:03.303112Z"},"links":{"citing_paper":"/paper/2411.17613"},"observation_digest":"sha256:6a6b8dbd93c71d8fe4cd6c5c6f2ef50476aed2debc6480efbc0f9d9bca1e3c0d","observation_id":"518c52b4-34a6-449f-aeb9-bdfd115afe99","resolution":{"observed_at":"2026-08-12T12:06:03.603360Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:06:03.567330Z","title":"Sci., vol","venue":null,"work_id":"64024fe6-b879-4920-b3da-968c85eb3e91","year":2009},"citing_paper":{"arxiv_id":"2411.17613","last_updated":"2024-11-26T17:27:09Z","snapshot_observed_at":"2026-08-12T11:53:05.913943Z","submitted_at":"2024-11-26T17:27:09Z","title":"An algorithm for uniform generation of unlabeled trees (P\\'olya trees), with an extension of Cayley's formula","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-12T12:06:03.312551Z"},"links":{"citing_paper":"/paper/2411.17613"},"observation_digest":"sha256:8c7d1357a4fe4c3b37baa71afd3d74d1c4a57ccc314a6145ed76def98131e2e2","observation_id":"7c188ffc-2655-42ee-b82a-307f3ad11f2a","resolution":{"observed_at":"2026-08-12T12:06:03.571952Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:06:03.611310Z","title":null,"venue":null,"work_id":"0bc7b3a4-6877-4968-828f-603eae267e35","year":2018},"citing_paper":{"arxiv_id":"2411.17613","last_updated":"2024-11-26T17:27:09Z","snapshot_observed_at":"2026-08-12T11:53:05.913943Z","submitted_at":"2024-11-26T17:27:09Z","title":"An algorithm for uniform generation of unlabeled trees (P\\'olya trees), with an extension of Cayley's formula","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-12T12:06:03.295644Z"},"links":{"citing_paper":"/paper/2411.17613"},"observation_digest":"sha256:c7e74ac864bb97b118affaccd2e2ecd2df71832a53e1f36ff4d0bb9e162d9990","observation_id":"5ecdb893-1175-4e53-8fe7-66ea4490534a","resolution":{"observed_at":"2026-08-12T12:06:03.620195Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:06:03.480950Z","title":"Burnside process","venue":null,"work_id":"e9465d14-def0-4c60-b2f8-e697f0d8a504","year":2016},"citing_paper":{"arxiv_id":"2411.17613","last_updated":"2024-11-26T17:27:09Z","snapshot_observed_at":"2026-08-12T11:53:05.913943Z","submitted_at":"2024-11-26T17:27:09Z","title":"An algorithm for uniform generation of unlabeled trees (P\\'olya trees), with an extension of Cayley's formula","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-12T12:06:03.333945Z"},"links":{"citing_paper":"/paper/2411.17613"},"observation_digest":"sha256:9565f7e0e7a00750b713168b34975b924f2a80824775899ecda46377a5767174","observation_id":"864d3bc7-18e6-42fd-8b0f-63bca40f4802","resolution":{"observed_at":"2026-08-12T12:06:03.488247Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:06:03.650929Z","title":"Leibniz Int","venue":null,"work_id":"4822f171-762a-47df-a1bc-a2d96381fcfc","year":2023},"citing_paper":{"arxiv_id":"2411.17613","last_updated":"2024-11-26T17:27:09Z","snapshot_observed_at":"2026-08-12T11:53:05.913943Z","submitted_at":"2024-11-26T17:27:09Z","title":"An algorithm for uniform generation of unlabeled trees (P\\'olya trees), with an extension of Cayley's formula","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-12T12:06:03.283964Z"},"links":{"citing_paper":"/paper/2411.17613"},"observation_digest":"sha256:c1af6141aaf96aa073ac56b4f788b21432bd9b6f392d0b24df177e4e5fdb8c59","observation_id":"2705ad96-4caa-46fd-8356-c4d753eb4bd9","resolution":{"observed_at":"2026-08-12T12:06:03.655887Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.17613","last_updated":"2024-11-26T17:27:09Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-12T11:53:05.913943Z","submitted_at":"2024-11-26T17:27:09Z","title":"An algorithm for uniform generation of unlabeled trees (P\\'olya trees), with an extension of Cayley's formula"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":1,"verified_fuzzy":10},"total_outbound_references":15},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 4 inbound Pith citation observations for arXiv:2411.17613."}