{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:KDV4SMEDOQU36LXO3UGGBNUJ23","short_pith_number":"pith:KDV4SMED","schema_version":"1.0","canonical_sha256":"50ebc930837429bf2eeedd0c60b689d6cfe50e7f9e67eabbf9fa5ad21435a269","source":{"kind":"arxiv","id":"2101.01329","version":1},"attestation_state":"computed","paper":{"title":"A Trainable Reconciliation Method for Hierarchical Time-Series","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Davide Burba, Trista Chen","submitted_at":"2021-01-05T03:21:07Z","abstract_excerpt":"In numerous applications, it is required to produce forecasts for multiple time-series at different hierarchy levels. An obvious example is given by the supply chain in which demand forecasting may be needed at a store, city, or country level. The independent forecasts typically do not add up properly because of the hierarchical constraints, so a reconciliation step is needed. In this paper, we propose a new general, flexible, and easy-to-implement reconciliation strategy based on an encoder-decoder neural network. By testing our method on four real-world datasets, we show that it can consiste"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2101.01329","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-01-05T03:21:07Z","cross_cats_sorted":[],"title_canon_sha256":"6ad03922a7506b25dd9d923aac8b731de39e902bd4a4fd9c4e14e71341a92212","abstract_canon_sha256":"2add93d8b39e503b5a4f4f538d5a691fd0f32b4bf664ca772060ba1ac260c198"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:04:31.701016Z","signature_b64":"jghhXpcQvpxqnG7CHcTgiknEmB9xcNtiaf73makSFH1U0eX+ZgRo9sWGEVbWfnMgUlFn6rUntzw5pXEgeNyVDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50ebc930837429bf2eeedd0c60b689d6cfe50e7f9e67eabbf9fa5ad21435a269","last_reissued_at":"2026-07-05T02:04:31.700497Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:04:31.700497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Trainable Reconciliation Method for Hierarchical Time-Series","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Davide Burba, Trista Chen","submitted_at":"2021-01-05T03:21:07Z","abstract_excerpt":"In numerous applications, it is required to produce forecasts for multiple time-series at different hierarchy levels. An obvious example is given by the supply chain in which demand forecasting may be needed at a store, city, or country level. The independent forecasts typically do not add up properly because of the hierarchical constraints, so a reconciliation step is needed. In this paper, we propose a new general, flexible, and easy-to-implement reconciliation strategy based on an encoder-decoder neural network. By testing our method on four real-world datasets, we show that it can consiste"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.01329","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2101.01329/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2101.01329","created_at":"2026-07-05T02:04:31.700556+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.01329v1","created_at":"2026-07-05T02:04:31.700556+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.01329","created_at":"2026-07-05T02:04:31.700556+00:00"},{"alias_kind":"pith_short_12","alias_value":"KDV4SMEDOQU3","created_at":"2026-07-05T02:04:31.700556+00:00"},{"alias_kind":"pith_short_16","alias_value":"KDV4SMEDOQU36LXO","created_at":"2026-07-05T02:04:31.700556+00:00"},{"alias_kind":"pith_short_8","alias_value":"KDV4SMED","created_at":"2026-07-05T02:04:31.700556+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.07044","citing_title":"Hierarchical Forecast Reconciliation for Urban Rail Transit Demand Prediction under Operational Disruptions","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KDV4SMEDOQU36LXO3UGGBNUJ23","json":"https://pith.science/pith/KDV4SMEDOQU36LXO3UGGBNUJ23.json","graph_json":"https://pith.science/api/pith-number/KDV4SMEDOQU36LXO3UGGBNUJ23/graph.json","events_json":"https://pith.science/api/pith-number/KDV4SMEDOQU36LXO3UGGBNUJ23/events.json","paper":"https://pith.science/paper/KDV4SMED"},"agent_actions":{"view_html":"https://pith.science/pith/KDV4SMEDOQU36LXO3UGGBNUJ23","download_json":"https://pith.science/pith/KDV4SMEDOQU36LXO3UGGBNUJ23.json","view_paper":"https://pith.science/paper/KDV4SMED","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.01329&json=true","fetch_graph":"https://pith.science/api/pith-number/KDV4SMEDOQU36LXO3UGGBNUJ23/graph.json","fetch_events":"https://pith.science/api/pith-number/KDV4SMEDOQU36LXO3UGGBNUJ23/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KDV4SMEDOQU36LXO3UGGBNUJ23/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KDV4SMEDOQU36LXO3UGGBNUJ23/action/storage_attestation","attest_author":"https://pith.science/pith/KDV4SMEDOQU36LXO3UGGBNUJ23/action/author_attestation","sign_citation":"https://pith.science/pith/KDV4SMEDOQU36LXO3UGGBNUJ23/action/citation_signature","submit_replication":"https://pith.science/pith/KDV4SMEDOQU36LXO3UGGBNUJ23/action/replication_record"}},"created_at":"2026-07-05T02:04:31.700556+00:00","updated_at":"2026-07-05T02:04:31.700556+00:00"}