{"as_of":"2026-08-11T19:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8733a1ba4e2f624ee818feeafc40b42ccb2a1d71b7b145e4bdcd347a19236b05","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-16T16:09:22.123546Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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/2601.04193/citation-record","integrity":"/paper/2601.04193/integrity","json":"/paper/2601.04193/citation-record.json","paper":"/paper/2601.04193"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On the translocation of masses","venue":null,"work_id":"5f513d65-b43b-418e-8cf6-f90a406eec69","year":1958},"citing_paper":{"arxiv_id":"2601.04193","last_updated":"2026-04-15T13:43:34Z","snapshot_observed_at":"2026-07-31T08:55:34.432532Z","submitted_at":"2026-01-07T18:59:07Z","title":"A discrete Benamou-Brenier formulation of Optimal Transport on graphs","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-16T16:09:22.123546Z"},"links":{"citing_paper":"/paper/2601.04193"},"observation_digest":"sha256:62d3ab3c3e8463ce7771c0fb8b7b274f72d1905bf9f289a969f750dcb842bd64","observation_id":"50a0066d-64b3-4faf-9acf-c10c2a432acc","resolution":{"observed_at":"2026-05-16T16:11:05.512251Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06-05T21:23:00.469572Z","title":"Optimal transport, old and new","venue":null,"work_id":"8d83b173-0950-48a8-8c90-35d8890ae561","year":2008},"citing_paper":{"arxiv_id":"2601.04193","last_updated":"2026-04-15T13:43:34Z","snapshot_observed_at":"2026-07-31T08:55:34.432532Z","submitted_at":"2026-01-07T18:59:07Z","title":"A discrete Benamou-Brenier formulation of Optimal Transport on graphs","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-16T16:09:22.123546Z"},"links":{"citing_paper":"/paper/2601.04193"},"observation_digest":"sha256:2d2cce9ee308675bfb45d4be42a0d1265c09432caa87149c2255fa5057a76e99","observation_id":"a98b1f9a-930c-44f1-b3e0-fd6eadaa67cc","resolution":{"observed_at":"2026-05-16T16:11:05.524250Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06-05T21:23:00.469572Z","title":"Wasserstein generative ad- versarial networks","venue":null,"work_id":"7aaedafe-a799-4418-9755-735fefa9e12b","year":2017},"citing_paper":{"arxiv_id":"2601.04193","last_updated":"2026-04-15T13:43:34Z","snapshot_observed_at":"2026-07-31T08:55:34.432532Z","submitted_at":"2026-01-07T18:59:07Z","title":"A discrete Benamou-Brenier formulation of Optimal Transport on graphs","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-16T16:09:22.123546Z"},"links":{"citing_paper":"/paper/2601.04193"},"observation_digest":"sha256:6effc64eaf8152dc6562727c70ef48ba602fe6559f36c8b67f069a2b745cd84c","observation_id":"202aeb95-01d4-47b6-8cc1-079c0732b6f4","resolution":{"observed_at":"2026-05-16T16:11:05.536535Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06-05T21:23:00.469572Z","title":"Learning with a Wasserstein loss","venue":null,"work_id":"3990af67-45f6-4e74-82d6-3b4c6e11e03a","year":2015},"citing_paper":{"arxiv_id":"2601.04193","last_updated":"2026-04-15T13:43:34Z","snapshot_observed_at":"2026-07-31T08:55:34.432532Z","submitted_at":"2026-01-07T18:59:07Z","title":"A discrete Benamou-Brenier formulation of Optimal Transport on graphs","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-16T16:09:22.123546Z"},"links":{"citing_paper":"/paper/2601.04193"},"observation_digest":"sha256:f7e2d145a56b5f4e4becebfd68931d24d78d8e33c257d64eb7dd11e32efe802a","observation_id":"05568433-48a5-4d33-b7a8-e95c1f4761f2","resolution":{"observed_at":"2026-05-16T16:11:05.546796Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06-05T21:23:00.469572Z","title":"Wasserstein dependency measure for representation learning","venue":null,"work_id":"a4505cbe-e996-489d-a250-cdda445be3f4","year":2019},"citing_paper":{"arxiv_id":"2601.04193","last_updated":"2026-04-15T13:43:34Z","snapshot_observed_at":"2026-07-31T08:55:34.432532Z","submitted_at":"2026-01-07T18:59:07Z","title":"A discrete Benamou-Brenier formulation of Optimal Transport on graphs","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-16T16:09:22.123546Z"},"links":{"citing_paper":"/paper/2601.04193"},"observation_digest":"sha256:dde810aedf989cfb10745759ea6ef17feee60b60597565e71a9516e9e770b98e","observation_id":"b067b9e8-c087-4830-92a8-b002ac77b634","resolution":{"observed_at":"2026-05-16T16:11:05.530887Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06-05T21:23:00.469572Z","title":"The variational formulation of the Fokker–Planck equation","venue":null,"work_id":"06eb1540-87a1-44d5-8ae5-d0044a84a3fd","year":1998},"citing_paper":{"arxiv_id":"2601.04193","last_updated":"2026-04-15T13:43:34Z","snapshot_observed_at":"2026-07-31T08:55:34.432532Z","submitted_at":"2026-01-07T18:59:07Z","title":"A discrete Benamou-Brenier formulation of Optimal Transport on graphs","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-16T16:09:22.123546Z"},"links":{"citing_paper":"/paper/2601.04193"},"observation_digest":"sha256:b64082ba734e145a62c2b36c956704c71f36b96ac8894d9074c86661fbf6b7ce","observation_id":"5d0f326f-327d-4c36-8481-9300677ed1f4","resolution":{"observed_at":"2026-05-16T16:11:05.551741Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06-05T21:23:00.469572Z","title":"Large-scale Wasserstein gradient flows","venue":null,"work_id":"36a347b3-68cc-491f-bae8-060d2fddf0bc","year":2021},"citing_paper":{"arxiv_id":"2601.04193","last_updated":"2026-04-15T13:43:34Z","snapshot_observed_at":"2026-07-31T08:55:34.432532Z","submitted_at":"2026-01-07T18:59:07Z","title":"A discrete Benamou-Brenier formulation of Optimal Transport on graphs","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-16T16:09:22.123546Z"},"links":{"citing_paper":"/paper/2601.04193"},"observation_digest":"sha256:9796a49ee3366c531b9119ca643bd24a190f8168c69dcf9ca0f92fb60e83e202","observation_id":"e3932fed-40fd-48a3-b159-261f797fe90b","resolution":{"observed_at":"2026-05-16T16:11:05.549434Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06-05T21:23:00.469572Z","title":"A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem","venue":null,"work_id":"1ef7966d-5bc0-4081-99e6-8bb9105985e6","year":2000},"citing_paper":{"arxiv_id":"2601.04193","last_updated":"2026-04-15T13:43:34Z","snapshot_observed_at":"2026-07-31T08:55:34.432532Z","submitted_at":"2026-01-07T18:59:07Z","title":"A discrete Benamou-Brenier formulation of Optimal Transport on graphs","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-16T16:09:22.123546Z"},"links":{"citing_paper":"/paper/2601.04193"},"observation_digest":"sha256:671cb98efebf7cbd683fddbaab2e01837b71db4eb700d47ede208d552ef315a4","observation_id":"782bd5f3-e2de-4046-b569-51a5cb8eb9fb","resolution":{"observed_at":"2026-05-16T16:11:05.539266Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06-05T21:23:00.469572Z","title":"A convexity principle for interacting gases","venue":null,"work_id":"41d14429-7348-414c-8a28-bfe71836d18a","year":1997},"citing_paper":{"arxiv_id":"2601.04193","last_updated":"2026-04-15T13:43:34Z","snapshot_observed_at":"2026-07-31T08:55:34.432532Z","submitted_at":"2026-01-07T18:59:07Z","title":"A discrete Benamou-Brenier formulation of Optimal Transport on graphs","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-16T16:09:22.123546Z"},"links":{"citing_paper":"/paper/2601.04193"},"observation_digest":"sha256:5cb6b000009f1df6e4cb8041e80a517c37e2d97f75a7bd697446d970aec626ec","observation_id":"ffd4fe67-3a1e-46e9-a619-4d9501a3d8a3","resolution":{"observed_at":"2026-05-16T16:11:05.532061Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06-05T21:23:00.469572Z","title":"Gradient flows of the entropy for finite Markov chains","venue":null,"work_id":"a08f7f3e-fa30-461c-a098-119b5294f200","year":2011},"citing_paper":{"arxiv_id":"2601.04193","last_updated":"2026-04-15T13:43:34Z","snapshot_observed_at":"2026-07-31T08:55:34.432532Z","submitted_at":"2026-01-07T18:59:07Z","title":"A discrete Benamou-Brenier formulation of Optimal Transport on graphs","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-16T16:09:22.123546Z"},"links":{"citing_paper":"/paper/2601.04193"},"observation_digest":"sha256:89a4f44be940165a1cbb8127fa275f0bae4a5d5b05c1bcbbe3fc4fe6fe62b651","observation_id":"96b9b10e-ca47-4c2a-bf07-9ce4b924bf32","resolution":{"observed_at":"2026-05-16T16:11:05.536715Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06-05T21:23:00.469572Z","title":"A continuous model of transportation","venue":null,"work_id":"fdfbb4e6-3dfa-4870-a157-d36d3869d2ad","year":1952},"citing_paper":{"arxiv_id":"2601.04193","last_updated":"2026-04-15T13:43:34Z","snapshot_observed_at":"2026-07-31T08:55:34.432532Z","submitted_at":"2026-01-07T18:59:07Z","title":"A discrete Benamou-Brenier formulation of Optimal Transport on graphs","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-16T16:09:22.123546Z"},"links":{"citing_paper":"/paper/2601.04193"},"observation_digest":"sha256:513fec47f4d040ea5431afaec0e11360fd07b906c10c5a270844dd4e5adc6a5e","observation_id":"5d63d240-dc9c-4d98-b1e7-b7891a17dc64","resolution":{"observed_at":"2026-05-16T16:11:05.526555Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06-05T21:23:00.469572Z","title":"Computational optimal transport: With applications to data science","venue":null,"work_id":"b1247e3f-324f-45f4-a0e7-a4dfe1b9db74","year":2019},"citing_paper":{"arxiv_id":"2601.04193","last_updated":"2026-04-15T13:43:34Z","snapshot_observed_at":"2026-07-31T08:55:34.432532Z","submitted_at":"2026-01-07T18:59:07Z","title":"A discrete Benamou-Brenier formulation of Optimal Transport on graphs","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-16T16:09:22.123546Z"},"links":{"citing_paper":"/paper/2601.04193"},"observation_digest":"sha256:0108d7d0438f2cffe6570aea65777f4d687f1097332b1e41744fed3b1d2e3a8f","observation_id":"3e57a34b-1498-4c8e-aa67-426741c13046","resolution":{"observed_at":"2026-05-16T16:11:05.523597Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06-05T21:23:00.469572Z","title":"Discrete versions of the transport equation and the Shepp-Olkin conjecture","venue":null,"work_id":"1823b817-af8e-48ea-879d-364ade4a1de6","year":2016},"citing_paper":{"arxiv_id":"2601.04193","last_updated":"2026-04-15T13:43:34Z","snapshot_observed_at":"2026-07-31T08:55:34.432532Z","submitted_at":"2026-01-07T18:59:07Z","title":"A discrete Benamou-Brenier formulation of Optimal Transport on graphs","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-16T16:09:22.123546Z"},"links":{"citing_paper":"/paper/2601.04193"},"observation_digest":"sha256:c3e44ea7d1455986f6480876b8b6a5d7e2a06c44c04a2de976465dccba3de1a6","observation_id":"71dcf8e9-d369-4559-8f2d-bb3961c03451","resolution":{"observed_at":"2026-05-16T16:11:05.518777Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06-05T21:23:00.469572Z","title":"Some asymptotic theory for the bootstrap","venue":null,"work_id":"f0dbccb9-cb98-430b-8f9b-f45d118a3e3b","year":1981},"citing_paper":{"arxiv_id":"2601.04193","last_updated":"2026-04-15T13:43:34Z","snapshot_observed_at":"2026-07-31T08:55:34.432532Z","submitted_at":"2026-01-07T18:59:07Z","title":"A discrete Benamou-Brenier formulation of Optimal Transport on graphs","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-16T16:09:22.123546Z"},"links":{"citing_paper":"/paper/2601.04193"},"observation_digest":"sha256:84abdba4e7d629145c078a523bc534832f937fc09e3d0660d9f9941ea5672c54","observation_id":"0000fe19-a208-402f-baaa-abcaadab51bc","resolution":{"observed_at":"2026-05-16T16:11:05.534265Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06-05T21:23:00.469572Z","title":"The phylogenetic Kantorovich– Rubinstein metric for environmental sequence samples","venue":null,"work_id":"614cbd0b-ded5-4785-a0b6-48eda37fe0df","year":2012},"citing_paper":{"arxiv_id":"2601.04193","last_updated":"2026-04-15T13:43:34Z","snapshot_observed_at":"2026-07-31T08:55:34.432532Z","submitted_at":"2026-01-07T18:59:07Z","title":"A discrete Benamou-Brenier formulation of Optimal Transport on graphs","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-16T16:09:22.123546Z"},"links":{"citing_paper":"/paper/2601.04193"},"observation_digest":"sha256:9180c4c490eb24c7de375bef722c452e48f02588c623d6953d907b6b1b356537","observation_id":"93f500fa-001f-495d-8918-e0de6c9f1806","resolution":{"observed_at":"2026-05-16T16:11:05.528375Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06-05T21:23:00.469572Z","title":"Unifrac: a new phylogenetic method for comparing microbial communities","venue":null,"work_id":"76830328-1eba-40e8-bcfe-0fe5f834d349","year":2005},"citing_paper":{"arxiv_id":"2601.04193","last_updated":"2026-04-15T13:43:34Z","snapshot_observed_at":"2026-07-31T08:55:34.432532Z","submitted_at":"2026-01-07T18:59:07Z","title":"A discrete Benamou-Brenier formulation of Optimal Transport on graphs","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-16T16:09:22.123546Z"},"links":{"citing_paper":"/paper/2601.04193"},"observation_digest":"sha256:9ab251744682e59ba68f05b0bc0b6b11b3f0239c217310e32223f7197d8f0c21","observation_id":"a72149a4-3a3e-4f2e-8b3b-ac5f804fc0fb","resolution":{"observed_at":"2026-05-16T16:11:05.509033Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06-05T21:23:00.469572Z","title":"Transportation distances on the circle","venue":null,"work_id":"0ec1eb17-264d-458f-b80d-0e62a302799a","year":2011},"citing_paper":{"arxiv_id":"2601.04193","last_updated":"2026-04-15T13:43:34Z","snapshot_observed_at":"2026-07-31T08:55:34.432532Z","submitted_at":"2026-01-07T18:59:07Z","title":"A discrete Benamou-Brenier formulation of Optimal Transport on graphs","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-16T16:09:22.123546Z"},"links":{"citing_paper":"/paper/2601.04193"},"observation_digest":"sha256:5fed2b3d1984d6e8a1c8200404203d710e225a53d36a0f13365e789089f72b7b","observation_id":"80e19e68-1903-43b9-bbbf-8d56819e7303","resolution":{"observed_at":"2026-05-16T16:11:05.554074Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.07547","last_updated":"2019-11-09T09:11:17Z","snapshot_observed_at":"2026-08-10T14:32:21.515966Z","submitted_at":"2019-05-18T07:41:26Z","title":"Kantorovich distance on a finite metric space","version":5},"cited_work":{"arxiv_id":"1905.07547","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1905.07547","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Kantorovich distance on a weighted graph","venue":null,"work_id":"c89c7d75-8467-4696-a266-566cea9373cc","year":1905},"citing_paper":{"arxiv_id":"2601.04193","last_updated":"2026-04-15T13:43:34Z","snapshot_observed_at":"2026-07-31T08:55:34.432532Z","submitted_at":"2026-01-07T18:59:07Z","title":"A discrete Benamou-Brenier formulation of Optimal Transport on graphs","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-16T16:09:22.123546Z"},"links":{"cited_paper":"/paper/1905.07547","citing_paper":"/paper/2601.04193"},"observation_digest":"sha256:2b24f36d3a7eb3285b1f42d60fd2ca74e4eb26ac409019731d55c12705746e26","observation_id":"063ff913-8871-4e36-9554-36e5b3e303ea","resolution":{"observed_at":"2026-05-16T16:11:05.087217Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06-05T21:23:00.469572Z","title":"Ambrosio, E","venue":null,"work_id":"2d38d340-33da-421f-97cd-e34bd8fb4c4e","year":2021},"citing_paper":{"arxiv_id":"2601.04193","last_updated":"2026-04-15T13:43:34Z","snapshot_observed_at":"2026-07-31T08:55:34.432532Z","submitted_at":"2026-01-07T18:59:07Z","title":"A discrete Benamou-Brenier formulation of Optimal Transport on graphs","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-16T16:09:22.123546Z"},"links":{"citing_paper":"/paper/2601.04193"},"observation_digest":"sha256:4a30b1ddc08a7d00287948d3367eb4e96932f5aaf9d621326ee7cf4f046ed007","observation_id":"3e830f26-3b33-471a-9d63-d3a3cff435cc","resolution":{"observed_at":"2026-05-16T16:11:05.541604Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"1f48b97e-803c-4659-bfba-3786510d0141","year":2010},"citing_paper":{"arxiv_id":"2601.04193","last_updated":"2026-04-15T13:43:34Z","snapshot_observed_at":"2026-07-31T08:55:34.432532Z","submitted_at":"2026-01-07T18:59:07Z","title":"A discrete Benamou-Brenier formulation of Optimal Transport on graphs","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-16T16:09:22.123546Z"},"links":{"citing_paper":"/paper/2601.04193"},"observation_digest":"sha256:c68387f89f518c27b1fa05d9644db149e29896f14a11d88392384b77cc146ab0","observation_id":"1918c92b-c48d-4bd8-87fa-ed35b735e421","resolution":{"observed_at":"2026-05-16T16:11:05.543996Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2601.04193","last_updated":"2026-04-15T13:43:34Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-07-31T08:55:34.432532Z","submitted_at":"2026-01-07T18:59:07Z","title":"A discrete Benamou-Brenier formulation of Optimal Transport on graphs"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":1,"verified_fuzzy":18},"total_outbound_references":20},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:2601.04193."}