{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WWTYPWOFVT2KWWDKLV6LUFILAZ","short_pith_number":"pith:WWTYPWOF","canonical_record":{"source":{"id":"1808.03643","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-08-10T07:13:44Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"30227f3f14ac8f64e7eb68bb23399d85c23110d7eebeaaffab95308ea7659fc9","abstract_canon_sha256":"58d10a5d360f1a68b66b2961c2754feb6e874033810a7f43c47bdbba9ee400e9"},"schema_version":"1.0"},"canonical_sha256":"b5a787d9c5acf4ab586a5d7cba150b066d42c4e8426ba0b82242a4c08fdf2f0a","source":{"kind":"arxiv","id":"1808.03643","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.03643","created_at":"2026-05-18T00:07:57Z"},{"alias_kind":"arxiv_version","alias_value":"1808.03643v1","created_at":"2026-05-18T00:07:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03643","created_at":"2026-05-18T00:07:57Z"},{"alias_kind":"pith_short_12","alias_value":"WWTYPWOFVT2K","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WWTYPWOFVT2KWWDK","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WWTYPWOF","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WWTYPWOFVT2KWWDKLV6LUFILAZ","target":"record","payload":{"canonical_record":{"source":{"id":"1808.03643","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-08-10T07:13:44Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"30227f3f14ac8f64e7eb68bb23399d85c23110d7eebeaaffab95308ea7659fc9","abstract_canon_sha256":"58d10a5d360f1a68b66b2961c2754feb6e874033810a7f43c47bdbba9ee400e9"},"schema_version":"1.0"},"canonical_sha256":"b5a787d9c5acf4ab586a5d7cba150b066d42c4e8426ba0b82242a4c08fdf2f0a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:57.922231Z","signature_b64":"Jd+8qklDBJZCNRdSFMpf35udFbTfR2Ug8ymwV3pfSoADQIWZi7z4TwVi80XK16SQIr7Lt2roMss1kz9JNAAtCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5a787d9c5acf4ab586a5d7cba150b066d42c4e8426ba0b82242a4c08fdf2f0a","last_reissued_at":"2026-05-18T00:07:57.921538Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:57.921538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.03643","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-18T00:07:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E1ARgtXsC381eP3TLk1kLYP87ERlpnLx+DzO1gtubJNSeaQqkev9CUdL3LDETvalJMI06y95sH7TJheZnAbFCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:22:46.330169Z"},"content_sha256":"6acf2a935e02d374f9e5e6dd7b599fce57f25ad350a143b0c94c776854e5b350","schema_version":"1.0","event_id":"sha256:6acf2a935e02d374f9e5e6dd7b599fce57f25ad350a143b0c94c776854e5b350"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WWTYPWOFVT2KWWDKLV6LUFILAZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Self-Organization Scheme for Balanced Routing in Large-Scale Multi-Hop Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DC","authors_text":"David Saad, Justin P. Coon, Mihai-Alin Badiu","submitted_at":"2018-08-10T07:13:44Z","abstract_excerpt":"We propose a self-organization scheme for cost-effective and load-balanced routing in multi-hop networks. To avoid overloading nodes that provide favourable routing conditions, we assign each node with a cost function that penalizes high loads. Thus, finding routes to sink nodes is formulated as an optimization problem in which the global objective function strikes a balance between route costs and node loads. We apply belief propagation (its min-sum version) to solve the network optimization problem and obtain a distributed algorithm whereby the nodes collectively discover globally optimal ro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03643","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-18T00:07:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rUWHv9ACcocbnKm9DgDJ7MiWX1pL35BjKU5J7xFGKNZDQL2KyJhNc4l5kvcMMW8nTH8kblFKB3rEHZ/Koal7CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:22:46.330829Z"},"content_sha256":"a113b469a41ebd05f251e71cd9ba147c3e67982d1d694b7fcec38fc26fe0c566","schema_version":"1.0","event_id":"sha256:a113b469a41ebd05f251e71cd9ba147c3e67982d1d694b7fcec38fc26fe0c566"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WWTYPWOFVT2KWWDKLV6LUFILAZ/bundle.json","state_url":"https://pith.science/pith/WWTYPWOFVT2KWWDKLV6LUFILAZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WWTYPWOFVT2KWWDKLV6LUFILAZ/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-05-28T10:22:46Z","links":{"resolver":"https://pith.science/pith/WWTYPWOFVT2KWWDKLV6LUFILAZ","bundle":"https://pith.science/pith/WWTYPWOFVT2KWWDKLV6LUFILAZ/bundle.json","state":"https://pith.science/pith/WWTYPWOFVT2KWWDKLV6LUFILAZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WWTYPWOFVT2KWWDKLV6LUFILAZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WWTYPWOFVT2KWWDKLV6LUFILAZ","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":"58d10a5d360f1a68b66b2961c2754feb6e874033810a7f43c47bdbba9ee400e9","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-08-10T07:13:44Z","title_canon_sha256":"30227f3f14ac8f64e7eb68bb23399d85c23110d7eebeaaffab95308ea7659fc9"},"schema_version":"1.0","source":{"id":"1808.03643","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.03643","created_at":"2026-05-18T00:07:57Z"},{"alias_kind":"arxiv_version","alias_value":"1808.03643v1","created_at":"2026-05-18T00:07:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03643","created_at":"2026-05-18T00:07:57Z"},{"alias_kind":"pith_short_12","alias_value":"WWTYPWOFVT2K","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WWTYPWOFVT2KWWDK","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WWTYPWOF","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:a113b469a41ebd05f251e71cd9ba147c3e67982d1d694b7fcec38fc26fe0c566","target":"graph","created_at":"2026-05-18T00:07:57Z","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":"We propose a self-organization scheme for cost-effective and load-balanced routing in multi-hop networks. To avoid overloading nodes that provide favourable routing conditions, we assign each node with a cost function that penalizes high loads. Thus, finding routes to sink nodes is formulated as an optimization problem in which the global objective function strikes a balance between route costs and node loads. We apply belief propagation (its min-sum version) to solve the network optimization problem and obtain a distributed algorithm whereby the nodes collectively discover globally optimal ro","authors_text":"David Saad, Justin P. Coon, Mihai-Alin Badiu","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-08-10T07:13:44Z","title":"Self-Organization Scheme for Balanced Routing in Large-Scale Multi-Hop Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03643","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:6acf2a935e02d374f9e5e6dd7b599fce57f25ad350a143b0c94c776854e5b350","target":"record","created_at":"2026-05-18T00:07:57Z","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":"58d10a5d360f1a68b66b2961c2754feb6e874033810a7f43c47bdbba9ee400e9","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-08-10T07:13:44Z","title_canon_sha256":"30227f3f14ac8f64e7eb68bb23399d85c23110d7eebeaaffab95308ea7659fc9"},"schema_version":"1.0","source":{"id":"1808.03643","kind":"arxiv","version":1}},"canonical_sha256":"b5a787d9c5acf4ab586a5d7cba150b066d42c4e8426ba0b82242a4c08fdf2f0a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5a787d9c5acf4ab586a5d7cba150b066d42c4e8426ba0b82242a4c08fdf2f0a","first_computed_at":"2026-05-18T00:07:57.921538Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:57.921538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Jd+8qklDBJZCNRdSFMpf35udFbTfR2Ug8ymwV3pfSoADQIWZi7z4TwVi80XK16SQIr7Lt2roMss1kz9JNAAtCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:57.922231Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.03643","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6acf2a935e02d374f9e5e6dd7b599fce57f25ad350a143b0c94c776854e5b350","sha256:a113b469a41ebd05f251e71cd9ba147c3e67982d1d694b7fcec38fc26fe0c566"],"state_sha256":"82f6122a0ef4107a7597b0f21ec8c3ce8385a4785da90058dd7896beea0f68b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jQocoTInzvB+jBFvtDtMKKkMjTc0ym0FV7G4x3gZFqnoECUaZyCKZOGys/7FUWKO2woeuVk1tqsbvhxY64ORAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:22:46.333992Z","bundle_sha256":"c373ba7f28d9240fe8957b607d96eb20a04bfb90d21f04f3e867cf0d075582b3"}}