{"as_of":"2026-08-16T11:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7d1f77509462d261d5fea9024c3c1f9ffc69832c7e011f490268d0bc92495a8c","coverage":[{"denominator":83,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":83,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T23:49:02.280522Z","state":"measured"},{"denominator":83,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":83,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/2505.03955/citation-record","integrity":"/paper/2505.03955/integrity","json":"/paper/2505.03955/citation-record.json","paper":"/paper/2505.03955"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:49:01.937456Z","title":"New algorithms and lower bounds for all-pairs max-flow in undirected graphs","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:01.937456Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:17b99a023b4b66d96d16a4902ffe209564c9b2a194a9d9205761f58a4798e8ee","observation_id":"967865ff-ac04-4351-bb9f-ab75e0060267","resolution":{"observed_at":"2026-08-15T23:49:01.937456Z","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-15T23:49:01.942282Z","title":null,"venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:01.942282Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:0cb8c7172232f751a98591d964d5ae3f09873536ccde2f052ef535e7c35de4d4","observation_id":"9ef22541-3c3b-455e-b6f4-996484def18e","resolution":{"observed_at":"2026-08-15T23:49:01.942282Z","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-15T23:49:01.946418Z","title":"“Approximating st minimum cuts in Õ (n","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:01.946418Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:9e283fa91b83aad3213958615199d573f4858d522e8ae9a2fa84c9fe576b33ac","observation_id":"fde117ad-9ca8-4773-9f6e-38b0c01993bd","resolution":{"observed_at":"2026-08-15T23:49:01.946418Z","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-15T23:49:03.350376Z","title":"In:Proceedings of the twenty-eighth annual ACM symposium on Theory of computing","venue":null,"work_id":"0a29dc5e-4b9f-46be-862e-24428c34dd01","year":1996},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:01.950579Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:7d39ece8d443854c5f260375103011b7f666a035db5a31d8fb591d5287b0dfab","observation_id":"984921d7-b17c-4e6b-ab15-1d3ee9237821","resolution":{"observed_at":"2026-08-15T23:49:03.354603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:03.337545Z","title":null,"venue":null,"work_id":"74387df6-1491-41ec-81c7-aad047bce875","year":2015},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:01.954894Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:b96382aa58f0014e931c4a8e7cf9f6e6cdfa1f094ab00997815201017dc60530","observation_id":"43592178-a6c7-4dfc-97e0-d000be7f1092","resolution":{"observed_at":"2026-08-15T23:49:03.341535Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:03.324525Z","title":"Faster high accuracy multi-commodity flow from single-commodity techniques","venue":null,"work_id":"dd4cbd84-4309-4eee-8dbf-8e9206a74957","year":2023},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:01.959171Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:861b770d04af83f8174efddfeb188c9e3a4d8462e3b54cd521524198733b4b4b","observation_id":"3ca6b0ad-3756-4f5e-b688-aff4fc24df1c","resolution":{"observed_at":"2026-08-15T23:49:03.328933Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:03.311459Z","title":"Bipartite matching in nearly-linear time on moderately dense graphs","venue":null,"work_id":"b02fa3fc-2dc9-4ec3-ad9e-c2e652104557","year":2020},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:01.963551Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:8b6afbae4cdfefe736dfce10c8745d3436e14d100afdc5170d3cee958daa7654","observation_id":"84992370-6c93-40ab-b7e1-ee37a432731a","resolution":{"observed_at":"2026-08-15T23:49:03.315910Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:03.297270Z","title":"Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time","venue":null,"work_id":"2ef5c030-1de1-4387-9875-5b5026438d8f","year":2024},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:01.968322Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:0244532ce3a1b7b2cd76b7f5fa2d28d4a2ab53ae304e9eec1047f0535cc11f99","observation_id":"1e2ad169-4f03-4d81-8ffd-046124fa504c","resolution":{"observed_at":"2026-08-15T23:49:03.302322Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:03.283947Z","title":"Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, st Shortest Path, and Minimum-Cost Flow","venue":null,"work_id":"fa772445-6e6c-4cd2-a2a9-7d50657870f8","year":2024},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:01.972758Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:f2a73e203756e9da2034b7c05f59bbfd3efbe9ac12ad3ec6370a61f040ab0128","observation_id":"e781fc2f-7bb3-4b04-9985-8f0d7fb8e646","resolution":{"observed_at":"2026-08-15T23:49:03.288304Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:03.269385Z","title":"Maximum flow and minimum-cost flow in almost-linear time","venue":null,"work_id":"d123a4fd-457e-4d8b-ade4-123517f12c65","year":2022},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:01.976631Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:5337ff959beeb8c3e573023451ac70cedce25ede087ccf8c2b6371ad2da50567","observation_id":"3481d890-5c9a-4891-8027-55d368913a78","resolution":{"observed_at":"2026-08-15T23:49:03.274103Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:03.256575Z","title":"Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs","venue":null,"work_id":"7448ba7d-4fe9-4519-832d-5c45f36e2df9","year":2011},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:01.980463Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:3c6dfcee79bbed9d3fc9a24bf4285c0124e4024365fde3c3363d8d9aa6856333","observation_id":"51742cdf-d95b-47e6-a434-a35a6bdd068c","resolution":{"observed_at":"2026-08-15T23:49:03.260856Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:03.243658Z","title":"Dirichlet proportions model for hierarchically coherent prob- abilistic forecasting","venue":null,"work_id":"b1ab169b-90c9-455c-a9ce-21e6c7f8c8b3","year":2023},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:01.984459Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:6e98194bdc5499a2c8e19c6310225389533075e18a40b008afd3173e427b7a5c","observation_id":"f8a0d815-378f-4dc5-949b-60f360fc3850","resolution":{"observed_at":"2026-08-15T23:49:03.247877Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.18568","last_updated":"2024-05-28T20:26:05Z","snapshot_observed_at":"2026-08-12T23:55:44.998806Z","submitted_at":"2024-05-28T20:26:05Z","title":"Warm-starting Push-Relabel","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.18568","snapshot_observed_at":"2026-08-15T23:49:01.988321Z","title":"Warm-starting Push-Relabel","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:01.988321Z"},"links":{"cited_paper":"/paper/2405.18568","citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:bd7d2e0414386d434a2b8a623cc7cb4a70e3f7acc0c8cb26b259d76a1152f09a","observation_id":"e24a351c-50c1-4849-9c9a-b09850e7a422","resolution":{"observed_at":"2026-08-15T23:49:01.988321Z","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-15T23:49:03.230251Z","title":"Predictiveflowsforfasterford-fulkerson","venue":null,"work_id":"815b0c6e-f556-49e2-9dee-3d887c48a685","year":2023},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:01.992393Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:62e2ba6224c4c9ccaedc8b0675225c24a18087c2a683d9b8f81d85df5c0989ed","observation_id":"d9c875b5-1208-47e6-a430-a391b952bc6b","resolution":{"observed_at":"2026-08-15T23:49:03.234437Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:03.217340Z","title":"Nested dissection meets ipms: Planar min-cost flow in nearly-linear time","venue":null,"work_id":"105ea239-8249-49fd-86ae-91b2ed6dbca8","year":2022},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:01.996245Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:e517b6aa0263a505dc6866e38a772cce08b47f595079f8121326a880da559551","observation_id":"e8d9b0dd-7be7-44ff-9096-56b73e646550","resolution":{"observed_at":"2026-08-15T23:49:03.221760Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:03.204312Z","title":"Theoretical improvements in algorithmic efficiency for network flow problems","venue":null,"work_id":"d9525b09-5730-4d55-9d9c-d0b179e1e887","year":1972},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.001380Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:907060d1fdbf8099b0940fe1f3253cbe2a482b02ceabd88f59f984423be2cb01","observation_id":"ba06b3bb-a102-4ab1-a6ea-743ddde1937e","resolution":{"observed_at":"2026-08-15T23:49:03.208621Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:03.191120Z","title":"Approximating fractional multicommodity flow independent of the number of commodities","venue":null,"work_id":"d5c290ac-e9be-4ba0-90b7-8025c9fc45f1","year":2000},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.005434Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:e13f92dd625e6eaf546ac10f6ac5181e8c6d644872aa989efdad760d6ffadc22","observation_id":"839186bf-3784-47f9-b899-f3fcdbe2284c","resolution":{"observed_at":"2026-08-15T23:49:03.195385Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:03.178456Z","title":"Constructing maximal dynamic flows from static flows","venue":null,"work_id":"f1b75ec2-0382-4be4-b9d8-da5f205dcaaf","year":1958},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.009364Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:471262d9df4a9b090b2a3f7429b69dc07225d4edc2f1436915ae95cf31d84405","observation_id":"ab92b217-dcfe-4d09-b901-30f0d7707275","resolution":{"observed_at":"2026-08-15T23:49:03.182548Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:03.165786Z","title":"Maximal flow through a network","venue":null,"work_id":"a26c30ec-2898-4b2b-b36c-84c4659c3f72","year":1956},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.013243Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:d1aaba6aaf5f2526ccb4e52a7582b4ee057d945614e31467783319ff3f393999","observation_id":"7727bfe8-3b67-4ada-81f1-125bc120b488","resolution":{"observed_at":"2026-08-15T23:49:03.170113Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:03.152794Z","title":"A network flow computation for project cost curves","venue":null,"work_id":"70b884e2-7e27-4d1c-8aa8-1887d7637b79","year":1961},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.017290Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:e07051f4894232fd5abe69bec5f8de85c69f5489dfda15744a002c63ceeec8c4","observation_id":"00e35180-d4f1-4a0a-8159-fb69bcee9f99","resolution":{"observed_at":"2026-08-15T23:49:03.157168Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:03.139859Z","title":"Transient flows in networks","venue":null,"work_id":"b3b418db-1516-4061-a9ad-0419d42442fd","year":1959},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.021436Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:5a6538a7e5d9cafeccda777c8d2bb99c463a931e982d75907e2a0b35cefe9e89","observation_id":"3fc62bb5-7c1d-40dd-aa2f-b0faa11eb40c","resolution":{"observed_at":"2026-08-15T23:49:03.144021Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:03.126462Z","title":"Faster and simpler algorithms for multicommodity flow and other fractional packing problems","venue":null,"work_id":"845717db-d8a2-42b0-a394-b55d6241341a","year":2007},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.025334Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:398871532cf15dfa4f57e101040b46cfd057f22e09ad317acb99573825b21b5b","observation_id":"741878a5-72da-4a49-885c-67d8db30acfd","resolution":{"observed_at":"2026-08-15T23:49:03.130719Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.12762","last_updated":"2024-05-21T13:15:19Z","snapshot_observed_at":"2026-08-16T08:29:36.492590Z","submitted_at":"2024-05-21T13:15:19Z","title":"Clarabel: An interior-point solver for conic programs with quadratic objectives","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.12762","snapshot_observed_at":"2026-08-15T23:49:02.029378Z","title":"Clarabel: An interior-point solver for conic programs with quadratic objectives","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.029378Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:5fb36fe20a9e273da38274f5efc43fae9263a0cb4bfe816c3b0c454aaac8526b","observation_id":"36016696-af9a-4538-9ec1-0a7e14b64e25","resolution":{"observed_at":"2026-08-15T23:49:02.029378Z","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-15T23:49:02.034043Z","title":"Recent Advances in Fully Dynamic Graph Algorithms - A Quick Reference Guide","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.034043Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:c2f4d10dd32813e93cfe5c3860f80ebcfb83759b2c9698fe2c7fbdd22c1fcb3b","observation_id":"7f6c2693-838b-4277-b286-a94e490e5870","resolution":{"observed_at":"2026-08-15T23:49:02.034043Z","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-15T23:49:03.113932Z","title":"Improvedalgorithms for decremental single-source reachability on directed graphs","venue":null,"work_id":"bfa06326-525c-427d-a373-052c35e7763b","year":2015},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.038108Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:c47f5e7fe5111377b65b014f526e9d58134f4a2783d220fac8b290241600945b","observation_id":"3dcc68cd-ccb2-42fb-b4a8-b1cded1644d8","resolution":{"observed_at":"2026-08-15T23:49:03.118066Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:03.100932Z","title":"Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs","venue":null,"work_id":"4baa07a8-61fb-42cf-be67-3109c149d673","year":2014},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.042072Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:7c493769f49ef02b9834286c6ce9b47a608081f57af6b6c66ac17777be677622","observation_id":"db4b5616-8e62-4479-be19-bea2a5e8e043","resolution":{"observed_at":"2026-08-15T23:49:03.105141Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:03.088366Z","title":"Springer, 2008","venue":null,"work_id":"57165e33-8285-4bcf-9be6-fdb3a7e35943","year":2008},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.046207Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:d7a48928693a8c7e699f5c76002930ea70269380a0ce2bdc219d19369a4f8aaa","observation_id":"a29195d4-86b4-473b-b496-664130eb85d4","resolution":{"observed_at":"2026-08-15T23:49:03.092312Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:03.075731Z","title":"Optimal combination forecasts for hierarchical time series","venue":null,"work_id":"7f919216-9b1b-4d1e-9525-63bac2b2a0d0","year":2011},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.050399Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:c543c7bfcba987bc12b81d7dd0a9ecbc14698a0dfb1fdc5f1ebc8c1057db2b50","observation_id":"756de43e-6e00-44e3-887f-03ac2de0ad16","resolution":{"observed_at":"2026-08-15T23:49:03.079829Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.07940","last_updated":"2023-10-19T04:01:49Z","snapshot_observed_at":"2026-08-13T15:22:58.253758Z","submitted_at":"2022-06-16T06:13:53Z","title":"When Rigidity Hurts: Soft Consistency Regularization for Probabilistic Hierarchical Time Series Forecasting","version":4},"cited_work":{"arxiv_id":"2206.07940","doi":null,"metadata_source":"pith","pith_arxiv_id":"2206.07940","snapshot_observed_at":"2026-08-15T23:49:02.351545Z","title":"When Rigidity Hurts: Soft Consistency Regularization for Probabilistic Hierarchical Time Series Forecasting","venue":"cs.LG","work_id":"6fff1cc0-3bfa-4a54-9e0c-d5ba8f986fe9","year":2022},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.054100Z"},"links":{"cited_paper":"/paper/2206.07940","citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:fa90a4b976a4e02aa305e13b4b96919b9704fc250801336b07d356b6e705dcef","observation_id":"eb9ef61a-7016-46e2-84fe-7d89f325c95b","resolution":{"observed_at":"2026-08-15T23:49:02.358035Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:03.062873Z","title":"On the translocation of masses","venue":null,"work_id":"792b3c61-37f2-471a-8102-4cc92d396c06","year":1942},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.058463Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:94ba49c35702543281bee23a93ee98a9debe74b0f0eaebe063ed95ae7224eeeb","observation_id":"5b5ee9f9-c211-4a65-aca9-2f9e789c9216","resolution":{"observed_at":"2026-08-15T23:49:03.067143Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:03.049973Z","title":"Faster approximation schemes for fractional multicommodity flow problems","venue":null,"work_id":"c2fc73b8-e357-48ff-9144-5d42fbbe180f","year":2008},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.062620Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:abb69f2793dd13523f87f5b906960f7d8756f6cbacb5d2019c789c7ce850717f","observation_id":"2f1fc368-4798-4156-8969-0dc2af3ea0c1","resolution":{"observed_at":"2026-08-15T23:49:03.054255Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:03.036911Z","title":"A faster deterministic maximum flow algorithm","venue":null,"work_id":"51beb507-c6d7-416c-9ce0-44959ee2315f","year":1994},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.066617Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:7e0361cae3e4e3d25f57b8bc7f645c89c4a48b7c5cfcf77ec771fe2fa9d0c10e","observation_id":"9262b904-095b-437c-9ed3-e494c4cc459f","resolution":{"observed_at":"2026-08-15T23:49:03.041169Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:03.023811Z","title":"Single source–All sinks max flows in planar digraphs","venue":null,"work_id":"897fe3ce-2f54-49c7-ae7b-a8c627294f37","year":2012},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.070365Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:2e74a0af4649cbcdb36d839a2e2834d09d9bf5dc9ed5121fc55c9faf02d1df93","observation_id":"e1a7a2c0-dd04-43c7-8923-50767deabc02","resolution":{"observed_at":"2026-08-15T23:49:03.027967Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:03.011050Z","title":"Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms","venue":null,"work_id":"5d40331f-3517-4f34-bd6b-578a02099883","year":1999},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.078239Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:a768e5c6d04830fefc2f57d9036c241cfa5aeeb37c20293952ca61c9a6377bdc","observation_id":"fcad1754-05f4-4071-a88a-45fa392e2a02","resolution":{"observed_at":"2026-08-15T23:49:03.015321Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.998283Z","title":"Computing maximum flow with augmenting electrical flows","venue":null,"work_id":"963e4855-93fa-4e22-ab15-650f76858e2b","year":2016},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.082287Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:483acf75fa79a42d32cb80983f17063d8a098e436aff7c221890eb913221b755","observation_id":"b74edb57-8302-410a-b301-3a9a31c6b267","resolution":{"observed_at":"2026-08-15T23:49:03.002562Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.985181Z","title":"Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms","venue":null,"work_id":"dc34c95a-effb-473a-be32-0fb430cc20f0","year":2010},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.086382Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:571b10d5b473ea6ff1a8dbe28bd978a6a2ebccd909355576ac22f839c0da3f67","observation_id":"8996a4fe-0462-4128-9242-b60a0cdfd7b2","resolution":{"observed_at":"2026-08-15T23:49:02.989571Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.972314Z","title":"Navigating central path with electrical flows: From flows to match- ings, and back","venue":null,"work_id":"cf1d045b-417c-4731-9125-c1d20800c4fb","year":2013},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.090217Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:f8896d50b42819ec6d54f797ab61659e37bc087fbb19051d591ec2cb4a9f988f","observation_id":"4ce8a941-6598-4c5e-b907-0ff4a27d97b4","resolution":{"observed_at":"2026-08-15T23:49:02.976558Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.959183Z","title":"Probabilistic hierarchical forecasting with deep poisson mixtures","venue":null,"work_id":"220d6182-f2aa-461a-a801-9b961e45626d","year":2024},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.094435Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:5dfd47db0d0423392f82803f4825121a0bcbb9530e36bb35da0251167b41d9a4","observation_id":"b6b46c69-b7a9-4dbf-ab31-158c68a4f874","resolution":{"observed_at":"2026-08-15T23:49:02.963693Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.946523Z","title":"A simpler and faster strongly polynomial algorithm for generalized flow maximization","venue":null,"work_id":"093d38b8-3aaf-4a85-8733-ebef93839585","year":2020},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.098795Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:a7bf53e673dd592b85fe68b1b20c76408ec12c9a6ee708718495fe645cd3e6b2","observation_id":"4ee6c329-f60b-461f-9f6b-b602dc7a87ff","resolution":{"observed_at":"2026-08-15T23:49:02.950590Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.10437","last_updated":"2020-02-20T21:08:57Z","snapshot_observed_at":"2026-08-14T16:26:52.986402Z","submitted_at":"2019-05-24T20:28:57Z","title":"N-BEATS: Neural basis expansion analysis for interpretable time series forecasting","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.10437","snapshot_observed_at":"2026-08-15T23:49:02.103137Z","title":"N-BEATS: Neural basis expansion analysis for interpretable time series forecasting","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.103137Z"},"links":{"cited_paper":"/paper/1905.10437","citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:16d2f6958e08cc38e604fe6b028c860a8889300b8003916357dcef5b79f3c429","observation_id":"49d66922-e054-4815-8ca2-823d5ee8b6fb","resolution":{"observed_at":"2026-08-15T23:49:02.103137Z","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-15T23:49:02.933574Z","title":"Forecastreconciliation:Ageometricviewwithnewinsights on bias correction","venue":null,"work_id":"6f42c667-075f-43f1-9f5e-6ae155584f30","year":2021},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.107716Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:d88fbbc172aa1389a56d73417fd831507fc75729293a7410d27cf189ebf8d045","observation_id":"9f15ab0c-3b80-4c76-a47a-0cf7ea88aa21","resolution":{"observed_at":"2026-08-15T23:49:02.937861Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.919523Z","title":"Learning-augmented maximum flow","venue":null,"work_id":"2c6bdcfd-d1f9-4753-899a-a144dad44deb","year":2024},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.111909Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:58b3678255f1c003947869eb79555f010885ce565575c3dd7ce448bcb71916c9","observation_id":"a53ecb1b-de5f-42f6-9c41-ae0044d44475","resolution":{"observed_at":"2026-08-15T23:49:02.924052Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.906593Z","title":"Deep state space models for time series forecasting","venue":null,"work_id":"9adb000a-f386-4782-b2d5-1ac93bee3490","year":2018},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.115893Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:52faa200010a04abbdc8726515f194e211eae3ba91b9388df1032f8d2ebf95dc","observation_id":"15c52eef-d350-49ee-a230-ebc2ba35699f","resolution":{"observed_at":"2026-08-15T23:49:02.910863Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.893139Z","title":"End-to-end learning of coherent probabilistic forecasts for hierarchical time series","venue":null,"work_id":"3ee6b98c-2c07-4163-b242-8756c1dfe292","year":2021},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.119780Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:4efc0bb9b1a9a69412170f17d45278c4292c3ebf9aae15feca40571928196a08","observation_id":"a2bf55b1-96a4-484c-8095-25ed4366f73b","resolution":{"observed_at":"2026-08-15T23:49:02.897811Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.879031Z","title":"Demand forecasting and inventory control: A simulation study on automotive spare parts","venue":null,"work_id":"a1e3eebd-81b5-4cd2-8dee-3b2a2839673c","year":2015},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.123826Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:158c78dba5e55d821f59cba5a08c95c3a20c3930ab086b91a815de628970f416","observation_id":"444b01ad-0990-4b41-8f32-03d93a8331e3","resolution":{"observed_at":"2026-08-15T23:49:02.883615Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1402.1128","last_updated":"2014-02-05T19:01:51Z","snapshot_observed_at":"2026-08-14T23:45:42.698121Z","submitted_at":"2014-02-05T19:01:51Z","title":"Long Short-Term Memory Based Recurrent Neural Network Architectures for Large Vocabulary Speech Recognition","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1402.1128","snapshot_observed_at":"2026-08-15T23:49:02.127925Z","title":"Long short-term memory based recurrent neural network architectures for large vocabulary speech recognition","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.127925Z"},"links":{"cited_paper":"/paper/1402.1128","citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:941639e7affaded2e354db199f8a5a58e9760cb4fbf8248975c724e99e2bface","observation_id":"3a7a89c2-5f50-417c-ac76-5825aa46216f","resolution":{"observed_at":"2026-08-15T23:49:02.127925Z","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-15T23:49:02.864959Z","title":"DeepAR: Probabilistic forecasting with autoregressive recurrent networks","venue":null,"work_id":"39e33165-68bf-45a8-bbd1-3c1080292d9e","year":2020},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.132871Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:a4b413018781c66cca58d4e27c0e886d2d176c6b4d7a6d2ffde052e6cb8a5e3f","observation_id":"d3e3569b-4113-4089-a76d-f6c80da7eddf","resolution":{"observed_at":"2026-08-15T23:49:02.869590Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.850335Z","title":"Bayesian intermittent demand forecasting for large inventories","venue":null,"work_id":"cf0325fe-82d3-4ebd-8a98-9ec3d7435fc2","year":2016},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.136793Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:7eaa9b9831bcf6a40296fded3fc2356b0e721d02da2b1ce5ca2288f3799fea4b","observation_id":"ade1eab3-4019-4d71-a549-69747f9932e7","resolution":{"observed_at":"2026-08-15T23:49:02.855300Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.837179Z","title":"The maximum concurrent flow problem","venue":null,"work_id":"3adae50a-3aad-4d70-9ea0-7582d208d27b","year":1990},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.141075Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:fb73bae0fb1c0267ed36dab206190af23cb1ea4b0e39d91d83c7b0db659f734c","observation_id":"0ab8650b-4a20-44b9-b7a4-da39ed7bb2d3","resolution":{"observed_at":"2026-08-15T23:49:02.841373Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.823809Z","title":"An introduction to network flows over time","venue":null,"work_id":"bf571c76-dfaf-49d5-a735-b2e8db06cfef","year":2009},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.145138Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:926cc7119258e4a1cb4b79ae96b022f001968b219e7329f1dc3b922c7c2980bb","observation_id":"e07704a7-2faa-4c9d-8a28-76d8e0a2b945","resolution":{"observed_at":"2026-08-15T23:49:02.828277Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.810166Z","title":"A deterministic almost-linear time algorithm for minimum- cost flow","venue":null,"work_id":"1546aba6-d2fa-41af-8e03-27a21a9b307a","year":2023},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.149137Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:3af896051822aab6c40f3eb03c6b4d185ef31a36765263864e446358108d12f0","observation_id":"770c6e9b-9e84-40c2-81bd-bc260dbfe8bc","resolution":{"observed_at":"2026-08-15T23:49:02.814384Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.797186Z","title":"Optimal fore- cast reconciliation for hierarchical and grouped time series through trace minimization","venue":null,"work_id":"42951585-45d5-497d-858f-ec88749033ad","year":2019},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.153160Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:4dc3dd59c3e825f1508fc397f13fdd90fd99e2b1c8b4cd4ba6c977bd76aa60c7","observation_id":"fc6932a5-6c5b-4d70-a2b6-bd19e9f90792","resolution":{"observed_at":"2026-08-15T23:49:02.801304Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.156858Z","title":"Cambridge university press, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.156858Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:2165ee5bd43cfa812c827186192d507d4f438e7901fea71de8606e0f06afe1f1","observation_id":"0a1c32a6-fae5-4709-9cb5-d0cf86e7fa35","resolution":{"observed_at":"2026-08-15T23:49:02.156858Z","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-15T23:49:02.775250Z","title":"Are transformers effective for time series forecasting?","venue":null,"work_id":"b91ac6d5-665a-4cfd-a215-9a127973eb4f","year":2023},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.160715Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:db491810f4bbb493c4b7a29fb9aa87efb8ef1efa3b3697f535fcccce8fae49bc","observation_id":"10f88eeb-182e-47e0-b40e-955885c55116","resolution":{"observed_at":"2026-08-15T23:49:02.779748Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.762777Z","title":null,"venue":null,"work_id":"bf3abc78-7233-49e6-ad1f-95ff3d7aab22","year":null},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.165291Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:cb741839d401c3b85a6d3586329c8e902097ac9370ad2931877312a49845232c","observation_id":"fe4e86cd-8807-4fac-a50b-09c8ed278a77","resolution":{"observed_at":"2026-08-15T23:49:02.766831Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.750056Z","title":null,"venue":null,"work_id":"7b44536a-6459-461f-9bc4-c2cf0fbb3cc1","year":null},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.169616Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:f2769c24a7ddf188774ebe45b10fe303c22099733e388c8dca385e2cd3ac4236","observation_id":"9e03e819-d344-4341-a740-8e5a163edd47","resolution":{"observed_at":"2026-08-15T23:49:02.754216Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.737021Z","title":null,"venue":null,"work_id":"f40216ef-30c2-49c5-bba4-f2ff0ad66ad4","year":null},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.173677Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:5e9c5bcd6dcefe54f933db00995eb4e6b7828299e982c85d34504fa7df317548","observation_id":"4fd0405f-1f6e-4f61-9a9b-d5b7fbc8d6a4","resolution":{"observed_at":"2026-08-15T23:49:02.741167Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.724380Z","title":null,"venue":null,"work_id":"edb829d2-0586-4552-b685-661db5ac7c1e","year":null},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.178187Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:4aec21ec80254a95457783a7363dc6991c51a919b8caa327f4e9ba5d3454574e","observation_id":"2b385878-7b40-4695-bf56-4468d94efc36","resolution":{"observed_at":"2026-08-15T23:49:02.728342Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.710192Z","title":null,"venue":null,"work_id":"64ce649d-6c84-4564-af97-7d2406fa0ac9","year":null},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.182443Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:daab944c0f484b0b16e8b1062cfb720d205a4f3a1a5cfcc02b075be92b357e3e","observation_id":"7e07fe60-f518-4baa-bcfa-34bef75e922d","resolution":{"observed_at":"2026-08-15T23:49:02.714445Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.697035Z","title":"The optimization problem becomes: min ˜y nX i=1 f(|˜yi− ˆyi|) subject to S˜y = b The objective is strictly convex as a sum of strictly convex functions composed with norms","venue":null,"work_id":"4ead4b80-1605-4383-83a1-2dd7503d4989","year":null},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.186923Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:eb580b065bbca88108192a9577d813a171d0c526c090cbbc476b231c1f31af96","observation_id":"f70650f7-3b51-4e2f-98ee-49d0cfda6cf1","resolution":{"observed_at":"2026-08-15T23:49:02.701502Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.684379Z","title":null,"venue":null,"work_id":"4d2b0a20-5e0b-4327-9755-9014979efb69","year":null},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.191052Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:1d6d017c9be4dc73ac60c5adf476da599b8f60239329337b0eb599267815e8ca","observation_id":"d5287fa6-0fda-469e-bb82-1cefe344c6b6","resolution":{"observed_at":"2026-08-15T23:49:02.688550Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.671705Z","title":null,"venue":null,"work_id":"de3c440b-c87c-454f-8e85-f19b65488cfd","year":null},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.195031Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:47e6c79fa04fe8093596069fc7022311e79b9bbce9cdde850511a91e9bef2bf4","observation_id":"76a2093a-9b26-4363-8a06-0c20b2d5f9c7","resolution":{"observed_at":"2026-08-15T23:49:02.675648Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.658905Z","title":"Therefore, computing the exact reconciled forecasts implicitly requires sorting the values x1,...,x n","venue":null,"work_id":"a52daeaa-bf21-4d2a-bbf2-e86b10946956","year":null},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.199706Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:866edb548aa6503e6b2999218a26a574f9ac7b8ef874f5c93b98a8208f674822","observation_id":"8b7a4be1-b78f-45da-bcd0-85c015e58d35","resolution":{"observed_at":"2026-08-15T23:49:02.663066Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.645236Z","title":null,"venue":null,"work_id":"7644c28c-d50f-4e3e-8fde-ab8ea1ffcb34","year":null},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.203894Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:38e506dbfd85d83802889c445d90f9e49778a95dbd6fb301799264edafb6db61","observation_id":"d2f61a37-55ab-4c20-956f-07b4bca4fedd","resolution":{"observed_at":"2026-08-15T23:49:02.649504Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.632923Z","title":null,"venue":null,"work_id":"7f508af6-9158-4b4d-bf67-3350d9565c78","year":null},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.207827Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:fc34b63d325fddb85bb938645c3c0b9f3ef82b383c0475168e5ec01ebdf5bb4c","observation_id":"7b22e4ad-259d-4fbf-b341-7e7523188bc4","resolution":{"observed_at":"2026-08-15T23:49:02.636974Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.620269Z","title":null,"venue":null,"work_id":"8b8c6dea-8cee-4101-b855-4f040f7f67f1","year":null},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.212090Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:358f0014614a7d3ee5028c1653a0127d849ee4a1d5aa389299b36dc51b7a7234","observation_id":"10c129c2-f892-4f45-89cc-ae729481f4c3","resolution":{"observed_at":"2026-08-15T23:49:02.624301Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.607156Z","title":"We prove each method yields the optimal reconciled forecasts: Step 1: Orthogonal projection correctness","venue":null,"work_id":"6449d456-a3df-4bd9-a696-d2380a52f6cd","year":null},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.215933Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:255e68de2ffbf5da6667e9f5c8957d62ec39f000addf42d1c6501a7cc7e272b5","observation_id":"b0340ca3-2102-4ab9-9a5d-cce42a47b8b8","resolution":{"observed_at":"2026-08-15T23:49:02.611416Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.594532Z","title":null,"venue":null,"work_id":"86488a5f-f8cd-438a-b062-5efd3b515763","year":null},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.219848Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:cdb8a0bfa14101b9ce6e8f83874896fff6890c1cb2cdf9379a4a78e9879a4df1","observation_id":"c1ee913b-82f4-4cfb-87df-174869d6cfa5","resolution":{"observed_at":"2026-08-15T23:49:02.598816Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.581817Z","title":null,"venue":null,"work_id":"2e01e041-940c-4e62-9c66-23e2a6f41a60","year":null},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.223883Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:34107a25f0cd53357c060ad108d808da51592d84d826912042e60131f67c5884","observation_id":"bdadf867-c0b9-44a5-ba98-3bae4f8aa827","resolution":{"observed_at":"2026-08-15T23:49:02.585841Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.568931Z","title":"We prove this in four steps: Step 1: First, we show that(P1) has a unique solution","venue":null,"work_id":"920e9ac2-4219-435b-9c99-b08cb2b319c4","year":null},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.227831Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:469f8939d40fad4326cd7b6c53ea7314462dc57e1d311b4c900543feb4b427cf","observation_id":"d0849868-979b-4db2-87e2-b7f1259e0a58","resolution":{"observed_at":"2026-08-15T23:49:02.573131Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.556796Z","title":null,"venue":null,"work_id":"160bed86-fa34-4077-9c57-9dcf917391e8","year":null},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.232290Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:ffebfd1e9c1269bd72bf0390cebb76902f7c0c7c7c4e0e0844c171d90f424cd7","observation_id":"2eb354b9-1abe-48f0-aefb-9ff6e2e016c5","resolution":{"observed_at":"2026-08-15T23:49:02.560669Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.544175Z","title":null,"venue":null,"work_id":"57b96da1-2565-4802-872f-dd74fdecadc2","year":null},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.236386Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:375e45c0b16543964205b31e00d10b97a32fb19259623f1804af269cee365e42","observation_id":"3fca44b2-65c5-4002-ab2e-19f0c2ffe48d","resolution":{"observed_at":"2026-08-15T23:49:02.548184Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.530529Z","title":null,"venue":null,"work_id":"985715de-e510-4f96-ae2f-24fd09be531a","year":null},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.240337Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:48db71031d86baafc90ac7e12e93a55217dd4987516365525ead2ed181382c84","observation_id":"483a09c4-6305-40c3-bc4a-6e8de00b26d8","resolution":{"observed_at":"2026-08-15T23:49:02.534563Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.517452Z","title":null,"venue":null,"work_id":"bb40e4d0-4642-4c98-afb8-531bbfd4f1b8","year":null},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.244202Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:658cce2d209018827604d264d1d92cc7708ebfa229bacb29fcd627d58c86ea0a","observation_id":"9a5e8eeb-131d-4670-b267-3532e5812561","resolution":{"observed_at":"2026-08-15T23:49:02.521623Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.504125Z","title":null,"venue":null,"work_id":"870a2524-c73c-4169-a5c0-14bb23d1f4b8","year":null},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.248057Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:2566f69a6b54654cc80b8597f321008998d92b75430273ec1e4d95902ed75b88","observation_id":"46655425-758a-43d2-930d-323bd616ddd9","resolution":{"observed_at":"2026-08-15T23:49:02.508133Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.491137Z","title":null,"venue":null,"work_id":"4c3330d5-d60a-453c-84d7-fb4b10533f54","year":null},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.252104Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:75ffe85b053c88447cec52ff84822d789ab4aade62b6bebc2e61bf20a88c3a62","observation_id":"500d07e6-4586-4570-b985-72df53eb2d4a","resolution":{"observed_at":"2026-08-15T23:49:02.495347Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.477828Z","title":"B Fast Updates and Approximations Hierarchical forecasting applications face three key challenges that traditional reconciliation methods like MinT handle inefficiently","venue":null,"work_id":"c62f8878-0622-4fef-b402-1817e15b4990","year":null},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.255954Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:6d8ecb5c9209b424d8ab1cbcf0d34c6d6e1a19814060dcdadaccef66f297567e","observation_id":"0657d15f-0b1e-467a-b477-a180b730547d","resolution":{"observed_at":"2026-08-15T23:49:02.482167Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.463354Z","title":null,"venue":null,"work_id":"d6793f12-3882-4198-9dda-d7937e433b04","year":null},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.260324Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:a59ad78f6468cbbbd7194b97b5fca8ef985b30945ecbb602feb7b598b6af5fa9","observation_id":"1d7c45af-8e36-4a08-9559-2bab3ba8fd9c","resolution":{"observed_at":"2026-08-15T23:49:02.467896Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.448686Z","title":null,"venue":null,"work_id":"4cc34f2b-418b-4916-83bb-5f3c1a1e1ea3","year":null},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.264561Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:b538d7e42b30358f32f0fa5602958920dbb0e61562c3ee18b024dd62e0fe3a1f","observation_id":"3b942dde-79da-4195-b101-0b24e43c0d92","resolution":{"observed_at":"2026-08-15T23:49:02.452797Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.435380Z","title":"B.4 Efficient Approximate Reconciliation Real-timeforecastingapplicationsoftenprioritizecomputationalefficiencyoverexactcoherence","venue":null,"work_id":"4b6ec836-5520-40f2-a69a-c0c4ddf4092c","year":null},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.268404Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:e853ce8e5d99e8e7a991ec22660328561f177c0a0c735baf048e47a7cf4a2768","observation_id":"bcf00bcd-e492-4aa6-ba74-146ab8a54dbb","resolution":{"observed_at":"2026-08-15T23:49:02.439990Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.422317Z","title":null,"venue":null,"work_id":"3572d117-52d8-4cb9-8c37-1dd3bf4ca499","year":null},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.272781Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:567750381ac4d0f300396d74ab815efe8b454b6f0ea94eb9ad0807f96b0118f7","observation_id":"11676ba4-b496-41cc-8122-c28e5e1f4e86","resolution":{"observed_at":"2026-08-15T23:49:02.426489Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.408984Z","title":null,"venue":null,"work_id":"6a1e8e61-62a9-44f4-be79-021d30d8a89a","year":null},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.276661Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:c36bc69ca477cbd07d17485158da46b901f092cafd44947fe109824a2873f791","observation_id":"f2d9af25-6661-42fe-ba01-96b3568e85ee","resolution":{"observed_at":"2026-08-15T23:49:02.413206Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T23:49:02.395564Z","title":"Memory requirements areO(m) to store the current solution and gradient","venue":null,"work_id":"f98e8541-2418-45d6-84b2-db1394180c84","year":null},"citing_paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-15T23:49:02.280522Z"},"links":{"citing_paper":"/paper/2505.03955"},"observation_digest":"sha256:28bae3f780308b50f01f10f475177589f79b7db12fbe5bec418d0d6a08fe25a6","observation_id":"24c044e3-ad20-43f5-840a-500da2700003","resolution":{"observed_at":"2026-08-15T23:49:02.400218Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.03955","last_updated":"2025-05-06T20:16:28Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T08:30:06.011992Z","submitted_at":"2025-05-06T20:16:28Z","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation"},"reference_resolution":{"displayed":83,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":32,"verified_exact":1,"verified_fuzzy":50},"total_outbound_references":83},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 83 of 83 outbound references and 0 inbound Pith citation observations for arXiv:2505.03955."}