{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:T7O2SMUZCYSJJAZW6XEH7UAUH3","short_pith_number":"pith:T7O2SMUZ","schema_version":"1.0","canonical_sha256":"9fdda932991624948336f5c87fd0143ec168ff447cc20a465ed8048b836cd5ab","source":{"kind":"arxiv","id":"1905.03086","version":1},"attestation_state":"computed","paper":{"title":"Fault-Tolerant Routing in Hypercube Networks by Avoiding Faulty Nodes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.NI","authors_text":"Pejman Khadivi, Shadrokh Samavi","submitted_at":"2019-05-01T07:30:54Z","abstract_excerpt":"Next to the high performance, the essential feature of the multiprocessor systems is their fault-tolerant capability. In this regard, fault-tolerant interconnection networks and especially fault-tolerant routing methods are crucial parts of these systems. Hypercube is a popular interconnection network that is used in many multiprocessors. There are several suggested practices for fault tolerant routing in these systems. In this paper, a neural routing method is introduced which is named as Fault Avoidance Routing (FAR). This method keeps the message as far from the faulty nodes as possible. Th"},"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":"1905.03086","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-05-01T07:30:54Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9550a3ba4907a32bccf3232dbf42b5a8d5c57a8e4c2abc3476cf3b098849191b","abstract_canon_sha256":"7a2789b65c25ee6f1052e772d6fc9e6e23882012d2b5c8e0a252294e69529683"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:42.920074Z","signature_b64":"JxEgT8g9pMGWrbuW8qNxWA05LRoFYB8QoSgdoruFScjyKMqq62v6+JGFOfT6M8vs9UL1Vo0YSJVs82PlW54bAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9fdda932991624948336f5c87fd0143ec168ff447cc20a465ed8048b836cd5ab","last_reissued_at":"2026-05-17T23:46:42.919426Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:42.919426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fault-Tolerant Routing in Hypercube Networks by Avoiding Faulty Nodes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.NI","authors_text":"Pejman Khadivi, Shadrokh Samavi","submitted_at":"2019-05-01T07:30:54Z","abstract_excerpt":"Next to the high performance, the essential feature of the multiprocessor systems is their fault-tolerant capability. In this regard, fault-tolerant interconnection networks and especially fault-tolerant routing methods are crucial parts of these systems. Hypercube is a popular interconnection network that is used in many multiprocessors. There are several suggested practices for fault tolerant routing in these systems. In this paper, a neural routing method is introduced which is named as Fault Avoidance Routing (FAR). This method keeps the message as far from the faulty nodes as possible. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03086","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":"1905.03086","created_at":"2026-05-17T23:46:42.919541+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.03086v1","created_at":"2026-05-17T23:46:42.919541+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03086","created_at":"2026-05-17T23:46:42.919541+00:00"},{"alias_kind":"pith_short_12","alias_value":"T7O2SMUZCYSJ","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"T7O2SMUZCYSJJAZW","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"T7O2SMUZ","created_at":"2026-05-18T12:33:27.125529+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/T7O2SMUZCYSJJAZW6XEH7UAUH3","json":"https://pith.science/pith/T7O2SMUZCYSJJAZW6XEH7UAUH3.json","graph_json":"https://pith.science/api/pith-number/T7O2SMUZCYSJJAZW6XEH7UAUH3/graph.json","events_json":"https://pith.science/api/pith-number/T7O2SMUZCYSJJAZW6XEH7UAUH3/events.json","paper":"https://pith.science/paper/T7O2SMUZ"},"agent_actions":{"view_html":"https://pith.science/pith/T7O2SMUZCYSJJAZW6XEH7UAUH3","download_json":"https://pith.science/pith/T7O2SMUZCYSJJAZW6XEH7UAUH3.json","view_paper":"https://pith.science/paper/T7O2SMUZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.03086&json=true","fetch_graph":"https://pith.science/api/pith-number/T7O2SMUZCYSJJAZW6XEH7UAUH3/graph.json","fetch_events":"https://pith.science/api/pith-number/T7O2SMUZCYSJJAZW6XEH7UAUH3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T7O2SMUZCYSJJAZW6XEH7UAUH3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T7O2SMUZCYSJJAZW6XEH7UAUH3/action/storage_attestation","attest_author":"https://pith.science/pith/T7O2SMUZCYSJJAZW6XEH7UAUH3/action/author_attestation","sign_citation":"https://pith.science/pith/T7O2SMUZCYSJJAZW6XEH7UAUH3/action/citation_signature","submit_replication":"https://pith.science/pith/T7O2SMUZCYSJJAZW6XEH7UAUH3/action/replication_record"}},"created_at":"2026-05-17T23:46:42.919541+00:00","updated_at":"2026-05-17T23:46:42.919541+00:00"}