{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:WUXIH7RLVJLPX6NLQHDCRTHZOZ","short_pith_number":"pith:WUXIH7RL","canonical_record":{"source":{"id":"2509.11239","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2025-09-14T12:29:49Z","cross_cats_sorted":[],"title_canon_sha256":"7092f259a142640cbf187096774dbdd0f71376e583c3600c18684f38758a374c","abstract_canon_sha256":"878a95b40ef55578d63fa5a8121e86e5ba450b1690ce67263aa3a4980fc66ea9"},"schema_version":"1.0"},"canonical_sha256":"b52e83fe2baa56fbf9ab81c628ccf97668682dce62fb935cacf9faa1f2e3a28e","source":{"kind":"arxiv","id":"2509.11239","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.11239","created_at":"2026-07-05T12:11:35Z"},{"alias_kind":"arxiv_version","alias_value":"2509.11239v1","created_at":"2026-07-05T12:11:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.11239","created_at":"2026-07-05T12:11:35Z"},{"alias_kind":"pith_short_12","alias_value":"WUXIH7RLVJLP","created_at":"2026-07-05T12:11:35Z"},{"alias_kind":"pith_short_16","alias_value":"WUXIH7RLVJLPX6NL","created_at":"2026-07-05T12:11:35Z"},{"alias_kind":"pith_short_8","alias_value":"WUXIH7RL","created_at":"2026-07-05T12:11:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:WUXIH7RLVJLPX6NLQHDCRTHZOZ","target":"record","payload":{"canonical_record":{"source":{"id":"2509.11239","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2025-09-14T12:29:49Z","cross_cats_sorted":[],"title_canon_sha256":"7092f259a142640cbf187096774dbdd0f71376e583c3600c18684f38758a374c","abstract_canon_sha256":"878a95b40ef55578d63fa5a8121e86e5ba450b1690ce67263aa3a4980fc66ea9"},"schema_version":"1.0"},"canonical_sha256":"b52e83fe2baa56fbf9ab81c628ccf97668682dce62fb935cacf9faa1f2e3a28e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:11:35.902028Z","signature_b64":"c43BzcygK60E+BBUz/WAnz53MdfEOPb2XxWgMfOa4uOYz8ztldUoYGqueFHZX+VOEnfKACGmqzUB76Yo9+MnCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b52e83fe2baa56fbf9ab81c628ccf97668682dce62fb935cacf9faa1f2e3a28e","last_reissued_at":"2026-07-05T12:11:35.901400Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:11:35.901400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2509.11239","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-05T12:11:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hiwZalmqsMp0TZe1aLFT3WvLxu5Mb97pEYQYfN06IRe21ID26St8m7t5McTNXgJXruFG0FdUOSqR8vp2OFqMCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T16:27:37.499452Z"},"content_sha256":"d7709868739fdc5fe1038b89435ce45dd60fdf69dcd5dd97c1b29078857e3d14","schema_version":"1.0","event_id":"sha256:d7709868739fdc5fe1038b89435ce45dd60fdf69dcd5dd97c1b29078857e3d14"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:WUXIH7RLVJLPX6NLQHDCRTHZOZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Layer Perceptron-Based Relay Node Selection for Next-Generation Intelligent Delay-Tolerant Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Milena Radenkovic, Zhekun Huang","submitted_at":"2025-09-14T12:29:49Z","abstract_excerpt":"Delay Tolerant Networks (DTNs) are critical for emergency communication in highly dynamic and challenging scenarios characterized by intermittent connectivity, frequent disruptions, and unpredictable node mobility. While some protocols are widely adopted for simplicity and low overhead, their static replication strategy lacks the ability to adaptively distinguish high-quality relay nodes, often leading to inefficient and suboptimal message dissemination. To address this challenge, we propose a novel intelligent routing enhancement that integrates machine learning-based node evaluation into the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.11239","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/2509.11239/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-05T12:11:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YSmPtPnqPtlHueYnnpjxcCtyfQFmOgIL5sBin43HsNh+x97vcMFSb+dFI0Q1Kj2DuKnfoZnZOYZA3YT5H1VcBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T16:27:37.500220Z"},"content_sha256":"933948a2d8c131304a6b89213965cab8e4ecbed6bede7b242735f5ec66e4ebfd","schema_version":"1.0","event_id":"sha256:933948a2d8c131304a6b89213965cab8e4ecbed6bede7b242735f5ec66e4ebfd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WUXIH7RLVJLPX6NLQHDCRTHZOZ/bundle.json","state_url":"https://pith.science/pith/WUXIH7RLVJLPX6NLQHDCRTHZOZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WUXIH7RLVJLPX6NLQHDCRTHZOZ/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-11T16:27:37Z","links":{"resolver":"https://pith.science/pith/WUXIH7RLVJLPX6NLQHDCRTHZOZ","bundle":"https://pith.science/pith/WUXIH7RLVJLPX6NLQHDCRTHZOZ/bundle.json","state":"https://pith.science/pith/WUXIH7RLVJLPX6NLQHDCRTHZOZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WUXIH7RLVJLPX6NLQHDCRTHZOZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:WUXIH7RLVJLPX6NLQHDCRTHZOZ","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":"878a95b40ef55578d63fa5a8121e86e5ba450b1690ce67263aa3a4980fc66ea9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2025-09-14T12:29:49Z","title_canon_sha256":"7092f259a142640cbf187096774dbdd0f71376e583c3600c18684f38758a374c"},"schema_version":"1.0","source":{"id":"2509.11239","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.11239","created_at":"2026-07-05T12:11:35Z"},{"alias_kind":"arxiv_version","alias_value":"2509.11239v1","created_at":"2026-07-05T12:11:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.11239","created_at":"2026-07-05T12:11:35Z"},{"alias_kind":"pith_short_12","alias_value":"WUXIH7RLVJLP","created_at":"2026-07-05T12:11:35Z"},{"alias_kind":"pith_short_16","alias_value":"WUXIH7RLVJLPX6NL","created_at":"2026-07-05T12:11:35Z"},{"alias_kind":"pith_short_8","alias_value":"WUXIH7RL","created_at":"2026-07-05T12:11:35Z"}],"graph_snapshots":[{"event_id":"sha256:933948a2d8c131304a6b89213965cab8e4ecbed6bede7b242735f5ec66e4ebfd","target":"graph","created_at":"2026-07-05T12:11:35Z","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/2509.11239/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Delay Tolerant Networks (DTNs) are critical for emergency communication in highly dynamic and challenging scenarios characterized by intermittent connectivity, frequent disruptions, and unpredictable node mobility. While some protocols are widely adopted for simplicity and low overhead, their static replication strategy lacks the ability to adaptively distinguish high-quality relay nodes, often leading to inefficient and suboptimal message dissemination. To address this challenge, we propose a novel intelligent routing enhancement that integrates machine learning-based node evaluation into the","authors_text":"Milena Radenkovic, Zhekun Huang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2025-09-14T12:29:49Z","title":"Multi-Layer Perceptron-Based Relay Node Selection for Next-Generation Intelligent Delay-Tolerant Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.11239","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:d7709868739fdc5fe1038b89435ce45dd60fdf69dcd5dd97c1b29078857e3d14","target":"record","created_at":"2026-07-05T12:11:35Z","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":"878a95b40ef55578d63fa5a8121e86e5ba450b1690ce67263aa3a4980fc66ea9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2025-09-14T12:29:49Z","title_canon_sha256":"7092f259a142640cbf187096774dbdd0f71376e583c3600c18684f38758a374c"},"schema_version":"1.0","source":{"id":"2509.11239","kind":"arxiv","version":1}},"canonical_sha256":"b52e83fe2baa56fbf9ab81c628ccf97668682dce62fb935cacf9faa1f2e3a28e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b52e83fe2baa56fbf9ab81c628ccf97668682dce62fb935cacf9faa1f2e3a28e","first_computed_at":"2026-07-05T12:11:35.901400Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:11:35.901400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c43BzcygK60E+BBUz/WAnz53MdfEOPb2XxWgMfOa4uOYz8ztldUoYGqueFHZX+VOEnfKACGmqzUB76Yo9+MnCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T12:11:35.902028Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.11239","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7709868739fdc5fe1038b89435ce45dd60fdf69dcd5dd97c1b29078857e3d14","sha256:933948a2d8c131304a6b89213965cab8e4ecbed6bede7b242735f5ec66e4ebfd"],"state_sha256":"311ed0d667f676ceae7b9cb3c4f6c1c4066c5f2008344be43f71a47df323c12d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GEX5FrNof269USHwZL5Kw6+YZxU1Bnrdn+nXvnlNp8YdX9JkvTp+l6BsiHE+Wvt+DwsKkWmqn6xl/dC+es1mDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T16:27:37.504666Z","bundle_sha256":"6fe761376579e28f7cfb070cbd3170280570a3e7d2b5a95f51e5725d3653a213"}}