{"as_of":"2026-08-14T10:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7403c2149f4917a1c7422e0dad58823fa55de428b2be738cdca9e507a7bd9bbe","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-12T20:32:27.819377Z","state":"measured"},{"denominator":16,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":16,"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-06T17:15:45.853300Z","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-06T17:15:46.139792Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.09791","last_updated":"2024-11-14T20:05:04Z","snapshot_observed_at":"2026-08-12T20:16:21.418591Z","submitted_at":"2024-11-14T20:05:04Z","title":"Generating strongly 2-connected digraphs","version":1},"cited_work":{"arxiv_id":"2411.09791","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.09791","snapshot_observed_at":"2026-08-06T17:15:46.139792Z","title":"Generating strongly 2-connected digraphs","venue":"math.CO","work_id":"f27cf51d-8291-4ce8-b8b4-a18621111811","year":2024},"citing_paper":{"arxiv_id":"2507.11814","last_updated":"2025-07-16T00:24:53Z","snapshot_observed_at":"2026-08-13T15:56:16.574471Z","submitted_at":"2025-07-16T00:24:53Z","title":"Unavoidable butterfly minors in digraphs of large cycle rank","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T17:15:45.853300Z"},"links":{"cited_paper":"/paper/2411.09791","citing_paper":"/paper/2507.11814"},"observation_digest":"sha256:970c62fe09f1491fde74f2fb7f99c823c138086a9ef2978633b9a91eb97a4d0e","observation_id":"f026522d-937e-444d-b58d-32199a776b86","resolution":{"observed_at":"2026-08-06T17:15:46.149756Z","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/2411.09791/citation-record","integrity":"/paper/2411.09791/integrity","json":"/paper/2411.09791/citation-record.json","paper":"/paper/2411.09791"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1603.02504","last_updated":"2016-03-14T09:04:42Z","snapshot_observed_at":"2026-08-09T23:11:40.081953Z","submitted_at":"2016-03-08T12:48:38Z","title":"The Erdos-Posa Property for Directed Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1603.02504","snapshot_observed_at":"2026-08-12T20:32:27.754860Z","title":"T he E rdos- P \\'o sa property for directed graphs","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2411.09791","last_updated":"2024-11-14T20:05:04Z","snapshot_observed_at":"2026-08-12T20:16:21.418591Z","submitted_at":"2024-11-14T20:05:04Z","title":"Generating strongly 2-connected digraphs","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-12T20:32:27.754860Z"},"links":{"cited_paper":"/paper/1603.02504","citing_paper":"/paper/2411.09791"},"observation_digest":"sha256:76df9f25f305a3196d67f15bc0b439a3e7ecfb12b4ea0a800a3421eb45641846","observation_id":"f7b68aa9-2443-44a7-9665-e6c72b40caff","resolution":{"observed_at":"2026-08-12T20:32:27.754860Z","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-12T20:32:28.277339Z","title":"Barnette and Branko Gr\\\" u nbaum","venue":null,"work_id":"05aaaed7-feb6-4a71-9cc0-a232c4eb1cec","year":1968},"citing_paper":{"arxiv_id":"2411.09791","last_updated":"2024-11-14T20:05:04Z","snapshot_observed_at":"2026-08-12T20:16:21.418591Z","submitted_at":"2024-11-14T20:05:04Z","title":"Generating strongly 2-connected digraphs","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-12T20:32:27.760144Z"},"links":{"citing_paper":"/paper/2411.09791"},"observation_digest":"sha256:11b2aef1877957d0f4301ce1125af14f0394e61fcc583b7d70cd08882ef11796","observation_id":"3d029ca5-4bf8-4080-a745-727a38a48157","resolution":{"observed_at":"2026-08-12T20:32:28.281686Z","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-12T20:32:28.259624Z","title":"Matchings, matroids and unimodular matrices","venue":null,"work_id":"e2271a66-8c34-4da3-abdc-0fb99d468740","year":1996},"citing_paper":{"arxiv_id":"2411.09791","last_updated":"2024-11-14T20:05:04Z","snapshot_observed_at":"2026-08-12T20:16:21.418591Z","submitted_at":"2024-11-14T20:05:04Z","title":"Generating strongly 2-connected digraphs","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-12T20:32:27.764382Z"},"links":{"citing_paper":"/paper/2411.09791"},"observation_digest":"sha256:082318b8b35bc76cb03a9947a012af3b75f86b587608381a0b524a337bf7eb9a","observation_id":"fd043682-cd43-4263-8c60-5248584f8feb","resolution":{"observed_at":"2026-08-12T20:32:28.264950Z","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-12T20:32:27.768384Z","title":"Circle graph obstructions under pivoting","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2411.09791","last_updated":"2024-11-14T20:05:04Z","snapshot_observed_at":"2026-08-12T20:16:21.418591Z","submitted_at":"2024-11-14T20:05:04Z","title":"Generating strongly 2-connected digraphs","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-12T20:32:27.768384Z"},"links":{"citing_paper":"/paper/2411.09791"},"observation_digest":"sha256:39173d2bb3307949c2d335226d2924eca1a6760098948f8069f95ca94480ea70","observation_id":"37bbf161-8701-4fea-a3bd-ca2171e80079","resolution":{"observed_at":"2026-08-12T20:32:27.768384Z","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-12T20:32:27.773129Z","title":null,"venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2411.09791","last_updated":"2024-11-14T20:05:04Z","snapshot_observed_at":"2026-08-12T20:16:21.418591Z","submitted_at":"2024-11-14T20:05:04Z","title":"Generating strongly 2-connected digraphs","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-12T20:32:27.773129Z"},"links":{"citing_paper":"/paper/2411.09791"},"observation_digest":"sha256:e45685cec1ea6c5de1568baad0e39f4d94a0c9a2d1ce4d45abcc496228eb6c8c","observation_id":"7a62bbe7-9c17-4484-953f-0121385c8aed","resolution":{"observed_at":"2026-08-12T20:32:27.773129Z","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-12T20:32:27.777693Z","title":"Matching structure and the matching lattice","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2411.09791","last_updated":"2024-11-14T20:05:04Z","snapshot_observed_at":"2026-08-12T20:16:21.418591Z","submitted_at":"2024-11-14T20:05:04Z","title":"Generating strongly 2-connected digraphs","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-12T20:32:27.777693Z"},"links":{"citing_paper":"/paper/2411.09791"},"observation_digest":"sha256:e06ea97217f2364c75211a9a113701859906c545a205fc2e82617a0067706b50","observation_id":"750538ab-cf97-448d-9edc-5452c7b6711b","resolution":{"observed_at":"2026-08-12T20:32:27.777693Z","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":"10.1002/jgt.1029","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-13T11:03:48.094449Z","title":"Brace generation","venue":"Journal of Graph Theory","work_id":"838bf021-a746-4acd-a33d-4152c3432f1c","year":2001},"citing_paper":{"arxiv_id":"2411.09791","last_updated":"2024-11-14T20:05:04Z","snapshot_observed_at":"2026-08-12T20:16:21.418591Z","submitted_at":"2024-11-14T20:05:04Z","title":"Generating strongly 2-connected digraphs","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-12T20:32:27.782345Z"},"links":{"citing_paper":"/paper/2411.09791"},"observation_digest":"sha256:171675821a9ea29f1f5d92e55cac35111f77c71de50ba10548b4a10f643aa734","observation_id":"99c5686f-8356-4370-a2d3-f138bc6943aa","resolution":{"observed_at":"2026-08-12T20:32:27.894729Z","resolver_source":"doi","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T20:32:27.786988Z","title":"Paths and topological minors in directed and undirected graphs","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.09791","last_updated":"2024-11-14T20:05:04Z","snapshot_observed_at":"2026-08-12T20:16:21.418591Z","submitted_at":"2024-11-14T20:05:04Z","title":"Generating strongly 2-connected digraphs","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-12T20:32:27.786988Z"},"links":{"citing_paper":"/paper/2411.09791"},"observation_digest":"sha256:c31d08882b0aafa500b713ea0e69c69167e9f8938f6fc918c38b1d021dcf9ccb","observation_id":"fc67c64e-71c3-4286-aaaf-21ddc4a34ad6","resolution":{"observed_at":"2026-08-12T20:32:27.786988Z","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-12T20:32:27.792365Z","title":"Generating bricks","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2411.09791","last_updated":"2024-11-14T20:05:04Z","snapshot_observed_at":"2026-08-12T20:16:21.418591Z","submitted_at":"2024-11-14T20:05:04Z","title":"Generating strongly 2-connected digraphs","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-12T20:32:27.792365Z"},"links":{"citing_paper":"/paper/2411.09791"},"observation_digest":"sha256:4c20edd6ec6fadabb16f472867ebe4a408af00bdca74412aacce953b0d44fa27","observation_id":"963fd4da-1047-4da2-818a-a64ac2a01164","resolution":{"observed_at":"2026-08-12T20:32:27.792365Z","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-12T20:32:27.796750Z","title":null,"venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2411.09791","last_updated":"2024-11-14T20:05:04Z","snapshot_observed_at":"2026-08-12T20:16:21.418591Z","submitted_at":"2024-11-14T20:05:04Z","title":"Generating strongly 2-connected digraphs","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-12T20:32:27.796750Z"},"links":{"citing_paper":"/paper/2411.09791"},"observation_digest":"sha256:53fe52d4f514b36893f0764b1ba2911474b51f74577abb2e71eaf73ca288bbc1","observation_id":"cf7cb463-39dd-4f42-8b97-eb785b574190","resolution":{"observed_at":"2026-08-12T20:32:27.796750Z","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-12T20:32:27.800978Z","title":"Characterization of even directed graphs","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2411.09791","last_updated":"2024-11-14T20:05:04Z","snapshot_observed_at":"2026-08-12T20:16:21.418591Z","submitted_at":"2024-11-14T20:05:04Z","title":"Generating strongly 2-connected digraphs","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-12T20:32:27.800978Z"},"links":{"citing_paper":"/paper/2411.09791"},"observation_digest":"sha256:5414d93003fdf3163e5e1f258d6c31f87380aec2dbdd9a213514afa73b6c96c4","observation_id":"8d3b99f4-aaa8-42e0-9253-509b30d635b2","resolution":{"observed_at":"2026-08-12T20:32:27.800978Z","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-12T20:32:28.237844Z","title":null,"venue":null,"work_id":"870a3ed2-21c8-44b1-856e-24f6c50855c9","year":1975},"citing_paper":{"arxiv_id":"2411.09791","last_updated":"2024-11-14T20:05:04Z","snapshot_observed_at":"2026-08-12T20:16:21.418591Z","submitted_at":"2024-11-14T20:05:04Z","title":"Generating strongly 2-connected digraphs","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-12T20:32:27.805548Z"},"links":{"citing_paper":"/paper/2411.09791"},"observation_digest":"sha256:de836ed0e14764067983da44607330fa386150bfcc0caa66c40796dc60f2157c","observation_id":"389eb564-5825-4068-9bb3-637ed5d253e7","resolution":{"observed_at":"2026-08-12T20:32:28.242307Z","resolver_source":"raw_fallback","status":"unresolved"},"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-12T20:32:28.223941Z","title":null,"venue":null,"work_id":"f76cb34e-8ed4-4b09-b0a9-a19c839f002b","year":1961},"citing_paper":{"arxiv_id":"2411.09791","last_updated":"2024-11-14T20:05:04Z","snapshot_observed_at":"2026-08-12T20:16:21.418591Z","submitted_at":"2024-11-14T20:05:04Z","title":"Generating strongly 2-connected digraphs","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-12T20:32:27.809825Z"},"links":{"citing_paper":"/paper/2411.09791"},"observation_digest":"sha256:5aa0e6a0cc3f4325642c29d67d3a1d8ffc609102e00d9bed89971b807c402e84","observation_id":"bd35e394-594b-4356-bd42-ca92ae0c5e39","resolution":{"observed_at":"2026-08-12T20:32:28.228478Z","resolver_source":"raw_fallback","status":"unresolved"},"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-12T20:32:27.815076Z","title":"Non-separable and planar graphs","venue":null,"work_id":null,"year":1932},"citing_paper":{"arxiv_id":"2411.09791","last_updated":"2024-11-14T20:05:04Z","snapshot_observed_at":"2026-08-12T20:16:21.418591Z","submitted_at":"2024-11-14T20:05:04Z","title":"Generating strongly 2-connected digraphs","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-12T20:32:27.815076Z"},"links":{"citing_paper":"/paper/2411.09791"},"observation_digest":"sha256:f6c2127d9fbaec2c0e86576541c4053f77ede917d3fce913017b6fd9179a616a","observation_id":"e6a805e6-a4b0-42c1-ad33-3239f7f16454","resolution":{"observed_at":"2026-08-12T20:32:27.815076Z","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":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T20:32:28.195686Z","title":"Digraphs of directed treewidth one","venue":null,"work_id":"eb613292-2745-4249-9623-4b451e3ccf08","year":2020},"citing_paper":{"arxiv_id":"2411.09791","last_updated":"2024-11-14T20:05:04Z","snapshot_observed_at":"2026-08-12T20:16:21.418591Z","submitted_at":"2024-11-14T20:05:04Z","title":"Generating strongly 2-connected digraphs","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-12T20:32:27.819377Z"},"links":{"citing_paper":"/paper/2411.09791"},"observation_digest":"sha256:4075a4d51cb32f02b780789ddbae173afb96e4662c1094dcdebc1eb5929fc267","observation_id":"7d226138-cde3-4d89-aee4-e24341ba5a44","resolution":{"observed_at":"2026-08-12T20:32:28.200107Z","resolver_source":"arxiv_id_nonexistent","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"}}],"paper":{"arxiv_id":"2411.09791","last_updated":"2024-11-14T20:05:04Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-12T20:16:21.418591Z","submitted_at":"2024-11-14T20:05:04Z","title":"Generating strongly 2-connected digraphs"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":2,"verified_fuzzy":2},"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-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 15 of 15 outbound references and 1 inbound Pith citation observation for arXiv:2411.09791."}