{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:NXX6EERODTEXYJUY6JE7PRVWTN","short_pith_number":"pith:NXX6EERO","schema_version":"1.0","canonical_sha256":"6defe2122e1cc97c2698f249f7c6b69b6f3b0bb58ccc852df5e55d4d597c8925","source":{"kind":"arxiv","id":"1204.0573","version":1},"attestation_state":"computed","paper":{"title":"Generalized Measures of Edge Fault Tolerance in (n,k)-star Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jun-Ming Xu, Xiang-jun Li","submitted_at":"2012-04-03T02:17:44Z","abstract_excerpt":"This paper considers a kind of generalized measure $\\lambda_s^{(h)}$ of fault tolerance in the $(n,k)$-star graph $S_{n,k}$ for $2\\leqslant k \\leqslant n-1$ and $0\\leqslant h \\leqslant n-k$, and determines $\\lambda_s^{(h)}(S_{n,k})=\\min\\{(n-h-1)(h+1), (n-k+1)(k-1)\\}$, which implies that at least $\\min\\{(n-k+1)(k-1),(n-h-1)(h+1)\\}$ edges of $S_{n,k}$ have to remove to get a disconnected graph that contains no vertices of degree less than $h$. This result shows that the $(n,k)$-star graph is robust when it is used to model the topological structure of a large-scale parallel processing system."},"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":"1204.0573","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-03T02:17:44Z","cross_cats_sorted":[],"title_canon_sha256":"7c3f3a220182ee4ec55dcbc3f727d7322bd8133977d42540f74e5ac594ddb378","abstract_canon_sha256":"ff762d97fa9c68b24caa458adcf5b6f42d32b954616baa32c8dab9ca8d2ef61a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:39.087392Z","signature_b64":"GX9R0Bo4jaBGf56cV8dEh/ZiB2jSxKEcmpj/fGJff4I9vstg2BAXkCLnRcIdtiap3V7HRLn4rbCzHDoDSyhXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6defe2122e1cc97c2698f249f7c6b69b6f3b0bb58ccc852df5e55d4d597c8925","last_reissued_at":"2026-05-18T03:58:39.086683Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:39.086683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Measures of Edge Fault Tolerance in (n,k)-star Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jun-Ming Xu, Xiang-jun Li","submitted_at":"2012-04-03T02:17:44Z","abstract_excerpt":"This paper considers a kind of generalized measure $\\lambda_s^{(h)}$ of fault tolerance in the $(n,k)$-star graph $S_{n,k}$ for $2\\leqslant k \\leqslant n-1$ and $0\\leqslant h \\leqslant n-k$, and determines $\\lambda_s^{(h)}(S_{n,k})=\\min\\{(n-h-1)(h+1), (n-k+1)(k-1)\\}$, which implies that at least $\\min\\{(n-k+1)(k-1),(n-h-1)(h+1)\\}$ edges of $S_{n,k}$ have to remove to get a disconnected graph that contains no vertices of degree less than $h$. This result shows that the $(n,k)$-star graph is robust when it is used to model the topological structure of a large-scale parallel processing system."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.0573","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":"1204.0573","created_at":"2026-05-18T03:58:39.086779+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.0573v1","created_at":"2026-05-18T03:58:39.086779+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0573","created_at":"2026-05-18T03:58:39.086779+00:00"},{"alias_kind":"pith_short_12","alias_value":"NXX6EERODTEX","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"NXX6EERODTEXYJUY","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"NXX6EERO","created_at":"2026-05-18T12:27:16.716162+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/NXX6EERODTEXYJUY6JE7PRVWTN","json":"https://pith.science/pith/NXX6EERODTEXYJUY6JE7PRVWTN.json","graph_json":"https://pith.science/api/pith-number/NXX6EERODTEXYJUY6JE7PRVWTN/graph.json","events_json":"https://pith.science/api/pith-number/NXX6EERODTEXYJUY6JE7PRVWTN/events.json","paper":"https://pith.science/paper/NXX6EERO"},"agent_actions":{"view_html":"https://pith.science/pith/NXX6EERODTEXYJUY6JE7PRVWTN","download_json":"https://pith.science/pith/NXX6EERODTEXYJUY6JE7PRVWTN.json","view_paper":"https://pith.science/paper/NXX6EERO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.0573&json=true","fetch_graph":"https://pith.science/api/pith-number/NXX6EERODTEXYJUY6JE7PRVWTN/graph.json","fetch_events":"https://pith.science/api/pith-number/NXX6EERODTEXYJUY6JE7PRVWTN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NXX6EERODTEXYJUY6JE7PRVWTN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NXX6EERODTEXYJUY6JE7PRVWTN/action/storage_attestation","attest_author":"https://pith.science/pith/NXX6EERODTEXYJUY6JE7PRVWTN/action/author_attestation","sign_citation":"https://pith.science/pith/NXX6EERODTEXYJUY6JE7PRVWTN/action/citation_signature","submit_replication":"https://pith.science/pith/NXX6EERODTEXYJUY6JE7PRVWTN/action/replication_record"}},"created_at":"2026-05-18T03:58:39.086779+00:00","updated_at":"2026-05-18T03:58:39.086779+00:00"}