{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YF7MPN6YMRF2EIKXSYCPVN4HSG","short_pith_number":"pith:YF7MPN6Y","canonical_record":{"source":{"id":"1705.05690","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-05-16T12:57:24Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"6944e58388470de24bda920716ec58dbce74275e4c77442e0fdb616344758cb2","abstract_canon_sha256":"787732986dcb7b1ab868f36d51e2525750d3b191fc7ebcf87a12c9328c393e0d"},"schema_version":"1.0"},"canonical_sha256":"c17ec7b7d8644ba221579604fab78791b7f9c62f0cdb374e9db46c360216a374","source":{"kind":"arxiv","id":"1705.05690","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.05690","created_at":"2026-05-18T00:42:43Z"},{"alias_kind":"arxiv_version","alias_value":"1705.05690v3","created_at":"2026-05-18T00:42:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05690","created_at":"2026-05-18T00:42:43Z"},{"alias_kind":"pith_short_12","alias_value":"YF7MPN6YMRF2","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YF7MPN6YMRF2EIKX","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YF7MPN6Y","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YF7MPN6YMRF2EIKXSYCPVN4HSG","target":"record","payload":{"canonical_record":{"source":{"id":"1705.05690","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-05-16T12:57:24Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"6944e58388470de24bda920716ec58dbce74275e4c77442e0fdb616344758cb2","abstract_canon_sha256":"787732986dcb7b1ab868f36d51e2525750d3b191fc7ebcf87a12c9328c393e0d"},"schema_version":"1.0"},"canonical_sha256":"c17ec7b7d8644ba221579604fab78791b7f9c62f0cdb374e9db46c360216a374","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:43.523711Z","signature_b64":"h4aDbnY7qq4F2zBJtaYBiR/7Q5I1SaYfoRIEzSPYdyK2V4RTGqSU1yBnWd9EvEekh0bcIaoiEEX41Q7HpwiGCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c17ec7b7d8644ba221579604fab78791b7f9c62f0cdb374e9db46c360216a374","last_reissued_at":"2026-05-18T00:42:43.523023Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:43.523023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.05690","source_version":3,"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-18T00:42:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zVKQY3BHSx3LLTNCGzPpg4pFC0tQwb6cSCtWoW2zDfBk2vqH/fRDAP6VrBfqJ3y1p/zk886x7J1HElGoSlPNCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T19:29:06.982176Z"},"content_sha256":"88821528e1dcce5d1a33016043602ef2d2c966358ed7be561acbc65e7ff2edb8","schema_version":"1.0","event_id":"sha256:88821528e1dcce5d1a33016043602ef2d2c966358ed7be561acbc65e7ff2edb8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YF7MPN6YMRF2EIKXSYCPVN4HSG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Long Short-Term Memory Recurrent Neural Network Framework for Network Traffic Matrix Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.NI","authors_text":"Abdelhadi Azzouni, Guy Pujolle","submitted_at":"2017-05-16T12:57:24Z","abstract_excerpt":"Network Traffic Matrix (TM) prediction is defined as the problem of estimating future network traffic from the previous and achieved network traffic data. It is widely used in network planning, resource management and network security. Long Short-Term Memory (LSTM) is a specific recurrent neural network (RNN) architecture that is well-suited to learn from experience to classify, process and predict time series with time lags of unknown size. LSTMs have been shown to model temporal sequences and their long-range dependencies more accurately than conventional RNNs. In this paper, we propose a LS"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05690","kind":"arxiv","version":3},"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-18T00:42:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BpoIBWA8lae/Tca1bKJUnAEoIvSBBEAuV14teY5inFa0Jlo8y/w1oEUrmBPwuTOASQiF34jPudJcQXyY3NklAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T19:29:06.982866Z"},"content_sha256":"d6c4929fae29d0a9389bbc4baf6c4d16a97cdfe1fbbdf6481c55a580480126ec","schema_version":"1.0","event_id":"sha256:d6c4929fae29d0a9389bbc4baf6c4d16a97cdfe1fbbdf6481c55a580480126ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YF7MPN6YMRF2EIKXSYCPVN4HSG/bundle.json","state_url":"https://pith.science/pith/YF7MPN6YMRF2EIKXSYCPVN4HSG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YF7MPN6YMRF2EIKXSYCPVN4HSG/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-08-15T19:29:06Z","links":{"resolver":"https://pith.science/pith/YF7MPN6YMRF2EIKXSYCPVN4HSG","bundle":"https://pith.science/pith/YF7MPN6YMRF2EIKXSYCPVN4HSG/bundle.json","state":"https://pith.science/pith/YF7MPN6YMRF2EIKXSYCPVN4HSG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YF7MPN6YMRF2EIKXSYCPVN4HSG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YF7MPN6YMRF2EIKXSYCPVN4HSG","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":"787732986dcb7b1ab868f36d51e2525750d3b191fc7ebcf87a12c9328c393e0d","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-05-16T12:57:24Z","title_canon_sha256":"6944e58388470de24bda920716ec58dbce74275e4c77442e0fdb616344758cb2"},"schema_version":"1.0","source":{"id":"1705.05690","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.05690","created_at":"2026-05-18T00:42:43Z"},{"alias_kind":"arxiv_version","alias_value":"1705.05690v3","created_at":"2026-05-18T00:42:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05690","created_at":"2026-05-18T00:42:43Z"},{"alias_kind":"pith_short_12","alias_value":"YF7MPN6YMRF2","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YF7MPN6YMRF2EIKX","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YF7MPN6Y","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:d6c4929fae29d0a9389bbc4baf6c4d16a97cdfe1fbbdf6481c55a580480126ec","target":"graph","created_at":"2026-05-18T00:42:43Z","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 Traffic Matrix (TM) prediction is defined as the problem of estimating future network traffic from the previous and achieved network traffic data. It is widely used in network planning, resource management and network security. Long Short-Term Memory (LSTM) is a specific recurrent neural network (RNN) architecture that is well-suited to learn from experience to classify, process and predict time series with time lags of unknown size. LSTMs have been shown to model temporal sequences and their long-range dependencies more accurately than conventional RNNs. In this paper, we propose a LS","authors_text":"Abdelhadi Azzouni, Guy Pujolle","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-05-16T12:57:24Z","title":"A Long Short-Term Memory Recurrent Neural Network Framework for Network Traffic Matrix Prediction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05690","kind":"arxiv","version":3},"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:88821528e1dcce5d1a33016043602ef2d2c966358ed7be561acbc65e7ff2edb8","target":"record","created_at":"2026-05-18T00:42:43Z","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":"787732986dcb7b1ab868f36d51e2525750d3b191fc7ebcf87a12c9328c393e0d","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-05-16T12:57:24Z","title_canon_sha256":"6944e58388470de24bda920716ec58dbce74275e4c77442e0fdb616344758cb2"},"schema_version":"1.0","source":{"id":"1705.05690","kind":"arxiv","version":3}},"canonical_sha256":"c17ec7b7d8644ba221579604fab78791b7f9c62f0cdb374e9db46c360216a374","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c17ec7b7d8644ba221579604fab78791b7f9c62f0cdb374e9db46c360216a374","first_computed_at":"2026-05-18T00:42:43.523023Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:43.523023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h4aDbnY7qq4F2zBJtaYBiR/7Q5I1SaYfoRIEzSPYdyK2V4RTGqSU1yBnWd9EvEekh0bcIaoiEEX41Q7HpwiGCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:43.523711Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.05690","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:88821528e1dcce5d1a33016043602ef2d2c966358ed7be561acbc65e7ff2edb8","sha256:d6c4929fae29d0a9389bbc4baf6c4d16a97cdfe1fbbdf6481c55a580480126ec"],"state_sha256":"d743ec992eea0e09984405eb29c621e31d319feed13ca0380304efb53ee4fe24"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9ucFKvu11m83MK8cWCYt/abeXiumoRmxJyCS8LJGWacR8TTDn0J/Mbyj9PIUgCN4X0zSsJLR/CbIOdVezXYACA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T19:29:06.986824Z","bundle_sha256":"5bb9aa086603423b786645c4c9d0fbc0975b8a6b90cdf81b244583bba53117db"}}