{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QIEF7U22L6TNQ4FXTTRSAMTGKY","short_pith_number":"pith:QIEF7U22","schema_version":"1.0","canonical_sha256":"82085fd35a5fa6d870b79ce32032665619b0dd248fc76c35b18d3e25d8c45e99","source":{"kind":"arxiv","id":"1708.01703","version":1},"attestation_state":"computed","paper":{"title":"The tightly super 3-extra connectivity and 3-extra diagnosability of crossed cubes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Shiying Wang, Xiaolei Ma","submitted_at":"2017-08-05T03:08:10Z","abstract_excerpt":"Many multiprocessor systems have interconnection networks as underlying topologies and an interconnection network is usually represented by a graph where nodes represent processors and links represent communication links between processors. In 2016, Zhang et al. proposed the $g$-extra diagnosability of $G$, which restrains that every component of $G-S$ has at least $(g +1)$ vertices. As an important variant of the hypercube, the $n$-dimensional crossed cube $CQ_{n}$ has many good properties. In this paper, we prove that $CQ_{n}$ is tightly $(4n-9)$ super 3-extra connected for $n\\geq 7$ and the"},"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":"1708.01703","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-05T03:08:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4b00a3df5388feefe946d87b331b36c72230a829c251247683153329ed5ef65f","abstract_canon_sha256":"de36c1f9b31c9f0f9c07a80aa103398822b383d833ceec897eb2402f53383c28"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:35.146337Z","signature_b64":"RtJm7X3Ipj1F0GArd94Or3BGh9xWsFrBhvFquh0T198fNoJhmDrDpRIk5+oGXA14vfFSVxzE2bSbv0gl06l6DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82085fd35a5fa6d870b79ce32032665619b0dd248fc76c35b18d3e25d8c45e99","last_reissued_at":"2026-05-18T00:38:35.145879Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:35.145879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The tightly super 3-extra connectivity and 3-extra diagnosability of crossed cubes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Shiying Wang, Xiaolei Ma","submitted_at":"2017-08-05T03:08:10Z","abstract_excerpt":"Many multiprocessor systems have interconnection networks as underlying topologies and an interconnection network is usually represented by a graph where nodes represent processors and links represent communication links between processors. In 2016, Zhang et al. proposed the $g$-extra diagnosability of $G$, which restrains that every component of $G-S$ has at least $(g +1)$ vertices. As an important variant of the hypercube, the $n$-dimensional crossed cube $CQ_{n}$ has many good properties. In this paper, we prove that $CQ_{n}$ is tightly $(4n-9)$ super 3-extra connected for $n\\geq 7$ and the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01703","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1708.01703","created_at":"2026-05-18T00:38:35.145944+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.01703v1","created_at":"2026-05-18T00:38:35.145944+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01703","created_at":"2026-05-18T00:38:35.145944+00:00"},{"alias_kind":"pith_short_12","alias_value":"QIEF7U22L6TN","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"QIEF7U22L6TNQ4FX","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"QIEF7U22","created_at":"2026-05-18T12:31:39.905425+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/QIEF7U22L6TNQ4FXTTRSAMTGKY","json":"https://pith.science/pith/QIEF7U22L6TNQ4FXTTRSAMTGKY.json","graph_json":"https://pith.science/api/pith-number/QIEF7U22L6TNQ4FXTTRSAMTGKY/graph.json","events_json":"https://pith.science/api/pith-number/QIEF7U22L6TNQ4FXTTRSAMTGKY/events.json","paper":"https://pith.science/paper/QIEF7U22"},"agent_actions":{"view_html":"https://pith.science/pith/QIEF7U22L6TNQ4FXTTRSAMTGKY","download_json":"https://pith.science/pith/QIEF7U22L6TNQ4FXTTRSAMTGKY.json","view_paper":"https://pith.science/paper/QIEF7U22","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.01703&json=true","fetch_graph":"https://pith.science/api/pith-number/QIEF7U22L6TNQ4FXTTRSAMTGKY/graph.json","fetch_events":"https://pith.science/api/pith-number/QIEF7U22L6TNQ4FXTTRSAMTGKY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QIEF7U22L6TNQ4FXTTRSAMTGKY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QIEF7U22L6TNQ4FXTTRSAMTGKY/action/storage_attestation","attest_author":"https://pith.science/pith/QIEF7U22L6TNQ4FXTTRSAMTGKY/action/author_attestation","sign_citation":"https://pith.science/pith/QIEF7U22L6TNQ4FXTTRSAMTGKY/action/citation_signature","submit_replication":"https://pith.science/pith/QIEF7U22L6TNQ4FXTTRSAMTGKY/action/replication_record"}},"created_at":"2026-05-18T00:38:35.145944+00:00","updated_at":"2026-05-18T00:38:35.145944+00:00"}