{"as_of":"2026-08-10T12:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:be239222e435a9d81d013844e528b99e344de3db8ec7d419aaebf2df7f7889cd","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T20:29:46.049417Z","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-05-14T20:42:57.944470Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1207.6381","last_updated":"2012-07-26T19:33:22Z","snapshot_observed_at":"2026-07-06T02:52:39.013453Z","submitted_at":"2012-07-26T19:33:22Z","title":"Efficient implementations of minimum-cost flow algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1207.6381","snapshot_observed_at":"2026-08-08T20:29:46.049417Z","title":"Efficient implementations of minimum-cost flow algo- rithms,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2502.05063","last_updated":"2025-02-07T16:35:06Z","snapshot_observed_at":"2026-08-10T02:29:37.882128Z","submitted_at":"2025-02-07T16:35:06Z","title":"Computing and Learning on Combinatorial Data","version":1},"reference_index":174,"source":"pdf_text","source_observed_at":"2026-08-08T20:29:46.049417Z"},"links":{"cited_paper":"/paper/1207.6381","citing_paper":"/paper/2502.05063"},"observation_digest":"sha256:56e51c4cd154bd71f4ff716bc2d0555c229a662e1c15b5beaca83030a6216e7e","observation_id":"0665130c-781b-4c83-9825-8d4b5406ca55","resolution":{"observed_at":"2026-08-08T20:29:46.049417Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1207.6381","last_updated":"2012-07-26T19:33:22Z","snapshot_observed_at":"2026-07-06T02:52:39.013453Z","submitted_at":"2012-07-26T19:33:22Z","title":"Efficient implementations of minimum-cost flow algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1207.6381","snapshot_observed_at":"2026-08-05T17:25:56.149392Z","title":"arXiv preprint arXiv:1207.6381 (2012)","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2508.16384","last_updated":"2025-08-22T13:38:49Z","snapshot_observed_at":"2026-08-09T23:03:20.420739Z","submitted_at":"2025-08-22T13:38:49Z","title":"Automata Learning -- Expect Delays!","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-05T17:25:56.149392Z"},"links":{"cited_paper":"/paper/1207.6381","citing_paper":"/paper/2508.16384"},"observation_digest":"sha256:581b75b3d997eb0c0e32e19019114923001f0b7abe99d9b95f79dfe8d37f803e","observation_id":"11dbd2ea-f3fd-4971-94c7-777c7dcca904","resolution":{"observed_at":"2026-08-05T17:25:56.149392Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1207.6381","last_updated":"2012-07-26T19:33:22Z","snapshot_observed_at":"2026-07-06T02:52:39.013453Z","submitted_at":"2012-07-26T19:33:22Z","title":"Efficient implementations of minimum-cost flow algorithms","version":1},"cited_work":{"arxiv_id":"1207.6381","doi":null,"metadata_source":"pith","pith_arxiv_id":"1207.6381","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efficient implementations of minimum-cost flow algorithms","venue":"cs.DM","work_id":"d078cab3-bcf5-4665-b997-599f66ace851","year":2012},"citing_paper":{"arxiv_id":"2605.13455","last_updated":"2026-05-26T01:11:26Z","snapshot_observed_at":"2026-08-02T19:48:14.039053Z","submitted_at":"2026-05-13T12:49:22Z","title":"Bayesian In Vivo Tracking of Synapses using Joint Poisson Deconvolution and Diffeomorphic Registration","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-05-14T20:40:38.573075Z"},"links":{"cited_paper":"/paper/1207.6381","citing_paper":"/paper/2605.13455"},"observation_digest":"sha256:5d64c7dc36d5a539ddce6197036e0157e958ce834166966a5b94652a1f23b26a","observation_id":"dbff8350-95e7-4de6-b586-508e2876cb66","resolution":{"observed_at":"2026-05-14T20:42:57.947280Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1207.6381/citation-record","integrity":"/paper/1207.6381/integrity","json":"/paper/1207.6381/citation-record.json","paper":"/paper/1207.6381"},"outbound":[],"paper":{"arxiv_id":"1207.6381","last_updated":"2012-07-26T19:33:22Z","latest_version":1,"primary_category":"cs.DM","snapshot_observed_at":"2026-07-06T02:52:39.013453Z","submitted_at":"2012-07-26T19:33:22Z","title":"Efficient implementations of minimum-cost flow algorithms"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1207.6381."}