{"as_of":"2026-08-13T06:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b67c00f186a1b99520832c217f49a89db24fa6d1a45bada64bc23c96422cdb56","coverage":[{"denominator":46,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":46,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T11:34:11.522532Z","state":"measured"},{"denominator":46,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":46,"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/2411.18292/citation-record","integrity":"/paper/2411.18292/integrity","json":"/paper/2411.18292/citation-record.json","paper":"/paper/2411.18292"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:12.193110Z","title":"Aho, John E","venue":null,"work_id":"7b4a38d9-c260-455e-bd68-e0bf626801d8","year":1974},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.335977Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:341a03332e6090094de0a54250e904f804f495010214d163b2f7680d2c815da1","observation_id":"014ba187-4ee6-41a1-8e1c-b923d4e43a30","resolution":{"observed_at":"2026-08-12T11:34:12.197024Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:12.179286Z","title":null,"venue":null,"work_id":"1445472e-2cbf-4586-b7b3-01bf51207ae4","year":2009},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.340594Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:fea18c1a9417518fa34dafe6fbb51206da8b7aeb0b17e2669d60ece1fb951a59","observation_id":"97039826-ae8d-494b-81e4-7879b0c9177f","resolution":{"observed_at":"2026-08-12T11:34:12.183190Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:12.165182Z","title":"Greedy algorithm and symmetric matroids","venue":null,"work_id":"51cf3da4-d2b2-4087-ba05-f84acaaaf6da","year":1987},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.344671Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:a7b388050823a0538ab0e48f93dc3aa47ed2a4af06059e761aa715b9c56827f1","observation_id":"9a3f39b9-d14f-4c78-b4c6-267c32c6afae","resolution":{"observed_at":"2026-08-12T11:34:12.169820Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:12.151231Z","title":null,"venue":null,"work_id":"9883a0e0-ad75-44e8-9dac-326177ce8102","year":1988},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.349167Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:23281e1b81d4f371ac9eb841e920b5f0e77a4de187c7a57c25e213a262d39f56","observation_id":"dd18ebd4-7ef9-4d63-a508-96d97a03372f","resolution":{"observed_at":"2026-08-12T11:34:12.155749Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:12.137133Z","title":"Algebraic algorit hms for linear matroid parity problems","venue":null,"work_id":"d76b9064-2bf3-4408-ac34-86cd26a176f9","year":2014},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.354324Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:c87dbfa4054dd416ad0457bc74c363246a187efb37ba38e75d0bcd178db35f04","observation_id":"8c04dc55-6037-4d1f-b4b9-e0a9ecbbd0e1","resolution":{"observed_at":"2026-08-12T11:34:12.142023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:12.122819Z","title":"Cunningham, and Jim Geelen","venue":null,"work_id":"9ae38c2a-0ad7-446c-a08d-52e724b3af2a","year":2008},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.359042Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:f42ab6e62144e13ea81efaa1f140e1e7d6bcc29df24a1409b6b1d97edfb0a8c1","observation_id":"dddb1806-1a78-4861-a2a2-30a7bd1d60d6","resolution":{"observed_at":"2026-08-12T11:34:12.127514Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:12.107798Z","title":"Packing non-zero A-paths in group-labelled graphs","venue":null,"work_id":"4f6b6e03-fb48-4da8-939e-e912aacfa956","year":2006},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.363909Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:e36d633b7ad6772ddda225bb06c6bba03f7d8d5ef52afb16b1b83e04be9f7475","observation_id":"8934805a-e503-459c-9c22-cda09b2fbe7a","resolution":{"observed_at":"2026-08-12T11:34:12.112625Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:12.092524Z","title":"Paths, trees, and flowers","venue":null,"work_id":"31705b48-06d4-4ac8-b513-599355185f59","year":1965},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.368157Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:f644dc57eab7215112c215c8705902b35d6c998b3cd55cc5166158544a3e18c4","observation_id":"ba3b1361-9a63-4689-8f17-1e7720f6c063","resolution":{"observed_at":"2026-08-12T11:34:12.097185Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:12.077742Z","title":"An O(N 2","venue":null,"work_id":"65a1e244-9115-4c0c-88ee-53665862e3fe","year":1975},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.372302Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:037f21195d9db7daeecdbd0ae56a85f7ceeaab1c6389320bbe2df7e9ccd8f781","observation_id":"4536e15c-7114-46fc-944e-d44a5a57c447","resolution":{"observed_at":"2026-08-12T11:34:12.082273Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:12.063727Z","title":null,"venue":null,"work_id":"bd4ac0b0-2ef2-41ae-8458-5cccfd281d17","year":1976},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.376483Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:2e8948839c8119f15c574f35b1732e9532cbdca23d14075eb6f32d4e21125e00","observation_id":"f268f879-a4b9-4e07-afc8-69240005fd0c","resolution":{"observed_at":"2026-08-12T11:34:12.068077Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:12.049809Z","title":"Gabow and Matthias Stallmann","venue":null,"work_id":"c2010a53-d93a-4935-98fa-6bff5be6a792","year":1986},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.380654Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:f5eaea8eacfafc78e963988de3a3199ba52f22672443d9c63e6d0db6ce66ae78","observation_id":"3b3c352a-193d-44d9-ac1c-0f56f87b1ed8","resolution":{"observed_at":"2026-08-12T11:34:12.054236Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:12.035177Z","title":"Maximum-minimum S¨ atze und verallgemeinerte Faktoren von Graphen","venue":null,"work_id":"465cbb9b-deb8-4073-892b-72b5f0d16671","year":1961},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.385254Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:0ac439dbea4f97d98965aa7e338173276ef3d7517e5b426e299e3e2396c4b355","observation_id":"41cbf6db-e311-4c0f-9d40-aabf42cb9d64","resolution":{"observed_at":"2026-08-12T11:34:12.040247Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:12.021192Z","title":null,"venue":null,"work_id":"94af29c8-fb31-44b2-9d07-1b7816cda03a","year":2009},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.389332Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:d8f887789febd15c18da51e17d4d7df28a0ddb8df42297a84957e1b05aa01abc","observation_id":"4cf81f05-1c5a-4c70-abb5-593a2352895d","resolution":{"observed_at":"2026-08-12T11:34:12.025588Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:12.007665Z","title":"A dual descent algorithm for node-capacitated m ultiflow problems and its applications","venue":null,"work_id":"a4912107-aa5c-41a9-afe6-87e8b0111dbc","year":2018},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.393326Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:a0f0c0973aa38a0a04a22ba7c37ed89b9bfb92c4d24347b9284e2bce66dfe9ab","observation_id":"6449a1fe-6976-498a-a402-7e5bae340219","resolution":{"observed_at":"2026-08-12T11:34:12.011839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:11.993532Z","title":"Tree metrics and edge-disjoint S-paths","venue":null,"work_id":"c1b7d0f0-9026-4f8a-af61-ad73bcb69be7","year":2014},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.397302Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:e942bf7272c8081e8c851b6780426c1b47ba4a4ae25399301b2523a42428fcd2","observation_id":"f82825c3-3750-4f89-8e08-5b78797750ca","resolution":{"observed_at":"2026-08-12T11:34:11.998279Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:11.979530Z","title":"A weighted linear matroid p arity algorithm","venue":null,"work_id":"3ad7813a-6445-468f-9a95-5e6e3fa98741","year":2021},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.401554Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:bfe9970c103eb1d65a5b4d7e9554a1b2a61e808381f83b18fca80ffc0559373b","observation_id":"5691715c-7f20-4edf-abaa-fb76dfed5e3a","resolution":{"observed_at":"2026-08-12T11:34:11.983986Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:11.965944Z","title":"Finding maximum edge-disjoint paths between multiple terminals","venue":null,"work_id":"4131d9c8-078c-4b5e-be83-278a97467da1","year":2023},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.405788Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:982ac96beb0c8facb08812e6a5e6dd5e33e630638ed7e29d2da58582ceaf36d6","observation_id":"8a238742-47fa-40b9-a0b0-9a662b5bbff1","resolution":{"observed_at":"2026-08-12T11:34:11.970464Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:11.951927Z","title":"0/1/all C SPs, half-integral A-path packing, and linear-time FPT algorithms","venue":null,"work_id":"46b60847-8bb8-4813-860a-6047a0b66189","year":2018},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.409924Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:e1015c4f0bdb871aeb230de0034a4bf49ff162e93e12af12bb6ca00d5576b1a1","observation_id":"18f980f0-f110-48ca-b239-1920cd0713c0","resolution":{"observed_at":"2026-08-12T11:34:11.956473Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:11.938621Z","title":"Karzanov","venue":null,"work_id":"f360b728-98cf-4035-ac0d-ed5d42b7dc9b","year":null},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.414273Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:d6ec6ad1144ccecaf4ab22c1673a82b14b921569199e8e27f62995c4a3749d17","observation_id":"4beb7b58-1c93-4c1d-9711-b7acec82425a","resolution":{"observed_at":"2026-08-12T11:34:11.943127Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:11.924993Z","title":"Karzanov","venue":null,"work_id":"6e5a0bc7-3262-463e-856d-c028a01bbd42","year":1997},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.418737Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:8cad202a1671cf97bf793b784b83efdd7c969078d02170cf326e2b9c57fa6ae8","observation_id":"cd91959a-68b8-49a8-b302-87598a941243","resolution":{"observed_at":"2026-08-12T11:34:11.929508Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":{"arxiv_id":"2402.11596","last_updated":"2024-02-18T14:17:30Z","snapshot_observed_at":"2026-08-13T04:16:02.756313Z","submitted_at":"2024-02-18T14:17:30Z","title":"Faster algorithms on linear delta-matroids","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.11596","snapshot_observed_at":"2026-08-12T11:34:11.422902Z","title":"Faster algorithms on lin ear delta-matroids","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.422902Z"},"links":{"cited_paper":"/paper/2402.11596","citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:70d414aa1bc886ad08a62fcaad983063bf785d0256f4a7df2338b9590ad5515c","observation_id":"f2404bc8-152f-4d72-a72d-d5dfd6121000","resolution":{"observed_at":"2026-08-12T11:34:11.422902Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:11.911577Z","title":"The dependence graph for bases in matroids","venue":null,"work_id":"d7156085-05d1-41a0-890f-6e42826834dc","year":1977},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.427356Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:614937f235aaf1a4cdc2d95240ce12685ba6f48629be4d135741d1ce8d0c7782","observation_id":"aa699baa-1eb0-47f6-b480-e8c66f8a5db8","resolution":{"observed_at":"2026-08-12T11:34:11.916156Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:11.898183Z","title":null,"venue":null,"work_id":"5fae32ed-1100-4cf1-a7b6-7bbd5ffff8ad","year":1976},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.431423Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:9e5f29774afe234228b4ae87068096b2060afdd7ce05613c6266df0227ec6391","observation_id":"f0557f99-2c31-4ec4-b4f1-e4daad606d3a","resolution":{"observed_at":"2026-08-12T11:34:11.902369Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:11.884248Z","title":"A note on factor-critical graphs.Studia Sci","venue":null,"work_id":"158e887c-93d2-4bba-a0ad-8d855f1d859f","year":1972},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.435586Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:8430b4ecc89140d3a50903226ff8a8934579fe64e0738698108a8e9195f9b3e4","observation_id":"197147d9-5e46-432b-b907-6d08a282b7c7","resolution":{"observed_at":"2026-08-12T11:34:11.888565Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:11.870456Z","title":"The matroid matching problem.Algebraic Methods in Graph Theory , 2:495–517, 1978","venue":null,"work_id":"de3bac9a-d47c-4873-a0ab-648e07257bbb","year":1978},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.439755Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:d89d627d9b2b3a8319cb37246abb21422b163dfc2f7f8fdcdc794ee487333ad7","observation_id":"fa9f1978-43b2-432b-8828-77d2bd4f92f2","resolution":{"observed_at":"2026-08-12T11:34:11.875140Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:11.856600Z","title":"Matroid matching and some applications.Journal of Combinatorial Theory, Series B , 28(2):208–236, 1980","venue":null,"work_id":"40e15b9f-cf72-470f-aaec-f4cabf854330","year":1980},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.443984Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:cb7253fa900d931c02fb60381dc5692f23a2510822aced3d0f12c1bba3e5d5c0","observation_id":"82cc53f9-dbf0-447b-b7c5-c20c9b3b7f7e","resolution":{"observed_at":"2026-08-12T11:34:11.861447Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:11.843392Z","title":"¨Uber die Maximalzahl kreuzungsfreier H-Wege","venue":null,"work_id":"b487c486-6c36-4fed-9ec4-35e9a33b0d49","year":1978},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.448258Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:e81fd1dab3e39312faf46bdd343b92be7432cc95e907e1c5bcedd4c516af0a3a","observation_id":"a8ba7744-700f-49e4-9329-c24a8736e254","resolution":{"observed_at":"2026-08-12T11:34:11.847568Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:11.830505Z","title":null,"venue":null,"work_id":"36804267-85a0-4dd6-988b-1671c9de1538","year":1972},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.452530Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:e0e2fdbb57fa67c64275a44dc424f4cce99df99b8a16cd9a9a4a291b7ba5b1aa","observation_id":"47881e7e-3f01-4c97-a7c9-cdd314aa95a3","resolution":{"observed_at":"2026-08-12T11:34:11.834367Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:11.817210Z","title":"Mader matroids are gammoids","venue":null,"work_id":"18a55fed-52e8-4cec-8905-c4673f9b40c8","year":2006},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.456816Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:0243ca14aae344ee5fd60e764b29b8366d29e9827808e3c3175cb9c96c7df542","observation_id":"c8b4ee4d-61ce-4973-9894-d39a06bc03f6","resolution":{"observed_at":"2026-08-12T11:34:11.821532Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:11.802716Z","title":"Packing non-returning A-paths","venue":null,"work_id":"d79b11e7-9778-4676-bd98-6164d66904c2","year":2007},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.460985Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:0e72629e3b8393cd18e3969985e52c8c5cfe4c0eca9d28cd35543eae9edc5d91","observation_id":"abcc98e8-44fb-49b3-b145-7e154e16825d","resolution":{"observed_at":"2026-08-12T11:34:11.807541Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:11.788976Z","title":"Some new results on node-capacitated packing of A-paths","venue":null,"work_id":"34a4c702-c0de-445b-a0ad-b534d3765f5c","year":2007},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.465179Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:79ad470ccf2359e0b6d63e936710c4e29ca8326b69e91bb3572f13be3f30890c","observation_id":"0dfdb994-7b6a-47ca-a5d8-610852ba4250","resolution":{"observed_at":"2026-08-12T11:34:11.793522Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:11.773752Z","title":"Packing non-returning A-paths algorithmically","venue":null,"work_id":"62805d58-a42b-4c3d-8a11-cd43ea491cc3","year":2008},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.469272Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:247e5133ec6b2cd74855596cfe134d7762a68aff394702e29e093bb6ab9a7d02","observation_id":"7ed460cd-be9a-4bc2-80f4-574eb47fb44f","resolution":{"observed_at":"2026-08-12T11:34:11.778768Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:11.758908Z","title":"Strongly polynomial time solvability of integral and half -integral node-capacitated multiflow problems","venue":null,"work_id":"256e891e-4609-495b-8f87-1257439a22d3","year":2008},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.472886Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:c9f3731a32ea04c1dcad8b3972c959e5b06f288405fd0d145bb3c104044c14ef","observation_id":"487597b7-986b-4a61-afee-6b05152c635d","resolution":{"observed_at":"2026-08-12T11:34:11.763661Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:11.744622Z","title":"A polynomial time algorithm for weighted node-disjoint S-paths","venue":null,"work_id":"2601cb32-3f6c-44d4-82d9-8e59f75e61bb","year":2011},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.476502Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:3a1d0a5ae2b0dfab51e98411a4acf5141243b804753cded47af8adbcc3ddd57b","observation_id":"51ed7815-4c17-4031-a466-0b9d4bc52be4","resolution":{"observed_at":"2026-08-12T11:34:11.749183Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:11.730473Z","title":"Weighted linear matroid matching","venue":null,"work_id":"1e6bfd7f-e116-40f9-9888-5871377b0bcf","year":2013},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.480157Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:e9d18f61a9a638b9b586e17606d0db72b764c36dd7628b2fb6fd7053c127219a","observation_id":"abb622f7-261e-4bec-9009-3e5ec3d2d5c6","resolution":{"observed_at":"2026-08-12T11:34:11.735023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:11.716468Z","title":"Weighted bipartite matching in matrix multiplicatio n time","venue":null,"work_id":"9dc5d5a0-b1ab-4b5a-8eda-7475e9b92e47","year":2006},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.483830Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:cce1b0d9d7a63fd29a781d47aeab68ff0f9f9f3d1e334bb11aa1b0243fb3e476","observation_id":"9f3bddb9-4047-4ae9-9346-c4a3cf57dccd","resolution":{"observed_at":"2026-08-12T11:34:11.721002Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:11.702064Z","title":"Is each mader matroid a gammoid? https://homepages.cwi.nl/~lex/, 2001","venue":null,"work_id":"88babd82-5d97-48dd-b7b4-e19b2c0d5404","year":2001},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.487536Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:f33094a6cfb8f7d18ed2713346ce7a95dd3e1490c5654a38abf91a79ec2fd4d8","observation_id":"1fa5f049-073c-4406-95c4-54c7751b3659","resolution":{"observed_at":"2026-08-12T11:34:11.706881Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:11.687977Z","title":"A short proof of Mader’s S-paths theorem","venue":null,"work_id":"28b3673b-25f4-4f3d-83ff-e2f55b82f845","year":2001},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.490972Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:2545a633035efd6e69bfe71c08875d8a1dc79b6b8d0729de7e028bd945103de8","observation_id":"7300a193-061a-44af-a1f7-5d67ce3e947e","resolution":{"observed_at":"2026-08-12T11:34:11.692657Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:11.673442Z","title":"Combinatorial Optimization: Polyhedra and Efficiency","venue":null,"work_id":"b901f057-d234-40cd-869f-a8ecca76b0eb","year":2003},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.494693Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:6d936f1bea2ff404368d5bfa9727f1b8bc9e653b11b56eb0a04fe24afbeaccd9","observation_id":"e709e76b-69b7-478d-970f-717757914012","resolution":{"observed_at":"2026-08-12T11:34:11.678390Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:11.658450Z","title":"The path-packing structure of graphs","venue":null,"work_id":"183b522e-3c20-4dc0-b1dc-da114bf445eb","year":null},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.498094Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:fe6550f6b96c54e44dd41e9ed83c84c22884d14aef11141678742218edfc1989","observation_id":"9b98f18f-a90c-40db-a9f8-9e3dc5083d3f","resolution":{"observed_at":"2026-08-12T11:34:11.663047Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:11.643622Z","title":"Packing non-zero A-paths via matroid matching","venue":null,"work_id":"40a1341c-4d3a-471a-b2d1-69548ce0f3cc","year":2016},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.502346Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:ea33994aacde73ccf096c346569de2cfc7b6b5f9e20c3d839d9e6f6f8290ca70","observation_id":"7a516db3-6ff5-45bf-a0f4-b30c98b22356","resolution":{"observed_at":"2026-08-12T11:34:11.648269Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:11.628534Z","title":"A 4k2 kernel for feedback vertex set","venue":null,"work_id":"8605da25-6cc9-4eac-a19c-8f886755c325","year":2010},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.506326Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:e25aaaa2386af7fd6d1739beffb95cf27ba9f194b319bbafd41fcfd0fd19a49d","observation_id":"58609c70-f6f0-4df0-a513-4add1c1c21eb","resolution":{"observed_at":"2026-08-12T11:34:11.633184Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:11.613294Z","title":"Representative set statements for delt a-matroids and the Mader delta-matroid","venue":null,"work_id":"f1c257ac-c80a-4c03-b87e-90d40804bd03","year":2024},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.510382Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:8f31c55a57b34d163caf3f3f7d67cd7fbd3aa4ca6ba7ed5380e58d45911f9b99","observation_id":"a7985daa-eca9-4c0e-aa91-a4e1e5980271","resolution":{"observed_at":"2026-08-12T11:34:11.618481Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:11.598625Z","title":"New bounds for matrix multiplication: from alpha to omega","venue":null,"work_id":"3eec9e6a-f76f-4bdb-8cf3-a6cf6cb503df","year":2024},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.514592Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:594430cf668ef71b15d2a4814fd4ac66fe6f249d419e0b44ca390d1ecfd1c541","observation_id":"4b678146-ac0c-4b66-a3ca-9cb45900d5e3","resolution":{"observed_at":"2026-08-12T11:34:11.603281Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:11.584004Z","title":"Packing A-paths in group-labelled graphs via linear matroid parity","venue":null,"work_id":"e1002107-af44-4afd-a20b-aaa8b8329493","year":2016},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.518544Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:4fd2fbf572bc7dcfe04003ec6582b173e73f2c62ec40463aac418bc203d8ec63","observation_id":"7679c435-1880-4cb9-8393-07bbf557268e","resolution":{"observed_at":"2026-08-12T11:34:11.588857Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:34:11.567372Z","title":"Shortest disjoint S-paths via weighted linear matroid parity","venue":null,"work_id":"f65fcb0b-c79e-447a-8d31-bafc3a20e75b","year":2016},"citing_paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-12T11:34:11.522532Z"},"links":{"citing_paper":"/paper/2411.18292"},"observation_digest":"sha256:5a025fd0de098b12f474af0d569a7c9125050fad85506aede9aa9b8f25e6f4e4","observation_id":"90d68b17-19fd-4d1a-b8a3-f1c20877aa86","resolution":{"observed_at":"2026-08-12T11:34:11.574099Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}}],"paper":{"arxiv_id":"2411.18292","last_updated":"2024-11-27T12:30:15Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-12T11:17:55.046776Z","submitted_at":"2024-11-27T12:30:15Z","title":"A Faster Deterministic Algorithm for Mader's $\\mathcal{S}$-Path Packing"},"reference_resolution":{"displayed":46,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":0,"verified_fuzzy":39},"total_outbound_references":46},"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 46 of 46 outbound references and 0 inbound Pith citation observations for arXiv:2411.18292."}