{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:O3GESSRJKT3SNI6GZTQDYZJV24","short_pith_number":"pith:O3GESSRJ","schema_version":"1.0","canonical_sha256":"76cc494a2954f726a3c6cce03c6535d711619d1f63d0a08191b1e49327c33673","source":{"kind":"arxiv","id":"2606.19833","version":1},"attestation_state":"computed","paper":{"title":"Fault-Tolerant Shared-Relay Communication in Circulant Interconnection Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NI","math.IT"],"primary_cat":"cs.DC","authors_text":"Bader Albader, Galal Hassan, Mohamed R. Al-Mulla","submitted_at":"2026-06-18T06:25:51Z","abstract_excerpt":"Circulant interconnection networks provide symmetric addressing, compact generator descriptions, and uniform local connectivity. This paper maps a degree--redundancy landscape for a fault-tolerant two-hop primitive in directed circulants: given $n$ nodes and degree budget $m$, how large can the worst-case shared-relay multiplicity $R(n,m)$ be? A node is a shared relay for an ordered terminal pair if it has outgoing links to both terminals; an $f$-relay-fault-tolerant circulant requires at least $f+1$ such relays for every pair. The underlying feasibility condition is a cyclic difference-multip"},"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":"2606.19833","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-06-18T06:25:51Z","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"title_canon_sha256":"3e4a8c8e577562c123de6cbdbb7a2a32ba3dfcf76a51c6024ff1fef081535f63","abstract_canon_sha256":"5de0b9be371d00f8e68790734108b49a9bb008488ea23c31587a97c3ecb0ccad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:12:36.494357Z","signature_b64":"HW5ncZtfAKnLjQCuksW6044boX2Ruuwdlk5+RyKgq4AqGLuaniL1YEbD/V2WxyI5APiQqD4cehLCIsCuhSp/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76cc494a2954f726a3c6cce03c6535d711619d1f63d0a08191b1e49327c33673","last_reissued_at":"2026-06-19T16:12:36.494012Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:12:36.494012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fault-Tolerant Shared-Relay Communication in Circulant Interconnection Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NI","math.IT"],"primary_cat":"cs.DC","authors_text":"Bader Albader, Galal Hassan, Mohamed R. Al-Mulla","submitted_at":"2026-06-18T06:25:51Z","abstract_excerpt":"Circulant interconnection networks provide symmetric addressing, compact generator descriptions, and uniform local connectivity. This paper maps a degree--redundancy landscape for a fault-tolerant two-hop primitive in directed circulants: given $n$ nodes and degree budget $m$, how large can the worst-case shared-relay multiplicity $R(n,m)$ be? A node is a shared relay for an ordered terminal pair if it has outgoing links to both terminals; an $f$-relay-fault-tolerant circulant requires at least $f+1$ such relays for every pair. The underlying feasibility condition is a cyclic difference-multip"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.19833","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.19833/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.19833","created_at":"2026-06-19T16:12:36.494070+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.19833v1","created_at":"2026-06-19T16:12:36.494070+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.19833","created_at":"2026-06-19T16:12:36.494070+00:00"},{"alias_kind":"pith_short_12","alias_value":"O3GESSRJKT3S","created_at":"2026-06-19T16:12:36.494070+00:00"},{"alias_kind":"pith_short_16","alias_value":"O3GESSRJKT3SNI6G","created_at":"2026-06-19T16:12:36.494070+00:00"},{"alias_kind":"pith_short_8","alias_value":"O3GESSRJ","created_at":"2026-06-19T16:12:36.494070+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/O3GESSRJKT3SNI6GZTQDYZJV24","json":"https://pith.science/pith/O3GESSRJKT3SNI6GZTQDYZJV24.json","graph_json":"https://pith.science/api/pith-number/O3GESSRJKT3SNI6GZTQDYZJV24/graph.json","events_json":"https://pith.science/api/pith-number/O3GESSRJKT3SNI6GZTQDYZJV24/events.json","paper":"https://pith.science/paper/O3GESSRJ"},"agent_actions":{"view_html":"https://pith.science/pith/O3GESSRJKT3SNI6GZTQDYZJV24","download_json":"https://pith.science/pith/O3GESSRJKT3SNI6GZTQDYZJV24.json","view_paper":"https://pith.science/paper/O3GESSRJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.19833&json=true","fetch_graph":"https://pith.science/api/pith-number/O3GESSRJKT3SNI6GZTQDYZJV24/graph.json","fetch_events":"https://pith.science/api/pith-number/O3GESSRJKT3SNI6GZTQDYZJV24/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O3GESSRJKT3SNI6GZTQDYZJV24/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O3GESSRJKT3SNI6GZTQDYZJV24/action/storage_attestation","attest_author":"https://pith.science/pith/O3GESSRJKT3SNI6GZTQDYZJV24/action/author_attestation","sign_citation":"https://pith.science/pith/O3GESSRJKT3SNI6GZTQDYZJV24/action/citation_signature","submit_replication":"https://pith.science/pith/O3GESSRJKT3SNI6GZTQDYZJV24/action/replication_record"}},"created_at":"2026-06-19T16:12:36.494070+00:00","updated_at":"2026-06-19T16:12:36.494070+00:00"}