{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4EBBHOTGMVQXEFGICKUB4XJO2L","short_pith_number":"pith:4EBBHOTG","canonical_record":{"source":{"id":"1602.07374","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-24T02:45:58Z","cross_cats_sorted":[],"title_canon_sha256":"21fb8af4e1e851b8bae9670f225423808ac2fce9bae1b6e10eb1e510cb680ffb","abstract_canon_sha256":"ee056bc435bced79be6c1af069638e9128b0ec1896ff61d07ef415235ed5c720"},"schema_version":"1.0"},"canonical_sha256":"e10213ba6665617214c812a81e5d2ed2f1bec66ced8d0ac92ce4b27201af92ae","source":{"kind":"arxiv","id":"1602.07374","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07374","created_at":"2026-05-18T01:04:55Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07374v2","created_at":"2026-05-18T01:04:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07374","created_at":"2026-05-18T01:04:55Z"},{"alias_kind":"pith_short_12","alias_value":"4EBBHOTGMVQX","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4EBBHOTGMVQXEFGI","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4EBBHOTG","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4EBBHOTGMVQXEFGICKUB4XJO2L","target":"record","payload":{"canonical_record":{"source":{"id":"1602.07374","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-24T02:45:58Z","cross_cats_sorted":[],"title_canon_sha256":"21fb8af4e1e851b8bae9670f225423808ac2fce9bae1b6e10eb1e510cb680ffb","abstract_canon_sha256":"ee056bc435bced79be6c1af069638e9128b0ec1896ff61d07ef415235ed5c720"},"schema_version":"1.0"},"canonical_sha256":"e10213ba6665617214c812a81e5d2ed2f1bec66ced8d0ac92ce4b27201af92ae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:55.908864Z","signature_b64":"t+2GcAvS0lXAlLaTySqJA5w0WHMuaYRwMjI+NWB3k6holZkGtN1QNZ0bxO9BqtFhvXtW8JmRm5+QvNFTSKZsAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e10213ba6665617214c812a81e5d2ed2f1bec66ced8d0ac92ce4b27201af92ae","last_reissued_at":"2026-05-18T01:04:55.908201Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:55.908201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.07374","source_version":2,"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-18T01:04:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KlxWotthy/nOWiAPs7YkoxIMzW2giSmdjQ6EpMcqnIEGW7O7QErdh9tz2Yjmfw+fKs6dlkzs3EbPdumyN2DnAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T23:23:42.916966Z"},"content_sha256":"b9b77100596e0f341a775cffb8654ebdd6d533c107d7b563c37ad5fd0e6880cb","schema_version":"1.0","event_id":"sha256:b9b77100596e0f341a775cffb8654ebdd6d533c107d7b563c37ad5fd0e6880cb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4EBBHOTGMVQXEFGICKUB4XJO2L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recursive cubes of rings as models for interconnection networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hamid Mokhtar, Sanming Zhou","submitted_at":"2016-02-24T02:45:58Z","abstract_excerpt":"We study recursive cubes of rings as models for interconnection networks. We first redefine each of them as a Cayley graph on the semidirect product of an elementary abelian group by a cyclic group in order to facilitate the study of them by using algebraic tools. We give an algorithm for computing shortest paths and the distance between any two vertices in recursive cubes of rings, and obtain the exact value of their diameters. We obtain sharp bounds on the Wiener index, vertex-forwarding index, edge-forwarding index and bisection width of recursive cubes of rings. The cube-connected cycles a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07374","kind":"arxiv","version":2},"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-18T01:04:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dhtgnw4zStTxzrLEhJxnlqLi3AO8mZmaOBbLJorMaSyr25UGJeY2sghFt9jvwEOEIipFCxA2ZVSaWC06w8oTDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T23:23:42.917677Z"},"content_sha256":"315359ce5a3c841d2db27a6d3ccd19f4a3110c3f7298cf8e91a7bd0623945d82","schema_version":"1.0","event_id":"sha256:315359ce5a3c841d2db27a6d3ccd19f4a3110c3f7298cf8e91a7bd0623945d82"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4EBBHOTGMVQXEFGICKUB4XJO2L/bundle.json","state_url":"https://pith.science/pith/4EBBHOTGMVQXEFGICKUB4XJO2L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4EBBHOTGMVQXEFGICKUB4XJO2L/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-07T23:23:42Z","links":{"resolver":"https://pith.science/pith/4EBBHOTGMVQXEFGICKUB4XJO2L","bundle":"https://pith.science/pith/4EBBHOTGMVQXEFGICKUB4XJO2L/bundle.json","state":"https://pith.science/pith/4EBBHOTGMVQXEFGICKUB4XJO2L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4EBBHOTGMVQXEFGICKUB4XJO2L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4EBBHOTGMVQXEFGICKUB4XJO2L","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":"ee056bc435bced79be6c1af069638e9128b0ec1896ff61d07ef415235ed5c720","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-24T02:45:58Z","title_canon_sha256":"21fb8af4e1e851b8bae9670f225423808ac2fce9bae1b6e10eb1e510cb680ffb"},"schema_version":"1.0","source":{"id":"1602.07374","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07374","created_at":"2026-05-18T01:04:55Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07374v2","created_at":"2026-05-18T01:04:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07374","created_at":"2026-05-18T01:04:55Z"},{"alias_kind":"pith_short_12","alias_value":"4EBBHOTGMVQX","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4EBBHOTGMVQXEFGI","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4EBBHOTG","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:315359ce5a3c841d2db27a6d3ccd19f4a3110c3f7298cf8e91a7bd0623945d82","target":"graph","created_at":"2026-05-18T01:04:55Z","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":"We study recursive cubes of rings as models for interconnection networks. We first redefine each of them as a Cayley graph on the semidirect product of an elementary abelian group by a cyclic group in order to facilitate the study of them by using algebraic tools. We give an algorithm for computing shortest paths and the distance between any two vertices in recursive cubes of rings, and obtain the exact value of their diameters. We obtain sharp bounds on the Wiener index, vertex-forwarding index, edge-forwarding index and bisection width of recursive cubes of rings. The cube-connected cycles a","authors_text":"Hamid Mokhtar, Sanming Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-24T02:45:58Z","title":"Recursive cubes of rings as models for interconnection networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07374","kind":"arxiv","version":2},"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:b9b77100596e0f341a775cffb8654ebdd6d533c107d7b563c37ad5fd0e6880cb","target":"record","created_at":"2026-05-18T01:04:55Z","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":"ee056bc435bced79be6c1af069638e9128b0ec1896ff61d07ef415235ed5c720","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-24T02:45:58Z","title_canon_sha256":"21fb8af4e1e851b8bae9670f225423808ac2fce9bae1b6e10eb1e510cb680ffb"},"schema_version":"1.0","source":{"id":"1602.07374","kind":"arxiv","version":2}},"canonical_sha256":"e10213ba6665617214c812a81e5d2ed2f1bec66ced8d0ac92ce4b27201af92ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e10213ba6665617214c812a81e5d2ed2f1bec66ced8d0ac92ce4b27201af92ae","first_computed_at":"2026-05-18T01:04:55.908201Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:55.908201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t+2GcAvS0lXAlLaTySqJA5w0WHMuaYRwMjI+NWB3k6holZkGtN1QNZ0bxO9BqtFhvXtW8JmRm5+QvNFTSKZsAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:55.908864Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.07374","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9b77100596e0f341a775cffb8654ebdd6d533c107d7b563c37ad5fd0e6880cb","sha256:315359ce5a3c841d2db27a6d3ccd19f4a3110c3f7298cf8e91a7bd0623945d82"],"state_sha256":"3ecfa7b0cad21e47cb837a809635db728c38ca1f039bbc84a716ccde1d3eb86f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ltLvUdlHq6KoeNwesyGP5gL4SYs7GWum0HsLxOHgG+v+iLfysToFzNhMm9mHZExMdARNeG511AB7j7O5l4a6Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T23:23:42.921436Z","bundle_sha256":"63f50b5bbf0c9d37d8ee543043286fab3a2756ef03cd18f8af9fa6d6295e3895"}}