{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4J6NKOCCE73LS35ICKLVYYKSQA","short_pith_number":"pith:4J6NKOCC","canonical_record":{"source":{"id":"1811.11262","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-10-25T04:59:37Z","cross_cats_sorted":[],"title_canon_sha256":"e77382aea7a67bfd94dea01ac392daddaf584b24e5cdc64d89a0dd57ef927259","abstract_canon_sha256":"6a37c08f92de8bee7d555c490990614705cd4fc61bd0cc4da86bf0890f56d08b"},"schema_version":"1.0"},"canonical_sha256":"e27cd5384227f6b96fa812975c6152802b30f1688124d6a1aed8f2185d8dff39","source":{"kind":"arxiv","id":"1811.11262","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.11262","created_at":"2026-05-17T23:59:44Z"},{"alias_kind":"arxiv_version","alias_value":"1811.11262v1","created_at":"2026-05-17T23:59:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11262","created_at":"2026-05-17T23:59:44Z"},{"alias_kind":"pith_short_12","alias_value":"4J6NKOCCE73L","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4J6NKOCCE73LS35I","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4J6NKOCC","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4J6NKOCCE73LS35ICKLVYYKSQA","target":"record","payload":{"canonical_record":{"source":{"id":"1811.11262","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-10-25T04:59:37Z","cross_cats_sorted":[],"title_canon_sha256":"e77382aea7a67bfd94dea01ac392daddaf584b24e5cdc64d89a0dd57ef927259","abstract_canon_sha256":"6a37c08f92de8bee7d555c490990614705cd4fc61bd0cc4da86bf0890f56d08b"},"schema_version":"1.0"},"canonical_sha256":"e27cd5384227f6b96fa812975c6152802b30f1688124d6a1aed8f2185d8dff39","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:44.334712Z","signature_b64":"lxjDvbxPJMb0+TJiC9/jA8+thjS4yOMmQQlqIiSxc1F59iWVoidgmp9KRZVuxmRZh5bVVs/NIjRtUDPFY25eCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e27cd5384227f6b96fa812975c6152802b30f1688124d6a1aed8f2185d8dff39","last_reissued_at":"2026-05-17T23:59:44.334277Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:44.334277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.11262","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:59:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z1UwTQFknr0pVVv+5NRLL/YOSvkzEmmVDzWChwCMUtnaIkcRlqfw15FTsWjfv2UNqPrDXU0wSH/YWzjI5+3RCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:50:36.508789Z"},"content_sha256":"24175994986fb5a1c29ee82b6c3ed58b63b8fd95ec8e7b59f6c0f1a57e49929c","schema_version":"1.0","event_id":"sha256:24175994986fb5a1c29ee82b6c3ed58b63b8fd95ec8e7b59f6c0f1a57e49929c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4J6NKOCCE73LS35ICKLVYYKSQA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A General, Fault tolerant, Adaptive, Deadlock-free Routing Protocol for Network-on-chip","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Didier Colle, Eduard Alarc\\'on, Mario Pickavet, Pieter Stroobant, Sergi Abadal, Wouter Tavernier","submitted_at":"2018-10-25T04:59:37Z","abstract_excerpt":"The paper presents a topology-agnostic greedy protocol for network-on-chip routing. The proposed routing algorithm can tolerate any number of permanent faults, and is proven to be deadlock-free. We introduce a specialized variant of the algorithm, which is optimized for 2D mesh networks, both flat and wireless. The adaptiveness and minimality of several variants this algorithm are analyzed through graph-based simulations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11262","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:59:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iaqaxb2EFIsIY41a3WksSVEF/tLdEwBZidhJUlv6sRrsdjQOb0pZ+zpXq6V4BkHZukONnSYinlQtu1E/kfhEAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:50:36.509136Z"},"content_sha256":"4a321f3bd9392b4d36b060010a8d3b864599157f47727b97f9d0b15386be5a34","schema_version":"1.0","event_id":"sha256:4a321f3bd9392b4d36b060010a8d3b864599157f47727b97f9d0b15386be5a34"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4J6NKOCCE73LS35ICKLVYYKSQA/bundle.json","state_url":"https://pith.science/pith/4J6NKOCCE73LS35ICKLVYYKSQA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4J6NKOCCE73LS35ICKLVYYKSQA/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-01T06:50:36Z","links":{"resolver":"https://pith.science/pith/4J6NKOCCE73LS35ICKLVYYKSQA","bundle":"https://pith.science/pith/4J6NKOCCE73LS35ICKLVYYKSQA/bundle.json","state":"https://pith.science/pith/4J6NKOCCE73LS35ICKLVYYKSQA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4J6NKOCCE73LS35ICKLVYYKSQA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4J6NKOCCE73LS35ICKLVYYKSQA","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":"6a37c08f92de8bee7d555c490990614705cd4fc61bd0cc4da86bf0890f56d08b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-10-25T04:59:37Z","title_canon_sha256":"e77382aea7a67bfd94dea01ac392daddaf584b24e5cdc64d89a0dd57ef927259"},"schema_version":"1.0","source":{"id":"1811.11262","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.11262","created_at":"2026-05-17T23:59:44Z"},{"alias_kind":"arxiv_version","alias_value":"1811.11262v1","created_at":"2026-05-17T23:59:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11262","created_at":"2026-05-17T23:59:44Z"},{"alias_kind":"pith_short_12","alias_value":"4J6NKOCCE73L","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4J6NKOCCE73LS35I","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4J6NKOCC","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:4a321f3bd9392b4d36b060010a8d3b864599157f47727b97f9d0b15386be5a34","target":"graph","created_at":"2026-05-17T23:59:44Z","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":"The paper presents a topology-agnostic greedy protocol for network-on-chip routing. The proposed routing algorithm can tolerate any number of permanent faults, and is proven to be deadlock-free. We introduce a specialized variant of the algorithm, which is optimized for 2D mesh networks, both flat and wireless. The adaptiveness and minimality of several variants this algorithm are analyzed through graph-based simulations.","authors_text":"Didier Colle, Eduard Alarc\\'on, Mario Pickavet, Pieter Stroobant, Sergi Abadal, Wouter Tavernier","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-10-25T04:59:37Z","title":"A General, Fault tolerant, Adaptive, Deadlock-free Routing Protocol for Network-on-chip"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11262","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:24175994986fb5a1c29ee82b6c3ed58b63b8fd95ec8e7b59f6c0f1a57e49929c","target":"record","created_at":"2026-05-17T23:59:44Z","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":"6a37c08f92de8bee7d555c490990614705cd4fc61bd0cc4da86bf0890f56d08b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-10-25T04:59:37Z","title_canon_sha256":"e77382aea7a67bfd94dea01ac392daddaf584b24e5cdc64d89a0dd57ef927259"},"schema_version":"1.0","source":{"id":"1811.11262","kind":"arxiv","version":1}},"canonical_sha256":"e27cd5384227f6b96fa812975c6152802b30f1688124d6a1aed8f2185d8dff39","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e27cd5384227f6b96fa812975c6152802b30f1688124d6a1aed8f2185d8dff39","first_computed_at":"2026-05-17T23:59:44.334277Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:44.334277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lxjDvbxPJMb0+TJiC9/jA8+thjS4yOMmQQlqIiSxc1F59iWVoidgmp9KRZVuxmRZh5bVVs/NIjRtUDPFY25eCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:44.334712Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.11262","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24175994986fb5a1c29ee82b6c3ed58b63b8fd95ec8e7b59f6c0f1a57e49929c","sha256:4a321f3bd9392b4d36b060010a8d3b864599157f47727b97f9d0b15386be5a34"],"state_sha256":"85167b7aaed99d751da728d6df7d96be65efe75810183aa997bfaa342e5bc4c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UT72zURnfAGLTQcnjrvGRpQ5HurT4Jriaok/0RXG0U4peLYt2gs2LqMp3OI+YqupHndyCuGWwaTEjcdQlkYWCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T06:50:36.511176Z","bundle_sha256":"73f42d05680b82b5b56f920b2c609c3f47838ecf701e77bda3c79ce4eeff3bc7"}}