{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:EHE43LZ4GAL36RPGBMYWTCKHHS","short_pith_number":"pith:EHE43LZ4","schema_version":"1.0","canonical_sha256":"21c9cdaf3c3017bf45e60b316989473c98c603090c65e77cc3c2cf24d3d5faa3","source":{"kind":"arxiv","id":"1601.01245","version":1},"attestation_state":"computed","paper":{"title":"Loop Free Multipath Routing Algorithm","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Anita Yadav, Rashmi Singh, Yatindra Nath Singh","submitted_at":"2016-01-06T17:24:36Z","abstract_excerpt":"Single path routing that is currently used in the internet routers,is easy to implement as it simplifies the routing tables and packet flow paths. However it is not optimal and has shortcomings in utilizing the network resources optimally, load balancing & fast recovery in case of faults (fault tolerance). The given algorithm resolves all these problems by using all possible multiple paths for transfer of information, while retaining loop-free property. We have proposed a new dynamic loop-free multipath routing algorithm which improves network throughput and network resource utilization, reduc"},"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":"1601.01245","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.NI","submitted_at":"2016-01-06T17:24:36Z","cross_cats_sorted":[],"title_canon_sha256":"f863652e2ca5255ab03a54f615060487fc8559a0190e7db84f87464176ad13c0","abstract_canon_sha256":"da392fa61f3fa67d6b4c84bf456e7837f03ca9e015c223da3d2aca9fdaa5c8d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:17.421329Z","signature_b64":"Ki5hTibyfUImXujkgNVVWJM64Z8c/heDv3SwpmR+oSlzl/56cf16E+RTfI5r3HLbMlyIESkovyB7CAKODuP2Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21c9cdaf3c3017bf45e60b316989473c98c603090c65e77cc3c2cf24d3d5faa3","last_reissued_at":"2026-05-18T01:23:17.420561Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:17.420561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Loop Free Multipath Routing Algorithm","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Anita Yadav, Rashmi Singh, Yatindra Nath Singh","submitted_at":"2016-01-06T17:24:36Z","abstract_excerpt":"Single path routing that is currently used in the internet routers,is easy to implement as it simplifies the routing tables and packet flow paths. However it is not optimal and has shortcomings in utilizing the network resources optimally, load balancing & fast recovery in case of faults (fault tolerance). The given algorithm resolves all these problems by using all possible multiple paths for transfer of information, while retaining loop-free property. We have proposed a new dynamic loop-free multipath routing algorithm which improves network throughput and network resource utilization, reduc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.01245","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":"1601.01245","created_at":"2026-05-18T01:23:17.420702+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.01245v1","created_at":"2026-05-18T01:23:17.420702+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01245","created_at":"2026-05-18T01:23:17.420702+00:00"},{"alias_kind":"pith_short_12","alias_value":"EHE43LZ4GAL3","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"EHE43LZ4GAL36RPG","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"EHE43LZ4","created_at":"2026-05-18T12:30:12.583610+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/EHE43LZ4GAL36RPGBMYWTCKHHS","json":"https://pith.science/pith/EHE43LZ4GAL36RPGBMYWTCKHHS.json","graph_json":"https://pith.science/api/pith-number/EHE43LZ4GAL36RPGBMYWTCKHHS/graph.json","events_json":"https://pith.science/api/pith-number/EHE43LZ4GAL36RPGBMYWTCKHHS/events.json","paper":"https://pith.science/paper/EHE43LZ4"},"agent_actions":{"view_html":"https://pith.science/pith/EHE43LZ4GAL36RPGBMYWTCKHHS","download_json":"https://pith.science/pith/EHE43LZ4GAL36RPGBMYWTCKHHS.json","view_paper":"https://pith.science/paper/EHE43LZ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.01245&json=true","fetch_graph":"https://pith.science/api/pith-number/EHE43LZ4GAL36RPGBMYWTCKHHS/graph.json","fetch_events":"https://pith.science/api/pith-number/EHE43LZ4GAL36RPGBMYWTCKHHS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EHE43LZ4GAL36RPGBMYWTCKHHS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EHE43LZ4GAL36RPGBMYWTCKHHS/action/storage_attestation","attest_author":"https://pith.science/pith/EHE43LZ4GAL36RPGBMYWTCKHHS/action/author_attestation","sign_citation":"https://pith.science/pith/EHE43LZ4GAL36RPGBMYWTCKHHS/action/citation_signature","submit_replication":"https://pith.science/pith/EHE43LZ4GAL36RPGBMYWTCKHHS/action/replication_record"}},"created_at":"2026-05-18T01:23:17.420702+00:00","updated_at":"2026-05-18T01:23:17.420702+00:00"}