{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:T7O2SMUZCYSJJAZW6XEH7UAUH3","short_pith_number":"pith:T7O2SMUZ","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"},"canonical_sha256":"9fdda932991624948336f5c87fd0143ec168ff447cc20a465ed8048b836cd5ab","source":{"kind":"arxiv","id":"1905.03086","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.03086","created_at":"2026-05-17T23:46:42Z"},{"alias_kind":"arxiv_version","alias_value":"1905.03086v1","created_at":"2026-05-17T23:46:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03086","created_at":"2026-05-17T23:46:42Z"},{"alias_kind":"pith_short_12","alias_value":"T7O2SMUZCYSJ","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"T7O2SMUZCYSJJAZW","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"T7O2SMUZ","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:T7O2SMUZCYSJJAZW6XEH7UAUH3","target":"record","payload":{"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"},"canonical_sha256":"9fdda932991624948336f5c87fd0143ec168ff447cc20a465ed8048b836cd5ab","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"},"source_kind":"arxiv","source_id":"1905.03086","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-17T23:46:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7RjZ91CwaWe+FRct243SZLw/wHURpiWkEq3/PX8P/ABz16L6SzZ3lKGPKut07/yVqrc975TfHlxVtAkfTX+bBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T12:50:45.697700Z"},"content_sha256":"92706cc5af977e110f6d7494a133cd2c55ca44ef7f35aae048cb56ab70ecba86","schema_version":"1.0","event_id":"sha256:92706cc5af977e110f6d7494a133cd2c55ca44ef7f35aae048cb56ab70ecba86"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:T7O2SMUZCYSJJAZW6XEH7UAUH3","target":"graph","payload":{"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"},"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-17T23:46:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2dioNXqVTnakiM+rBErvTOs/pvEqtPfbu9A1NZdWWigYESxxBPI1/TKGMifKWHbMFqbuk9MCgiKgk/BQ92YcDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T12:50:45.698032Z"},"content_sha256":"0c67bb286830eeeddbcee7d1aab2e985600da31f16357f6542f73322700aabd2","schema_version":"1.0","event_id":"sha256:0c67bb286830eeeddbcee7d1aab2e985600da31f16357f6542f73322700aabd2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T7O2SMUZCYSJJAZW6XEH7UAUH3/bundle.json","state_url":"https://pith.science/pith/T7O2SMUZCYSJJAZW6XEH7UAUH3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T7O2SMUZCYSJJAZW6XEH7UAUH3/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-06-23T12:50:45Z","links":{"resolver":"https://pith.science/pith/T7O2SMUZCYSJJAZW6XEH7UAUH3","bundle":"https://pith.science/pith/T7O2SMUZCYSJJAZW6XEH7UAUH3/bundle.json","state":"https://pith.science/pith/T7O2SMUZCYSJJAZW6XEH7UAUH3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T7O2SMUZCYSJJAZW6XEH7UAUH3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:T7O2SMUZCYSJJAZW6XEH7UAUH3","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":"7a2789b65c25ee6f1052e772d6fc9e6e23882012d2b5c8e0a252294e69529683","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-05-01T07:30:54Z","title_canon_sha256":"9550a3ba4907a32bccf3232dbf42b5a8d5c57a8e4c2abc3476cf3b098849191b"},"schema_version":"1.0","source":{"id":"1905.03086","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.03086","created_at":"2026-05-17T23:46:42Z"},{"alias_kind":"arxiv_version","alias_value":"1905.03086v1","created_at":"2026-05-17T23:46:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03086","created_at":"2026-05-17T23:46:42Z"},{"alias_kind":"pith_short_12","alias_value":"T7O2SMUZCYSJ","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"T7O2SMUZCYSJJAZW","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"T7O2SMUZ","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:0c67bb286830eeeddbcee7d1aab2e985600da31f16357f6542f73322700aabd2","target":"graph","created_at":"2026-05-17T23:46:42Z","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":"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","authors_text":"Pejman Khadivi, Shadrokh Samavi","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-05-01T07:30:54Z","title":"Fault-Tolerant Routing in Hypercube Networks by Avoiding Faulty Nodes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03086","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:92706cc5af977e110f6d7494a133cd2c55ca44ef7f35aae048cb56ab70ecba86","target":"record","created_at":"2026-05-17T23:46:42Z","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":"7a2789b65c25ee6f1052e772d6fc9e6e23882012d2b5c8e0a252294e69529683","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-05-01T07:30:54Z","title_canon_sha256":"9550a3ba4907a32bccf3232dbf42b5a8d5c57a8e4c2abc3476cf3b098849191b"},"schema_version":"1.0","source":{"id":"1905.03086","kind":"arxiv","version":1}},"canonical_sha256":"9fdda932991624948336f5c87fd0143ec168ff447cc20a465ed8048b836cd5ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9fdda932991624948336f5c87fd0143ec168ff447cc20a465ed8048b836cd5ab","first_computed_at":"2026-05-17T23:46:42.919426Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:42.919426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JxEgT8g9pMGWrbuW8qNxWA05LRoFYB8QoSgdoruFScjyKMqq62v6+JGFOfT6M8vs9UL1Vo0YSJVs82PlW54bAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:42.920074Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.03086","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92706cc5af977e110f6d7494a133cd2c55ca44ef7f35aae048cb56ab70ecba86","sha256:0c67bb286830eeeddbcee7d1aab2e985600da31f16357f6542f73322700aabd2"],"state_sha256":"eaaba18e305010a216dee70b8a8e1c9c80ca6506700f1bfec3e5a9dad556749e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CTDdiatY21GXkeOHEzpoUjIGhfk6Qg7Zm2BnlvpDrTHGy/gcX1ZdMt/+OwmQ7aGXuzh8cYF8ttF0d7vzoxIyCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T12:50:45.699969Z","bundle_sha256":"5ac820fdd42b6ef41ebfa7567bc87d5c02f73b98e28bb002b5f820f75301902f"}}