{"as_of":"2026-08-13T18:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8d9c10db1f5bb4b6a6728f68847bed403194f2fe4e30d1533c1a6fe6b4470e65","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T03:10:16.247862Z","state":"measured"},{"denominator":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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.25238/citation-record","integrity":"/paper/2607.25238/integrity","json":"/paper/2607.25238/citation-record.json","paper":"/paper/2607.25238"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T03:10:16.063299Z","title":"Barab´ asi,Network Science; Cambridge University Press: Cambridge, UK, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.25238","last_updated":"2026-07-28T03:28:16Z","snapshot_observed_at":"2026-08-03T17:24:08.730169Z","submitted_at":"2026-07-28T03:28:16Z","title":"Optimization of the directed spanning trees using the weighted matroid intersection algorithm","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T03:10:16.063299Z"},"links":{"citing_paper":"/paper/2607.25238"},"observation_digest":"sha256:1b32df5f75d59123f7e419c7152b3b257bcd9abafa39a62476409410090c6a09","observation_id":"c94f767c-2f20-45c3-92ac-355c25ebc221","resolution":{"observed_at":"2026-08-01T03:10:16.063299Z","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-01T03:10:16.068632Z","title":"Bellman,On a routing problem","venue":null,"work_id":null,"year":1958},"citing_paper":{"arxiv_id":"2607.25238","last_updated":"2026-07-28T03:28:16Z","snapshot_observed_at":"2026-08-03T17:24:08.730169Z","submitted_at":"2026-07-28T03:28:16Z","title":"Optimization of the directed spanning trees using the weighted matroid intersection algorithm","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T03:10:16.068632Z"},"links":{"citing_paper":"/paper/2607.25238"},"observation_digest":"sha256:425c6fe5aec599e6c513498e931399db9685e224dc9347a1142c438d6af18955","observation_id":"1c72d918-e7e5-426d-a13c-5e8688a2d88a","resolution":{"observed_at":"2026-08-01T03:10:16.068632Z","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-01T03:10:16.073837Z","title":"Bock,An algorithm to construct a minimum directed spanning tree in a directed network, Developments in Operations Research, pp","venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2607.25238","last_updated":"2026-07-28T03:28:16Z","snapshot_observed_at":"2026-08-03T17:24:08.730169Z","submitted_at":"2026-07-28T03:28:16Z","title":"Optimization of the directed spanning trees using the weighted matroid intersection algorithm","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T03:10:16.073837Z"},"links":{"citing_paper":"/paper/2607.25238"},"observation_digest":"sha256:46c3d85a144cf3f21915a7f233465efe5329862d400c94d60f1cf40d7872820e","observation_id":"d4a007c3-8286-4a1b-91a6-d527e3c29c5d","resolution":{"observed_at":"2026-08-01T03:10:16.073837Z","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-01T03:10:16.079483Z","title":"Brezovec, G","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2607.25238","last_updated":"2026-07-28T03:28:16Z","snapshot_observed_at":"2026-08-03T17:24:08.730169Z","submitted_at":"2026-07-28T03:28:16Z","title":"Optimization of the directed spanning trees using the weighted matroid intersection algorithm","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T03:10:16.079483Z"},"links":{"citing_paper":"/paper/2607.25238"},"observation_digest":"sha256:1250366ea49db1d968c6dd0026eceee5c504e43e1075c295f2735aa968bf24ca","observation_id":"a2eedcac-810e-489d-9d82-3aeff347f893","resolution":{"observed_at":"2026-08-01T03:10:16.079483Z","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-01T03:10:16.084765Z","title":"B¨ other, O","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.25238","last_updated":"2026-07-28T03:28:16Z","snapshot_observed_at":"2026-08-03T17:24:08.730169Z","submitted_at":"2026-07-28T03:28:16Z","title":"Optimization of the directed spanning trees using the weighted matroid intersection algorithm","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T03:10:16.084765Z"},"links":{"citing_paper":"/paper/2607.25238"},"observation_digest":"sha256:702afa972baf764f8260d27584f07fb1ffb52fb0623fb151a710642bfcb2559d","observation_id":"217400e5-6ba8-42fc-9429-74e6460751aa","resolution":{"observed_at":"2026-08-01T03:10:16.084765Z","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-01T03:10:16.090888Z","title":"B´ erczi, T","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.25238","last_updated":"2026-07-28T03:28:16Z","snapshot_observed_at":"2026-08-03T17:24:08.730169Z","submitted_at":"2026-07-28T03:28:16Z","title":"Optimization of the directed spanning trees using the weighted matroid intersection algorithm","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T03:10:16.090888Z"},"links":{"citing_paper":"/paper/2607.25238"},"observation_digest":"sha256:609d498ef112c00738a2e9499f3eb5c48eae6d7ebad37673f2d82adbc2464aa1","observation_id":"1cb73ad7-c7ce-4672-b397-b4c657d3071e","resolution":{"observed_at":"2026-08-01T03:10:16.090888Z","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-01T03:10:16.096568Z","title":null,"venue":null,"work_id":null,"year":1965},"citing_paper":{"arxiv_id":"2607.25238","last_updated":"2026-07-28T03:28:16Z","snapshot_observed_at":"2026-08-03T17:24:08.730169Z","submitted_at":"2026-07-28T03:28:16Z","title":"Optimization of the directed spanning trees using the weighted matroid intersection algorithm","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T03:10:16.096568Z"},"links":{"citing_paper":"/paper/2607.25238"},"observation_digest":"sha256:34733c85461b1ffaa995425aada5359105e0190a3a71eff5ebd03a3de163c28f","observation_id":"e37d049f-a9b6-4547-96fb-2a1cbb07716a","resolution":{"observed_at":"2026-08-01T03:10:16.096568Z","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-01T03:10:16.101368Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.25238","last_updated":"2026-07-28T03:28:16Z","snapshot_observed_at":"2026-08-03T17:24:08.730169Z","submitted_at":"2026-07-28T03:28:16Z","title":"Optimization of the directed spanning trees using the weighted matroid intersection algorithm","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T03:10:16.101368Z"},"links":{"citing_paper":"/paper/2607.25238"},"observation_digest":"sha256:ab205d2a85a686e49ff5f0aa81ba1a8e7f3e18a493eb022b078072161b32e7b0","observation_id":"8c55eb8e-66b0-4d84-990a-cfc4bb2cc8ee","resolution":{"observed_at":"2026-08-01T03:10:16.101368Z","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-01T03:10:16.105861Z","title":"Cherkassky, and A","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.25238","last_updated":"2026-07-28T03:28:16Z","snapshot_observed_at":"2026-08-03T17:24:08.730169Z","submitted_at":"2026-07-28T03:28:16Z","title":"Optimization of the directed spanning trees using the weighted matroid intersection algorithm","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T03:10:16.105861Z"},"links":{"citing_paper":"/paper/2607.25238"},"observation_digest":"sha256:ed53650b21c566015efd9c0a1ba60bd01d30a3df38eeaabdaf5ca3f63c6e410b","observation_id":"8fc83caf-ccd8-461d-b69e-33cb49bd1400","resolution":{"observed_at":"2026-08-01T03:10:16.105861Z","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-01T03:10:16.110391Z","title":null,"venue":null,"work_id":null,"year":1959},"citing_paper":{"arxiv_id":"2607.25238","last_updated":"2026-07-28T03:28:16Z","snapshot_observed_at":"2026-08-03T17:24:08.730169Z","submitted_at":"2026-07-28T03:28:16Z","title":"Optimization of the directed spanning trees using the weighted matroid intersection algorithm","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T03:10:16.110391Z"},"links":{"citing_paper":"/paper/2607.25238"},"observation_digest":"sha256:77fd13e892bce18df5c0c4ab9432ed0ad161cda53416d191d2e02ec4c5bfcc32","observation_id":"674f38fb-6e61-4c9a-a209-c6a0829c75fe","resolution":{"observed_at":"2026-08-01T03:10:16.110391Z","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-01T03:10:16.114961Z","title":"Edmonds,Optimum branchings, Journal of Research of the National Bureau of Standards, 71B (1967), p","venue":null,"work_id":null,"year":1967},"citing_paper":{"arxiv_id":"2607.25238","last_updated":"2026-07-28T03:28:16Z","snapshot_observed_at":"2026-08-03T17:24:08.730169Z","submitted_at":"2026-07-28T03:28:16Z","title":"Optimization of the directed spanning trees using the weighted matroid intersection algorithm","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T03:10:16.114961Z"},"links":{"citing_paper":"/paper/2607.25238"},"observation_digest":"sha256:5df96fb658c8f5c88dfec2e3a53e28364dd792a9dcc1899e0543db88dd979717","observation_id":"e81e9942-1e9c-4fcd-b4cc-75f47de3ed84","resolution":{"observed_at":"2026-08-01T03:10:16.114961Z","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-01T03:10:16.119438Z","title":"Edmonds,Submodular Functions, Matroids, and Certain Polyhedra","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.25238","last_updated":"2026-07-28T03:28:16Z","snapshot_observed_at":"2026-08-03T17:24:08.730169Z","submitted_at":"2026-07-28T03:28:16Z","title":"Optimization of the directed spanning trees using the weighted matroid intersection algorithm","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T03:10:16.119438Z"},"links":{"citing_paper":"/paper/2607.25238"},"observation_digest":"sha256:b4a429284a9cf110016215c5e53637759ab7f4a28ac13748a2bbccafec377113","observation_id":"98368289-0d80-4228-a4ae-d3a3faf896ed","resolution":{"observed_at":"2026-08-01T03:10:16.119438Z","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.3390/a16120559","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Espada, A","venue":"Algorithms","work_id":"d19f691a-6779-4faa-bd3f-76dfff34fbe7","year":2023},"citing_paper":{"arxiv_id":"2607.25238","last_updated":"2026-07-28T03:28:16Z","snapshot_observed_at":"2026-08-03T17:24:08.730169Z","submitted_at":"2026-07-28T03:28:16Z","title":"Optimization of the directed spanning trees using the weighted matroid intersection algorithm","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T03:10:16.124401Z"},"links":{"citing_paper":"/paper/2607.25238"},"observation_digest":"sha256:78afb231043cb58de30ea1119b4c626834400220bb0fab95f9e2a1075d97e9d9","observation_id":"26abf640-3e9f-4a97-b718-448c9f8292e8","resolution":{"observed_at":"2026-08-01T03:14:15.303647Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-01T03:10:16.130041Z","title":"Eppstein, Z","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.25238","last_updated":"2026-07-28T03:28:16Z","snapshot_observed_at":"2026-08-03T17:24:08.730169Z","submitted_at":"2026-07-28T03:28:16Z","title":"Optimization of the directed spanning trees using the weighted matroid intersection algorithm","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T03:10:16.130041Z"},"links":{"citing_paper":"/paper/2607.25238"},"observation_digest":"sha256:352008534ebe39b534e6937e000cca58ee88a670e45d627053005a7164952205","observation_id":"738afef6-cd03-457d-8efc-eb579ad99f2e","resolution":{"observed_at":"2026-08-01T03:10:16.130041Z","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-01T03:10:16.134838Z","title":"Erd˝ os and A","venue":null,"work_id":null,"year":1959},"citing_paper":{"arxiv_id":"2607.25238","last_updated":"2026-07-28T03:28:16Z","snapshot_observed_at":"2026-08-03T17:24:08.730169Z","submitted_at":"2026-07-28T03:28:16Z","title":"Optimization of the directed spanning trees using the weighted matroid intersection algorithm","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T03:10:16.134838Z"},"links":{"citing_paper":"/paper/2607.25238"},"observation_digest":"sha256:7f3650efa83a7d5375a2e5d6dbba762cda53e39aaa1b78af8a3aa559e3ed5283","observation_id":"04e892dd-209c-4cf4-ab5d-1cbe2a83aabf","resolution":{"observed_at":"2026-08-01T03:10:16.134838Z","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-01T03:10:16.139274Z","title":null,"venue":null,"work_id":null,"year":1962},"citing_paper":{"arxiv_id":"2607.25238","last_updated":"2026-07-28T03:28:16Z","snapshot_observed_at":"2026-08-03T17:24:08.730169Z","submitted_at":"2026-07-28T03:28:16Z","title":"Optimization of the directed spanning trees using the weighted matroid intersection algorithm","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T03:10:16.139274Z"},"links":{"citing_paper":"/paper/2607.25238"},"observation_digest":"sha256:0b154618583436e8576b200f3ff104bb23a39a4bde16478511ecce2cf161b15a","observation_id":"dca1ec75-c2ef-4cc5-8f03-dfa3ce3c25e2","resolution":{"observed_at":"2026-08-01T03:10:16.139274Z","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-01T03:10:16.143643Z","title":"Frank, ,A weighted matroid intersection algorithm, Journal of Algorithms, 2(4): 328–336 (1981)","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2607.25238","last_updated":"2026-07-28T03:28:16Z","snapshot_observed_at":"2026-08-03T17:24:08.730169Z","submitted_at":"2026-07-28T03:28:16Z","title":"Optimization of the directed spanning trees using the weighted matroid intersection algorithm","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T03:10:16.143643Z"},"links":{"citing_paper":"/paper/2607.25238"},"observation_digest":"sha256:0b5cdac92931c577ffcf90074f7fc6f11d17b73d5891939fd9bdcc90da2323fb","observation_id":"773c64c0-1d0f-424e-8bc1-e6142fe7f358","resolution":{"observed_at":"2026-08-01T03:10:16.143643Z","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-01T03:10:16.148606Z","title":"Fujishige,A primal approach to the independent assignment problem, Journal of the Operations Research Society of Japan 20 (1977) 1-15","venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2607.25238","last_updated":"2026-07-28T03:28:16Z","snapshot_observed_at":"2026-08-03T17:24:08.730169Z","submitted_at":"2026-07-28T03:28:16Z","title":"Optimization of the directed spanning trees using the weighted matroid intersection algorithm","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T03:10:16.148606Z"},"links":{"citing_paper":"/paper/2607.25238"},"observation_digest":"sha256:b270436aa0de5e6510c2599b20bae8d5c726fd2ec84e59b87333c6f21edc72bb","observation_id":"b04d1581-f23a-4a95-80a8-ea01a94148ca","resolution":{"observed_at":"2026-08-01T03:10:16.148606Z","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-01T03:10:16.153816Z","title":"Fischer and R","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.25238","last_updated":"2026-07-28T03:28:16Z","snapshot_observed_at":"2026-08-03T17:24:08.730169Z","submitted_at":"2026-07-28T03:28:16Z","title":"Optimization of the directed spanning trees using the weighted matroid intersection algorithm","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-01T03:10:16.153816Z"},"links":{"citing_paper":"/paper/2607.25238"},"observation_digest":"sha256:043f94f22e2c199b7d3a45c7c8e41b9d5354da4b36b92f57652e60a60cafaff8","observation_id":"ba8c072e-42d3-4bf9-bd00-c1ef4aa3671b","resolution":{"observed_at":"2026-08-01T03:10:16.153816Z","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-01T03:10:16.158065Z","title":null,"venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2607.25238","last_updated":"2026-07-28T03:28:16Z","snapshot_observed_at":"2026-08-03T17:24:08.730169Z","submitted_at":"2026-07-28T03:28:16Z","title":"Optimization of the directed spanning trees using the weighted matroid intersection algorithm","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T03:10:16.158065Z"},"links":{"citing_paper":"/paper/2607.25238"},"observation_digest":"sha256:8b2ec6c8d1e6933647ac4379fdd427e3447cad2537653de88e2b94d11dae9a85","observation_id":"346c195a-b814-4f59-991e-e276ba639ecf","resolution":{"observed_at":"2026-08-01T03:10:16.158065Z","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-01T03:10:16.163513Z","title":"Hanauer, M","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.25238","last_updated":"2026-07-28T03:28:16Z","snapshot_observed_at":"2026-08-03T17:24:08.730169Z","submitted_at":"2026-07-28T03:28:16Z","title":"Optimization of the directed spanning trees using the weighted matroid intersection algorithm","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-01T03:10:16.163513Z"},"links":{"citing_paper":"/paper/2607.25238"},"observation_digest":"sha256:2d36097436465d52e6ee5896c33e83578da26fbeb63dc2a47d14976f03f9d8c2","observation_id":"08a745e3-c611-48a1-9719-07e1750dcb66","resolution":{"observed_at":"2026-08-01T03:10:16.163513Z","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-01T03:10:16.168471Z","title":"Hagberg P","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.25238","last_updated":"2026-07-28T03:28:16Z","snapshot_observed_at":"2026-08-03T17:24:08.730169Z","submitted_at":"2026-07-28T03:28:16Z","title":"Optimization of the directed spanning trees using the weighted matroid intersection algorithm","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-01T03:10:16.168471Z"},"links":{"citing_paper":"/paper/2607.25238"},"observation_digest":"sha256:42a976504e093d8dd1e491bd0fa6b3956b346fe53374b99ac82a2335d5cddfa3","observation_id":"bea3b070-08d0-4b69-93fc-887971cb6cbf","resolution":{"observed_at":"2026-08-01T03:10:16.168471Z","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-01T03:10:16.172741Z","title":"Harel, R","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2607.25238","last_updated":"2026-07-28T03:28:16Z","snapshot_observed_at":"2026-08-03T17:24:08.730169Z","submitted_at":"2026-07-28T03:28:16Z","title":"Optimization of the directed spanning trees using the weighted matroid intersection algorithm","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-01T03:10:16.172741Z"},"links":{"citing_paper":"/paper/2607.25238"},"observation_digest":"sha256:efb28a34710df94f928e05796b519b31c8170e9254c9c851831358d68602dfed","observation_id":"021e9040-4ed6-446b-9f18-c31e9b261251","resolution":{"observed_at":"2026-08-01T03:10:16.172741Z","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-01T03:10:16.178114Z","title":"Karp,A simple derivation of Edmonds’ algorithm for optimum branchings, Net- works 1 (1971): 265-272","venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2607.25238","last_updated":"2026-07-28T03:28:16Z","snapshot_observed_at":"2026-08-03T17:24:08.730169Z","submitted_at":"2026-07-28T03:28:16Z","title":"Optimization of the directed spanning trees using the weighted matroid intersection algorithm","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T03:10:16.178114Z"},"links":{"citing_paper":"/paper/2607.25238"},"observation_digest":"sha256:5f509cae851e22548b9a8f3b7c12cf3fac3909296e8192ecb0f34810c7546c07","observation_id":"93134370-a68f-4172-815f-3bc2a8f0de1a","resolution":{"observed_at":"2026-08-01T03:10:16.178114Z","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-01T03:10:16.183105Z","title":"Kamiyama,Arborescence problems in directed graphs: Theorems and algorithms, Interdiscip","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.25238","last_updated":"2026-07-28T03:28:16Z","snapshot_observed_at":"2026-08-03T17:24:08.730169Z","submitted_at":"2026-07-28T03:28:16Z","title":"Optimization of the directed spanning trees using the weighted matroid intersection algorithm","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-01T03:10:16.183105Z"},"links":{"citing_paper":"/paper/2607.25238"},"observation_digest":"sha256:5099345c0c4c77625690bc5b58da595eaf1b30a3b410b8b70cc8ebd2a8db89d8","observation_id":"d266a0c8-e0f4-41b5-8f9b-3a7e002d78c4","resolution":{"observed_at":"2026-08-01T03:10:16.183105Z","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-01T03:10:16.187295Z","title":"Korte, and J","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.25238","last_updated":"2026-07-28T03:28:16Z","snapshot_observed_at":"2026-08-03T17:24:08.730169Z","submitted_at":"2026-07-28T03:28:16Z","title":"Optimization of the directed spanning trees using the weighted matroid intersection algorithm","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-01T03:10:16.187295Z"},"links":{"citing_paper":"/paper/2607.25238"},"observation_digest":"sha256:23d7cbc7fd897ff8f9cb7d70802a7f77a1620e73a51ab248cbbcb3e4c0f24d80","observation_id":"0ca494ef-09e3-4240-8d12-fc3c818633a0","resolution":{"observed_at":"2026-08-01T03:10:16.187295Z","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-01T03:10:16.191870Z","title":null,"venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2607.25238","last_updated":"2026-07-28T03:28:16Z","snapshot_observed_at":"2026-08-03T17:24:08.730169Z","submitted_at":"2026-07-28T03:28:16Z","title":"Optimization of the directed spanning trees using the weighted matroid intersection algorithm","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-01T03:10:16.191870Z"},"links":{"citing_paper":"/paper/2607.25238"},"observation_digest":"sha256:f36048744826e89f018b5490141eeffbd7414248777bea2f4a8e478f9e557b98","observation_id":"eec6be32-d525-4c68-a94c-79c493e6a55e","resolution":{"observed_at":"2026-08-01T03:10:16.191870Z","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-01T03:10:16.196806Z","title":"Lov´ asz,Computing ears and branchings in parallel, in 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), 1985, pp","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2607.25238","last_updated":"2026-07-28T03:28:16Z","snapshot_observed_at":"2026-08-03T17:24:08.730169Z","submitted_at":"2026-07-28T03:28:16Z","title":"Optimization of the directed spanning trees using the weighted matroid intersection algorithm","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-01T03:10:16.196806Z"},"links":{"citing_paper":"/paper/2607.25238"},"observation_digest":"sha256:705ef5645cca7209c22b77b61840507810ce3028c26b8f01c2986aee5b91425b","observation_id":"ef7b4dcf-acf8-4e3c-bc1b-698972c9e87c","resolution":{"observed_at":"2026-08-01T03:10:16.196806Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1705.02044","last_updated":"2017-05-04T23:11:11Z","snapshot_observed_at":"2026-08-02T13:08:35.568546Z","submitted_at":"2017-05-04T23:11:11Z","title":"A Survey of Shortest-Path Algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1705.02044","snapshot_observed_at":"2026-08-01T03:10:16.201461Z","title":"Madkour, W","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.25238","last_updated":"2026-07-28T03:28:16Z","snapshot_observed_at":"2026-08-03T17:24:08.730169Z","submitted_at":"2026-07-28T03:28:16Z","title":"Optimization of the directed spanning trees using the weighted matroid intersection algorithm","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-01T03:10:16.201461Z"},"links":{"cited_paper":"/paper/1705.02044","citing_paper":"/paper/2607.25238"},"observation_digest":"sha256:f214656d881d004b687b5e1985ea48cb38a475cef5e18e853b249030b95735fd","observation_id":"9535b113-ba5c-489b-bf33-126cf24ebd26","resolution":{"observed_at":"2026-08-01T03:10:16.201461Z","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-01T03:10:16.206388Z","title":"Moore,The Shortest Path Through a Maze","venue":null,"work_id":null,"year":1959},"citing_paper":{"arxiv_id":"2607.25238","last_updated":"2026-07-28T03:28:16Z","snapshot_observed_at":"2026-08-03T17:24:08.730169Z","submitted_at":"2026-07-28T03:28:16Z","title":"Optimization of the directed spanning trees using the weighted matroid intersection algorithm","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-01T03:10:16.206388Z"},"links":{"citing_paper":"/paper/2607.25238"},"observation_digest":"sha256:078b4c56f446df54aa818bc44073eab018340abcbcc612eb212b193babb0f2b6","observation_id":"13ab2c04-25c3-46de-92a3-7824706f1cde","resolution":{"observed_at":"2026-08-01T03:10:16.206388Z","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-01T03:10:16.211453Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.25238","last_updated":"2026-07-28T03:28:16Z","snapshot_observed_at":"2026-08-03T17:24:08.730169Z","submitted_at":"2026-07-28T03:28:16Z","title":"Optimization of the directed spanning trees using the weighted matroid intersection algorithm","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-01T03:10:16.211453Z"},"links":{"citing_paper":"/paper/2607.25238"},"observation_digest":"sha256:5883f9d644d7f1d6109d861db9d9b2803a7ef7fd08c54bf77a258472d819ba4c","observation_id":"f560fb05-3825-43b2-bdda-91a7b3c23018","resolution":{"observed_at":"2026-08-01T03:10:16.211453Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.13826","last_updated":"2020-05-12T08:28:27Z","snapshot_observed_at":"2026-08-12T21:05:36.100944Z","submitted_at":"2020-04-22T07:23:47Z","title":"Every Document Owns Its Structure: Inductive Text Classification via Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.13826","snapshot_observed_at":"2026-08-01T03:10:16.216346Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.25238","last_updated":"2026-07-28T03:28:16Z","snapshot_observed_at":"2026-08-03T17:24:08.730169Z","submitted_at":"2026-07-28T03:28:16Z","title":"Optimization of the directed spanning trees using the weighted matroid intersection algorithm","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-01T03:10:16.216346Z"},"links":{"cited_paper":"/paper/2004.13826","citing_paper":"/paper/2607.25238"},"observation_digest":"sha256:3af618232f7c7c8e1e01057a96135fe13694717387a08bc647f07402adbc249a","observation_id":"cddf831c-208c-44fe-8792-6eee4ce493a0","resolution":{"observed_at":"2026-08-01T03:10:16.216346Z","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-01T03:10:16.220904Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.25238","last_updated":"2026-07-28T03:28:16Z","snapshot_observed_at":"2026-08-03T17:24:08.730169Z","submitted_at":"2026-07-28T03:28:16Z","title":"Optimization of the directed spanning trees using the weighted matroid intersection algorithm","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-01T03:10:16.220904Z"},"links":{"citing_paper":"/paper/2607.25238"},"observation_digest":"sha256:b4880e4ff11a1db18cf9b7b6ad6ecf3aec95e66c5c04633098eff086ae3e6e67","observation_id":"a701ec5a-416c-4e08-b9b4-1bc4ce4384d4","resolution":{"observed_at":"2026-08-01T03:10:16.220904Z","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-01T03:10:16.230125Z","title":"Schrijver,Combinatorial Optimization: Polyhedra and Efficiency, Springer Berlin, Heidelberg, 2003","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.25238","last_updated":"2026-07-28T03:28:16Z","snapshot_observed_at":"2026-08-03T17:24:08.730169Z","submitted_at":"2026-07-28T03:28:16Z","title":"Optimization of the directed spanning trees using the weighted matroid intersection algorithm","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-01T03:10:16.230125Z"},"links":{"citing_paper":"/paper/2607.25238"},"observation_digest":"sha256:760d981aeb35d5b348eba9ace08fb8832a36670bfae7724c459c467aa50527a1","observation_id":"c340887c-8bf7-4580-92c1-0244b058d582","resolution":{"observed_at":"2026-08-01T03:10:16.230125Z","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-01T03:10:16.234482Z","title":"S¨ orensen, and G","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.25238","last_updated":"2026-07-28T03:28:16Z","snapshot_observed_at":"2026-08-03T17:24:08.730169Z","submitted_at":"2026-07-28T03:28:16Z","title":"Optimization of the directed spanning trees using the weighted matroid intersection algorithm","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-01T03:10:16.234482Z"},"links":{"citing_paper":"/paper/2607.25238"},"observation_digest":"sha256:8aa998459cfa9306a041e42fa278290436ba1f17dcff8a9d62e62f6a8fb1daf0","observation_id":"df024fde-b319-4c92-bd91-88274ccbeb50","resolution":{"observed_at":"2026-08-01T03:10:16.234482Z","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-01T03:10:16.239081Z","title":null,"venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2607.25238","last_updated":"2026-07-28T03:28:16Z","snapshot_observed_at":"2026-08-03T17:24:08.730169Z","submitted_at":"2026-07-28T03:28:16Z","title":"Optimization of the directed spanning trees using the weighted matroid intersection algorithm","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-01T03:10:16.239081Z"},"links":{"citing_paper":"/paper/2607.25238"},"observation_digest":"sha256:b6030fa590bc24b034b63e17b57842cca028192be5c11181b6a8ec36b8e8a86d","observation_id":"998b7b34-c927-49c6-8f34-5ad0355fb375","resolution":{"observed_at":"2026-08-01T03:10:16.239081Z","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-01T03:10:16.243434Z","title":null,"venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2607.25238","last_updated":"2026-07-28T03:28:16Z","snapshot_observed_at":"2026-08-03T17:24:08.730169Z","submitted_at":"2026-07-28T03:28:16Z","title":"Optimization of the directed spanning trees using the weighted matroid intersection algorithm","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-01T03:10:16.243434Z"},"links":{"citing_paper":"/paper/2607.25238"},"observation_digest":"sha256:d40b5eca67c963454c59e74cfc7beb36bed4944e6fdc488b6dac0503b13839f2","observation_id":"e4f64624-d0ae-44fc-a10b-64bd5c29e040","resolution":{"observed_at":"2026-08-01T03:10:16.243434Z","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.1145/3709704","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Proceedings of the ACM on Management of Data","work_id":"e4f5fe8f-03d8-4326-b5c3-095bba174139","year":2025},"citing_paper":{"arxiv_id":"2607.25238","last_updated":"2026-07-28T03:28:16Z","snapshot_observed_at":"2026-08-03T17:24:08.730169Z","submitted_at":"2026-07-28T03:28:16Z","title":"Optimization of the directed spanning trees using the weighted matroid intersection algorithm","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-01T03:10:16.247862Z"},"links":{"citing_paper":"/paper/2607.25238"},"observation_digest":"sha256:7a299a6aa72d1b43bc5a2baac96723b9f1740ec9cbde22adb02aaae89c0a3745","observation_id":"ba00c47a-6bb3-412f-a3e0-0be0fdf30c88","resolution":{"observed_at":"2026-08-01T03:14:15.015302Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-01T03:10:16.225610Z","title":"Springer, Berlin, Heidelberg","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.25238","last_updated":"2026-07-28T03:28:16Z","snapshot_observed_at":"2026-08-03T17:24:08.730169Z","submitted_at":"2026-07-28T03:28:16Z","title":"Optimization of the directed spanning trees using the weighted matroid intersection algorithm","version":1},"reference_index":2006,"source":"pdf_text","source_observed_at":"2026-08-01T03:10:16.225610Z"},"links":{"citing_paper":"/paper/2607.25238"},"observation_digest":"sha256:6aad0595a3da035211a66e501289cc0c0e1b828644b2855c40da55a6be51771d","observation_id":"af74fbae-c80b-4da8-bb61-3baf6fb756b7","resolution":{"observed_at":"2026-08-01T03:10:16.225610Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.25238","last_updated":"2026-07-28T03:28:16Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-03T17:24:08.730169Z","submitted_at":"2026-07-28T03:28:16Z","title":"Optimization of the directed spanning trees using the weighted matroid intersection algorithm"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":37,"verified_exact":2,"verified_fuzzy":0},"total_outbound_references":39},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 0 inbound Pith citation observations for arXiv:2607.25238."}