{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:QP3TLWSIFQDELU3PS7ZTT5G22O","short_pith_number":"pith:QP3TLWSI","canonical_record":{"source":{"id":"2505.21553","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2025-05-26T04:23:54Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"9c60f4c1130e96211c2a8890d9f79cd84a90c27fbd3e63ab0c3347f1290a6892","abstract_canon_sha256":"9de44145f0383d72062ebfe8019a1425dd3e4bd5a311bb8faf0215f666356b70"},"schema_version":"1.0"},"canonical_sha256":"83f735da482c0645d36f97f339f4dad395801451d3494051c190032cc1c5b1b9","source":{"kind":"arxiv","id":"2505.21553","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.21553","created_at":"2026-07-05T11:10:59Z"},{"alias_kind":"arxiv_version","alias_value":"2505.21553v1","created_at":"2026-07-05T11:10:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.21553","created_at":"2026-07-05T11:10:59Z"},{"alias_kind":"pith_short_12","alias_value":"QP3TLWSIFQDE","created_at":"2026-07-05T11:10:59Z"},{"alias_kind":"pith_short_16","alias_value":"QP3TLWSIFQDELU3P","created_at":"2026-07-05T11:10:59Z"},{"alias_kind":"pith_short_8","alias_value":"QP3TLWSI","created_at":"2026-07-05T11:10:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:QP3TLWSIFQDELU3PS7ZTT5G22O","target":"record","payload":{"canonical_record":{"source":{"id":"2505.21553","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2025-05-26T04:23:54Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"9c60f4c1130e96211c2a8890d9f79cd84a90c27fbd3e63ab0c3347f1290a6892","abstract_canon_sha256":"9de44145f0383d72062ebfe8019a1425dd3e4bd5a311bb8faf0215f666356b70"},"schema_version":"1.0"},"canonical_sha256":"83f735da482c0645d36f97f339f4dad395801451d3494051c190032cc1c5b1b9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:10:59.777600Z","signature_b64":"yTtk07VX5vhBTMFs0LqYpvmwbdFsjLxkGadDqWPst7nndi71BDbKecgNFbz7XMaMOYnSvticI/hC4xunn2WBDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83f735da482c0645d36f97f339f4dad395801451d3494051c190032cc1c5b1b9","last_reissued_at":"2026-07-05T11:10:59.777148Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:10:59.777148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.21553","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-07-05T11:10:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LLaZTiahoFwdNlQmNF7Wa/2Bt4iOn1/7Vm1c06rY16BCdUAVgMHCIXLMTowpjz6bxGH6WlleVABuFCRACtTiBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T13:13:25.965372Z"},"content_sha256":"f6ecc8f4f11e5c0e5399adc5bfc1b5ed37066895b9aa7944a0ee0ebdfa4aedeb","schema_version":"1.0","event_id":"sha256:f6ecc8f4f11e5c0e5399adc5bfc1b5ed37066895b9aa7944a0ee0ebdfa4aedeb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:QP3TLWSIFQDELU3PS7ZTT5G22O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"MetaSTNet: Multimodal Meta-learning for Cellular Traffic Conformal Prediction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.NI","authors_text":"Hui Ma, Kai Yang","submitted_at":"2025-05-26T04:23:54Z","abstract_excerpt":"Network traffic prediction techniques have attracted much attention since they are valuable for network congestion control and user experience improvement. While existing prediction techniques can achieve favorable performance when there is sufficient training data, it remains a great challenge to make accurate predictions when only a small amount of training data is available. To tackle this problem, we propose a deep learning model, entitled MetaSTNet, based on a multimodal meta-learning framework. It is an end-to-end network architecture that trains the model in a simulator and transfers th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.21553","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/2505.21553/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"},"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-07-05T11:10:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kr+wrSPC6qjsotXm1uH2I948pZGxjSwEehOZfIaVVG0fkOKjuOli5Sa9Nwg9gJB5zJ9TdKNVcjOo4nAsmgXSAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T13:13:25.965727Z"},"content_sha256":"5a1f027a6dc950bee2e484b129e50c94a7d2bf7ee84cab0442599fc060d22b92","schema_version":"1.0","event_id":"sha256:5a1f027a6dc950bee2e484b129e50c94a7d2bf7ee84cab0442599fc060d22b92"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QP3TLWSIFQDELU3PS7ZTT5G22O/bundle.json","state_url":"https://pith.science/pith/QP3TLWSIFQDELU3PS7ZTT5G22O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QP3TLWSIFQDELU3PS7ZTT5G22O/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-21T13:13:25Z","links":{"resolver":"https://pith.science/pith/QP3TLWSIFQDELU3PS7ZTT5G22O","bundle":"https://pith.science/pith/QP3TLWSIFQDELU3PS7ZTT5G22O/bundle.json","state":"https://pith.science/pith/QP3TLWSIFQDELU3PS7ZTT5G22O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QP3TLWSIFQDELU3PS7ZTT5G22O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:QP3TLWSIFQDELU3PS7ZTT5G22O","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":"9de44145f0383d72062ebfe8019a1425dd3e4bd5a311bb8faf0215f666356b70","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2025-05-26T04:23:54Z","title_canon_sha256":"9c60f4c1130e96211c2a8890d9f79cd84a90c27fbd3e63ab0c3347f1290a6892"},"schema_version":"1.0","source":{"id":"2505.21553","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.21553","created_at":"2026-07-05T11:10:59Z"},{"alias_kind":"arxiv_version","alias_value":"2505.21553v1","created_at":"2026-07-05T11:10:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.21553","created_at":"2026-07-05T11:10:59Z"},{"alias_kind":"pith_short_12","alias_value":"QP3TLWSIFQDE","created_at":"2026-07-05T11:10:59Z"},{"alias_kind":"pith_short_16","alias_value":"QP3TLWSIFQDELU3P","created_at":"2026-07-05T11:10:59Z"},{"alias_kind":"pith_short_8","alias_value":"QP3TLWSI","created_at":"2026-07-05T11:10:59Z"}],"graph_snapshots":[{"event_id":"sha256:5a1f027a6dc950bee2e484b129e50c94a7d2bf7ee84cab0442599fc060d22b92","target":"graph","created_at":"2026-07-05T11:10:59Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2505.21553/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Network traffic prediction techniques have attracted much attention since they are valuable for network congestion control and user experience improvement. While existing prediction techniques can achieve favorable performance when there is sufficient training data, it remains a great challenge to make accurate predictions when only a small amount of training data is available. To tackle this problem, we propose a deep learning model, entitled MetaSTNet, based on a multimodal meta-learning framework. It is an end-to-end network architecture that trains the model in a simulator and transfers th","authors_text":"Hui Ma, Kai Yang","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2025-05-26T04:23:54Z","title":"MetaSTNet: Multimodal Meta-learning for Cellular Traffic Conformal Prediction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.21553","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:f6ecc8f4f11e5c0e5399adc5bfc1b5ed37066895b9aa7944a0ee0ebdfa4aedeb","target":"record","created_at":"2026-07-05T11:10:59Z","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":"9de44145f0383d72062ebfe8019a1425dd3e4bd5a311bb8faf0215f666356b70","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2025-05-26T04:23:54Z","title_canon_sha256":"9c60f4c1130e96211c2a8890d9f79cd84a90c27fbd3e63ab0c3347f1290a6892"},"schema_version":"1.0","source":{"id":"2505.21553","kind":"arxiv","version":1}},"canonical_sha256":"83f735da482c0645d36f97f339f4dad395801451d3494051c190032cc1c5b1b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83f735da482c0645d36f97f339f4dad395801451d3494051c190032cc1c5b1b9","first_computed_at":"2026-07-05T11:10:59.777148Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:10:59.777148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yTtk07VX5vhBTMFs0LqYpvmwbdFsjLxkGadDqWPst7nndi71BDbKecgNFbz7XMaMOYnSvticI/hC4xunn2WBDA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:10:59.777600Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.21553","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f6ecc8f4f11e5c0e5399adc5bfc1b5ed37066895b9aa7944a0ee0ebdfa4aedeb","sha256:5a1f027a6dc950bee2e484b129e50c94a7d2bf7ee84cab0442599fc060d22b92"],"state_sha256":"99d6f7318b74ce4d3766eb94d9032673363e1bca372fafcfbfe11700cb09191c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CZGr3wi94UC2Q++j/yvIVDcoi5IujsGLEuKerl7DlJ2dUfnoMHvDH+EmC7N6upD8UMOQIiz7Z1T/OWbYSjamAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T13:13:25.969303Z","bundle_sha256":"579f56989b076e677d51a4368ccbc54d90b41b449abf7fe47f766baedf5188d3"}}