{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:XIFXEWMKRIT4VJ3AYBV3HKDYWG","short_pith_number":"pith:XIFXEWMK","canonical_record":{"source":{"id":"1204.4018","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-18T08:58:17Z","cross_cats_sorted":[],"title_canon_sha256":"1d29fab261f9475fcc14d110b8629841fd2be38a5faeff6e4f9442c1fa3dd129","abstract_canon_sha256":"7bb95e2907e0e4742746b1907b8b44b3fd3f17c627d1c7cc245fdf7f065cc5f8"},"schema_version":"1.0"},"canonical_sha256":"ba0b72598a8a27caa760c06bb3a878b1bbe8115cb05e793add031d16973ad0a6","source":{"kind":"arxiv","id":"1204.4018","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.4018","created_at":"2026-05-18T03:57:37Z"},{"alias_kind":"arxiv_version","alias_value":"1204.4018v1","created_at":"2026-05-18T03:57:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4018","created_at":"2026-05-18T03:57:37Z"},{"alias_kind":"pith_short_12","alias_value":"XIFXEWMKRIT4","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XIFXEWMKRIT4VJ3A","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XIFXEWMK","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:XIFXEWMKRIT4VJ3AYBV3HKDYWG","target":"record","payload":{"canonical_record":{"source":{"id":"1204.4018","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-18T08:58:17Z","cross_cats_sorted":[],"title_canon_sha256":"1d29fab261f9475fcc14d110b8629841fd2be38a5faeff6e4f9442c1fa3dd129","abstract_canon_sha256":"7bb95e2907e0e4742746b1907b8b44b3fd3f17c627d1c7cc245fdf7f065cc5f8"},"schema_version":"1.0"},"canonical_sha256":"ba0b72598a8a27caa760c06bb3a878b1bbe8115cb05e793add031d16973ad0a6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:37.966144Z","signature_b64":"33E30JwzSC4Kxx1YXXQyGqQIfsnFgqp6LOpdawymQzqKNisOdqFfnSYRIcux1tMB0xXOn8wZxm4dAu7g3cTPBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba0b72598a8a27caa760c06bb3a878b1bbe8115cb05e793add031d16973ad0a6","last_reissued_at":"2026-05-18T03:57:37.965556Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:37.965556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.4018","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-05-18T03:57:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/iv35lbA3DiT69aWwaskMuftanq3wEPwIOlt1nqF+J7A24uIQJipWHYUKfYX8Pp0ugc25vwUqND71cIXD90FCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T02:06:33.570855Z"},"content_sha256":"d9d7da953ef5b30c5e2609d7a925f27d76d2678c94fe58bc1a9775a024c6c9fe","schema_version":"1.0","event_id":"sha256:d9d7da953ef5b30c5e2609d7a925f27d76d2678c94fe58bc1a9775a024c6c9fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:XIFXEWMKRIT4VJ3AYBV3HKDYWG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fault Diagnosability of Arrangement Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jun-Ming Xu, Shuming Zhou","submitted_at":"2012-04-18T08:58:17Z","abstract_excerpt":"The growing size of the multiprocessor system increases its vulnerability to component failures. It is crucial to locate and to replace the faulty processors to maintain a system's high reliability. The fault diagnosis is the process of identifying faulty processors in a system through testing. This paper shows that the largest connected component of the survival graph contains almost all remaining vertices in the $(n,k)$-arrangement graph $A_{n,k}$ when the number of moved faulty vertices is up to twice or three times the traditional connectivity. Based on this fault resiliency, we establishe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4018","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"},"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-18T03:57:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ouBItFTaTT7jaCDI54XkYdaGhAowMegi9BIi3gBMQOIAecr6IdtssixzHXC0zclnjEozzllYUgy5vDs//ZHCBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T02:06:33.571205Z"},"content_sha256":"310f22a49362a5eb78441088e3f0b507c12b5fdce86def805aa6325298a85457","schema_version":"1.0","event_id":"sha256:310f22a49362a5eb78441088e3f0b507c12b5fdce86def805aa6325298a85457"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XIFXEWMKRIT4VJ3AYBV3HKDYWG/bundle.json","state_url":"https://pith.science/pith/XIFXEWMKRIT4VJ3AYBV3HKDYWG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XIFXEWMKRIT4VJ3AYBV3HKDYWG/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-24T02:06:33Z","links":{"resolver":"https://pith.science/pith/XIFXEWMKRIT4VJ3AYBV3HKDYWG","bundle":"https://pith.science/pith/XIFXEWMKRIT4VJ3AYBV3HKDYWG/bundle.json","state":"https://pith.science/pith/XIFXEWMKRIT4VJ3AYBV3HKDYWG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XIFXEWMKRIT4VJ3AYBV3HKDYWG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:XIFXEWMKRIT4VJ3AYBV3HKDYWG","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":"7bb95e2907e0e4742746b1907b8b44b3fd3f17c627d1c7cc245fdf7f065cc5f8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-18T08:58:17Z","title_canon_sha256":"1d29fab261f9475fcc14d110b8629841fd2be38a5faeff6e4f9442c1fa3dd129"},"schema_version":"1.0","source":{"id":"1204.4018","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.4018","created_at":"2026-05-18T03:57:37Z"},{"alias_kind":"arxiv_version","alias_value":"1204.4018v1","created_at":"2026-05-18T03:57:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4018","created_at":"2026-05-18T03:57:37Z"},{"alias_kind":"pith_short_12","alias_value":"XIFXEWMKRIT4","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XIFXEWMKRIT4VJ3A","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XIFXEWMK","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:310f22a49362a5eb78441088e3f0b507c12b5fdce86def805aa6325298a85457","target":"graph","created_at":"2026-05-18T03:57:37Z","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":"The growing size of the multiprocessor system increases its vulnerability to component failures. It is crucial to locate and to replace the faulty processors to maintain a system's high reliability. The fault diagnosis is the process of identifying faulty processors in a system through testing. This paper shows that the largest connected component of the survival graph contains almost all remaining vertices in the $(n,k)$-arrangement graph $A_{n,k}$ when the number of moved faulty vertices is up to twice or three times the traditional connectivity. Based on this fault resiliency, we establishe","authors_text":"Jun-Ming Xu, Shuming Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-18T08:58:17Z","title":"Fault Diagnosability of Arrangement Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4018","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:d9d7da953ef5b30c5e2609d7a925f27d76d2678c94fe58bc1a9775a024c6c9fe","target":"record","created_at":"2026-05-18T03:57:37Z","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":"7bb95e2907e0e4742746b1907b8b44b3fd3f17c627d1c7cc245fdf7f065cc5f8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-18T08:58:17Z","title_canon_sha256":"1d29fab261f9475fcc14d110b8629841fd2be38a5faeff6e4f9442c1fa3dd129"},"schema_version":"1.0","source":{"id":"1204.4018","kind":"arxiv","version":1}},"canonical_sha256":"ba0b72598a8a27caa760c06bb3a878b1bbe8115cb05e793add031d16973ad0a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ba0b72598a8a27caa760c06bb3a878b1bbe8115cb05e793add031d16973ad0a6","first_computed_at":"2026-05-18T03:57:37.965556Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:57:37.965556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"33E30JwzSC4Kxx1YXXQyGqQIfsnFgqp6LOpdawymQzqKNisOdqFfnSYRIcux1tMB0xXOn8wZxm4dAu7g3cTPBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:57:37.966144Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.4018","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d9d7da953ef5b30c5e2609d7a925f27d76d2678c94fe58bc1a9775a024c6c9fe","sha256:310f22a49362a5eb78441088e3f0b507c12b5fdce86def805aa6325298a85457"],"state_sha256":"5b1252de0173dc38223e4a76c0ae7d81ce572a44851e7b0db0ba5c0ccafcbfa9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IshYn6OrjEGnaCHYDD9U6AfYaISnW0ZfVTNSE4qnoD8IP518HIPf1Fl4reRJtN2bgvC0jCUvgkpKVLNywg3bDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T02:06:33.573241Z","bundle_sha256":"00a5a4665d7d2f082eca5a3637bfd019510a2d2cb34e8a065788c1a546fecdd8"}}