{"as_of":"2026-08-12T15:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b3b8065db529cad8accd200c13554c147e3734098559981f3cb94c3bf03d7180","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T04:15:23.978196Z","state":"measured"},{"denominator":17,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":17,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2607.23928/citation-record","integrity":"/paper/2607.23928/integrity","json":"/paper/2607.23928/citation-record.json","paper":"/paper/2607.23928"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T04:15:22.392947Z","title":"Crossing patterns of semi-algebraic sets.Journal of Combinatorial Theory, Series A, 111(2):310–326, 2005","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.23928","last_updated":"2026-08-03T15:34:06Z","snapshot_observed_at":"2026-08-10T01:18:46.725042Z","submitted_at":"2026-07-27T01:48:38Z","title":"A note on matchings and co-matchings in bipartite graphs","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T04:15:22.392947Z"},"links":{"citing_paper":"/paper/2607.23928"},"observation_digest":"sha256:13cccf0777ee8e26462cfff3feb3bbea394734dc69f0d8885151ef50a7a6836e","observation_id":"64ce8e2d-d9b5-4fb4-b4e5-397dc566df60","resolution":{"observed_at":"2026-08-04T04:15:22.392947Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.23989","last_updated":"2025-06-30T15:54:45Z","snapshot_observed_at":"2026-08-06T21:24:25.908420Z","submitted_at":"2025-06-30T15:54:45Z","title":"Factorization norms and an inverse theorem for MaxCut","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.23989","snapshot_observed_at":"2026-08-04T04:15:22.467675Z","title":"Factorization norms and an inverse theorem for MaxCut, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23928","last_updated":"2026-08-03T15:34:06Z","snapshot_observed_at":"2026-08-10T01:18:46.725042Z","submitted_at":"2026-07-27T01:48:38Z","title":"A note on matchings and co-matchings in bipartite graphs","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T04:15:22.467675Z"},"links":{"cited_paper":"/paper/2506.23989","citing_paper":"/paper/2607.23928"},"observation_digest":"sha256:22e94ab8505e976f0533db0409be4a4ae0fbd1596de88a09ce6f4dc379dfd85e","observation_id":"1f348c96-7725-4473-8025-c91e916fe92e","resolution":{"observed_at":"2026-08-04T04:15:22.467675Z","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-04T04:15:22.636369Z","title":"Pure pairs","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.23928","last_updated":"2026-08-03T15:34:06Z","snapshot_observed_at":"2026-08-10T01:18:46.725042Z","submitted_at":"2026-07-27T01:48:38Z","title":"A note on matchings and co-matchings in bipartite graphs","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T04:15:22.636369Z"},"links":{"citing_paper":"/paper/2607.23928"},"observation_digest":"sha256:815bcb09cf0ee019652c72018f7a1e1e0a04f01dd04a3e5a97e9620723c5e230","observation_id":"b9773393-2193-4a97-9613-d09255b81edb","resolution":{"observed_at":"2026-08-04T04:15:22.636369Z","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-04T04:15:22.745614Z","title":"Ramsey-type theorems.Discrete Applied Mathematics, 25(1):37–52, 1989","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2607.23928","last_updated":"2026-08-03T15:34:06Z","snapshot_observed_at":"2026-08-10T01:18:46.725042Z","submitted_at":"2026-07-27T01:48:38Z","title":"A note on matchings and co-matchings in bipartite graphs","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T04:15:22.745614Z"},"links":{"citing_paper":"/paper/2607.23928"},"observation_digest":"sha256:0d371bcf910317fd2876ccb65ecda1e41863fb790e804196fe6da344f551cd8c","observation_id":"f7f2756f-8c2c-4aeb-8819-e80e4a5269ce","resolution":{"observed_at":"2026-08-04T04:15:22.745614Z","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-04T04:15:22.846211Z","title":"Springer Berlin Heidelberg, Berlin, Heidelberg, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.23928","last_updated":"2026-08-03T15:34:06Z","snapshot_observed_at":"2026-08-10T01:18:46.725042Z","submitted_at":"2026-07-27T01:48:38Z","title":"A note on matchings and co-matchings in bipartite graphs","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T04:15:22.846211Z"},"links":{"citing_paper":"/paper/2607.23928"},"observation_digest":"sha256:f0b34320b7140134589d41fa9a7f0c7b619754192d5ab29aa18950dba25243c0","observation_id":"d3015339-f209-4930-89e3-d7861a71a5c9","resolution":{"observed_at":"2026-08-04T04:15:22.846211Z","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-04T04:15:22.859055Z","title":"En route to the log-rank conjecture: New reductions and equivalent formulations","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.23928","last_updated":"2026-08-03T15:34:06Z","snapshot_observed_at":"2026-08-10T01:18:46.725042Z","submitted_at":"2026-07-27T01:48:38Z","title":"A note on matchings and co-matchings in bipartite graphs","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T04:15:22.859055Z"},"links":{"citing_paper":"/paper/2607.23928"},"observation_digest":"sha256:cf6837ecc591c62ed6cd6ec08cd4c3894a9e3b102c6e34068901d18f972ad88b","observation_id":"54546f34-db2b-4b75-914f-d71e8329b5cc","resolution":{"observed_at":"2026-08-04T04:15:22.859055Z","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-04T04:15:22.995801Z","title":"Deterministic communication vs","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.23928","last_updated":"2026-08-03T15:34:06Z","snapshot_observed_at":"2026-08-10T01:18:46.725042Z","submitted_at":"2026-07-27T01:48:38Z","title":"A note on matchings and co-matchings in bipartite graphs","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T04:15:22.995801Z"},"links":{"citing_paper":"/paper/2607.23928"},"observation_digest":"sha256:b1033ceb3925bff37b9842296374b3f64ba0885154a9b9b0531538b48d63dee2","observation_id":"d2ddd066-be15-435e-8ef1-d7de9ca89ce4","resolution":{"observed_at":"2026-08-04T04:15:22.995801Z","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-04T04:15:23.114193Z","title":"Geometric rank of tensors and subrank of matrix multiplication.Discrete Analysis, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23928","last_updated":"2026-08-03T15:34:06Z","snapshot_observed_at":"2026-08-10T01:18:46.725042Z","submitted_at":"2026-07-27T01:48:38Z","title":"A note on matchings and co-matchings in bipartite graphs","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T04:15:23.114193Z"},"links":{"citing_paper":"/paper/2607.23928"},"observation_digest":"sha256:64a7a1826b4cdc5b974767a22cbf690f18fc7ec7f69e158b02111c65f730cc69","observation_id":"51e40843-b81f-4108-b152-e8783cbb6149","resolution":{"observed_at":"2026-08-04T04:15:23.114193Z","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-04T04:15:23.228880Z","title":"Communication is bounded by root of rank.J","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.23928","last_updated":"2026-08-03T15:34:06Z","snapshot_observed_at":"2026-08-10T01:18:46.725042Z","submitted_at":"2026-07-27T01:48:38Z","title":"A note on matchings and co-matchings in bipartite graphs","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T04:15:23.228880Z"},"links":{"citing_paper":"/paper/2607.23928"},"observation_digest":"sha256:8d4b884b6176ef81ebd3d35d7059bb030488b720ff46ded60ab90b5d9d671d2e","observation_id":"d69e94d0-f0ee-4d07-881f-6292aa80ef44","resolution":{"observed_at":"2026-08-04T04:15:23.228880Z","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-04T04:15:23.352042Z","title":"Lattices, mobius functions and communications complexity","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2607.23928","last_updated":"2026-08-03T15:34:06Z","snapshot_observed_at":"2026-08-10T01:18:46.725042Z","submitted_at":"2026-07-27T01:48:38Z","title":"A note on matchings and co-matchings in bipartite graphs","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T04:15:23.352042Z"},"links":{"citing_paper":"/paper/2607.23928"},"observation_digest":"sha256:8ee34c01cc9222a4e969a4ad92ca6742323ec0d645e681553dd7c215e862ac29","observation_id":"12ef8bc2-e680-4627-a1cd-290f1c216b20","resolution":{"observed_at":"2026-08-04T04:15:23.352042Z","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-04T04:15:23.474092Z","title":"The partition rank of a tensor andk-right corners inF qn.Journal of Combina- torial Theory, Series A, 174:105190, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.23928","last_updated":"2026-08-03T15:34:06Z","snapshot_observed_at":"2026-08-10T01:18:46.725042Z","submitted_at":"2026-07-27T01:48:38Z","title":"A note on matchings and co-matchings in bipartite graphs","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T04:15:23.474092Z"},"links":{"citing_paper":"/paper/2607.23928"},"observation_digest":"sha256:ec08358115e4bf9c7c2f77876ab932232074bc8292047b06dba105c4374afac2","observation_id":"a843b368-e435-4d3a-b5fb-3c4d0f4055d5","resolution":{"observed_at":"2026-08-04T04:15:23.474092Z","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-04T04:15:23.561088Z","title":"On rank vs","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2607.23928","last_updated":"2026-08-03T15:34:06Z","snapshot_observed_at":"2026-08-10T01:18:46.725042Z","submitted_at":"2026-07-27T01:48:38Z","title":"A note on matchings and co-matchings in bipartite graphs","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T04:15:23.561088Z"},"links":{"citing_paper":"/paper/2607.23928"},"observation_digest":"sha256:dca7297c8029cad6ff24da118e3a1c3e693611d031f2c866e00f64f3a90d1df1","observation_id":"736709b9-f1d5-484e-a32c-6afaf62253d3","resolution":{"observed_at":"2026-08-04T04:15:23.561088Z","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-04T04:15:23.633875Z","title":"Payne and Joseph A","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.23928","last_updated":"2026-08-03T15:34:06Z","snapshot_observed_at":"2026-08-10T01:18:46.725042Z","submitted_at":"2026-07-27T01:48:38Z","title":"A note on matchings and co-matchings in bipartite graphs","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T04:15:23.633875Z"},"links":{"citing_paper":"/paper/2607.23928"},"observation_digest":"sha256:664977380505661acbe147e5f81572f911ed9eb8383fbc5100efba29065f8f9b","observation_id":"12197fca-2df1-48b0-b3c4-e2f6fa4ce931","resolution":{"observed_at":"2026-08-04T04:15:23.633875Z","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-04T04:15:23.719146Z","title":"Pure pairs","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23928","last_updated":"2026-08-03T15:34:06Z","snapshot_observed_at":"2026-08-10T01:18:46.725042Z","submitted_at":"2026-07-27T01:48:38Z","title":"A note on matchings and co-matchings in bipartite graphs","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T04:15:23.719146Z"},"links":{"citing_paper":"/paper/2607.23928"},"observation_digest":"sha256:1d59900e810df20cf943f6b79e088e61ce43c643978a40ebc560c39bb2f24d65","observation_id":"12d2f624-95fb-40f6-aae1-9b8494fce8c5","resolution":{"observed_at":"2026-08-04T04:15:23.719146Z","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-04T04:15:23.792952Z","title":"Matrix discrepancy and the log-rank conjecture.Math","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23928","last_updated":"2026-08-03T15:34:06Z","snapshot_observed_at":"2026-08-10T01:18:46.725042Z","submitted_at":"2026-07-27T01:48:38Z","title":"A note on matchings and co-matchings in bipartite graphs","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T04:15:23.792952Z"},"links":{"citing_paper":"/paper/2607.23928"},"observation_digest":"sha256:d49f985174c3745904caa4b6ded6085183f1424ce105a505e3a78c6bc6087336","observation_id":"f8f0d36c-4a35-43f9-9f21-8529555996ad","resolution":{"observed_at":"2026-08-04T04:15:23.792952Z","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-04T04:15:23.903321Z","title":"A symmetric formulation of the Croot-Lev-Pach-Ellenberg-Gijswijt capset bound,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23928","last_updated":"2026-08-03T15:34:06Z","snapshot_observed_at":"2026-08-10T01:18:46.725042Z","submitted_at":"2026-07-27T01:48:38Z","title":"A note on matchings and co-matchings in bipartite graphs","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T04:15:23.903321Z"},"links":{"citing_paper":"/paper/2607.23928"},"observation_digest":"sha256:6410504459a0c443d9224cf20b66d748c402190a67d0e724041b27a5934180b8","observation_id":"f7a58618-76d2-4025-bc99-df546d322eaf","resolution":{"observed_at":"2026-08-04T04:15:23.903321Z","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-04T04:15:23.978196Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.23928","last_updated":"2026-08-03T15:34:06Z","snapshot_observed_at":"2026-08-10T01:18:46.725042Z","submitted_at":"2026-07-27T01:48:38Z","title":"A note on matchings and co-matchings in bipartite graphs","version":2},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-04T04:15:23.978196Z"},"links":{"citing_paper":"/paper/2607.23928"},"observation_digest":"sha256:4b6b0b3f95c15c414077117af46e5d8e9b35b7cb47557bd5dd800d17cd2b41bc","observation_id":"f1625e4e-41bf-4bb2-9eb8-023a90b1e685","resolution":{"observed_at":"2026-08-04T04:15:23.978196Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.23928","last_updated":"2026-08-03T15:34:06Z","latest_version":2,"primary_category":"math.CO","snapshot_observed_at":"2026-08-10T01:18:46.725042Z","submitted_at":"2026-07-27T01:48:38Z","title":"A note on matchings and co-matchings in bipartite graphs"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":17,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":17},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 0 inbound Pith citation observations for arXiv:2607.23928."}