{"as_of":"2026-08-14T23:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e381d293fe339e4a43662d876419ef261d867f19b97b1ef93461c7b72c5a7da4","coverage":[{"denominator":23,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T17:59:20.723102Z","state":"measured"},{"denominator":24,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":24,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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-07T05:37:39.411598Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T05:37:39.595216Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.00799","last_updated":"2025-02-02T13:39:45Z","snapshot_observed_at":"2026-08-10T05:01:16.614755Z","submitted_at":"2025-02-02T13:39:45Z","title":"Minimal matroids in dependency posets: algorithms and applications to computing irreducible decompositions of circuit varieties","version":1},"cited_work":{"arxiv_id":"2502.00799","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.00799","snapshot_observed_at":"2026-08-07T05:37:39.595216Z","title":"Minimal matroids in dependency posets: algorithms and applications to computing irreducible decompositions of circuit varieties","venue":"math.CO","work_id":"762c8b68-4578-43f5-9a06-dbcf48a653e1","year":2025},"citing_paper":{"arxiv_id":"2506.07757","last_updated":"2025-06-09T13:37:57Z","snapshot_observed_at":"2026-08-07T05:23:59.347191Z","submitted_at":"2025-06-09T13:37:57Z","title":"Algebraic Geometry of Cactus, Pascal, and Pappus Matroids","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T05:37:39.411598Z"},"links":{"cited_paper":"/paper/2502.00799","citing_paper":"/paper/2506.07757"},"observation_digest":"sha256:eaa8da6dbfb6940aea59bf79cbafe71d9e63e8ce44b490bb6f860bcdca97b9ee","observation_id":"9a799213-d4f4-4e0b-93c6-3b0a2a6614e4","resolution":{"observed_at":"2026-08-07T05:37:39.602098Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.00799/citation-record","integrity":"/paper/2502.00799/integrity","json":"/paper/2502.00799/citation-record.json","paper":"/paper/2502.00799"},"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-09T17:59:21.056364Z","title":"Gr¨ obner bases and determinantal ideals","venue":null,"work_id":"022f180d-fbce-4cac-8ade-63ee232e63c4","year":2003},"citing_paper":{"arxiv_id":"2502.00799","last_updated":"2025-02-02T13:39:45Z","snapshot_observed_at":"2026-08-10T05:01:16.614755Z","submitted_at":"2025-02-02T13:39:45Z","title":"Minimal matroids in dependency posets: algorithms and applications to computing irreducible decompositions of circuit varieties","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-09T17:59:20.640865Z"},"links":{"citing_paper":"/paper/2502.00799"},"observation_digest":"sha256:cdddefe025b835c0a00019541e39c77263222e5fe666351f9720c1ef7cfaf77d","observation_id":"246a882d-cab7-4bf4-8d4f-50d15f480c79","resolution":{"observed_at":"2026-08-09T17:59:21.059598Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T17:59:21.047739Z","title":"Lattice conditional independence models and Hibi ideals","venue":null,"work_id":"b8c73554-1d36-4c17-aa00-421bf047ced4","year":2022},"citing_paper":{"arxiv_id":"2502.00799","last_updated":"2025-02-02T13:39:45Z","snapshot_observed_at":"2026-08-10T05:01:16.614755Z","submitted_at":"2025-02-02T13:39:45Z","title":"Minimal matroids in dependency posets: algorithms and applications to computing irreducible decompositions of circuit varieties","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-09T17:59:20.645440Z"},"links":{"citing_paper":"/paper/2502.00799"},"observation_digest":"sha256:52a7a6421504405470af127dd788d9a3f2240db9229e3143ed829de7b70c4bd2","observation_id":"304ea22f-3994-4895-8e5b-bca25da049de","resolution":{"observed_at":"2026-08-09T17:59:21.050683Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T17:59:21.039775Z","title":"Matroid stratifications of hypergraph varieties, their realization spaces, and discrete conditional independence models","venue":null,"work_id":"5a80d1e5-d3f9-42cd-9b93-20a57d0c7867","year":2022},"citing_paper":{"arxiv_id":"2502.00799","last_updated":"2025-02-02T13:39:45Z","snapshot_observed_at":"2026-08-10T05:01:16.614755Z","submitted_at":"2025-02-02T13:39:45Z","title":"Minimal matroids in dependency posets: algorithms and applications to computing irreducible decompositions of circuit varieties","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-09T17:59:20.649135Z"},"links":{"citing_paper":"/paper/2502.00799"},"observation_digest":"sha256:f05899b0ef12562617c6ef4413d22c213c0c716325aee00f1e99c598dc0b017d","observation_id":"484f22c3-ec74-4ff3-839d-6d830a25003a","resolution":{"observed_at":"2026-08-09T17:59:21.042847Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T17:59:21.031362Z","title":"Steiner systems","venue":null,"work_id":"1ebdcab9-326c-4057-b96a-8dc0ef5b0806","year":2006},"citing_paper":{"arxiv_id":"2502.00799","last_updated":"2025-02-02T13:39:45Z","snapshot_observed_at":"2026-08-10T05:01:16.614755Z","submitted_at":"2025-02-02T13:39:45Z","title":"Minimal matroids in dependency posets: algorithms and applications to computing irreducible decompositions of circuit varieties","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-09T17:59:20.652142Z"},"links":{"citing_paper":"/paper/2502.00799"},"observation_digest":"sha256:5cb39b38e699aa6cc922bdf9cecfc79e1f29632621b086a08f02dbee6ad857d2","observation_id":"d5f5ce9c-5bbe-4435-946a-b59aeff5fc2d","resolution":{"observed_at":"2026-08-09T17:59:21.034513Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.11915","last_updated":"2025-03-14T12:21:04Z","snapshot_observed_at":"2026-08-13T10:50:08.963920Z","submitted_at":"2023-07-21T21:39:24Z","title":"Singular matroid realization spaces","version":2},"cited_work":{"arxiv_id":"2307.11915","doi":null,"metadata_source":"pith","pith_arxiv_id":"2307.11915","snapshot_observed_at":"2026-08-09T17:59:20.874467Z","title":"Singular matroid realization spaces","venue":"math.AG","work_id":"ce4f87d2-5819-4eaa-ac83-9658aeac6ccd","year":2023},"citing_paper":{"arxiv_id":"2502.00799","last_updated":"2025-02-02T13:39:45Z","snapshot_observed_at":"2026-08-10T05:01:16.614755Z","submitted_at":"2025-02-02T13:39:45Z","title":"Minimal matroids in dependency posets: algorithms and applications to computing irreducible decompositions of circuit varieties","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-09T17:59:20.655596Z"},"links":{"cited_paper":"/paper/2307.11915","citing_paper":"/paper/2502.00799"},"observation_digest":"sha256:e1b64dae07028691a09e4c80d3ea356ca8311182e33708491a25f2111bc3ca59","observation_id":"8328fc52-02d6-4fb6-907b-11d6079d5488","resolution":{"observed_at":"2026-08-09T17:59:20.878627Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T17:59:21.022062Z","title":"Combinatorial geometries, convex polyhedra, and schubert cells","venue":null,"work_id":"85e556d3-d4a4-4e91-8aab-f40663920d75","year":1987},"citing_paper":{"arxiv_id":"2502.00799","last_updated":"2025-02-02T13:39:45Z","snapshot_observed_at":"2026-08-10T05:01:16.614755Z","submitted_at":"2025-02-02T13:39:45Z","title":"Minimal matroids in dependency posets: algorithms and applications to computing irreducible decompositions of circuit varieties","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-09T17:59:20.659180Z"},"links":{"citing_paper":"/paper/2502.00799"},"observation_digest":"sha256:9f46494d8b60b4342d11a93ceaf5664dfc98bd94dc0e1ccd36aebe36623ad48f","observation_id":"6f37772b-d15a-498d-bdbd-53ffa3ff287f","resolution":{"observed_at":"2026-08-09T17:59:21.025338Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T17:59:21.014111Z","title":"Rigidity matroids","venue":null,"work_id":"3b5373ef-0041-495b-a96d-ec1bcc437dfe","year":1991},"citing_paper":{"arxiv_id":"2502.00799","last_updated":"2025-02-02T13:39:45Z","snapshot_observed_at":"2026-08-10T05:01:16.614755Z","submitted_at":"2025-02-02T13:39:45Z","title":"Minimal matroids in dependency posets: algorithms and applications to computing irreducible decompositions of circuit varieties","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-09T17:59:20.663218Z"},"links":{"citing_paper":"/paper/2502.00799"},"observation_digest":"sha256:abad95f27590d502c96138c6f6a0c2e70c0840218175d8ba41dabd27cb3be0fb","observation_id":"830b5975-49fb-41cd-aca0-e6cc19c7a7ac","resolution":{"observed_at":"2026-08-09T17:59:21.016855Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T17:59:21.006417Z","title":"Graver, Brigitte Servatius, and Herman Servatius","venue":null,"work_id":"d52b2db9-bd27-4142-bc51-dbd4619bdb3b","year":1993},"citing_paper":{"arxiv_id":"2502.00799","last_updated":"2025-02-02T13:39:45Z","snapshot_observed_at":"2026-08-10T05:01:16.614755Z","submitted_at":"2025-02-02T13:39:45Z","title":"Minimal matroids in dependency posets: algorithms and applications to computing irreducible decompositions of circuit varieties","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-09T17:59:20.668040Z"},"links":{"citing_paper":"/paper/2502.00799"},"observation_digest":"sha256:cdd4788d459ad0c74bcf8ceb441e137941cbccd78484b73f4e236c38d264c3eb","observation_id":"ee1834e3-daa7-4a3a-bf42-c731b5d91d69","resolution":{"observed_at":"2026-08-09T17:59:21.009374Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T17:59:20.997270Z","title":"Configurations and Steiner systems s(2, 4, 25)","venue":null,"work_id":"d8c1cd72-140b-4db7-bc37-bc19d8dc7e8f","year":1991},"citing_paper":{"arxiv_id":"2502.00799","last_updated":"2025-02-02T13:39:45Z","snapshot_observed_at":"2026-08-10T05:01:16.614755Z","submitted_at":"2025-02-02T13:39:45Z","title":"Minimal matroids in dependency posets: algorithms and applications to computing irreducible decompositions of circuit varieties","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-09T17:59:20.671923Z"},"links":{"citing_paper":"/paper/2502.00799"},"observation_digest":"sha256:704d064e16967ceccbb7e7fa5a74785e15aec5cef0a87f6a17e7f5355bab03c0","observation_id":"54bb5f25-c456-4bb6-ae4e-15cd900f98c0","resolution":{"observed_at":"2026-08-09T17:59:21.000676Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T17:59:20.988066Z","title":"Configurations and their realization","venue":null,"work_id":"4485e7ec-43af-4b39-9a37-63645789ac25","year":1997},"citing_paper":{"arxiv_id":"2502.00799","last_updated":"2025-02-02T13:39:45Z","snapshot_observed_at":"2026-08-10T05:01:16.614755Z","submitted_at":"2025-02-02T13:39:45Z","title":"Minimal matroids in dependency posets: algorithms and applications to computing irreducible decompositions of circuit varieties","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-09T17:59:20.675754Z"},"links":{"citing_paper":"/paper/2502.00799"},"observation_digest":"sha256:c095df777612e074a0a4779f08bf078d40159c9f87ee5f571b087efac050905b","observation_id":"5307f25e-3a59-4d5d-a562-a63e7c12e693","resolution":{"observed_at":"2026-08-09T17:59:20.990830Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.00322","last_updated":"2024-02-23T02:37:30Z","snapshot_observed_at":"2026-08-14T19:42:58.154484Z","submitted_at":"2023-09-01T08:11:48Z","title":"Connectedness and combinatorial interplay in the moduli space of line arrangements","version":2},"cited_work":{"arxiv_id":"2309.00322","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.00322","snapshot_observed_at":"2026-08-09T17:59:20.858755Z","title":"Connectedness and combinatorial interplay in the moduli space of line arrangements","venue":"math.AG","work_id":"764688f6-4806-45be-9f13-1947dfe61cc9","year":2023},"citing_paper":{"arxiv_id":"2502.00799","last_updated":"2025-02-02T13:39:45Z","snapshot_observed_at":"2026-08-10T05:01:16.614755Z","submitted_at":"2025-02-02T13:39:45Z","title":"Minimal matroids in dependency posets: algorithms and applications to computing irreducible decompositions of circuit varieties","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-09T17:59:20.679227Z"},"links":{"cited_paper":"/paper/2309.00322","citing_paper":"/paper/2502.00799"},"observation_digest":"sha256:abf0c6dcc56f99070c98d684ee59805a5040fb3c3fe4b1d71134e656da93462a","observation_id":"ad7f5826-3ca8-4b41-a85f-469c2076ac41","resolution":{"observed_at":"2026-08-09T17:59:20.864955Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T17:59:20.978143Z","title":"Maximal matroids in weak order posets","venue":null,"work_id":"8979fa9b-2fb6-42ab-9ffa-f094143a6e9b","year":2024},"citing_paper":{"arxiv_id":"2502.00799","last_updated":"2025-02-02T13:39:45Z","snapshot_observed_at":"2026-08-10T05:01:16.614755Z","submitted_at":"2025-02-02T13:39:45Z","title":"Minimal matroids in dependency posets: algorithms and applications to computing irreducible decompositions of circuit varieties","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-09T17:59:20.682464Z"},"links":{"citing_paper":"/paper/2502.00799"},"observation_digest":"sha256:2f30cc39c75e1608a1a47c8e168f3e18f6fe2336c5df1074a299e0ec36ea0bd6","observation_id":"95d2fa36-356e-4cc7-a86a-e31c7e100a95","resolution":{"observed_at":"2026-08-09T17:59:20.980938Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T17:59:20.967393Z","title":"Mn¨ ev-sturmfels universality for schemes","venue":null,"work_id":"97094729-2e65-4d52-acbd-e8f035120967","year":2013},"citing_paper":{"arxiv_id":"2502.00799","last_updated":"2025-02-02T13:39:45Z","snapshot_observed_at":"2026-08-10T05:01:16.614755Z","submitted_at":"2025-02-02T13:39:45Z","title":"Minimal matroids in dependency posets: algorithms and applications to computing irreducible decompositions of circuit varieties","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-09T17:59:20.685885Z"},"links":{"citing_paper":"/paper/2502.00799"},"observation_digest":"sha256:5437fde3097271436a7b20aab6192c22984a7a6db794720cdf36e26fdb4e4a1f","observation_id":"542ddb1d-c4e1-4019-a3e2-4e579afe1125","resolution":{"observed_at":"2026-08-09T17:59:20.971796Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T17:59:20.957557Z","title":"Topics on Steiner systems","venue":null,"work_id":"409cbada-7a60-4db7-ac28-31ea8d211b49","year":2011},"citing_paper":{"arxiv_id":"2502.00799","last_updated":"2025-02-02T13:39:45Z","snapshot_observed_at":"2026-08-10T05:01:16.614755Z","submitted_at":"2025-02-02T13:39:45Z","title":"Minimal matroids in dependency posets: algorithms and applications to computing irreducible decompositions of circuit varieties","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-09T17:59:20.689113Z"},"links":{"citing_paper":"/paper/2502.00799"},"observation_digest":"sha256:f4674bba3aab30e0d4609568b59816726a02cf53ef5de093a0838de286b686b0","observation_id":"61ce7f9b-f193-4af2-8f70-2c594b7cfd37","resolution":{"observed_at":"2026-08-09T17:59:20.961078Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T17:59:20.698387Z","title":"Paving matroids: defining equations and associated varieties","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.00799","last_updated":"2025-02-02T13:39:45Z","snapshot_observed_at":"2026-08-10T05:01:16.614755Z","submitted_at":"2025-02-02T13:39:45Z","title":"Minimal matroids in dependency posets: algorithms and applications to computing irreducible decompositions of circuit varieties","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-09T17:59:20.698387Z"},"links":{"citing_paper":"/paper/2502.00799"},"observation_digest":"sha256:d6a7ccf31df88e9c4b4f079d527de17a203d3b5cdff1777bf685f7e30b22e918","observation_id":"f6d27779-526a-461b-82d5-6900d0cbccc2","resolution":{"observed_at":"2026-08-09T17:59:20.698387Z","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-09T17:59:20.948458Z","title":"On the connectivity of the realization spaces of line arrangements","venue":null,"work_id":"b4d92351-43a4-4b50-9122-825b05346d44","year":2012},"citing_paper":{"arxiv_id":"2502.00799","last_updated":"2025-02-02T13:39:45Z","snapshot_observed_at":"2026-08-10T05:01:16.614755Z","submitted_at":"2025-02-02T13:39:45Z","title":"Minimal matroids in dependency posets: algorithms and applications to computing irreducible decompositions of circuit varieties","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-09T17:59:20.701167Z"},"links":{"citing_paper":"/paper/2502.00799"},"observation_digest":"sha256:82fdf33c75fba2025f336b2a41269186fd941a92ec6b01c08f95c9e391755f90","observation_id":"75221869-114c-47dc-aadd-7dfb9f48a209","resolution":{"observed_at":"2026-08-09T17:59:20.951383Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T17:59:20.939814Z","title":"Matroid Theory","venue":null,"work_id":"37e21781-8049-4f67-a410-ef24fe09d685","year":2011},"citing_paper":{"arxiv_id":"2502.00799","last_updated":"2025-02-02T13:39:45Z","snapshot_observed_at":"2026-08-10T05:01:16.614755Z","submitted_at":"2025-02-02T13:39:45Z","title":"Minimal matroids in dependency posets: algorithms and applications to computing irreducible decompositions of circuit varieties","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-09T17:59:20.704280Z"},"links":{"citing_paper":"/paper/2502.00799"},"observation_digest":"sha256:c289e311137c1538f0a3ec67eaacad2d28b4ca24b4ec94668503aa6bb890372e","observation_id":"6ebc9a96-6f96-4129-b60c-744d1ce870ac","resolution":{"observed_at":"2026-08-09T17:59:20.942688Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T17:59:20.929009Z","title":"Piff and Dominic J.A","venue":null,"work_id":"ef893ced-55ce-44c6-9558-edf9ea2c98aa","year":1970},"citing_paper":{"arxiv_id":"2502.00799","last_updated":"2025-02-02T13:39:45Z","snapshot_observed_at":"2026-08-10T05:01:16.614755Z","submitted_at":"2025-02-02T13:39:45Z","title":"Minimal matroids in dependency posets: algorithms and applications to computing irreducible decompositions of circuit varieties","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-09T17:59:20.707065Z"},"links":{"citing_paper":"/paper/2502.00799"},"observation_digest":"sha256:2378799b02d2e60908d01970d9e7011f2ca64df86812de9222fec737502b3f94","observation_id":"7bbe20c4-7b15-4bf9-a2ed-c4ab22c71246","resolution":{"observed_at":"2026-08-09T17:59:20.932254Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T17:59:20.917977Z","title":"Rybnikov","venue":null,"work_id":"ec030673-97c2-4c8c-bd20-2a3ecfdc5f5e","year":2011},"citing_paper":{"arxiv_id":"2502.00799","last_updated":"2025-02-02T13:39:45Z","snapshot_observed_at":"2026-08-10T05:01:16.614755Z","submitted_at":"2025-02-02T13:39:45Z","title":"Minimal matroids in dependency posets: algorithms and applications to computing irreducible decompositions of circuit varieties","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-09T17:59:20.710100Z"},"links":{"citing_paper":"/paper/2502.00799"},"observation_digest":"sha256:24dde5acb7e5b3352db36ac3d2808a85f97f21ad5f1ab1c16cd1a706d77323fc","observation_id":"9078cb74-abbd-4613-9ecf-deedeeeaf555","resolution":{"observed_at":"2026-08-09T17:59:20.921901Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1910.05390","last_updated":"2021-03-28T16:10:30Z","snapshot_observed_at":"2026-07-06T08:28:54.629267Z","submitted_at":"2019-10-11T19:57:33Z","title":"The Maximum Matroid of a Graph","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.05390","snapshot_observed_at":"2026-08-09T17:59:20.713038Z","title":"The maximum matroid of a graph","venue":null,"work_id":null,"year":1910},"citing_paper":{"arxiv_id":"2502.00799","last_updated":"2025-02-02T13:39:45Z","snapshot_observed_at":"2026-08-10T05:01:16.614755Z","submitted_at":"2025-02-02T13:39:45Z","title":"Minimal matroids in dependency posets: algorithms and applications to computing irreducible decompositions of circuit varieties","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-09T17:59:20.713038Z"},"links":{"cited_paper":"/paper/1910.05390","citing_paper":"/paper/2502.00799"},"observation_digest":"sha256:ad525d66ce201d5ffa5a9b5ea2b3a92781327965b75bd8d1c92cf7d9a7a9f4be","observation_id":"53b9c98e-fe94-49c5-8f91-aec5d8c632de","resolution":{"observed_at":"2026-08-09T17:59:20.713038Z","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-09T17:59:20.908016Z","title":"Murphy’s law in algebraic geometry: badly-behaved deformation spaces","venue":null,"work_id":"cb5c7832-c58c-4159-b1f7-9e1d3803838d","year":2006},"citing_paper":{"arxiv_id":"2502.00799","last_updated":"2025-02-02T13:39:45Z","snapshot_observed_at":"2026-08-10T05:01:16.614755Z","submitted_at":"2025-02-02T13:39:45Z","title":"Minimal matroids in dependency posets: algorithms and applications to computing irreducible decompositions of circuit varieties","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-09T17:59:20.716684Z"},"links":{"citing_paper":"/paper/2502.00799"},"observation_digest":"sha256:d7269559acd6af6676e6c97fe381d4b7395995468ef5f6e5a3b7ace72bc05a03","observation_id":"8bf91acd-d8a0-42e9-a6fe-cf2b7a0f3a07","resolution":{"observed_at":"2026-08-09T17:59:20.911316Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T17:59:20.896818Z","title":"Some matroids from descrete applied geometry , volume 197","venue":null,"work_id":"09f89df2-039b-40bc-97b5-86b67b8a5523","year":1996},"citing_paper":{"arxiv_id":"2502.00799","last_updated":"2025-02-02T13:39:45Z","snapshot_observed_at":"2026-08-10T05:01:16.614755Z","submitted_at":"2025-02-02T13:39:45Z","title":"Minimal matroids in dependency posets: algorithms and applications to computing irreducible decompositions of circuit varieties","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-09T17:59:20.720511Z"},"links":{"citing_paper":"/paper/2502.00799"},"observation_digest":"sha256:d29bafc26561f09a2a5753cdc5c8434192fa993788c9e3aa3543e3bad799c58d","observation_id":"57a74af5-f2f1-46eb-8868-86f22488e3a7","resolution":{"observed_at":"2026-08-09T17:59:20.900929Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-09T17:59:20.886447Z","title":"On the abstract properties of linear dependence","venue":null,"work_id":"cb6870f1-f279-4ca8-b22d-6c432b4f05ec","year":1992},"citing_paper":{"arxiv_id":"2502.00799","last_updated":"2025-02-02T13:39:45Z","snapshot_observed_at":"2026-08-10T05:01:16.614755Z","submitted_at":"2025-02-02T13:39:45Z","title":"Minimal matroids in dependency posets: algorithms and applications to computing irreducible decompositions of circuit varieties","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-09T17:59:20.723102Z"},"links":{"citing_paper":"/paper/2502.00799"},"observation_digest":"sha256:032cae3116c612674d62954bd4c5d9a6b8283a8634be93a50ae21296fd7347af","observation_id":"4037544c-3afe-45e4-b289-0832ed8fb92d","resolution":{"observed_at":"2026-08-09T17:59:20.889730Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.00799","last_updated":"2025-02-02T13:39:45Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-10T05:01:16.614755Z","submitted_at":"2025-02-02T13:39:45Z","title":"Minimal matroids in dependency posets: algorithms and applications to computing irreducible decompositions of circuit varieties"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":2,"verified_fuzzy":19},"total_outbound_references":23},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 23 of 23 outbound references and 1 inbound Pith citation observation for arXiv:2502.00799."}