{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WWTYPWOFVT2KWWDKLV6LUFILAZ","short_pith_number":"pith:WWTYPWOF","schema_version":"1.0","canonical_sha256":"b5a787d9c5acf4ab586a5d7cba150b066d42c4e8426ba0b82242a4c08fdf2f0a","source":{"kind":"arxiv","id":"1808.03643","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1808.03643","created_at":"2026-05-18T00:07:57.921654+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.03643v1","created_at":"2026-05-18T00:07:57.921654+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03643","created_at":"2026-05-18T00:07:57.921654+00:00"},{"alias_kind":"pith_short_12","alias_value":"WWTYPWOFVT2K","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"WWTYPWOFVT2KWWDK","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"WWTYPWOF","created_at":"2026-05-18T12:33:01.666342+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WWTYPWOFVT2KWWDKLV6LUFILAZ","json":"https://pith.science/pith/WWTYPWOFVT2KWWDKLV6LUFILAZ.json","graph_json":"https://pith.science/api/pith-number/WWTYPWOFVT2KWWDKLV6LUFILAZ/graph.json","events_json":"https://pith.science/api/pith-number/WWTYPWOFVT2KWWDKLV6LUFILAZ/events.json","paper":"https://pith.science/paper/WWTYPWOF"},"agent_actions":{"view_html":"https://pith.science/pith/WWTYPWOFVT2KWWDKLV6LUFILAZ","download_json":"https://pith.science/pith/WWTYPWOFVT2KWWDKLV6LUFILAZ.json","view_paper":"https://pith.science/paper/WWTYPWOF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.03643&json=true","fetch_graph":"https://pith.science/api/pith-number/WWTYPWOFVT2KWWDKLV6LUFILAZ/graph.json","fetch_events":"https://pith.science/api/pith-number/WWTYPWOFVT2KWWDKLV6LUFILAZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WWTYPWOFVT2KWWDKLV6LUFILAZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WWTYPWOFVT2KWWDKLV6LUFILAZ/action/storage_attestation","attest_author":"https://pith.science/pith/WWTYPWOFVT2KWWDKLV6LUFILAZ/action/author_attestation","sign_citation":"https://pith.science/pith/WWTYPWOFVT2KWWDKLV6LUFILAZ/action/citation_signature","submit_replication":"https://pith.science/pith/WWTYPWOFVT2KWWDKLV6LUFILAZ/action/replication_record"}},"created_at":"2026-05-18T00:07:57.921654+00:00","updated_at":"2026-05-18T00:07:57.921654+00:00"}