{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:O3GESSRJKT3SNI6GZTQDYZJV24","short_pith_number":"pith:O3GESSRJ","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"},"canonical_sha256":"76cc494a2954f726a3c6cce03c6535d711619d1f63d0a08191b1e49327c33673","source":{"kind":"arxiv","id":"2606.19833","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.19833","created_at":"2026-06-19T16:12:36Z"},{"alias_kind":"arxiv_version","alias_value":"2606.19833v1","created_at":"2026-06-19T16:12:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.19833","created_at":"2026-06-19T16:12:36Z"},{"alias_kind":"pith_short_12","alias_value":"O3GESSRJKT3S","created_at":"2026-06-19T16:12:36Z"},{"alias_kind":"pith_short_16","alias_value":"O3GESSRJKT3SNI6G","created_at":"2026-06-19T16:12:36Z"},{"alias_kind":"pith_short_8","alias_value":"O3GESSRJ","created_at":"2026-06-19T16:12:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:O3GESSRJKT3SNI6GZTQDYZJV24","target":"record","payload":{"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"},"canonical_sha256":"76cc494a2954f726a3c6cce03c6535d711619d1f63d0a08191b1e49327c33673","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"},"source_kind":"arxiv","source_id":"2606.19833","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-06-19T16:12:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p8U8bHU8qNEIFRxm+fFNfHXuxlO/0XqSQ2tyAVYK39WDPhED3feQQEQljMunFHMboELTyhTOmITqA7z/lkO/Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T13:14:59.715738Z"},"content_sha256":"1441bb778315b86a1c6294fd8c9ebd2012b887c66690b1bb9aeac729921afec0","schema_version":"1.0","event_id":"sha256:1441bb778315b86a1c6294fd8c9ebd2012b887c66690b1bb9aeac729921afec0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:O3GESSRJKT3SNI6GZTQDYZJV24","target":"graph","payload":{"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"},"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-06-19T16:12:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"em40MAzr7dbNo1Pa4RITRYrOBIQVt8KrVqzA8r/DiHnRm5tqxhF/QE99HrVXlKy2pjK1rdfifJOUbZqCn6nNBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T13:14:59.716117Z"},"content_sha256":"b38253893c802f478e9761a0f69dc1bfa0a1117a949c3d642bf5f02e343a11f0","schema_version":"1.0","event_id":"sha256:b38253893c802f478e9761a0f69dc1bfa0a1117a949c3d642bf5f02e343a11f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O3GESSRJKT3SNI6GZTQDYZJV24/bundle.json","state_url":"https://pith.science/pith/O3GESSRJKT3SNI6GZTQDYZJV24/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O3GESSRJKT3SNI6GZTQDYZJV24/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-30T13:14:59Z","links":{"resolver":"https://pith.science/pith/O3GESSRJKT3SNI6GZTQDYZJV24","bundle":"https://pith.science/pith/O3GESSRJKT3SNI6GZTQDYZJV24/bundle.json","state":"https://pith.science/pith/O3GESSRJKT3SNI6GZTQDYZJV24/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O3GESSRJKT3SNI6GZTQDYZJV24/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:O3GESSRJKT3SNI6GZTQDYZJV24","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":"5de0b9be371d00f8e68790734108b49a9bb008488ea23c31587a97c3ecb0ccad","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-06-18T06:25:51Z","title_canon_sha256":"3e4a8c8e577562c123de6cbdbb7a2a32ba3dfcf76a51c6024ff1fef081535f63"},"schema_version":"1.0","source":{"id":"2606.19833","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.19833","created_at":"2026-06-19T16:12:36Z"},{"alias_kind":"arxiv_version","alias_value":"2606.19833v1","created_at":"2026-06-19T16:12:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.19833","created_at":"2026-06-19T16:12:36Z"},{"alias_kind":"pith_short_12","alias_value":"O3GESSRJKT3S","created_at":"2026-06-19T16:12:36Z"},{"alias_kind":"pith_short_16","alias_value":"O3GESSRJKT3SNI6G","created_at":"2026-06-19T16:12:36Z"},{"alias_kind":"pith_short_8","alias_value":"O3GESSRJ","created_at":"2026-06-19T16:12:36Z"}],"graph_snapshots":[{"event_id":"sha256:b38253893c802f478e9761a0f69dc1bfa0a1117a949c3d642bf5f02e343a11f0","target":"graph","created_at":"2026-06-19T16:12:36Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.19833/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Bader Albader, Galal Hassan, Mohamed R. Al-Mulla","cross_cats":["cs.IT","cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-06-18T06:25:51Z","title":"Fault-Tolerant Shared-Relay Communication in Circulant Interconnection Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.19833","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:1441bb778315b86a1c6294fd8c9ebd2012b887c66690b1bb9aeac729921afec0","target":"record","created_at":"2026-06-19T16:12:36Z","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":"5de0b9be371d00f8e68790734108b49a9bb008488ea23c31587a97c3ecb0ccad","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-06-18T06:25:51Z","title_canon_sha256":"3e4a8c8e577562c123de6cbdbb7a2a32ba3dfcf76a51c6024ff1fef081535f63"},"schema_version":"1.0","source":{"id":"2606.19833","kind":"arxiv","version":1}},"canonical_sha256":"76cc494a2954f726a3c6cce03c6535d711619d1f63d0a08191b1e49327c33673","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76cc494a2954f726a3c6cce03c6535d711619d1f63d0a08191b1e49327c33673","first_computed_at":"2026-06-19T16:12:36.494012Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:12:36.494012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HW5ncZtfAKnLjQCuksW6044boX2Ruuwdlk5+RyKgq4AqGLuaniL1YEbD/V2WxyI5APiQqD4cehLCIsCuhSp/AA==","signature_status":"signed_v1","signed_at":"2026-06-19T16:12:36.494357Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.19833","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1441bb778315b86a1c6294fd8c9ebd2012b887c66690b1bb9aeac729921afec0","sha256:b38253893c802f478e9761a0f69dc1bfa0a1117a949c3d642bf5f02e343a11f0"],"state_sha256":"f2e50a4dbfb5e7e230c80ca3587eca0b0a20622ec2e477b8526347074d6d3b4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K876B1KydrZeUFXTDre8k6vl2iZFz3oZ5e8QJ2iw0vAIAj630ivUJQqGe/scL5iadIQItAA2GiiP4LlGeh3hDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T13:14:59.718054Z","bundle_sha256":"09803fb908fbdfd71e79394d44f87f8cebf44821c157f365ca3164595c67dc78"}}