{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:DSCXDQQRUWXVCN5F4ARJAZOIRH","short_pith_number":"pith:DSCXDQQR","canonical_record":{"source":{"id":"1905.09771","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-23T16:50:54Z","cross_cats_sorted":["cs.NI","eess.SP"],"title_canon_sha256":"d9906328fca654324733fbcb31ff0317385f2e4caaa4a752112ade45d025f450","abstract_canon_sha256":"c67b80162fc3fb6f150e55fb23651aeb653061358055639aab864ed62ac56781"},"schema_version":"1.0"},"canonical_sha256":"1c8571c211a5af5137a5e0229065c889e9038622dad9f8e23aca932e3b31b5bb","source":{"kind":"arxiv","id":"1905.09771","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.09771","created_at":"2026-05-17T23:45:16Z"},{"alias_kind":"arxiv_version","alias_value":"1905.09771v1","created_at":"2026-05-17T23:45:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09771","created_at":"2026-05-17T23:45:16Z"},{"alias_kind":"pith_short_12","alias_value":"DSCXDQQRUWXV","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DSCXDQQRUWXVCN5F","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DSCXDQQR","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:DSCXDQQRUWXVCN5F4ARJAZOIRH","target":"record","payload":{"canonical_record":{"source":{"id":"1905.09771","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-23T16:50:54Z","cross_cats_sorted":["cs.NI","eess.SP"],"title_canon_sha256":"d9906328fca654324733fbcb31ff0317385f2e4caaa4a752112ade45d025f450","abstract_canon_sha256":"c67b80162fc3fb6f150e55fb23651aeb653061358055639aab864ed62ac56781"},"schema_version":"1.0"},"canonical_sha256":"1c8571c211a5af5137a5e0229065c889e9038622dad9f8e23aca932e3b31b5bb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:16.088833Z","signature_b64":"7moaZ2jrSyT/Y17g1UM6V+Gw52rxoK/ZFHf/W0zJxiiVmJRUUCFw/XcCeQc2qqmwvIPdhvxY5P8SVeCXO46dBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c8571c211a5af5137a5e0229065c889e9038622dad9f8e23aca932e3b31b5bb","last_reissued_at":"2026-05-17T23:45:16.088177Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:16.088177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.09771","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:45:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7zC7TSY4sEFfgTfeXTFFjQ7PYBnnDno0MaNjDwmtmTUC7XTQSE7QgR1OiRDBC+LGA0Hr6ASonev0EYLNKmEfCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:16:42.030933Z"},"content_sha256":"f7d845a60f37f47477504f8e982886f2e2d8bc85bdb195b3f48d2d5d7dd705f5","schema_version":"1.0","event_id":"sha256:f7d845a60f37f47477504f8e982886f2e2d8bc85bdb195b3f48d2d5d7dd705f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:DSCXDQQRUWXVCN5F4ARJAZOIRH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Service Mobile Traffic Forecasting via Convolutional Long Short-Term Memories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","eess.SP"],"primary_cat":"cs.LG","authors_text":"Chaoyun Zhang, Marco Fiore, Paul Patras","submitted_at":"2019-05-23T16:50:54Z","abstract_excerpt":"Network slicing is increasingly used to partition network infrastructure between different mobile services. Precise service-wise mobile traffic forecasting becomes essential in this context, as mobile operators seek to pre-allocate resources to each slice in advance, to meet the distinct requirements of individual services. This paper attacks the problem of multi-service mobile traffic forecasting using a sequence-to-sequence (S2S) learning paradigm and convolutional long short-term memories (ConvLSTMs). The proposed architecture is designed so as to effectively extract complex spatiotemporal "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.09771","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:45:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lh2ovLq6jmtBOqPcV9f6JGmlrVx3Bta9+CGnKVyhOyVKcsL2LqtuDnrqWxIyhRi4ebdr99ReKXToCGhdzj1JAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:16:42.031652Z"},"content_sha256":"547f6a5988ae5ac440d2617d6783c0b17f8cc570f329eccdf4c653b3991e3aae","schema_version":"1.0","event_id":"sha256:547f6a5988ae5ac440d2617d6783c0b17f8cc570f329eccdf4c653b3991e3aae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DSCXDQQRUWXVCN5F4ARJAZOIRH/bundle.json","state_url":"https://pith.science/pith/DSCXDQQRUWXVCN5F4ARJAZOIRH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DSCXDQQRUWXVCN5F4ARJAZOIRH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-08T20:16:42Z","links":{"resolver":"https://pith.science/pith/DSCXDQQRUWXVCN5F4ARJAZOIRH","bundle":"https://pith.science/pith/DSCXDQQRUWXVCN5F4ARJAZOIRH/bundle.json","state":"https://pith.science/pith/DSCXDQQRUWXVCN5F4ARJAZOIRH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DSCXDQQRUWXVCN5F4ARJAZOIRH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:DSCXDQQRUWXVCN5F4ARJAZOIRH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c67b80162fc3fb6f150e55fb23651aeb653061358055639aab864ed62ac56781","cross_cats_sorted":["cs.NI","eess.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-23T16:50:54Z","title_canon_sha256":"d9906328fca654324733fbcb31ff0317385f2e4caaa4a752112ade45d025f450"},"schema_version":"1.0","source":{"id":"1905.09771","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.09771","created_at":"2026-05-17T23:45:16Z"},{"alias_kind":"arxiv_version","alias_value":"1905.09771v1","created_at":"2026-05-17T23:45:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09771","created_at":"2026-05-17T23:45:16Z"},{"alias_kind":"pith_short_12","alias_value":"DSCXDQQRUWXV","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DSCXDQQRUWXVCN5F","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DSCXDQQR","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:547f6a5988ae5ac440d2617d6783c0b17f8cc570f329eccdf4c653b3991e3aae","target":"graph","created_at":"2026-05-17T23:45:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Network slicing is increasingly used to partition network infrastructure between different mobile services. Precise service-wise mobile traffic forecasting becomes essential in this context, as mobile operators seek to pre-allocate resources to each slice in advance, to meet the distinct requirements of individual services. This paper attacks the problem of multi-service mobile traffic forecasting using a sequence-to-sequence (S2S) learning paradigm and convolutional long short-term memories (ConvLSTMs). The proposed architecture is designed so as to effectively extract complex spatiotemporal ","authors_text":"Chaoyun Zhang, Marco Fiore, Paul Patras","cross_cats":["cs.NI","eess.SP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-23T16:50:54Z","title":"Multi-Service Mobile Traffic Forecasting via Convolutional Long Short-Term Memories"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.09771","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f7d845a60f37f47477504f8e982886f2e2d8bc85bdb195b3f48d2d5d7dd705f5","target":"record","created_at":"2026-05-17T23:45:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c67b80162fc3fb6f150e55fb23651aeb653061358055639aab864ed62ac56781","cross_cats_sorted":["cs.NI","eess.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-23T16:50:54Z","title_canon_sha256":"d9906328fca654324733fbcb31ff0317385f2e4caaa4a752112ade45d025f450"},"schema_version":"1.0","source":{"id":"1905.09771","kind":"arxiv","version":1}},"canonical_sha256":"1c8571c211a5af5137a5e0229065c889e9038622dad9f8e23aca932e3b31b5bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1c8571c211a5af5137a5e0229065c889e9038622dad9f8e23aca932e3b31b5bb","first_computed_at":"2026-05-17T23:45:16.088177Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:16.088177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7moaZ2jrSyT/Y17g1UM6V+Gw52rxoK/ZFHf/W0zJxiiVmJRUUCFw/XcCeQc2qqmwvIPdhvxY5P8SVeCXO46dBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:16.088833Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.09771","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7d845a60f37f47477504f8e982886f2e2d8bc85bdb195b3f48d2d5d7dd705f5","sha256:547f6a5988ae5ac440d2617d6783c0b17f8cc570f329eccdf4c653b3991e3aae"],"state_sha256":"45e8d772d8a099283e2ab70b2b5d7af70c3c0cf6c4b1bb04c9a628dc2d60635e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1ed1ojqr//5cRaJp0kzrCK7zjQKYUGORaDZhwagaJQgB/R9qv4fFlnMd7+V773W4YaM0KAFbkCyVVSYp3B4xBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T20:16:42.035603Z","bundle_sha256":"6309bedae41f02fa24b478e394bce7f24d2a8e7a3109c953bba0fe5a1ec93788"}}