{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:O5RY46DKWONLORQNVZBZVIPLLD","short_pith_number":"pith:O5RY46DK","canonical_record":{"source":{"id":"1109.4673","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-21T23:36:34Z","cross_cats_sorted":[],"title_canon_sha256":"63836b98f0f231f67ec87fa7effeabfc8394ad214ec3dd1c21dd598ea0235c55","abstract_canon_sha256":"9d5f811e7ede334a06a565fad1b500ec421382c42836469c3535d601ca6a6eba"},"schema_version":"1.0"},"canonical_sha256":"77638e786ab39ab7460dae439aa1eb58d3f367aec123d5031aedd69a5b91e0d1","source":{"kind":"arxiv","id":"1109.4673","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.4673","created_at":"2026-05-18T04:12:33Z"},{"alias_kind":"arxiv_version","alias_value":"1109.4673v1","created_at":"2026-05-18T04:12:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.4673","created_at":"2026-05-18T04:12:33Z"},{"alias_kind":"pith_short_12","alias_value":"O5RY46DKWONL","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"O5RY46DKWONLORQN","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"O5RY46DK","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:O5RY46DKWONLORQNVZBZVIPLLD","target":"record","payload":{"canonical_record":{"source":{"id":"1109.4673","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-21T23:36:34Z","cross_cats_sorted":[],"title_canon_sha256":"63836b98f0f231f67ec87fa7effeabfc8394ad214ec3dd1c21dd598ea0235c55","abstract_canon_sha256":"9d5f811e7ede334a06a565fad1b500ec421382c42836469c3535d601ca6a6eba"},"schema_version":"1.0"},"canonical_sha256":"77638e786ab39ab7460dae439aa1eb58d3f367aec123d5031aedd69a5b91e0d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:33.188094Z","signature_b64":"zQjLIxwIJCkVOLjNEZxN5A+kzgx/O7Eoz/zkAtmdkvfPlEgj/4Ml1louQdkeJNlpLPidvGcCqRe2ZBgOy+b3BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77638e786ab39ab7460dae439aa1eb58d3f367aec123d5031aedd69a5b91e0d1","last_reissued_at":"2026-05-18T04:12:33.187459Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:33.187459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.4673","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-18T04:12:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YfSbjaLqUmG0EYl8MOKK80Me+cMpcqmyln09cPLh9I2tWTSyT7DxhRFz2XkcmHWSjOrbX9nMyRintYHoP3TZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:22:10.480394Z"},"content_sha256":"ed3b48881a6b67fd7dcaf6e90e07928b4b9c6504709a511e9eff46fd36e62f8b","schema_version":"1.0","event_id":"sha256:ed3b48881a6b67fd7dcaf6e90e07928b4b9c6504709a511e9eff46fd36e62f8b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:O5RY46DKWONLORQNVZBZVIPLLD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extreme tenacity of graphs with given order and size","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chuandong Xu, Shenggui Zhang, T.C.E. Cheng, Yinkui Li","submitted_at":"2011-09-21T23:36:34Z","abstract_excerpt":"Computer or communication networks are so designed that they do not easily get disrupted under external attack and, moreover, these are easily reconstructible if they do get disrupted. These desirable properties of networks can be measured by various graph parameters, such as connectivity, toughness, scattering number, integrity, tenacity, rupture degree and edge-analogues of some of them. Among these parameters, the tenacity and rupture degree are two better ones to measure the stability of a network. In this paper we consider two extremal problems on the tenacity of graphs: Determine the min"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.4673","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-18T04:12:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iE1REcu0JKCO6mtNHEapAPQyabtEb1a/sLlfBSI59wzfCApr5HlXqCKtT8gzau0/hToTQTqYNzV3CsjbHlKIDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:22:10.481162Z"},"content_sha256":"232a6115cbdb686320cbca3da056a30d737af85205d3ef4350688e93d06bb8aa","schema_version":"1.0","event_id":"sha256:232a6115cbdb686320cbca3da056a30d737af85205d3ef4350688e93d06bb8aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O5RY46DKWONLORQNVZBZVIPLLD/bundle.json","state_url":"https://pith.science/pith/O5RY46DKWONLORQNVZBZVIPLLD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O5RY46DKWONLORQNVZBZVIPLLD/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-05-26T03:22:10Z","links":{"resolver":"https://pith.science/pith/O5RY46DKWONLORQNVZBZVIPLLD","bundle":"https://pith.science/pith/O5RY46DKWONLORQNVZBZVIPLLD/bundle.json","state":"https://pith.science/pith/O5RY46DKWONLORQNVZBZVIPLLD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O5RY46DKWONLORQNVZBZVIPLLD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:O5RY46DKWONLORQNVZBZVIPLLD","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":"9d5f811e7ede334a06a565fad1b500ec421382c42836469c3535d601ca6a6eba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-21T23:36:34Z","title_canon_sha256":"63836b98f0f231f67ec87fa7effeabfc8394ad214ec3dd1c21dd598ea0235c55"},"schema_version":"1.0","source":{"id":"1109.4673","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.4673","created_at":"2026-05-18T04:12:33Z"},{"alias_kind":"arxiv_version","alias_value":"1109.4673v1","created_at":"2026-05-18T04:12:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.4673","created_at":"2026-05-18T04:12:33Z"},{"alias_kind":"pith_short_12","alias_value":"O5RY46DKWONL","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"O5RY46DKWONLORQN","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"O5RY46DK","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:232a6115cbdb686320cbca3da056a30d737af85205d3ef4350688e93d06bb8aa","target":"graph","created_at":"2026-05-18T04:12:33Z","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":"Computer or communication networks are so designed that they do not easily get disrupted under external attack and, moreover, these are easily reconstructible if they do get disrupted. These desirable properties of networks can be measured by various graph parameters, such as connectivity, toughness, scattering number, integrity, tenacity, rupture degree and edge-analogues of some of them. Among these parameters, the tenacity and rupture degree are two better ones to measure the stability of a network. In this paper we consider two extremal problems on the tenacity of graphs: Determine the min","authors_text":"Chuandong Xu, Shenggui Zhang, T.C.E. Cheng, Yinkui Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-21T23:36:34Z","title":"Extreme tenacity of graphs with given order and size"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.4673","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:ed3b48881a6b67fd7dcaf6e90e07928b4b9c6504709a511e9eff46fd36e62f8b","target":"record","created_at":"2026-05-18T04:12:33Z","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":"9d5f811e7ede334a06a565fad1b500ec421382c42836469c3535d601ca6a6eba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-21T23:36:34Z","title_canon_sha256":"63836b98f0f231f67ec87fa7effeabfc8394ad214ec3dd1c21dd598ea0235c55"},"schema_version":"1.0","source":{"id":"1109.4673","kind":"arxiv","version":1}},"canonical_sha256":"77638e786ab39ab7460dae439aa1eb58d3f367aec123d5031aedd69a5b91e0d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77638e786ab39ab7460dae439aa1eb58d3f367aec123d5031aedd69a5b91e0d1","first_computed_at":"2026-05-18T04:12:33.187459Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:12:33.187459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zQjLIxwIJCkVOLjNEZxN5A+kzgx/O7Eoz/zkAtmdkvfPlEgj/4Ml1louQdkeJNlpLPidvGcCqRe2ZBgOy+b3BA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:12:33.188094Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.4673","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed3b48881a6b67fd7dcaf6e90e07928b4b9c6504709a511e9eff46fd36e62f8b","sha256:232a6115cbdb686320cbca3da056a30d737af85205d3ef4350688e93d06bb8aa"],"state_sha256":"a34c51e5c871400d7aa01d8c2d583b9783f863bfbfd63c4d3449cdba896d8d24"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RDuPTbPn1i1c4/eRiBBQf6LM85WVYpJr0hCcLPJ1hp/g9a21hZcMK3LUIDRrmDsfCg4xcWsraZIFSC9fsB4hBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T03:22:10.485635Z","bundle_sha256":"52bb9e0b6eb973bfd04f2d6fb05662c78f0af952aed3593ff37018344c524025"}}